Capacitated Vehicle Routing Problem: Some new cutting planes

Asia-Pacific Journal of Operational Research

Volumn 15, Issue 1, 1998, Pages 109-123

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

^a CURTIN UNIVERSITY   (Australia)

Author keywords

Branch and Cut; Combinatorial optimization; Vehicle routing

Indexed keywords

EID: 0006284516     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. Achuthan, N. R., L. Caccetta and S. P. Hill (1996a), A new subtour elimination constraint for the vehicle routing problem, European Journal of Operational Research 91, 573-586.
2. Achuthan, N. R., L. Caccetta and S. P. Hill (1996b), An improved Branch and Cut algorithm for the capacitated vehicle routing problem, (submitted for publication).
3. Applegate, D., R. Bixby, V. Chvatal and W. Cook (1995), Finding Cuts in the TSP (A Preliminary Report), DIMACS Technical Report 95-05.
4. Araque, J. R., G. Kidva, T. L. Morin and J. F. Pkeny (1994), A Branch and Cut algorithm for vehicle routing problems, Annals of Operations Research 50, 37-59.
5. Augerat, P., J. M. Belenguer, E. Benavent, A. Corberan, D. Naddef and G. Rinaldi (1995), Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France.
6. Bodin, L. D., B. L. Golden, A. Assad and M. Ball (1983), Routing and scheduling of vehicles and crews, the state of the art, Computers and Operations Research 10, 69-211.
7. Campos, V., A. Corberan and E. Mota (1991), Polyhedral results for a vehicle routing problem, European Journal of Operational Research 52, 75-85.
8. Christofides, N. (1985), Vehicle Routing, in The Travelling Salesman Problem (Lawler, E., J. K. Lenstra, A. G. H. Rinnoy Kan and D. M. Shmoys, editors), John Wiley, 431-448.
9. Christofides, N. and S. Eilon (1969), An algorithm for the vehicle dispatching problem, Operations Research 20, 309-318.
10. Christofides, N., A. Mingozzi and P. Toth (1979), The Vehicle Routing Problem, in Combinatorial Optimization (Christofides, N., A. Mingozzi, P. Toth and C. Sandi, editors), Wiley, Chichester, 315-338.
11. Cornuejols, G. and F. Harche (1993), Polyhedral study of the capacitated vehicle routing problem, Mathematical Programming 60, 21-52.
12. Fisher, M. (1994), Optimal solution of vehicle routing problems using minimum K-trees, Operations Research 42, 626-642.
13. Hill, S. P., (1995), Branch and Cut Methods for the Symmetric Capacitated Vehicle Routing Problems, PhD Thesis, Curtin University of Technology, Perth, Western Australia.
14. Laporte, G. (1992), The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59, 345-358.
15. Laporte, G. and Y. Nobert (1987), Exact algorithms for the vehicle routing problem, Annals of Discrete Mathematics 31, 147-184.
16. Laporte, G., Y. Nobert and M. Desrochers (1985), Optimal routing under capacity and distance restrictions, Operations Research 33, 1050-1073.
17. Martello, S. and P. Toth (1990), Knapsack Problems: Algorithms and Computer Implementations, John Wiley.
18. Padberg, M. and G. Rinaldi (1991), A Branch and Cut algorithm for the resolution of large scale travelling salesman problems, SIAM Review 33, 60-100.