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

3. Transportprobleme

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

Der Bereich des Transports gehört zu den wichtigsten Bereichen der Logistik. In diesem Kapitel werden einige Hauptvarianten von Transportproblemen näher betrachtet sowie Methoden, die in der Lage sind, sie zumindest mit ausreichender Qualität zu lösen. Wir diskutieren Zuordnungsprobleme, die eine grobe Transportplanung ermöglichen, Probleme der Ermittlung kürzester Wege, sowie die wichtigsten Arten von komplexeren Tourenplanungsproblemen: das Travelling-Salesman-Problem und das Vehicle-Routing-Problem. Insbesondere für das Vehicle-Routing-Problem werden verschiedene praktisch relevante Varianten betrachtet. Das Kapitel endet mit einer kurzen Diskussion von Netzwerkflussproblemen.

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 Computational Intelligence
Nächstes Kapitel Bestandsplanung und Losgrößenbestimmung
Literatur
Ahmed, Z. H. (2010). Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. International Journal of Biometrics and Bioinformatics (IJBB), 3(6), 96–105.
Albayrak, M., & Allahverdi, N. (2011). Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313–1320. CrossRef
Anbuudayasankar, S. P., Ganesh, K., & Mohapatra, S. (2014). Models for practical routing problems in logistics. Springer. CrossRef
Applegate, D., Cook, W., & Rohe, A. (2003). Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15(1), 82–92. CrossRef
Braun, H. (1991). On solving travelling salesman problems by genetic algorithms. In H.-P. Schwefel & R. Männer (Hrsg.), Parallel problem solving from nature (S. 129–133). Springer. CrossRef
Bryan, J., & McIntire, J. (2015). Leveraging distributed metaheuristics to balance flexibility and complexity. Invited talk at IEEE TENCON 2015: Technical track 11, IEEE.
Buriol, L., França, P. M., & Moscato, P. (2004). A new memetic algorithm for the asymmetric traveling salesman problem. Journal of Heuristics, 10(5), 483–506. CrossRef
Burkard, R. E., & Cela, E. (1999). Linear assignment problems and extensions. In D.-Z. Du & P. M. Pardalos (Hrsg.), Handbook of combinatorial optimization (S. 75–149). Springer. CrossRef
Charon, I., & Hudry, O. (2000). Application of the noising method to the travelling salesman problem. European Journal of Operational Research, 125(2), 266–277. CrossRef
Chatterjee, S., Carrera, C., & Lynch, L. A. (1996). Genetic algorithms and traveling salesman problems. European Journal of Operational Research, 93(3), 490–510. CrossRef
Créput, J. C., & Koukam, A. (2009). A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing, 72(4), 1250–1264. CrossRef
Créput, J. C., Hajjam, A., Koukam, A., & Kuhn, O. (2012). Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem. Journal of Combinatorial Optimization, 24(4), 437–458. CrossRef
Crisan, G. C., & Nechita, E. (2008). Solving fuzzy TSP with ant algorithms. International Journal of Computers, Communications and Control, 3, 228–231.
Dorigo, M., & Gambardella, L. M. (1997a). Ant colonies for the travelling salesman problem. BioSystems, 43(2), 73–81. CrossRef
Dorigo, M., & Gambardella, L. M. (1997b). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53–66. CrossRef
Erbao, C., & Mingyong, L. (2009). A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. Journal of Computational and Applied Mathematics, 231(1), 302–310. CrossRef
Even, S., Itai, A., & Shamir, A. (1975). On the complexity of time table and multi-commodity flow problems. 16th annual symposium on foundations of computer science, 1975, IEEE, S. 184–193.
Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problems with profits. Transportation Science, 39(2), 188–205. CrossRef
Fu, L., Sun, D., & Rilett, L. R. (2006). Heuristic shortest path algorithms for transportation applications: State of the art. Computers & Operations Research, 33(11), 3324–3343. CrossRef
Gendreau, M., Laporte, G., & Vigo, D. (1999). Heuristics for the traveling salesman problem with pickup and delivery. Computers & Operations Research, 26(7), 699–714. CrossRef
Gendreau, M., Potvin, J. Y., Bräumlaysy, O., Hasle, G., & Løkketangen, A. (2008). Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In B. L. Golden, S. Raghavan, & E. A. Wasil (Hrsg.), The vehicle routing problem: Latest advances and new challenges (S. 143–116). Springer. CrossRef
Golden, B. L., Raghavan, S., & Wasil, E. A. (Hrsg.). (2008). The vehicle routing problem: Latest advances and new challenges (Operations research/computer science interfaces series, Bd. 43). Springer.
Grefenstette, J., et al. (1985). Genetic algorithms for the traveling salesman problem. Proceedings of the first international conference on genetic algorithms and their applications, Lawrence Erlbaum, S. 160–168.
Hall, A., Hippler, S., & Skutella, M. (2007). Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science, 379(3), 387–404. CrossRef
Hanne, T., Melo, T., & Nickel, S. (2009). Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces, 39(3), 241–255. CrossRef
Jati, G. K., & Suyanto, S. (2011). Evolutionary discrete firefly algorithm for travelling salesman problem. In Adaptive and intelligent systems (Lecture Notes in Computer Science, Bd. 6943, S. 393–403). Springer. CrossRef
Jolai, F., & Ghanbari, A. (2010). Integrating data transformation techniques with Hopfield neural networks for solving travelling salesman problem. Expert Systems with Applications, 37(7), 5331–5335. CrossRef
Jozefowiez, N., Semet, F., & Talbi, E. G. (2008). Multi-objective vehicle routing problems. European Journal of Operational Research, 189(2), 293–309. CrossRef
Kallehauge, B., Larsen, J., Madsen, O. B., & Solomon, M. M. (2005). Vehicle routing problem with time windows. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Hrsg.), Column generation (S. 67–98). Springer. CrossRef
Karaboga, D., & Gorkemli, B. (2011). A combinatorial artificial bee colony algorithm for traveling salesman problem. 2011 international symposium on Innovations in Intelligent Systems and Applications (INISTA), IEEE, S. 50–53.
Laporte, G., & Semet, F. (2001). Classical heuristics for the capacitated VRP. In P. Toth & D. Vigo (Hrsg.), The vehicle routing problem (S. 109–128). Society for Industrial and Applied Mathematics.
Larrañaga, P., Kuijpers, C. M. H., Murga, R. H., Inza, I., & Dizdarevic, S. (1999). Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review, 13(2), 129–170. CrossRef
Lenstra, J. K., & Kan, A. H. G. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221–227. CrossRef
Leung, S. C., Zhou, X., Zhang, D., & Zheng, J. (2011). Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research, 38(1), 205–215. CrossRef
Li, J., Li, Y., & Pardalos, P. M. (2016). Multi-depot vehicle routing problem with time windows under shared depot resources. Journal of Combinatorial Optimization, 31(2), 515–532. CrossRef
Li, X., Tian, P., Hua, J., & Zhong, N. (2006). A hybrid discrete particle swarm optimization for the traveling salesman problem. In T.-D. Wang, X. Li, & X. Wang (Hrsg.), Simulated evolution and learning (S. 181–188). Springer. CrossRef
Liu, T., Jiang, Z., & Geng, N. (2014). A genetic local search algorithm for the multi-depot heterogeneous fleet capacitated arc routing problem. Flexible Services and Manufacturing Journal, 26(4), 540–564. CrossRef
Marinakis, Y., Migdalas, A., & Pardalos, P. M. (2005). Expanding neighborhood GRASP for the traveling salesman problem. Computational Optimization and Applications, 32(3), 231–257. CrossRef
McBride, R. D. (1998). Advances in solving the multicommodity-flow problem. Interfaces, 28(2), 32–41. CrossRef
Mladenović, N., Urošević, D., & Ilić, A. (2012). A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research, 220(1), 270–285. CrossRef
Modares, A., Somhom, S., & Enkawa, T. (1999). A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. International Transactions in Operational Research, 6(6), 591–606. CrossRef
Nguyen, H. D., Yoshihara, I., Yamamori, K., & Yasunaga, M. (2007). Implementation of an effective hybrid GA for large-scale traveling salesman problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 37(1), 92–99. CrossRef
Oppen, J., & Løkketangen, A. (2006). The livestock collection problem. Proceedings of the 21st European conference on Operational Research.
Ouaarab, A., Ahiod, B., & Yang, X. S. (2014). Discrete cuckoo search algorithm for the travelling salesman problem. Neural Computing and Applications, 24(7–8), 1659–1669. CrossRef
Pasti, R., & De Castro, L. N. (2006). A neuro-immune network for solving the traveling salesman problem. International joint conference on Neural Networks, 2006. IJCNN’06, IEEE, S. 3760–3766.
Pepper, J. W., Golden, B. L., & Wasil, E. A. (2002). Solving the traveling salesman problem with annealing-based heuristics: A computational study. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 32(1), 72–77. CrossRef
Perboli, G., Tadei, R., & Vigo, D. (2011). The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Science, 45(3), 364–380. CrossRef
Peterson, C. (1990). Parallel distributed approaches to combinatorial optimization: Benchmark studies on traveling salesman problem. Neural Computation, 2(3), 261–269. CrossRef
Potvin, J. Y. (1993). State-of-the-art survey – The traveling salesman problem: A neural network perspective. ORSA Journal on Computing, 5(4), 328–348. CrossRef
Reinelt, G. (1991). TSPLIB – A traveling salesman problem library. ORSA Journal on Computing, 3(4), 376–384. CrossRef
Ritzinger, U., Puchinger, J., & Hartl, R. F. (2016). A survey on dynamic and stochastic vehicle routing problems. International Journal of Production Research, 54(1), 215–231. CrossRef
Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., & Wang, Q. X. (2007). Particle swarm optimization-based algorithms for TSP and generalized TSP. Information Processing Letters, 103(5), 169–176. CrossRef
Shim, V. A., Tan, K. C., Chia, J. Y., & Chong, J. K. (2011). Evolutionary algorithms for solving multi-objective travelling salesman problem. Flexible Services and Manufacturing Journal, 23(2), 207–241. CrossRef
Snyder, L. V., & Daskin, M. S. (2006). A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research, 174(1), 38–53. CrossRef
Steinhaus, M. (2015). The application of the self organizing map to the vehicle routing problem. Open access dissertations, University of Rhode Island.
Steinhaus, M., Shirazi, A. N., & Sodhi, M. (2015). Modified self organizing neural network algorithm for solving the vehicle routing problem. 2015 I.E. 18th international conference on Computational Science and Engineering (CSE), IEEE, S. 246–252.
Stützle, T., Grün, A., Linke, S., & Rüttger, M. (2000). A comparison of nature inspired heuristics on the traveling salesman problem. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo & H.-P. Schwefel (Hrsg.), Parallel problem solving from nature PPSN VI (S. 661–670). Springer. CrossRef
Takaoka, T. (2013). A simplified algorithm for the all pairs shortest path problem with O(n 2 log n) expected time. Journal of Combinatorial Optimization, 25(2), 326–337. CrossRef
Teodorović, D. (1999). Fuzzy logic systems for transportation engineering: The state of the art. Transportation Research Part A: Policy and Practice, 33(5), 337–364.
Toth, P., & Vigo, D. (Hrsg.). (2014). Vehicle routing: Problems, methods, and applications (Bd. 18). Society for Industrial and Applied Mathematics.
Tsai, C. F., & Tsai, C. W. (2002). A new approach for solving large traveling salesman problem using evolutionary ant rules. Proceedings of the 2002 international joint conference on Neural Networks, 2002 (IJCNN’02), Bd. 2, IEEE.
Tsai, H. K., Yang, J. M., Tsai, Y. F., & Kao, C. Y. (2004). An evolutionary algorithm for large traveling salesman problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 34(4), 1718–1729. CrossRef
Tsubakitani, S., & Evans, J. R. (1998). Optimizing tabu list size for the traveling salesman problem. Computers & Operations Research, 25(2), 91–97. CrossRef
Ulder, N. L., Aarts, E. H., Bandelt, H. J., van Laarhoven, P. J., & Pesch, E. (1991). Genetic local search algorithms for the traveling salesman problem. In H.-P. Schwefel & R. Männer (Hrsg.), Parallel problem solving from nature (S. 109–116). Springer. CrossRef
Weise, T., Chiong, R., Lassig, J., Tang, K., Tsutsui, S., Chen, W., et al. (2014). Benchmarking optimization algorithms: An open source framework for the traveling salesman problem. IEEE Computational Intelligence Magazine, 9(3), 40–52. CrossRef
Xu, J., Yan, F., & Li, S. (2011). Vehicle routing optimization with soft time windows in a fuzzy random environment. Transportation Research Part E: Logistics and Transportation Review, 47(6), 1075–1091. CrossRef
Yadlapalli, S., Malik, W. A., Darbha, S., & Pachter, M. (2009). A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem. Nonlinear Analysis: Real World Applications, 10(4), 1990–1999.
Zheng, Y., & Liu, B. (2006). Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm. Applied Mathematics and Computation, 176(2), 673–683. CrossRef
Zhong, W. L., Zhang, J., & Chen, W. N. (2007). A novel discrete particle swarm optimization to solve traveling salesman problem. IEEE Congress on Evolutionary Computation, 2007. CEC 2007, IEEE, S. 3283–3287.
Metadaten
Titel
Transportprobleme
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_3

Premium Partner

Pluta
    Bildnachweise