Skip to main content
SpringerLink
Log in

Recent Advances in Routing Algorithms

  • Chapter
Operations Research and Decision Aid Methodologies in Traffic and Transportation Management

Part of the book series: NATO ASI Series ((NATO ASI F,volume 166))

Summary

In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These include some polyhedral results and related branch and cut algorithms, new relaxations, generalized insertion algorithms, and tabu search methods. Some of the most significant developments will be presented, together with indications on their computational value.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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. Applegate, D., Bixby, R., Chvâtal, Cook, W. (1994): Solving Traveling Salesman Problems. Presented at Fifth International Symposium on Mathematical Programming, Ann Arbor, MI.

    Google Scholar 

  2. Araque, J.R., Kudva, G., Morin, T.L., Pekny, J.F. (1994): A Branch-and-Cut Algorithm for Vehicle Routing Problems Annals of Operations Research 50, 37–59.

    Article  MATH  Google Scholar 

  3. Augerat, P., Belenguer, J.M., Benavent, E., Corberân, A., Naddef, D., Rinaldi, G. (1995): Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Working Paper.

    Google Scholar 

  4. Balas, E., Christofides, N. (1981): A Restricted Langrangean Approach to the Traveling Salesman Problem. Mathematical Programming 21, 19–46.

    Article  MathSciNet  MATH  Google Scholar 

  5. Balas, E., Toth, P. (1985): Branch and Bound Methods, In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chicester, pp. 361–401.

    Google Scholar 

  6. Bellmore, M., Malone, J.C. (1971): Pathology of Traveling-Salesman Subtour-Elimination Algorithnms. Operations Research 19, 278–307.

    Article  MathSciNet  MATH  Google Scholar 

  7. Bentley, J.J. (1992): Fast Algorithms for Geometric Traveling Salesman Problems. ORSA Journal on Computing 4, 387–411.

    Article  MathSciNet  MATH  Google Scholar 

  8. Bodin, L.D. (1990): Twenty Years of Routing and Scheduling. Operations Research 38, 571–579.

    Article  Google Scholar 

  9. Bodin, L.D., Golden, B.L., Assad, A.A., Ball, M.O. (1983): Routing and Scheduling of Vehicles and Crews. The State of the Art. Computers Operations Research 10, 69–211.

    MathSciNet  Google Scholar 

  10. Carpaneto, G., Fischetti, M., Toth, P. (1989): New Lower Bounds for the Symmetric Travelling Salesman Problem. Mathematical Programming 45, 233–254.

    Article  MathSciNet  MATH  Google Scholar 

  11. Carpaneto, G., Martello, S., Toth, P. (1988): Algorithms and Codes for the Assignment Problem. In: Simeone, B., Toth, P., Gallo, G., Maffioli, F., Pallottino, S. (eds). FORTRAN Codes for Network Optimization Annals of Operations Research 13, 193–223.

    Google Scholar 

  12. Carpaneto, G., Toth, P. (1980): Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem. Management Science 26, 736743.

    Google Scholar 

  13. Charon, L., Hudry, O. (1993): The Noising Method: A New Method for Combinatorial Optimization. Operations Research Letters 14, 133–137.

    Google Scholar 

  14. Christofides, N. (1970): The Shortest Hamiltonian Chain of a graph. SIAM Journal on Applied Mathematics 19, 689–696.

    Article  MathSciNet  Google Scholar 

  15. Christofides, N. (1985): Vehicle Routing. In Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Schmoys, D.B. (eds). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chichester, pp. 431–448.

    Google Scholar 

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

    Google Scholar 

  17. Codenotti, B., Manzini, G., Margara, L., Resta, G. (1996): Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP. INFORMS Journal on Computing 8, 125–133.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. Crowder, H., Padberg, M.W. (1980): Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality. Management Science 26, 495–509.

    Article  MathSciNet  MATH  Google Scholar 

  20. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M. (1954): Solution of a Large-Scale Traveling-Salesman Problem. Operations Research 2, 393–410.

    Article  MathSciNet  Google Scholar 

  21. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M. (1959): On a Linear-Programming Combinatorial Approach to the Traveling-Salesman Problem. Operations Research 7, 58–66.

    Article  MathSciNet  Google Scholar 

  22. Eastman, W.L. (1958): Linear Programming with Pattern Constraints. Ph.D. Thesis. Harvard University, Cambridge, MA.

    Google Scholar 

  23. El Ghaziri, H. (1993): Algorithmes connexionistes pour l’optimisation combinatoire. Ph.D. Dissertation 1167, École Polytechnique Fédérale de Lausanne, Switzerland.

    Google Scholar 

  24. Fischetti, M., Toth, P. (1992): An Additive Bounding Procedure for the Asymmetric Travelling Salesman Problem. Mathematical Programming 53, 173–197.

    Article  MathSciNet  MATH  Google Scholar 

  25. Fisher, M.L. (1994): Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees. Operations Research 42, 626–642.

    Article  MathSciNet  MATH  Google Scholar 

  26. Fisher, M.L. (1995): Vehicle Routing, In; Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds). Network Routing, Handbooks in Operations Research and Management Science 8. North-Holland, Amsterdam, pp. 1–33.

    Google Scholar 

  27. Garfinkel, R.S. (1973): On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem. Operations Research 21, 340–343.

    Article  MathSciNet  MATH  Google Scholar 

  28. Gavish, B., Srikanth, K.N. (1986): An Optimal Solution Method for Large-Scale Multiple Traveling Salesman Problems. Operations Research 34, 698–717.

    Article  MathSciNet  MATH  Google Scholar 

  29. Gendreau, M., Hertz, A., Laporte, G. (1992): New Insertion and Post-Optimization Procedures for the Traveling Salesman Problem. Operations Research 40, 1086–1094.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  31. Gendreau, M., Laporte, G., Potvin, J.-Y. (1997): Vehicle Routing: Modern Heuristics, In: Aarts, E.H.L., Lenstra, J.K. (eds). Local Search in Combinatorial Optimization. Wiley, Chichester, pp. 311–336.

    Google Scholar 

  32. Glover, F. (1977): Heuristic for Integer Programming Using Surrogate Constraints. Decision Sciences 8, 156–166.

    Article  Google Scholar 

  33. Glover, F. (1989): Tabu Search, Part I. ORSA Journal of Computing 1, 190206.

    Google Scholar 

  34. Glover, F. (1990): Tabu Search, Part II. ORSA Journal of Computing 2, 4–32.

    Article  MATH  Google Scholar 

  35. Glover, F., Taillard, E., deWerra, D. (1993): A User’s Guide to Tabu Search. Annals of Operations Research 41, 3–28.

    Article  MATH  Google Scholar 

  36. Golden, B.L., Assad, A.A. (1986): Perspectives on Vehicle Routing: Exciting New Developments. Operations Research 34, 803–810.

    Article  Google Scholar 

  37. Golden, B.L., Assad, A.A. (1988): Vehicle Routing: Methods and Studies. North-Holland, Amsterdam.

    MATH  Google Scholar 

  38. Golden, B.L., Stewart, W.R. Jr. (1985): Empirical Analysis of Heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chichester, pp. 207–249.

    Google Scholar 

  39. Gomory, R.E. (1963): An Algorithm for Integer Solutions to Linear Program. In: Graves, R.L., Wolfe, P. (eds). Recent Advances in Mathematical Programming. McGraw-Hill, New York, pp. 269–302.

    Google Scholar 

  40. Grötschel, M., Holland, O. (1991): Solution of Large-Scale Symmetric Travelling Salesman Problems. Mathematical Programming 51, 141–202.

    Article  MathSciNet  MATH  Google Scholar 

  41. Grötschel, M., Padberg, M.W. (1985): Polyhedral Theory, In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds). The Traveling Salesman Problem. A guided Tour of Combinatorial Optimization. Wiley, Chichester, pp. 251–305.

    Google Scholar 

  42. Helbig-Hansen, K., Krarup, J. (1974): Improvements of the Held-Karp Algorithm for the Symmetric Traveling-Salesman Problem. Mathematical Programming 7, 87–96.

    Article  MathSciNet  MATH  Google Scholar 

  43. Held, M., Karp, R.M. (1970): The Traveling Salesman Problem and Minimum Spanning Trees. Operations Research 18, 1138–1162.

    Article  MathSciNet  MATH  Google Scholar 

  44. Held, M., Karp, R.M. (1971): The Traveling-Salesman Problem and Minimum Spanning Trees. Part II. Mathematical Programming 1, 6–25.

    Article  MathSciNet  MATH  Google Scholar 

  45. Hill, S.P. (1995): Branch-and-Cut Method for the Symmetric Capacitated Vehicle Routing Problem. Ph.D. Thesis, Curtin University of Technology, Australia.

    Google Scholar 

  46. Johnson, D.L. (1990): Local Optimization and the Traveling Salesman Problem, In: Paterson, E.M. (ed). Proceedings of the 17th International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science. Springer-Verlag, Berlin, pp. 446–461.

    Google Scholar 

  47. Johnson, D.L., McGeoch, L.A. (1997): The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds). Local Search in Combinatorial Optimization. Wiley, Chichester. Forthcoming

    Google Scholar 

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

    Google Scholar 

  49. Kirkpatrick, S., Gelatt, C.D. Jr., Vecchi, M.P. (1983): Optimization by Simulated Annealing. Science 220, 671–680.

    Article  MathSciNet  MATH  Google Scholar 

  50. Land, A.H. (1979): The Solution of Some 100-City Travelling Salesman Problems. Working Paper. London School of Economics.

    Google Scholar 

  51. Langevin, A., Soumis, F., Desrosiers, J. (1990): Classification of Travelling Salesman Problem Formulations. Operations Research Letters 9, 127–132.

    Article  MathSciNet  MATH  Google Scholar 

  52. Laporte, G. (1992a): The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research 59, 231–247.

    Article  MATH  Google Scholar 

  53. Laporte, G. (1992b): The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. European Journal of Operational Research 59, 345–358.

    Article  MATH  Google Scholar 

  54. Laporte, G. (1993): Recent Algorithmic Developments for the Traveling Salesman Problem and the Vehicle Routing Problem. Ricerca Operativa 25, 5–27.

    MathSciNet  Google Scholar 

  55. Laporte, G. (1997): Vehicle Routing, In: Dell’Amico, M., Maffioli, F., Martello, S. (eds). Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester. Forthcoming.

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  58. Laporte, G., Osman, I.H. (1996): Metaheuristics in Combinatorial Optimization. Baltzer, Amsterdam.

    Google Scholar 

  59. Laporte, G., Osman, I.H. (1995): Routing Problems: A Bibliography. Annals of Operations Research 61, 227–262.

    Article  MATH  Google Scholar 

  60. Lawler, E.L., Lenster, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (1985): The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chichester.

    Google Scholar 

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

    MATH  Google Scholar 

  62. Lin, S., Kernighan, B.W. (1973): An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research 21, 498–516.

    Article  MathSciNet  MATH  Google Scholar 

  63. Little, J.D.C., Murty, K.G., Sweeney, D.W., Karel, C. (1963): An Algorithm for the Traveling Salesman Problem. Operations Research 11, 972–989.

    Article  MATH  Google Scholar 

  64. Magnanti, T.L. (1981): Combinatorial Optimization and Vehicle Fleet Planning. Perspectives and Prospects. Networks 11, 179–214.

    Article  MathSciNet  Google Scholar 

  65. Mak, K.-T., Morton, A.J. (1993): A Modified Lin-Kernighan Traveling-Salesman Heuristic. Operations Research Letters 13, 127–132.

    Article  MathSciNet  MATH  Google Scholar 

  66. Martin, G.T. (1966): Solving the Travelling Salesman Problem by Integer Programming. Working Paper. CEIR, New York.

    Google Scholar 

  67. Menger, K. (1932): Das Botenproblem, In: K. Menger (ed). Ergebnisse eines Mathematischen Kolloquiums 2, Teunber, Leipzig, 12.

    Google Scholar 

  68. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E. (1953): Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics 21, 1087–1091.

    Article  Google Scholar 

  69. Miliotis, P. (1976): Integer Programming Approaches to the Travelling Salesman Problem. Mathematical Programming 10, 367–378.

    Article  MathSciNet  MATH  Google Scholar 

  70. Miliotis, P. (1978): Using Cutting Planes to Solve the Symmetric Travelling Salesman Problem. Mathematical Programming 15, 177–188.

    Article  MathSciNet  MATH  Google Scholar 

  71. Miller, D.L. (1995): A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems. ORSA Journal on Computing 7, 1–9.

    Article  MATH  Google Scholar 

  72. Miller, D.L., Pekny, J.F. (1989): Results from a Parallel Branch and Bound Algorithm for Solving Large Asymmetrical Traveling Salesman Problems. Operations Research Letters 8, 129–135.

    Article  MathSciNet  MATH  Google Scholar 

  73. Miller, D.L. Pekny, J.F. (1991): Exact Solution of Large Asymmetric Traveling Salesman Problems. Science 251, 754–761.

    Google Scholar 

  74. Murty, K.G. (1968): An Algorithm for Ranking all the Assignments in Order of Increasing Cost. Operations Research 16, 682–687.

    Article  MATH  Google Scholar 

  75. Naddef, D., Rinaldi, G. (1991): The Symmetric Traveling Salesman Polytope and its Graphical Relaxation: Composition of Valid Inequalities. Mathematical Programming 51, 359–400.

    Article  MathSciNet  MATH  Google Scholar 

  76. Ong, H.L., Huang, H.C. (1989): Asymptotic Expected Performance of Some TSP Heuristics. European Journal of Operational Research 43, 231–238.

    Article  MathSciNet  MATH  Google Scholar 

  77. Or, I. (1976): Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph.D. Dissertation, Northwestern University, Evanston, IL.

    Google Scholar 

  78. Osman, I.H. (1991): Metastrategy Simulated Annealing and Tabu Search Algorithms for Combinatorial Optimization Problems. Ph.D. Thesis, Imperial College, London.

    Google Scholar 

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

    MATH  Google Scholar 

  80. Padberg, M.W., Grötschel, M. (1985): Polyhedral Computations, In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chichester, pp. 307–360.

    Google Scholar 

  81. Padberg, M.W., Hong, S. (1980): On the Symmetric Travelling Salesman Problem: A Computational Study. Mathematical Programming Study 12, 78–107.

    Google Scholar 

  82. Padberg, M.W., Rinaldi, G. (1987): Optimization of a 532-City Symmetric Traveling Salesman Problem by Branch and Cut. Operations Research Letters 6, 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  83. Padberg, M.W., Rinaldi, G. (1990): Facet Identification for the Symmetric Traveling Salesman Problem. Mathematical Programming 47, 219–257.

    Article  MathSciNet  MATH  Google Scholar 

  84. Padberg, M.W., Rinaldi, G. (1991): A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems. SIAM Review 33, 60–100.

    Article  MathSciNet  MATH  Google Scholar 

  85. Padberg, M.W., Sung, T.-Y. (1991): An Analytical Comparison of Different Formulations of the Travelling Salesman Problem. Mathematical Programming 52, 315–357.

    Article  MathSciNet  MATH  Google Scholar 

  86. Pekny, J.F., Miller, D.L. (1992): A Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems. Mathematical Programming 55, 17–33.

    Article  MathSciNet  MATH  Google Scholar 

  87. Pirlot, M. (1992): General Local Search Heuristics in Combinatorial Optimization: A Tutorial. Belgian Journal of Operations Research, Statistics and Computer Science 32, 8–67.

    Google Scholar 

  88. Potvin, J.-Y., Bengio, S. (1996): The Vehicle Routing with Time Windows-Part II: Genetic Search. INFORMS Journal on Computing 8, 165–172.

    Article  MATH  Google Scholar 

  89. Pureza, V.M., Franca, P.M. (1991): Vehicle Routing Problems via Tabu Search Metaheuristic. Publication CRT-747, Centre de Recherche sur les Transports, Montreal.

    Google Scholar 

  90. Reeves, C.R. (1993): Modern Heuristic Techniques for Combinatorial Optimization. Blackwell, Oxford.

    Google Scholar 

  91. Rego, C., Roucairol, C. (1996): A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem, In: Osman, I.H., Kelly, J.P. (eds). Metaheuristics: Theory Applications. Kluwer, Norwell, MA, pp. 661–675.

    Google Scholar 

  92. Reinelt, G. (1991): TSPLIB–A Traveling Salesman Problem Library. ORSA Journal on Computing 3, 376–384.

    Article  MATH  Google Scholar 

  93. Reinelt, G. (1992): Fast Heuristics for Large Scale Geometric Traveling Salesman Problems. ORSA Journal on Computing 4, 206–217.

    Article  MATH  Google Scholar 

  94. Renaud, J., Boctor, F.F., Laporte, G. (1996): A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. INFORMS Journal on Computing 8, 134–143.

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  96. Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M. II (1977): An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM Journal on Computing 6, 563–581.

    Article  MathSciNet  MATH  Google Scholar 

  97. Shapiro, D.M. (1966): Algorithms for the Solution of the Optimal Cost and Bottleneck Traveling Salesman Problems. Sc.D. Thesis. Washington University, St.Louis, MO.

    Google Scholar 

  98. Smith, T.H.C., Srinivasan, V., Thompson, G.L. (1977): Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems. Annals of Discrete Mathematics 1, 495–506.

    Article  Google Scholar 

  99. Smith, T.H.C., Thompson, G.L. (1977): A LIFO Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp’s 1-Tree Relaxation. Annals of Discrete Mathematics 1, 479–493.

    Article  MathSciNet  Google Scholar 

  100. Storer, R.H., Wu, S.D., Vaccari, R. (1992): New Search Spaces for Sequencing Problems with Application to Job Chop Scheduli ng. Management Science 38, 1495–1509.

    Article  MATH  Google Scholar 

  101. Taillard, E. (1993): Parallel Iterative Search Methods for Vehicle Routing Problems. Networks 23, 661–676.

    Article  MATH  Google Scholar 

  102. Tarjan, R.E., (1977): Finding Optimum Branchings. Networks 7, 25–35.

    Article  MathSciNet  MATH  Google Scholar 

  103. Thangiah, S.R. (1993): Vehicle Routing with Time Windows Using Genetic Algorithms Technical Report SRU-SpSc-TR-93–23, Slippery Rock University, Slippery Rock, PA.

    Google Scholar 

  104. Volgenant, T., Jonker, R. (1982): A Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem Based on the 1-Tree Relaxation. European Journal of Operational Research 9, 83–89.

    Article  MathSciNet  MATH  Google Scholar 

  105. Willard, J.A.G. (1989): Vehicle Routing Using r-Optimal Tabu Search. M.Sc. Dissertation, The Management School, Imperial College, London.

    Google Scholar 

  106. Xu, J., Kelly, J.P. (1996): A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem. Transportation Science 30, 379–393.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Groupe d’études et de recherche en analyse des décisions, GERAD, 3000 chemin de la Côte-Sainte-Catherine, Montréal, H3T 2A7, Canada

    Gilbert Laporte

  2. Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, H3C 3J7, Canada

    Gilbert Laporte

Authors
  1. Gilbert Laporte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ISRO and SMG, Université Libre de Bruxelles, Boulevard du Triomphe, B-1050, Brussels, Belgium

    Martine Labbé

  2. Centre de Recherche sur les Transports, Université de Montréal, CP 6128, H3C 3JT, Montréal, Canada

    Gilbert Laporte

  3. Department of Transport Economics, Technical University of Budapest, Bertallan L. u. 2, H-1111, Budapest, Hungary

    Katalin Tanczos

  4. Département de Mathématiques, Université Notre Dame de la Paix, Rempart de la Vierge, 8, B-5000, Namur, Belgium

    Philippe Toint (ASI Director) (ASI Director)

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Laporte, G. (1998). Recent Advances in Routing Algorithms. In: Labbé, M., Laporte, G., Tanczos, K., Toint, P. (eds) Operations Research and Decision Aid Methodologies in Traffic and Transportation Management. NATO ASI Series, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03514-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-03514-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08428-7

  • Online ISBN: 978-3-662-03514-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation