Abstract
The capacitated vehicle routing problem (CVRP) considered in this paper occurs when goods must be delivered from a central depot to clients with known demands, usingk vehicles of fixed capacity. Each client must be assigned to exactly one of the vehicles. The set of clients assigned to each vehicle must satisfy the capacity constraint. The goal is to minimize the total distance traveled. When the capacity of the vehicles is large enough, this problem reduces to the famous traveling salesman problem (TSP). A variant of the problem in which each client is visited by at least one vehicle, called the graphical vehicle routing problem (GVRP), is also considered in this paper and used as a relaxation of CVRP. Our approach for CVRP and GVRP is to extend the polyhedral results known for TSP. For example, the subtour elimination constraints can be generalized to facets of both CVRP and GVRP. Interesting classes of facets arise as a generalization of the comb inequalities, depending on whether the depot is in a handle, a tooth, both or neither. We report on the optimal solution of two problem instances by a cutting plane algorithm that only uses inequalities from the above classes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.R. Araque, “Solution of a 48-city vehicle routing problem by branch-and-cut,” Working paper, department of Applied Mathematics and Statistics, SUNY (Stony Brook, NY, 1989).
L.D. Bodin, B.L. Golden, A. Assad and M. Ball, “Routing and scheduling of vehicles and crews, the state of the art,”Computers and Operations Research 10 (1983) 69–211.
V. Campos, A. Corberan and E. Mota, “Polyhedral results for a vehicle routing problem,”European Journal of Operational Research 52 (1991) 75–85.
N. Christofides, “Vehicle routing,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
N. Christofides and S. Eilon, “An algorithm for the vehicle dispatching problem,”Operations Research Quarterly 20 (1969) 309–318.
V. Chvátal, “Edmonds polytopes and weakly Hamiltonian graphs,”Mathematical Programing 5 (1973) 29–40.
G. Cornuejols, J. Fonlupt and D. Naddef, “The traveling salesman problem on a graph and some related integer polyhedra,”Mathematical Programming 33 (1985) 1–27.
G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large-scale traveling salesman problem,”Operations Research 2 (1954) 393–410.
M.L. Fisher, “Optimal solution of vehicle routing problems using minimumK-trees,” Working paper 89-12-13, Department of Decision Sciences, The Wharton School, University of Pennsylvania (Philadelphia, PA, 1990).
B. Fleischmann, “Linear programming approaches to traveling salesman and vehicle scheduling problems'” presented at theXIth International Symposium on Mathematical Programming, Bonn, 1982.
B. Fleischmann, “A new class of cutting planes for the symmetric traveling salesman problem,”Mathematical Programming 40 (1988) 225–246.
J. Fonlupt and D. Naddef, “The traveling salesman problem with some excluded minors,” Research Report 557, Université Scientifique et Médicale (Grenoble, France, 1985).
B. Foster and D. Ryan, “An integer programming approach to the vehicle scheduling problem,”Operational Research Quarterly 27 (1976) 367–385.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
M. Grötschel, “On the symmetric traveling salesman problem: Solution of a 120-city problem,”Mathematical Programming Studies 12 (1980) 61–77.
M. Grötschel and M.W. Padberg, “On the symmetric traveling salesman problem: I–II,”Mathematical Programming 16 (1979) 265–280 and 281–302.
M. Grötschel and W. Pulleyblank, “Clique tree inequalities and the traveling salesman problem,”Mathematics of Operations Research 11 (1986) 537–569.
A. Kearny, “Improving productivity in physical distribution,” Report Undertaken for CPDM (London, 1980).
D. Kendrick and A. Meerans, “GAMS — An introduction, user's manual for GAMS,” Development and Research Department of the World Bank (1985).
G. Laporte, “An integer programming approach to the vehicle scheduling problem,” Cahiers du GERAD, G-82-10, Ecole des Hautes Etudes Commerciales de Montreal (1982).
G. Laporte and J.M. Bourjolly, “Some further results onk-star constraints and comb inequalities,” Cahiers du GERAD, G-84-17, Ecole des Hautes Etudes Commerciales (Montreal, Que., 1984).
G. Laporte and Y. Nobert, “Comb inequalities for the vehicle routing problem,”Methods of Operations Research 51 (1984) 271–276.
G. Laporte and Y. Nobert, “Exact algorithms for the vehicle routing problem,”Annals of Discrete Mathematics 31 (1987) 147–184.
G. Laporte, Y. Nobert and M. Desrochers, ‘Optimal routing under capacity and distance restrictions,”Operations Research 33 (1985) 1050–1073.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
T.L. Magnanti, “Combinatorial optimization and vehicle fleet planning: Perspectives and prospects,”Networks 11 (1981) 179–214.
D. Naddef and G. Rinaldi, “The traveling salesman problem: A composition of valid inequalities given by the graphical relaxation,” to appear inMathematical Programming.
D. Naddef and G. Rinaldi, “The symmetric traveling salesman polytope: New facets from the graphical relaxation,” forthcoming.
G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).
M.W. Padberg and S. Hong, “On the symmetric traveling salesman problem: A computational study,”Mathematical Programming Studies 12 (1980) 78–107.
M.W. Padberg and G. Rinaldi, “Optimization of a 532-city symmetric traveling salesman problem,”Operations Research Letters 6 (1987) 1–8.
P. Toth, “Heuristic algorithms for the vehicle routing problem,” presented atthe Workshop on Routing Problems, Hamburg, 1984.
Author information
Authors and Affiliations
Additional information
This work was supported in part by NSF grant DDM-8901495.
Rights and permissions
About this article
Cite this article
Cornuejols, G., Harche, F. Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming 60, 21–52 (1993). https://doi.org/10.1007/BF01580599
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580599