Lower bound for the split delivery vehicle routing problem

Operations Research

Volumn 48, Issue 5, 2000, Pages 801-810

  Belenguer, J M ^a   Martinez, M C ^a   Mota, E ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; TRANSPORTATION ROUTES; VECTORS;

CAPACITATED VEHICLE ROUTING; SPLIT DELIVERY VEHICLE ROUTING;

OPERATIONS RESEARCH;

EID: 0034262328     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.5.801.12407     Document Type: Article

References (26)

1. Araque, J. R. 1989. A polyhedral approach to vehicle routing. Presented at ORSA/TIMS Meeting, New York.
2. Augerat, P., J. M. Belenguer, E. Benavent, A. Corberan, D. Naddef, G. Rinaldi. 1995. Computational results with a branch and cut code for the vehicle routing problem. Technical Report RR949-M. Institut IMAG, Grenoble, France.
3. Bodin, L. D., B. L. Golden, A. A. Assad, M. O. Ball. 1983. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. 10 63-211.
4. Campos, V., E. Mota. 2000. Heuristic procedures for the capacitated vehicle routing problem. Comput. Optim. Appl. Forthcoming.
5. Chnstofides, N. 1985. Vehicle routing. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, UK, 431-448.
6. _, S. Eilon. 1969. An algorithm for the vehicle-dispatching problems. Oper. Res. Quart. 20309-318.
7. Cornuejols, G., J. Fonlupt, D. Naddef. 1985. The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33 1-27.
8. _, F. Harche. 1993. Polyhedral study of the capacitated vehicle routing problem. Math. Programming 60 21-52.
9. CPLEX Optimization, Inc. 1994. Using the CPLEX™ callable library and CPLEX™ mixed integer library. 930 Tahoe Blvd., Bldg. 802, Incline Village, NV.
10. Dror, M., G. Laporte, P. Trudeau. 1994. Vehicle routing with split deliveries. Discrete Appl. Math. 50 239-254.
11. _, P. Trudeau. 1989. Savings by split delivery routing. Transportation Sci. 23 141-145.
12. _, _. 1990. Split delivery routing. Naval Res. Logist. 37 383-402.
13. Federgruen, A., D. Simchi-Levi. 1995. Analysis of vehicle routing and inventory routing problems. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in OR&MS, vol. 8, North-Holland, Amsterdam, The Netherlands, 297-373.
14. Fisher, M. 1995. Vehicle routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in OR&MS, vol. 8. North-Holland, Amsterdam, The Netherlands, 1-33.
15. Frizzell, P. W., J. W. Giffin. 1992. The bounded split delivery vehicle routing problem with grid networks distances. Asia Pacific J. Oper. Res. 9 101-116.
16. _, _. 1995. The split delivery vehicle scheduling problem with time windows and grid network distance. Comput. Oper. Res. 22 655-667.
17. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
18. Harche, F., G. Rinaldi. 1991. Vehicle routing. Private communication.
19. Magnanti, T. 1981. Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks 11 179-213.
20. Martinez, M. C. 1995. Rutas de vehícules con demanda compartida. Ph.D. Dissertation. Department of Statistics and O.R., University of Valencia, Valencia, Spain.
21. _, E. Mota, G. Rinaldi. 2000. The split delivery vehicle routing polyhedron: New families of facet defining inequalities. Working paper.
22. Mullaseril, P. A., M. Dror, J. Leung. 1997. Split-delivery routing heuristics in livestock feed distribution. J. Oper. Res. Soc. 48 107-116.
23. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
24. Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41 421-451.
25. Reinelt, G. 1991. TSPLIB - traveling salesman problem library. ORSAJ. Comput. 3 376-384. WWW-access:http://www.iwr. uni-heidelberg.de/iwr/comopt/soft/TSPLIB/TSPLIB.html.
26. Sierksma, G., G. A. Tijssen. 1998. Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. 76 261-286.