Complexity of the VRP and SDVRP

Transportation Research Part C: Emerging Technologies

Volumn 19, Issue 5, 2011, Pages 741-750

  Archetti, Claudia ^a   Feillet, Dominique ^b   Gendreau, Michel ^c   Grazia Speranza, M ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

^b ECOLE DES MINES DE SAINT ETIENNE   (France)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Circle; Computational complexity on line; Split delivery vehicle routing problem; Star; Tree; Vehicle routing problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY; STARS; TREES (MATHEMATICS); VEHICLES;

CIRCLE; SPECIAL CLASS; SPECIAL STRUCTURE; SPLIT DELIVERY VEHICLE ROUTING; TREE; UNDERLYING GRAPHS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

PUBLIC TRANSPORT; ROAD TRANSPORT; NUMERICAL METHOD; TRANSPORTATION SYSTEM;

ALGORITHMS; FORESTRY; MATHEMATICS; TREES;

EID: 79955957608     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2009.12.006     Document Type: Article

References (11)

1. Archetti C., Speranza M.G. The split delivery vehicle routing problem: a survey. Operations Research/Computer Science Interfaces Series 2008, vol. 43:103-122. Springer-Verlag, New York. B. Golden, R. Raghavan, E. Wasil (Eds.).
2. Archetti C., Mansini R., Speranza M.G. Complexity and reducibility of the skip delivery problem. Transportation Science 2005, 39:182-187.
3. Archetti C., Savelsbergh M.W.P., Speranza M.G. Worst-case analysis for split delivery vehicle routing problems. Transportation Science 2006, 40:226-234.
4. Busch I.K. Vehicle Routing on Acyclic Networks, Dissertation 1991, The Johns Hopkins University, Baltimore, Maryland.
5. Christofides N., Mingozzi A., Toth P. The vehicle routing problem. Combinatorial Optimization 1979, 315-338. Wiley, Chichester. N. Christofides (Ed.).
6. Dantzig G.B., Ramser J.H. The truck dispatching problem. Management Science 1959, 6:80-91.
7. Dror M., Trudeau P. Savings by split delivery routing. Transportation Science 1989, 23:141-145.
8. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, Freeman, New York.
9. The Vehicle Routing Problem Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series 2008, vol. 43. Springer-Verlag, New York. B. Golden, R. Raghavan, E. Wasil (Eds.).
10. Labbé M., Laporte G., Mercure H. Capacitated vehicle routing on trees. Operations Research 1991, 39:616-622.
11. The Vehicle Routing Problem 2002, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia. P. Toth, D. Vigo (Eds.).