Skip to main content
SpringerLink
Log in

Modeling and Optimization of Vehicle Routing and Arc Routing Problems

  • Chapter
Handbook on Modelling for Discrete Optimization

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 88))

Abstract

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing problems. Exact methods (mostly based on branch-and-cut) and heuristics (mostly based on tabu search) are described, and computational results are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Agarwal, K. Mathur and H.M. Salkin. A Set-Partitioning-Based Exact Algorithm for the Vehicle Routing Problem. Networks, 19:731–749, 1989.

    MathSciNet  Google Scholar 

  2. K. Altinkemer and B. Gavish. Parallel Savings Based Heuristic for the Delivery Problem. Operations Research, 39:456–469, 1991.

    MathSciNet  Google Scholar 

  3. P. Augerat. Approche polyédrale du problème de tournées de véhicules. Institut National Polytechnique de Grenoble, France, 1995.

    Google Scholar 

  4. P. Augerat, J.M. Belengner, E. Benavent, A. Corberán and D. Naddef. Separating Capacity Inequalities in the CVRP Using Tabu Search. European Journal of Operational Research, 106:546–557, 1999.

    Article  Google Scholar 

  5. A.A. Assad and B.L. Golden. Arc Routing Methods and applications. In: M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (eds), Network Routing, Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 8:375–483, 1995.

    Google Scholar 

  6. R. Baldacci, A. Mingozzi and E.A Hadjiconstantinou. An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. Operations Research, 2004. Forthcoming.

    Google Scholar 

  7. F. Barahona and M. Grötschel. On the Cycle Poly-tope of a Binary Matroid. Journal of Combinatorial Theory, 40:40–62, 1986.

    Article  Google Scholar 

  8. C. Barnhart and T.G. Crainic (eds). Focused Issue on Freight Transportation. Transportation Science, 32:87–203, 1998.

    Google Scholar 

  9. C. Barnhart, J. Desrosiers and M.M. Solomon (eds). Focused Issue on Airline Optimization. Transportation Science, 32:205–301, 1998a.

    Google Scholar 

  10. C. Barnhart, J. Desrosiers and M.M. Solomon (eds). Focused Issue on Rail Optimization. Transportation Science, 32:303–304, 1998b.

    Google Scholar 

  11. E.L. Beltrami and L.D. Bodin. Networks and Vehicle Routing for Municipal Waste Pollution. Networks, 4:65–94, 1974.

    MATH  Google Scholar 

  12. E. Benavent. ftp://indurain.estadi.uv.es/pub/CARP, 1997.

    Google Scholar 

  13. M. Blais and G. Laporte. Exact Solution of the Generalized Routing Problem through Graph Transformations. Journal of the Operational Research Society, 54:906–910, 2003.

    Article  Google Scholar 

  14. J. Bramel and D. Simchi-Levi. A Location Based Heuristic for General Routing Problems. Operations Research, 43:649–660, 1995.

    MathSciNet  Google Scholar 

  15. J. Bramel and D. Simchi-Levi. Set-Covering-Based Algorithms for the Capacitated VRP. In: P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 85–108, 2002.

    Google Scholar 

  16. B. Bullnheimer, R.F. Haiti and C. Strauss. An Improved Ant System for the Vehicle Routing Problem. Annals of Operations Research, 89:319–328, 1999.

    Article  MathSciNet  Google Scholar 

  17. B. Bullnheimer, R.F. Hartl and C. Strauss. Applying the Ant System to the Vehicle Routing Problem. In: S. Voss, S. Martello, I.H. Osman and C. Roucairol (eds), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, 109–120, 1998.

    Google Scholar 

  18. K.J. Button. Transport Economics. Edward Elgar, Aldershot, United Kingdom, 1993.

    Google Scholar 

  19. N. Christofides. The Optimum Traversal of a Graph. Omega, 1:719–732, 1973.

    Article  Google Scholar 

  20. N. Christofides. The Vehicle Routing Problem. RAIRO (recherche opérationnelle), 10:55–70, 1976a.

    MathSciNet  Google Scholar 

  21. N. Christofides. Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem. Report No 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1976b.

    Google Scholar 

  22. N. Christofides, V. Campos, A. Corberán and E. Mota. An Algorithm for the Rural Postman Problem. Report IC.O.R. 81.5, Imperial College, London, 1981.

    Google Scholar 

  23. N. Christofides, A. Mingozzi and P. Toth. The Vehicle Routing Problem. In: N. Christofides, A. Mingozzi and P. Toth (eds), Combinatorial Optimization, Wiley, Chichester, 315–338, 1979.

    Google Scholar 

  24. N. Christofides, A. Mingozzi and P. Toth. Exact Algorithms for the Vehicle Routing Problem, Based on Spanning Tree Shortest Path Relaxation. Mathematical Programming, 20:255–282, 1981a.

    Article  MathSciNet  Google Scholar 

  25. N. Christofides, A. Mingozzi and P. Toth. State Space Relaxation Procedures for the Computation of Bounds to Routing Problems. Networks, 11:145–164, 1981b.

    MathSciNet  Google Scholar 

  26. G. Clarke and J.W. Wright. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12:568–581, 1964.

    Google Scholar 

  27. J.-M. Clochard and D. Naddef. Use of Path Inequalities for TSP. In: G. Rinaldi and L.A. Wolsey (eds), Proceedings of the Third Workshop on Integer Programming and Combinatorial Optimization. CORE, Université de Louvain-la-Neuve, Belgium, 1993.

    Google Scholar 

  28. A. Colorni, M. Dorigo and V. Maniezzo. Distributed Optimization by Ant Colonies. In: F. Varela and P. Bourgine (eds), Proceedings of the European Conference on Artificial Life, Elsevier, Amsterdam, 1991.

    Google Scholar 

  29. A. Corberán and J.M. Sanchis. A Polyhedral Approach to the Rural Postman Problem. European Journal of Operational Research, 79:95–114, 1994.

    Article  Google Scholar 

  30. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M. Solomon and F. Soumis. VRP with Time Windows. In: P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 157–194, 2002.

    Google Scholar 

  31. J.-F. Cordeau, M. Gendreau and G. La-porte. A Tabu Search Heuristic for the Periodic and Multi-Depot Vehicle Routing Problems. Networks, 30:105–119, 1997.

    Article  Google Scholar 

  32. J.-F. Cordeau and G. Laporte. A Tabu Search Heuristic for the Site Dependent Vehicle Routing Problem with Time Windows. INFOR, 39:292–298, 2001.

    Google Scholar 

  33. J.-F. Cordeau and G. Laporte. Tabu Search Heuristics for the Vehicle Routing Problem. Cahiers du GERAD G-2002-15, École des Hautes Études Commerciales, Montreal, 2002.

    Google Scholar 

  34. J.-F Cordeau, G. Laporte and A. Mercier. A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Journal of the Operational Research Society, 52:928–936, 2001.

    Article  Google Scholar 

  35. J.-F. Cordeau, M. Gendreau, G. Laporte, J.-Y. Potvin and F. Semet. A Guide to Vehicle Routing Heuristics. Journal of the Operational Research Society, 53:512–522, 2002.

    Article  Google Scholar 

  36. G. Cornuéjols and F. Harche. Polyhedral Study of the Capacitated Vehicle Routing Problem. Mathematical Programming, 60:21–52, 1993.

    Article  MathSciNet  Google Scholar 

  37. T.G. Crainic and H.-J. Sebastian (eds). Focused Issue on Freight Transportation. Transportation Science, 36:1–143, 2002.

    Google Scholar 

  38. G.A. Croes. A Method for Solving Traveling — Salesman Problems. Operations Research, 6:791–812, 1981.

    MathSciNet  Google Scholar 

  39. J.S. de Armon. A Comparison of Heuristics for the Capacitated Chinese Postman Problem. Master’s Thesis, University of Maryland, College Park, MD, 1991.

    Google Scholar 

  40. M. Desrochers and T.W. Verhoog. A Matching Based Savings Algorithm for the Vehicle Routing Problem. Cahiers du GERAD G-89-04, École des Hautes Études Commerciales, Montreal, 1989.

    Google Scholar 

  41. M. Dror (ed.). Arc Routing: Theory, Solutions and Applications, Kluwer, Boston, 2000.

    MATH  Google Scholar 

  42. M. Dror, G. Laporte and P. Trudeau. Vehicle Routing with Split Deliveries. Discrete Applied Mathematics, 50:239–254, 1994.

    Article  MathSciNet  Google Scholar 

  43. G. Dueck. New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel. Journal of Computational Physics, 104:86–92, 1993.

    Article  ADS  Google Scholar 

  44. G. Dueck and T. Scheuer. Threshold Accepting: A General Purpose Optimization Algorithm. Journal of Computational Physics, 90:161–175, 1990.

    Article  MathSciNet  Google Scholar 

  45. R. Durbin and D. Willshaw. An Analogue Approach to the Traveling Salesman Problem Using and Elastic Net Method. Nature, 326:689–691, 1987.

    Article  PubMed  CAS  ADS  Google Scholar 

  46. J. Edmonds and E.L. Johnson. Matching, Euler Tours and the Chinese Postman Problem. Mathematical Programming, 5:88–124, 1973.

    Article  MathSciNet  Google Scholar 

  47. H.A Eiselt, M. Gendreau and G Laporte. Arc Routing Problems, Part I: The Chinese Postman Problem. Operations Research, 43:231–242, 1995a.

    MathSciNet  Google Scholar 

  48. H.A Eiselt, M. Gendreau and G Laporte. Arc Routing Problems, Part II: The Rural Postman Problem. Operations Research, 43:399–414, 1995b.

    MathSciNet  Google Scholar 

  49. H.A Eiselt and G Laporte. A Historical Perspective on Arc Routing. In: M. Dror (ed.), Arc Routing: Theory, Solutions and Applications, Kluwer, Boston, 1–16, 2000.

    Google Scholar 

  50. L. Euler. Solutio Problematis ad Geometriam Situ Pertinentis. Commentarii Academiae Scientarum Petropolitanae, 8:128–140, 1736.

    Google Scholar 

  51. M.L. Fisher. Optimal Solution of Vehicle Routing Problems Using Minimum k-Trees. Operations Research, 42:626–642, 1995.

    Google Scholar 

  52. M.L. Fisher and R. Jaikumar. Generalized Assignment Heuristic for the Vehicle Routing Problem. Networks, 11:109–124, 1981.

    MathSciNet  Google Scholar 

  53. H. Fleischner. Eulerian Graphs and Related Topics (Part 1, Vol 1), Annals of Discrete Mathematics, North-Holland, Amsterdam, 1990.

    Google Scholar 

  54. H. Fleischner. Eulerian graphs and Related Topics (Part 1, vol 2), Annals of Discrete Mathematics, North-Holland, Amsterdam, 1991.

    Google Scholar 

  55. G.N. Frederickson. Approximation Algorithms for Some Routing Problems. Journal of the Association for Computing Machinery, 26:538–554, 1979.

    MathSciNet  Google Scholar 

  56. L.R. Ford and D.R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.

    MATH  Google Scholar 

  57. B.A. Foster and D.M. Ryan. An Integer Programming Approach to the Vehicle Scheduling Problem. Operations Research, 27:367–384, 1976.

    Article  CAS  MathSciNet  Google Scholar 

  58. M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.

    MATH  Google Scholar 

  59. B. Gavish and S. Graves. Scheduling and Routing on Transportation and Distribution Systems: Formulations and New Relaxations. Working Paper, graduate School of Management, University of Rochester, NY., 1982.

    Google Scholar 

  60. M. Gendreau, A. Hertz and G. Laporte. A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science, 40:1276–1290, 1994.

    Google Scholar 

  61. M. Gendreau, A. Hertz and G. Laporte. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research, 40:1086–1094, 1992.

    MathSciNet  Google Scholar 

  62. M. Gendreau, G. Laporte, C. Musaraganyi and É.D. Taillard. A Tabu Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Computers & Operations Research, 26:1153–1173, 1999.

    Article  Google Scholar 

  63. M. Gendreau, G. Laporte and Y.-Y. Potvin. Metaheuristics for the Capacitated VRP. In: P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 129–154, 2002.

    Google Scholar 

  64. H. Ghaziri. Algorithmes connexionistes pour l’optimisation combinatoire. Thèse de doctorat, École Polytechnique Fédérate de Lausanne, Switzerland, 1993.

    Google Scholar 

  65. H. Ghaziri. Solving Routing Problems by a Self-Organizing Map. In: T. Kohonen, K. Makisara, O. Simula and J. Kangas (eds), Artificial Neural Networks, North-Holland, Amsterdam, 1991.

    Google Scholar 

  66. G. Ghiani and G. Laporte. A Branch-and-Cut Algorithm for the Undirected Rural Postman Problem. Mathematical Programming, Series A 87:467–481, 2000.

    Article  MathSciNet  Google Scholar 

  67. B.E. Gillett and L.R. Miller. A Heuristic Algorithm for the Vehicle Dispatch Problem. Operations Research, 22:340–349, 1974.

    Google Scholar 

  68. F. Glover and M. Laguna. Tabu Search, Kluwer, Boston, 1997.

    MATH  Google Scholar 

  69. B.L. Golden, A.A. Assad and E.A. Wasil. Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries. In:P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 245–286, 2002.

    Google Scholar 

  70. B.L. Golden, J.S. de Armon and F.K. Baker. Computational Experiments with Algorithms for a Class of Routing Problems. Computers & Operations Research, 10:47–59, 1983.

    Article  MathSciNet  Google Scholar 

  71. B.L. Golden, T.L. Magnanti and H.G. Nguyen. Implementing Vehicle Routing Algorithms. Networks, 7:113–148, 1977.

    Google Scholar 

  72. B.L. Golden, E.A. Wasil, J.P. Kelly and I-M. Chao. Metaheuristics in Vehicle Routing. In: T.G. Crainic and G. Laporte (eds), Fleet Management and Logistics, Kluwer, Boston, 35–56, 1998.

    Google Scholar 

  73. B.L. Golden and R.T. Wong. Capacitated Arc Routing Problems. Networks, 11:305–315, 1981.

    MathSciNet  Google Scholar 

  74. P. Greistorfer. Computational Experiments with Heuristics for a Capacitated Arc Routing Problem. Working Paper 32, Department of Business, University of Graz, Austria, 1994.

    Google Scholar 

  75. M. Grötschel and Z. Win. A Cutting Plane Algorithm for the Windy Postman Problem. Mathematical Programming, 55:339–338, 1992.

    Article  MathSciNet  Google Scholar 

  76. M. Guan. Graphic Programming Using Odd and Even Points. Chinese Mathematics, 1:273–277, 1962.

    Google Scholar 

  77. E.A. Hadjiconstantinou, N. Christofldes and A. Mingozzi. A New Exact Algorithm for the Vehicle Routing Problem Based on q-Paths and k-Shortest Paths Relaxations. In: M. Gendreau and G. Laporte (eds), Freight Transportation, Annals of Operations Research Baltzer, Amsterdam, 61:21–43, 1995.

    Google Scholar 

  78. C.A. Harre, C. Barnhart, E.L. Johnson, R.E. Marston, G.L. Nemhauser and G. Sigismondi. The Fleet Assignment Problem: Solving a Large-Scale Integer Program. Mathematical Programming, 70:211–232.

    Google Scholar 

  79. A. Hertz, G. Laporte and M. Mittaz. A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Operations Research, 48:129–135, 2000.

    Article  MathSciNet  Google Scholar 

  80. A. Hertz, G. Laporte and P. Nanchen-Hugo. Improvement Procedures for the Undireded Rural Postman Problem. INFORMS Journal on Computing, 11:53–62, 1999.

    MathSciNet  Google Scholar 

  81. A. Hertz and M. Mittaz. A Variable Neighbourhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem. Transportation Science, 35:452–434, 2001.

    Article  Google Scholar 

  82. C. Hierholzer. Uber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechnung zu umfahren. Mathematische Annalen, VI:30–32, 1873.

    Article  MathSciNet  Google Scholar 

  83. J.J. Hopfield and D.W. Tank. Neural Computation of Decisions in Optimization Problems. Biological Cybernetics, 52:141–152, 1985.

    PubMed  CAS  MathSciNet  Google Scholar 

  84. M. Jünger, G. Reinelt and G. Rinaldi. The Traveling Salesman Problem. In: M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (eds), Network Models, Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 7:225–330, 1995.

    Google Scholar 

  85. H. Kawamura, M. Yamamoto, T. Mitamura, K. Suzuki and A. Ohuchi. Cooperative Search on Pheromone Communication for Vehicle Routing Problems. IEEE Transactions on Fundamentals, E81-A:1089–1096, 1998.

    Google Scholar 

  86. T. Kohonen. Self-Organizing and Associative Memory, Springer, Berlin, 1988.

    Google Scholar 

  87. G. Laporte and F.V. Louveaux. Solving Stochastic Routing Problems. In: T.G. Crainic and G. Laporte (eds), Fleet Management and Logistics, Kluwer, Boston, 159–167, 1998.

    Google Scholar 

  88. G. Laporte and Y. Nobert. Comb Inequalities for the Vehicle Routing Problem. Methods of Operations Research, 51:271–276, 1984.

    MathSciNet  Google Scholar 

  89. G. Laporte, Y. Nobert and M. Desrochers. Optimal Routing under Capacity and Distance Restrictions. Operations Research, 33:1050–1073, 1985.

    MathSciNet  Google Scholar 

  90. G. Laporte and F. Semet. Classical Heuristics for the Capacitated VRP. In: P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 109–128, 2002.

    Google Scholar 

  91. J.K. Lenstra and A.H.G. Rinnooy Kan. On General Routing Problems. Networks, 6:273–280, 1976.

    MathSciNet  Google Scholar 

  92. A.N. Letchford. Polyhedral Results for Some Constrained Arc-Routing Problems. Ph.D. Thesis, Department of Management Science, Lancaster University, United Kingdom, 1996.

    Google Scholar 

  93. A.N. Letchford, R.W. Eglese and J. Lysgaard. Multistars, Partial Multistars and the Capacitated Vehicle Routing Problem. Mathematical Programming, 94:21–40, 2002.

    Article  MathSciNet  Google Scholar 

  94. S. Lin. Computer Solutions of the Traveling Salesman Problem. Bell System Technical Journal, 44:2245–2269, 1965.

    MathSciNet  Google Scholar 

  95. J. Lysgaard, A.N. Letchford and R.W. Eglese. A New Branch-and-Cut Algorithm for Capacitated Vehicle Routing Problems. Mahtematical Programming, 2003. Forthcoming.

    Google Scholar 

  96. S. Martello and P. Toth. Knapsack Problems, Wiley, Chichester, 1990.

    MATH  Google Scholar 

  97. J.I. McGill and G.J. van Ryzin (eds). Focused Issue on Yield Management in Transportation. Transportation Science, 33:135–256, 1999.

    Google Scholar 

  98. S. Mitrović-Minić, R. Krishna-raurti and G. Laporte. Double-Horizon Based Heuristics for the Dynamic Pickup and Delivery Problem with Time Windows. Transportation Research B, 2004. Forthcoming.

    Google Scholar 

  99. N. Mladenović and P. Hansen. Variable Neighborhood Search. Computers & Operations Research, 34:1097–1100, 1997.

    Article  Google Scholar 

  100. D. Naddef and G. Rinaldi. The Graphical Relaxation: A New Framework for the Symmetric Traveling Salesman Polytope. Mathematical Programming, 58:53–88, 1993.

    Article  MathSciNet  Google Scholar 

  101. D. Naddef and G. Rinaldi. Branch-and-Cut Algorithms for the Capacitated VRP. In: P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 53–84, 2002.

    Google Scholar 

  102. Y. Nobert and J.-C. Picard. An Optimal Algorithm for the Mixed Chinese Postman Problem. Networks, 27:95–108, 1996.

    Article  MathSciNet  Google Scholar 

  103. M.D. Nelson, K.E. Nygard, J.H. Griffin and W.E. Shreve. Implementation Techniques for the Vehicle Routing Problem. Computers & Operations Research, 12:273–283, 1985.

    Article  Google Scholar 

  104. C.S. Orloff. A Fundamental Problem in Vehicle Routing. Networks, 4:35–64, 1974.

    MathSciNet  Google Scholar 

  105. I.H. Osman. Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem. Annals of Operations Research, 41:421–451, 1993.

    Article  Google Scholar 

  106. M. Owoc and M.A. Sargious. The Role of Transportation in Free Trade Competition. In: N. Waters (ed.), Canadian Transportation: Competing in a Global Context, Banff, Alberta, Canada, 23–32, 1992.

    Google Scholar 

  107. H. Paessens. The Savings Algorithm for the Vehicle Routing Problem. European Journal of Operational Research, 34:336–344, 1988.

    Article  Google Scholar 

  108. W.-L. Pearn. Approximate Solutions for the Capacitated Arc Routing Problem. Computers & Operations Research, 16:589–600, 1989.

    Article  MathSciNet  Google Scholar 

  109. C. Prins. A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem. Computers & Operations Research, 2004. Forthcoming.

    Google Scholar 

  110. H.N. Psaraftis (ed.). Focused Issue on Maritime Transportation. Transportation Science, 33:3–123, 1999.

    Google Scholar 

  111. T.K. Ralphs. Parallel Branch and Cut for Vehicle Routing. Ph.D. Thesis, Cornell University, Ithaca, NY, 1995.

    Google Scholar 

  112. C. Rego. A Subpath Ejection Method for the Vehicle Routing Problem. Management Science, 44:1447–1459, 1998.

    Google Scholar 

  113. C. Rego and C. Roucairol. A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem. In: I.H. Osman and J.P. Kelly (eds), Meta-Heuristics: Theory and Applications, Kluwer, Boston, 661–675, 1996.

    Google Scholar 

  114. J. Renaud, F.F. Boctor and G. Laporte. An Improved Petal Heuristic for the Vehicle Routing Problem. Journal of the Operational Research Society, 47:329–336, 1996.

    Article  Google Scholar 

  115. Y. Rochat and É.D. Taillard. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1:147–167, 1995.

    Article  Google Scholar 

  116. D.M. Ryan, C. Hjorring and F. Glover. Extensions of the Petal Method for Vehicle Routing. newblock Journal of the Operational Research Society, 47:329–336, 1993.

    Google Scholar 

  117. L.J. Schmitt. An Empirical Computational Study of Genetic Algorithms to Solve Order Based Problems: An Emphasis on TSP and VRPTC. Ph.D. Dissertation, Fogelman College of Business and Economics, University of Memphis, TN, 1994.

    Google Scholar 

  118. L.J. Schmitt. An Evaluation of a Genetic Algorithm Approach to the Vehicle Routing Problem. Working Paper, Department of Information Technology Management, Christian Brothers University, Memphis, TN, 1995.

    Google Scholar 

  119. Y. Shen, J.-Y. Potvin, J.-M. Rousseau and S. Roy. A computer Assistant for Vehicle Dispatching with Learning Capabilities. In: M. Gen-dreau and G. Laporte (eds), Freight Transportation, Annals of Operations Research, 61:189–211, 1995.

    Google Scholar 

  120. M.M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Contraints. Operations Research, 35:254–265, 1987.

    MathSciNet  Google Scholar 

  121. É.D. Taillard. Parallel Iterative Search Methods for Vehicle Routing Problems. Networks, 23:661–6673, 1993.

    Google Scholar 

  122. P. Toth and D Vigo. Exact Solution of the Vehicle Routing Problem. In: T.G. Crainic and G. Laporte (eds), Fleet Management and Logistics, Kluwer, Boston, 1–31, 1998a.

    Google Scholar 

  123. P. Toth and D Vigo. The Granular Tabu Search and its Application to the Vehicle-Routing Problem. INFORMS Journal on Computing, 2003. Forhtcoming.

    Google Scholar 

  124. P. Toth and D Vigo (eds). The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002a.

    MATH  Google Scholar 

  125. P. Toth and D Vigo. Branch-and-Bound Algorithms for the Capacitated VRP. In: P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 29–51, 2002b.

    Google Scholar 

  126. P. Toth and D Vigo. VRP with Backhauls. In: P. Toth and D. Vigo (eds), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 195–224, 2002c.

    Google Scholar 

  127. T. van Aardenne-Ehsenfest and N.G. de Bruijn. Circuits and Trees in Oriented Linear Graphs. Simon Stevin, 28:203–217, 1951.

    MathSciNet  Google Scholar 

  128. A. Van Breedam. An Analysis of the Effect of Local Improvement Operators in Genetic Algorithms and Simulated Annealing for the Vehicle Routing Problem. RUCA Working Paper 96/14, University of Antwerp, Belgium, 1996.

    Google Scholar 

  129. A. Volgenant and R. Jonker. The Symmetric Traveling Salesman Problem. European Journal of Operational Research, 12:394–403,1983.

    Article  MathSciNet  Google Scholar 

  130. P. Wark and J. Holt. A repeated Matching Heuristic for the Vehicle Routing Problem. Journal of the Operational Research Society, 45:1156–1167, 1994.

    Article  Google Scholar 

  131. A. Wren. Computers in Transport Planning and Operation, Ian Allan, London, 1971.

    Google Scholar 

  132. A. Wren and A. Holliday. Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points. Operational Research Quarterly, 23:333–344, 1972.

    Google Scholar 

  133. P. Yellow. A Computational Modification to the Savings Method of Vehicle Scheduling. Operational Research Quarterly, 21:281–283, 1970.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Canada Research Chair in Distribution Management and GERAD, HEC Montreal, 3000 chemin de la Côte-Sainte-Catherine, Montreal, Canada, H3T 2A7

    Jean-Francois Cordeau & Gilbert Laporte

Authors
  1. Jean-Francois Cordeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gilbert Laporte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Operational Research Department, London School of Economics, UK

    Gautam Appa  & H. Paul Williams  & 

  2. Department of Mathematical and Physical Sciences, Aristotle University of Thessaloniki, Greece

    Leonidas Pitsoulis

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Cordeau, JF., Laporte, G. (2006). Modeling and Optimization of Vehicle Routing and Arc Routing Problems. In: Appa, G., Pitsoulis, L., Williams, H.P. (eds) Handbook on Modelling for Discrete Optimization. International Series in Operations Research & Management Science, vol 88. Springer, Boston, MA . https://doi.org/10.1007/0-387-32942-0_6

Download citation

Publish with us

Policies and ethics

Search

Navigation