Complexity and reducibility of the skip delivery problem

Transportation Science

Volumn 39, Issue 2, 2005, Pages 182-187

  Archetti, C ^a   Mansini, R ^a   Speranza, M G ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Computational complexity; Skip delivery problem split delivery; Triangle inequality; Vehicle routing

Indexed keywords

COMPUTATIONAL COMPLEXITY; FLEET OPERATIONS; OPTIMIZATION; POLYNOMIALS;

SKIP DELIVERY PROBLEM; SPLIT DELIVERY; TRIANGLE INEQUALITY; VEHICLE ROUTING;

OPERATIONS RESEARCH;

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

References (14)

1. Archetti, C., M. G. Speranza. 2002. The 1-skip collection problem. Technical Report Number 209, Department of Quantitative Methods, University of Brescia, Brescia, Italy.
2. Archetti, C., R. Mansini, M. G. Speranza. 2001. The split delivery vehicle routing problem with small capacity. Technical Report Number 201, Department of Quantitative Methods, University of Brescia, Brescia, Italy.
3. Ball, M., L. Bodin, R. Baldacci, A. Mingozzi. 2000. The rollon-rolloff vehicle routing problem. Transportation Sci. 34 271-288.
4. Christofides, N. 1985. Vehicle routing. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem. John Wiley and Sons, Chichester, UK.
5. Christofides, N., A. Mingozzi, P. Toth. 1979. The vehicle routing problem. N. Christofides, A. Mingozzi, P. Toth, C. Sandi, eds. Combinatorial Optimization. John Wiley and Sons, Chichester, UK.
6. De Meulemeester, L., G. Laporte, F. V. Louveaux, F. Semet. 1997. Optimal scheduling of skip collections and deliveries. J. Oper. Res. Soc. 48 57-64.
7. Dror, M., P. Trudeau. 1989. Savings by split delivery routing. Transportation Sci. 23 141-145.
8. Dror, M., P. Trudeau. 1990. Split delivery routing. Naval Res. Logist. 37 383-402.
9. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.
10. Gerards, A. M. H. 1995. Matching. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science, Vol. 7. North-Holland, Amsterdam, The Netherlands.
11. Golden, B. L., A. A. Assad. 1988. Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, The Netherlands.
12. Gourdin, É., M. Labbé, G. Laporte. 2000. The uncapacitated facility location problem with client matching. Oper. Res. 48 671-685.
13. Hannemann, M. M., A. Schwartz. 2000. Implementing weighted b -matching algorithms: Towards a flexible software design. ACM J. Experiment. Algorithmics 5(Article 8).
14. Toth, P., D. Vigo. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA.