Skip to main content
SpringerLink
Log in

Line-Based Optimization of LTL-Shipments Using a Multi-Step Genetic Algorithm

  • Chapter
  • First Online:
Automation, Communication and Cybernetics in Science and Engineering 2013/2014

  • 1310 Accesses

Abstract

Motivated by the so-called “CloudLogistic”-concept as an innovative, line-based way for dealing with less than truck load (LTL) shipments in cooperation networks, this paper introduces a genetic algorithm as a heuristical approach for dealing with multi-objective optimization problems. Based on the implied optimization problem – the NP-hard multi-depot heterogeneous fleet vehicle routing problem with time windows and assignment restrictions (m-VRPTWAR) - four different optimization goals of the “CloudLogistic”-concept are introduced and a multi-step approach is motivated.

Therefore, two different optimization steps are presented and transferred into a genetic algorithm. Additionally, two innovative problem-specific genetic operators are introduced by combining a generation-based approach and a usage-based approach in order to create a useful mutation process. A further usage-based approach is used to realize a problem-specific crossover operator. The presented genetic multi-step approach is a useful concept for dealing with multi-objective optimization problems without the need of a single combined fitness function.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bundesministerium für Verkehr Bau und Stadtentwicklung (BMVBS). 2007. Prognose der deutschlandweiten Verkehrsverflechtung 2025.

    Google Scholar 

  2. Bundesministerium für Verkehr Bau und Stadtentwicklung (BMVBS). 2008. Masterplan Güterverkehr und Logistik.

    Google Scholar 

  3. Helmreich, Stephan, and Hartmut Keller. 2011. FREIGHTVISION - Sustainable European freight transport 2050: Forecast, vision and policy recommendation. Heidelberg: Springer.

    Book  Google Scholar 

  4. Tummel, Christian, Christian Franzen, Phil Friedrichsmeier, Nadine Vossen, Philipp Wolters, Eckart Hauck, and Sabina Jeschke. 2012. CloudLogistic - Line-Based Optimization for the Disposition of LTL Shipments. In Proceedings of the 17th International Symposium on Logistics, Cape Town, South Africa, 361–371.

    Google Scholar 

  5. Tummel, Christian, Christian Franzen, Eckart Hauck, and Sabina Jeschke. 2011. The Multi-Depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Assignment Restrictions (m-VRPTWAR). In Proceedings of The 3rd International Conference on Logistics and Transport & The 4th International Conference on Operations and Supply Chain Management, Malé, Maldives, 661–672.

    Google Scholar 

  6. Dantzig, G. B., and J. H. Ramser. 1959. The truck dispatching problem. Management Science 6 (1): 80–91.

    Article  MATH  MathSciNet  Google Scholar 

  7. Dondo, Rodolfo, C. A. Méndez, and Jaime Cerdá. 2003. An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints. Latin American Applied Research 33 (2): 129–134.

    Google Scholar 

  8. Bräysy, Olli, and Michel Gendreau. 2005. Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science 39 (1): 104–118.

    Article  Google Scholar 

  9. Bräysy, Olli, and Michel Gendreau. 2005. Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science 39 (1): 119–139.

    Article  Google Scholar 

  10. Bodin, Lawrence, and Bruce Golden. 1981. Classification in vehicle routing and scheduling. Networks 11 (2): 97–108.

    Article  Google Scholar 

  11. Bodin, Lawrence, Bruce Golden, A. Assad, and M. Ball. 1983. Routing and scheduling of vehicles and crews: The state of the art. Computers and Operations Research 10 (2): 63–212.

    Article  MathSciNet  Google Scholar 

  12. Blanton, Joe L. Jr., and Roger L. Wainwright. 1993. Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms. In Proceedings of the 5th International Conference on Genetic Algorithms, 452–459, San Francisco, CA, USA. Burlington: Morgan Kaufmann.

    Google Scholar 

  13. Thangiah, Sam R. 1995. Vehicle routing with time windows using genetic algorithms. In Applications handbook of genetic algorithms: New frontiers, ed. Lance Chambers, 253–278. Boca Raton: CRC.

    Google Scholar 

  14. Potvin, Jean-Yves, and Samy Bengio. 1996. The vehicle routing problem with time windows part II: Genetic search. INFORMS Journal on Computing 8 (2): 165–172.

    Article  MATH  Google Scholar 

  15. Berger, Jean, and Mohamed Barkaoui. 1998. A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows. In Advances in Artificial Intelligence. 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, 44–51. Burlington: Morgan Kaufmann.

    Google Scholar 

  16. Berger, Jean, and Mohamed Barkaoui. 2003. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Information Systems and Operations Research 41: 179–194.

    Google Scholar 

  17. Gehring, H., and J. Homberger. 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In Proceedings of EUROGEN99–Short Course on Evolutionary Algorithms in Engineering and Computer Science, 57–64.

    Google Scholar 

  18. Gehring, Hermann, and Jörg Homberger. 2002. Parallelization of a two-phase metaheuristic for routing problems with time windows. Journal of Heuristics 8 (3): 251–276.

    Article  MATH  Google Scholar 

  19. Tan, K. C., T. H. Lee, K. Ou, and L. H. Lee. 2001. A Messy Genetic Algorithm for the Vehicle Routing Problem with Time Window Constraints. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, 679–686, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea. Piscataway: IEEE Press.

    Google Scholar 

  20. Ho, Wee-Kit, Juay Chin Ang, and Andrew Lim. 2001. A hybrid search algorithm for the vehicle routing problem with time windows. International Journal on Artificial Intelligence Tools 10:431–449.

    Article  Google Scholar 

  21. Le Bouthillier, Alexandre, and Teodor Gabriel Crainic. 2005. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers and Operations Research 32 (7): 1685–1708.

    Article  MATH  Google Scholar 

  22. Tummel, Christian, Christian Franzen, Eckart Hauck, and Sabina Jeschke. 2011. An incremental online heuristic for evaluating the feasibility of the m-VRPTWAR. In Proceedings of The 3rd International Conference on Logistics and Transport & The 4th International Conference on Operations and Supply Chain Management, Malé, Maldives, 647–660.

    Google Scholar 

  23. Goldberg, David E. 1989. Genetic algorithms in search optimization and machine learning. Boston: Addison-Wesley.

    MATH  Google Scholar 

  24. Gerdes, I., F. Klawonn, and R. Kruse. 2004. Evolutionäre Algorithmen: Genetische Algorithmen - Strategien und Optimierungsverfahren - Beispielanwendungen (Computational Intelligence). Vieweg+Teubner.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMA/ZLW & IfU, RWTH Aachen University, Dennewartstr. 27, 52068, Aachen, Germany

    Christian Tummel, Tobias Pyttel, Philipp Wolters, Eckart Hauck & Sabina Jeschke

Authors
  1. Christian Tummel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tobias Pyttel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philipp Wolters
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eckart Hauck
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sabina Jeschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Tummel .

Editor information

Editors and Affiliations

  1. IMA/ZLW & IfU, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Sabina Jeschke

  2. IMA/ZLW & IfU, RWTH Aachen University, Aachen, Germany

    Ingrid Isenhardt

  3. IMA/ZLW & IfU, RWTH Aachen University, Aachen, Germany

    Frank Hees

  4. IMA/ZLW & IfU, RWTH Aachen University, Aachen, Germany

    Klaus Henning

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Tummel, C., Pyttel, T., Wolters, P., Hauck, E., Jeschke, S. (2014). Line-Based Optimization of LTL-Shipments Using a Multi-Step Genetic Algorithm. In: Jeschke, S., Isenhardt, I., Hees, F., Henning, K. (eds) Automation, Communication and Cybernetics in Science and Engineering 2013/2014. Springer, Cham. https://doi.org/10.1007/978-3-319-08816-7_54

Download citation

Publish with us

Policies and ethics

Search

Navigation