An improved branch-and-cut algorithm for the capacitated vehicle routing problem

Transportation Science

Volumn 37, Issue 2, 2003, Pages 153-169

  Achuthan, N R ^a   Caccetta, L ^a   Hill, S P ^a  

^a CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; GROUND VEHICLES; OPTIMIZATION; SET THEORY; TRAVELING SALESMAN PROBLEM;

BRANCH-AND-CUT ALGORITHM; CAPACITATED VEHICLE ROUTING PROBLEM; CUTTING PLANES;

FREIGHT TRANSPORTATION;

EID: 0041704620     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.37.2.153.15243     Document Type: Article

References (27)

1. Achuthan, N. R., L. Caccetta. 1990. Models for vehicle routing problems. G. P. Pervan, ed. Proc. 10th ASOR Conf. 276-294.
2. ____, ____. 1991. Integer linear programming formulation for a vehicle routing problem. Eur. J. Oper. Res. 52 86-89.
3. ____, ____, S. P. Hill. 1996. A new subtour elimination constraint for the vehicle routing problem. Eur. J. Oper. Res. 91 573-586.
4. Araque, J. R., G. Kudva, T. L. Morin, J. F. Pekny. 1994. A branch and cut algorithm for vehicle routing problems. Ann. Oper. Res. 50 37-59.
5. Augerat, P., J. M. Belengner, E. Benavent, A. Cornberan, D. Naddef, G. Rinaldi. 1995. Computational results with a branch and cut code for the capacitated vehicle routing problem. Rapport de recherche RR949-M. ARTEMIS-IMAG, Grenoble, France.
6. Bodin, L. D., B. L. Golden, A. A. Assad, M. O. Ball. 1983. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. 10 69-211.
7. Bondy, J. A., U. S. R. Murty. 1976. Graph Theory with Applications. American Elsevier, Amsterdam, The Netherlands.
8. Campos, V., A. Corberan, E. Mota. 1991. Polyhedral results for a vehicle routing problem. Eur. J. Oper. Res. 52 75-85.
9. Christofides, N. 1985. Vehicle routing. E. Lawler et al., eds. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, NY, 431-448.
10. ____, S. Eilon. 1969. An algorithm for the vehicle dispatching problem. Oper. Res. Quart. 20 309-318.
11. ____, A. Mingozzi, P. Toth. 1979. The vehicle routing problem. N. Christofides, A. Mingozzi, P. Toth, M. Sandi, eds. Combinatorial Optimization. Wiley, NY, 315-338.
12. ____, ____, ____. 1981. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming 20 255-282.
13. Cornuejols, G., F. Harche. 1993. Polyhedral study of the capacitated vehicle routing problem. Math. Programming 60 21-52.
14. CPLEX Optimization, Inc. 1993. Using the CPLEX Callable Library and CPLEX Mixed Integer Library. Incline Village, NV.
15. Crowder, H., M. Padberg. 1980. Solving large-scale symmetric travelling salesman problems to optimality. Management Sci. 26 495-509.
16. Eilon, S., C. D. T. Watson-Gandy, N. Christofides. 1971. Distribution Management: Mathematical Modelling and Practical Analysis. Griffin, ed. Hafner Publications, London, U.K.
17. Fisher, M. L. 1994. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. 42 626-642.
18. Hadjiconstantinou, E., C. Christofides, A. Mingozzi. 1995. A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Ann. Oper. Res. 61 21-43.
19. Land, A. H., S. Powell. 1973. FORTRAN Codes for Mathematical Programming: Linear, Quadratic and Discrete. John Wiley and Sons, New York.
20. Laporte, G. 1992. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59 213-247.
21. ____, Y. Nobert. 1984. Comb inequalities for the vehicle routing problem. Methods of Oper. Res. 51 271-276.
22. ____, ____. 1987. Exact algorithms for the vehicle routing problem. Ann. Discrete Math. 31 147-184.
23. ____, ____, M. Desrochers. 1985. Optimal routing under capacity and distance restrictions. Oper. Res. 33 1050-1073.
24. Padberg, M. W., G. Rinaldi. 1991. A branch and cut algorithm for the resolution of large scale symmetric traveling salesman problems. SIAM Rev. 33 60-100.
25. Paessens, H. 1988. The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. 34 336-344.
26. Reinelt, G. 1981. A traveling salesman problem library. ORSA J. Comput. 3 376-384.
27. Taillard, E. 1993. Parallel iterative search methods for vehicle routing problems. Networks 23 661-674.