Skip to main content
Fachgebiete
Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Weitere Formate
Webinare Technik
Webinare Wirtschaft
Kongresse
Veranstaltungskalender
Podcasts
Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen beantragen
Erweiterte Suche
Anmelden
nach oben

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

Erschienen in:
Einführung in Logistik und Supply Chain Management Kapitel lesen Erstes Kapitel lesen

2023 | OriginalPaper | Buchkapitel

6. Standortplanung und Netzwerkgestaltung

verfasst von : Thomas Hanne, Rolf Dornberger

Erschienen in: Computational Intelligence in Logistik und Supply Chain Management

Verlag: Springer International Publishing

Einloggen, um Zugang zu erhalten

Zusammenfassung

Dieses Kapitel beschäftigt sich mit strategischen Problemen der Planung eines neuen Standorts sowie dem Gesamtproblem der Gestaltung eines Netzwerks. Bereits die Planung eines einzelnen Standorts stellt sich dabei komplex und schwierig dar, da oft viele verschieden Kriterien zu berücksichtigen sind. Wir betrachten verschiedene verbreitete Varianten von Problemen der Standortplanung wie p-Median-Probleme, p-Center-Probleme, Facility Location-Probleme ohne und mit Kapazitäten sowie Weber-Probleme. Ferner betrachten wir Location-Routing-Probleme, bei denen operative Aspekte der Tourenplanung in die Standortplanung einfliessen sowie komplexe Netzwerk-Gestaltungsprobleme mit Hubs (Hub-Location-Probleme) oder mehreren Netzwerkstufen (Multi-Echelon-Probleme).

Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe



 


Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt 90 Tage mit der neuen Mini-Lizenz testen!

Jetzt informieren
Vorheriges Kapitel Scheduling
Nächstes Kapitel Intelligente Software für die Logistik
Literatur
Ahuja, R. K., Orlin, J. B., Pallottino, S., Scaparra, M. P., & Scutellà, M. G. (2004). A multi-exchange heuristic for the single-source capacitated facility location problem. Management Science, 50(6), 749–760. CrossRef
Akyüz, M. H., Öncan, T., & Altinel, I. K. (2010). The multi-commodity capacitated multi-facility Weber problem: Heuristics and confidence intervals. IIE Transactions, 42(11), 825–841. CrossRef
Al-Khedhairi, A. (2008). Simulated annealing metaheuristic for solving p-median problem. International Journal of Contemporary Mathematical Sciences, 3(28), 1357–1365.
Alp, O., Erkut, E., & Drezner, Z. (2003). An efficient genetic algorithm for the p-median problem. Annals of Operations Research, 122(1–4), 21–42. CrossRef
Al-Sultan, K. S., & Al-Fawzan, M. A. (1999). A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research, 86, 91–103. CrossRef
Alumur, S. A., Kara, B. Y., & Melo, M. T. (2015). Location and logistics. In G. Laporte, S. Nickel & F. Saldanha da Gama (Hrsg.), Location science (S. 419–441). Springer International Publishing. CrossRef
Antunes, A., & Peeters, D. (2001). On solving complex multi-period location models using simulated annealing. European Journal of Operational Research, 130(1), 190–201. CrossRef
Aras, N., Özkısacık, K. C., & Altınel, İ. K. (2006). Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps. Journal of the Operational Research Society, 57(1), 82–93. CrossRef
Arostegui, M. A., Kadipasaoglu, S. N., & Khumawala, B. M. (2006). An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 103(2), 742–754. CrossRef
Awasthi, A., Chauhan, S. S., & Goyal, S. K. (2011). A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty. Mathematical and Computer Modelling, 53(1), 98–109. CrossRef
Berman, O., & Drezner, Z. (2008). A new formulation for the conditional p-median and p-center problems. Operations Research Letters, 36(4), 481–483. CrossRef
Bischoff, M., & Dächert, K. (2009). Allocation search methods for a generalized class of location – allocation problems. European Journal of Operational Research, 192(3), 793–807.
Brimberg, J., Hansen, P., Mladenovic, N., & Taillard, E. D. (2000). Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Operations Research, 48(3), 444–460. CrossRef
Brimberg, J., Mladenovic, N., & Salhi, S. (2004). The multi-source Weber problem with constant opening cost. Journal of the Operational Research Society, 55, 640–646. CrossRef
Brimberg, J., Hansen, P., & Mladenović, N. (2006). Decomposition strategies for large-scale continuous location–allocation problems. IMA Journal of Management Mathematics, 17(4), 307–316. CrossRef
Canós, M. J., Ivorra, C., & Liern, V. (2001). The fuzzy p-median problem: A global analysis of the solutions. European Journal of Operational Research, 130(2), 430–436. CrossRef
Chen, C. H., & Ting, C. J. (2008). Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transportation Research Part E: Logistics and Transportation Review, 44(6), 1099–1122. CrossRef
Chen, C. T. (2001). A fuzzy approach to select the location of the distribution center. Fuzzy Sets and Systems, 118(1), 65–73. CrossRef
Cheng, E. W., Li, H., & Yu, L. (2007). A GIS approach to shopping mall location selection. Building and Environment, 42(2), 884–892. CrossRef
Chiyoshi, F., & Galvao, R. D. (2000). A statistical analysis of simulated annealing applied to the p-median problem. Annals of Operations Research, 96(1–4), 61–74. CrossRef
Chou, S. Y., Chang, Y. H., & Shen, C. Y. (2008a). A fuzzy simple additive weighting system under group decision-making for facility location selection with objective/subjective attributes. European Journal of Operational Research, 189(1), 132–145. CrossRef
Chou, T. Y., Hsu, C. L., & Chen, M. C. (2008b). A fuzzy multi-criteria decision model for international tourist hotels location selection. International Journal of Hospitality Management, 27(2), 293–301. CrossRef
Contreras, I., Fernández, E., & Reinelt, G. (2012). Minimizing the maximum travel time in a combined model of facility location and network design. Omega, 40(6), 847–860. CrossRef
Contreras, I. A., & Díaz, J. A. (2008). Scatter search for the single source capacitated facility location problem. Annals of Operations Research, 157(1), 73–89. CrossRef
Cooper, L. (1964). Heuristic methods for location-allocation problems. SIAM Review, 6(1), 37–53. CrossRef
Cornuéjols, G., Nemhauser, G. L., & Wolsey, L. A. (1983). The uncapacitated facility location problem (No. MSRR-493). Management Sciences Research Report MSRR 493. Carnegie-Mellon University.
Correa, E. S., Steiner, M. T. A., Freitas, A. A., & Carnieri, C. (2004). A genetic algorithm for solving a capacitated p-median problem. Numerical Algorithms, 35(2–4), 373–388. CrossRef
Cortinhal, M. J., Lopes, M. J., & Melo, M. T. (2015). Dynamic design and re-design of multi-echelon, multi-product logistics networks with outsourcing opportunities: A computational study. Computers & Industrial Engineering, 90, 118–131. CrossRef
Cura, T. (2010). A parallel local search approach to solving the uncapacitated warehouse location problem. Computers & Industrial Engineering, 59(4), 1000–1009. CrossRef
Davidović, T., Ramljak, D., Šelmić, M., & Teodorović, D. (2011). Bee colony optimization for the p-center problem. Computers & Operations Research, 38(10), 1367–1376. CrossRef
Derbel, H., Jarboui, B., Hanafi, S., & Chabchoub, H. (2010). An iterated local search for solving a location-routing problem. Electronic Notes in Discrete Mathematics, 36, 875–882. CrossRef
Derbel, H., Jarboui, B., Hanafi, S., & Chabchoub, H. (2012). Genetic algorithm with iterated local search for solving a location-routing problem. Expert Systems with Applications, 39(3), 2865–2871. CrossRef
Díaz, J. A., & Fernandez, E. (2006). Hybrid scatter search and path relinking for the capacitated p-median problem. European Journal of Operational Research, 169(2), 570–585. CrossRef
Doerner, K. F., Gutjahr, W. J., & Nolz, P. C. (2009). Multi-criteria location planning for public facilities in tsunami-prone coastal areas. OR Spectrum, 31(3), 651–678. CrossRef
Doong, S. H., Lai, C. C., & Wu, C. H. (2007). Genetic subgradient method for solving location–allocation problems. Applied Soft Computing, 7(1), 373–386. CrossRef
Drexl, M., & Schneider, M. (2015). A survey of variants and extensions of the location-routing problem. European Journal of Operational Research, 241(2), 283–308. CrossRef
Drezner, Z., & Hamacher, H. W. (Hrsg.). (2001). Facility location: Applications and theory. Springer Science & Business Media.
Escobar, J. W., Linfati, R., & Toth, P. (2013). A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Computers & Operations Research, 40(1), 70–79. CrossRef
Farahani, R. Z., SteadieSeifi, M., & Asgari, N. (2010). Multiple criteria facility location problems: A survey. Applied Mathematical Modelling, 34(7), 1689–1709. CrossRef
Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64(4), 1096–1109. CrossRef
Gamal, M. D. H., & Salhi, S. (2001). Constructive heuristics for the uncapacitated continuous location-allocation problem. Journal of the Operational Research Society, 52(7), 821–829. CrossRef
Ghaderi, A., & Jabalameli, M. S. (2013). Modeling the budget-constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: A case study of health care. Mathematical and Computer Modelling, 57(3), 382–400. CrossRef
Ghaderi, A., Jabalameli, M. S., Barzinpour, F., & Rahmaniani, R. (2012). An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem. Networks and Spatial Economics, 12(3), 421–439. CrossRef
Ghiani, G., Guerriero, F., & Musmanno, R. (2002). The capacitated plant location problem with multiple facilities in the same site. Computers & Operations Research, 29(13), 1903–1912. CrossRef
Ghosh, D. (2003). Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research, 150(1), 150–162. CrossRef
Gong, D., Gen, M., Xu, W., & Yamazaki, G. (1995). Hybrid evolutionary method for obstacle location-allocation. Computers & Industrial Engineering, 29(1), 525–530. CrossRef
Guastaroba, G., & Speranza, M. G. (2014). A heuristic for BILP problems: The single source capacitated facility location problem. European Journal of Operational Research, 238(2), 438–450. CrossRef
Guha, S., & Khuller, S. (1999). Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31(1), 228–248. CrossRef
Guha, S., Meyerson, A., & Munagala, K. (2003). A constant factor approximation algorithm for the fault-tolerant facility location problem. Journal of Algorithms, 48(2), 429–440. CrossRef
Hanne, T. (2012). Intelligent strategies for meta multiple criteria decision making (International series in operations research & management science, Bd. 33). Springer Science & Business Media.
Hansen, P., & Mladenović, N. (1997). Variable neighborhood search for the p-median. Location Science, 5(4), 207–226. CrossRef
Harris, I., Mumford, C., & Naim, M. (2009). The multi-objective uncapacitated facility location problem for green logistics. In IEEE Congress on Evolutionary Computation, 2009. CEC’09 (S. 2732–2739). IEEE. CrossRef
Harris, I., Mumford, C. L., & Naim, M. M. (2011). An evolutionary bi-objective approach to the capacitated facility location problem with cost and CO2 emissions. In N. Krasnogor (Hrsg.), Proceedings of the 13th annual conference on genetic and evolutionary computation (S. 697–704). ACM. CrossRef
Hassin, R., Levin, A., & Morad, D. (2003). Lexicographic local search and the p-center problem. European Journal of Operational Research, 151(2), 265–279. CrossRef
Houck, C. R., Joines, J. A., & Kay, M. G. (1996). Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Computers & Operations Research, 23(6), 587–596. CrossRef
Hsieh, K. H., & Tien, F. C. (2004). Self-organizing feature maps for solving location–allocation problems with rectilinear distances. Computers & Operations Research, 31(7), 1017–1031. CrossRef
Jabalameli, M. S., & Ghaderi, A. (2008). Hybrid algorithms for the uncapacitated continuous location-allocation problem. The International Journal of Advanced Manufacturing Technology, 37(1–2), 202–209. CrossRef
Jaramillo, J. H., Bhadury, J., & Batta, R. (2002). On the use of genetic algorithms to solve location problems. Computers & Operations Research, 29(6), 761–779. CrossRef
Jarboui, B., Derbel, H., Hanafi, S., & Mladenović, N. (2013). Variable neighborhood search for location routing. Computers & Operations Research, 40(1), 47–57. CrossRef
Jones, P. C., Lowe, T. J., Muller, G., Xu, N., Ye, Y., & Zydiak, J. L. (1995). Specially structured uncapacitated facility location problems. Operations Research, 43(4), 661–669. CrossRef
Kahraman, C., Ruan, D., & Doǧan, I. (2003). Fuzzy group decision-making for facility location selection. Information Sciences, 157, 135–153. CrossRef
Kariv, O., & Hakimi, S. L. (1979). An algorithmic approach to network location problems. II: The p-medians. SIAM Journal on Applied Mathematics, 37(3), 539–560. CrossRef
Kaveh, A., & Nasr, H. (2011). Solving the conditional and unconditional p-center problem with modified harmony search: A real case study. Scientia Iranica, 18(4), 867–877. CrossRef
Klein, C. M., & Kincaid, R. K. (1994). Technical note – The discrete anti-p-center problem. Transportation Science, 28(1), 77–79. CrossRef
Kratica, J., Tošic, D., Filipović, V., & Ljubić, I. (2001). Solving the simple plant location problem by genetic algorithm. RAIRO-Operations Research, 35(1), 127–142. CrossRef
Lim, A., Rodrigues, B., Wang, F., & Xu, Z. (2004). k-Center problems with minimum coverage. In K.-Y. Chwa & J. I. J. Munro (Hrsg.), Computing and combinatorics, 10th annual international conference, COCOON 2004, Jeju Island, Korea (S. 349–359). Springer.
Lozano, S., Guerrero, F., Onieva, L., & Larraneta, J. (1998). Kohonen maps for solving a class of location-allocation problems. European Journal of Operational Research, 108(1), 106–117. CrossRef
Luis, M., Salhi, S., & Nagy, G. (2011). A guided reactive GRASP for the capacitated multi-source Weber problem. Computers & Operations Research, 38(7), 1014–1024. CrossRef
Maniezzo, V., Mingozzi, A., & Baldacci, R. (1998). A bionomic approach to the capacitated p-median problem. Journal of Heuristics, 4(3), 263–280. CrossRef
Manzour-al-Ajdad, S. M. H., Torabi, S. A., & Eshghi, K. (2012). Single-source capacitated multi-facility Weber problem – An iterative two phase heuristic algorithm. Computers & Operations Research, 39(7), 1465–1476. CrossRef
Marić, M., Stanimirović, Z., & Milenković, N. (2012). Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients’ preferences. Electronic Notes in Discrete Mathematics, 39, 43–50. CrossRef
Megiddo, N., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal on Computing, 13(1), 182–196. CrossRef
Mladenović, N., Labbé, M., & Hansen, P. (2003). Solving the p-center problem with tabu search and variable neighborhood search. Networks, 42(1), 48–64. CrossRef
Mladenović, N., Brimberg, J., Hansen, P., & Moreno-Pérez, J. A. (2007). The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179(3), 927–939. CrossRef
Mohammadi, N., Malek, M. R., & Alesheikh, A. A. (2010). A new GA based solution for capacitated multi source Weber problem. International Journal of Computational Intelligence Systems, 3(5), 514–521.
Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649–672. CrossRef
Nickel, S., & Puerto, J. (2006). Location theory: A unified approach. Springer Science & Business Media.
Ohlemüller, M. (1997). Tabu search for large location-allocation problems. Journal of the Operational Research Society, 48(7), 745–750. CrossRef
Öncan, T. (2013). Heuristics for the single source capacitated multi-facility Weber problem. Computers & Industrial Engineering, 64(4), 959–971. CrossRef
Özsoy, F. A., & Pınar, M. Ç. (2006). An exact algorithm for the capacitated vertex p-center problem. Computers & Operations Research, 33(5), 1420–1436. CrossRef
Prodhon, C., & Prins, C. (2014). A survey of recent research on location-routing problems. European Journal of Operational Research, 238(1), 1–17. CrossRef
ReVelle, C. S., & Swain, R. W. (1970). Central facilities location. Geographical Analysis, 2(1), 30–42. CrossRef
Rolland, E., Schilling, D. A., & Current, J. R. (1997). An efficient tabu search procedure for the p-median problem. European Journal of Operational Research, 96(2), 329–342. CrossRef
Salhi, S., & Gamal, M. D. H. (2003). A genetic algorithm based approach for the uncapacitated continuous location–allocation problem. Annals of Operations Research, 123(1–4), 203–222. CrossRef
Sankaran, J. K. (2007). On solving large instances of the capacitated facility location problem. European Journal of Operational Research, 178(3), 663–676. CrossRef
Scaparra, M. P., Pallottino, S., & Scutellà, M. G. (2004). Large-scale local search heuristics for the capacitated vertex p-center problem. Networks, 43(4), 241–255. CrossRef
Sherali, H. D., & Nordai, F. L. (1988). NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands. Mathematics of Operations Research, 13(1), 32–49. CrossRef
Silva, F. J. F., & De la Figuera, D. S. (2007). A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45(21), 5117–5134. CrossRef
Sridharan, R. (1995). The capacitated plant location problem. European Journal of Operational Research, 87(2), 203–213. CrossRef
Sun, M. (2006). Solving the uncapacitated facility location problem using tabu search. Computers & Operations Research, 33(9), 2563–2589. CrossRef
Sun, M. (2012). A tabu search heuristic procedure for the capacitated facility location problem. Journal of Heuristics, 18(1), 91–118. CrossRef
Tcha, D. W., & Lee, B. I. (1984). A branch-and-bound algorithm for the multi-level uncapacitated facility location problem. European Journal of Operational Research, 18(1), 35–43. CrossRef
Ting, C. J., & Chen, C. H. (2013). A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal of Production Economics, 141(1), 34–44. CrossRef
Tohyama, H., Ida, K., & Matsueda, J. (2011). A genetic algorithm for the uncapacitated facility location problem. Electronics and Communications in Japan, 94(5), 47–54. CrossRef
Tragantalerngsak, S., Holt, J., & Ro, M. (1997). Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem. European Journal of Operational Research, 102(3), 611–625. CrossRef
Wang, D., Wu, C. H., Ip, A., Wang, D., & Yan, Y. (2008). Parallel multi-population particle swarm optimization algorithm for the uncapacitated facility location problem using openMP. In IEEE Congress on Evolutionary Computation, 2008. CEC 2008 (IEEE World Congress on Computational Intelligence) (S. 1214–1218). IEEE. CrossRef
Wen, M., & Iwamura, K. (2008). Facility location–allocation problem in random fuzzy environment: Using (α, β)-cost minimization model under the Hurewicz criterion. Computers & Mathematics with Applications, 55(4), 704–713. CrossRef
Yu, V. F., Lin, S. W., Lee, W., & Ting, C. J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58(2), 288–299. CrossRef
Zhou, J., & Liu, B. (2003). New stochastic models for capacitated location-allocation problem. Computers & Industrial Engineering, 45(1), 111–125. CrossRef
Zhou, J., & Liu, B. (2007). Modeling capacitated location–allocation problem with fuzzy demands. Computers & Industrial Engineering, 53(3), 454–468. CrossRef
Metadaten
Titel
Standortplanung und Netzwerkgestaltung
verfasst von
Thomas Hanne
Rolf Dornberger
Copyright-Jahr
2023
Buch
Computational Intelligence in Logistik und Supply Chain Management

Print ISBN: 978-3-031-21451-6

Electronic ISBN: 978-3-031-21452-3

Copyright-Jahr: 2023

DOI
https://doi.org/10.1007/978-3-031-21452-3_6

Premium Partner

Pluta
    Bildnachweise