Abstract
In this paper we present two new heuristic procedures for the Capacitated Vehicle Routing Problem (CVRP). The first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original problem. This second algorithm is designed to be used in a branch and cut approach to solve to optimality CVRP instances. In both heuristics, the initial solution is improved using tabu search techniques. Computational results over a set of known instances, most of them with a proved optimal solution, are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Augerat, J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef, and G. Rinaldi, “Computational results with a branch and cut code for the capacitated vehicle routing problem,” Institut IMAG, University Joseph Fourier Grenoble I, Working paper RR949-M, 1995.
M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Handbooks in Operations Research and Management Science, vol. 8, Elsevier Science B.V., 1995.
N. Christofides, and S. Eilon, “An algorithm for the vehicle dispatching problem,” Operations Research Quartely, vol. 20, pp. 309–318, 1969.
N. Christofides, E. Hadjiconstantinou, and A. Mingozzi, “An exact algorithm for the vehicle routing problem based on the set partitionning formulation,” communication presented at EURO XIII, Glasgow, July 1994.
N. Christofides, A. Mingozzi, and P. Toth, “The vehicle routing problem,” in Combinatorial Optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (Eds.), Wiley: Chichester, 1979, pp. 318–338.
G. Clarke and J. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, pp. 568–581, 1964.
G. Cornuejols and F. Harche, “Polyhedral study of the capacitated vehicle routing problem,” Mathematical Programming, vol. 60, pp. 21–52, 1993.
M.L. Fisher, “Optimal solution of vehicle routing problems using minimum K-trees,” Operations Research, vol. 42-44, pp. 626–642, 1994.
M.L. Fisher, “Vehicle routing,” in Handbooks in Operations Research and Management Science, vol. 8, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Elsevier Science B.V., 1995, pp. 1-33.
M.L. Fisher and R. Jaikumar, “A generalized assignment heuristic for the vehicle routing problem,” Networks, vol. 11, pp. 109–124, 1981.
M. Gendreau, A. Hertz, and G. Laporte, “A tabu search heuristic for the vehicle routing problem,” Management Science, vol. 40, pp. 1276–1290, 1994.
F. Glover, “Tabu search-Part I,” ORSA Journal of Computing, vol. 1, pp. 190–206, 1989.
F. Glover, “Tabu search-Part II,” ORSA Journal of Computing, vol. 2, pp. 4–32, 1990.
F. Glover, E. Taillard, and D. De Werra, “A user's guide to tabu search,” Annals of Operations Research, vol. 41, pp. 3–28, 1993.
S. Lin, and B.W. Kernighan, “An effective heuristic algorithm for the travelling salesman problem,” Operations Research, vol. 21, pp. 2245–2269, 1973.
S. Martello and P. Toth, “Generalized assignment problem,” in Knapsack Problems Algorithms and Computer Implementations, John Wiley and Sons Ltd., pp. 189-220, 1990.
I.H. Osman, “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,” Annals of Operations Research, vol. 41, pp. 421–451, 1993.
G. Reinelt, “TSPLIB: A travelling salesman problem library,” ORSA Journal of Computing, vol. 3, pp. 376–384, 1993.
E. Taillard, “Parallel iterative search methods for vehicle routing problems,” Networks, vol. 23, pp. 661–674, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Campos, V., Mota, E. Heuristic Procedures for the Capacitated Vehicle Routing Problem. Computational Optimization and Applications 16, 265–277 (2000). https://doi.org/10.1023/A:1008768313174
Issue Date:
DOI: https://doi.org/10.1023/A:1008768313174