Who is the father of the heuristic method

Methods and models for route planning

Route planning in road freight transport pp 49-101 | Cite as


This chapter provides an overview of procedures for solving route planning problems. For this purpose, the different approaches to planning are presented at the beginning, in order to then go into specific procedures relevant in the area of ​​route planning. Thus, the basis for the development of a solution method for a complex route planning problem is laid in the following chapters.

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


Unable to display preview. Download preview PDF.


  1. Schultz, Jens; Weigelt, Mark; Mertens, Peter: Procedure for computer-aided detailed production planning - an overview. In: business Informatics 37 (1995), No. 6, pp. 594-608 Google Scholar
  2. Rechenberg, Ingo: Evolution strategy. Stuttgart: Frommann-Holzboog, 1973Google Scholar
  3. Ablay, Paul: Construction of controlled evolution strategies to solve difficult optimization problems of the economy. In: [Alb90], pp. 73-106Google Scholar
  4. Friedrich, Sebastian: Procedure for tactical planning of the supply chain. Aachen: Shaker, 2007 (writings on quantitative business administration and business informatics) p. 167ffGoogle Scholar
  5. Zimmermann, Werner: Operations Research. 7th edition Munich: Oldenbourg, 1995Google Scholar
  6. Boysen, Nils: Business research on corporate governance. Vol. 49: Variant flow production. Wiesbaden: DUV, 2005 p. 32. Google Scholar
  7. Domschke, Wolfgang; Drexl, Andreas: Introduction to Operations Research. 4th edition Berlin: Springer, 1998 p. 125ff. Google Scholar
  8. Ahuja, Ravindra K .; Magnanti, Thomas L .; Orlin, James B .; Reddy, M. R .: Applications of Network Optimization. In: [BMMN95b], Chapter 1, pp. 1–83Google Scholar
  9. Gendreau, Michel; Laporte, Gilbert; Séguin, René: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers. In: Transportation Science 29 (1995), May, No. 2, pp. 143-155 Google Scholar
  10. Achuthan, Narasimaha R .; Caccetta, Louis; Hill, Stephen P .: An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem. In: Transportation Science 37 (2003), May, No. 2, pp. 153-169 CrossRefGoogle Scholar
  11. Yellow, P. C: A Computational Modification to the Savings Method of Vehicle Scheduling. In: Operational Research Quarterly 21 (1970), pp. 281-283 Google Scholar
  12. Bienstock, Daniel; Bramel, Julien; Simchi-Levi, David: A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. In: Mathematics of Operations Research 18 (1993), November, No. 4, pp. 786-802 Google Scholar
  13. Laporte, Gilbert; Gendreau, Michel; Potvin, Jean-Yves; Semet, Frédéric: Classical and Modern Heuristics for the Vehicle Routing Problem. In: International Transactions in Operational Research 7 (2000), pp. 285-300 CrossRefGoogle Scholar
  14. Schrage, Linus: Formulation and Structure of More Complex / Realistic Routing and Scheduling Problems. In: Network 11 (1981), pp. 229-232 CrossRefGoogle Scholar
  15. Altinkemer, Kemal; Gavish, Bezalel: Heuristics for Delivery Problems with Constant Error Guarantees. In: Transportation Science 24 (1990), November, No. 4, pp. 294-297 Google Scholar
  16. Labbé, Martine; Laporte, Gilbert; Mercure, Hélène: Capacitated Vehicle Routing on Trees. In: Operations Research 39 (1991), No. 4, pp. 616-622 CrossRefGoogle Scholar
  17. Lin, Shen: Computer Solution of the Traveling Salesman Problem. In: The Bell System Technical Journal 44 (1965), December, pp. 2245-2269Google Scholar
  18. Reinelt, Gerhard: TSPLIB - A Traveling Salesman Problem Library. In: ORSA Journal on Computing 3 (1991), No. 4, pp. 376-384 Google Scholar
  19. Michalewicz, Zbigniew; Vignaux, George A .; Hobbs, Matthew: A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem. In: ORSA Journal on Computing 3 (1991), No. 4, pp. 307-316 Google Scholar
  20. Börner, Gerhard; Bartelmann, Matthias: Astronomers decipher the book of creation. In: Physics in our time 33 (2002), No. 3, pp. 114-120 CrossRefGoogle Scholar
  21. Lineweaver, Charles H .; Davis, Tamara M .: The Big Bang - Myth and Truth. In: Spectrum of science (2005), May, pp. 38-47 Google Scholar
  22. Holland, JohnH .: Adaptation in Natural and Artificial Systems. Cambridge: MIT Press, 1994Google Scholar
  23. Mayr, Ernst: Species concept and evolution. Hamburg: Parey, 1967Google Scholar
  24. Bent, Russell; Hentenryck, Pascal van: A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. In: Transportation Science 38 (2004), November, No. 4, pp. 515-530CrossRefGoogle Scholar
  25. Kirkpatrick, Scott; Gelatt, Charles D .; Vecchi, Mario P .: Optimization by Simulated Annealing. In: Science 220 (1983), May, No. 4598, pp. 671-680 CrossRefGoogle Scholar
  26. Hajek, Bruce: Cooling Schedules for Optimal Annealing. In: Mathematics of Operations Research 13 (1988), Mai, No. 2, pp. 311-329 Google Scholar
  27. Friedrich, Sebastian: Procedure for tactical planning of the supply chain. Aachen: Shaker, 2007 (writings on quantitative business administration and business informatics) Google Scholar
  28. Glover, Fred: Future Paths for Integer Programming and Links to Artificial Intelligence. In: Computers & Operations Research 13 (1986), No. 5, pp. 533-549 CrossRefGoogle Scholar
  29. Balas, Egon; Vazacopoulos, Alkis: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. In: Management Science 44 (1998), February, No. 2, pp. 237-256Google Scholar
  30. Dorer, Klaus; Calisti, Monique: An Adaptive Solution to Dynamic Transport Optimization. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems. New York: ACM Press, July 2005, pp. 45-51 CrossRefGoogle Scholar
  31. Wendt, Oliver: Route planning through the use of nature-analogous procedures. Wiesbaden: DUV, 1995Google Scholar

Copyright information

© Business publishing house Dr. Th. Gabler | GWV Fachverlage GmbH, Wiesbaden 2008