A Lower Bound for the Split Delivery Vehicle Routing Problem
Published Online:1 Oct 2000https://doi.org/10.1287/opre.48.5.801.12407
References
- A polyhedral approach to vehicle routing. (1989) Presented at ORSA/TIMS MeetingNew YorkGoogle Scholar
- Computational results with a branch and cut code for the vehicle routing problem. (1995) . Technical Report RR949-M. Institut IMAG, Grenoble, FranceGoogle Scholar
- Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. (1983) 10:63–211Crossref, Google Scholar
- Heuristic procedures for the capacitated vehicle routing problem. Comput. Optim. Appl. (2000) . ForthcomingCrossref, Google Scholar
- , Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Vehicle routing. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, Chichester, UK) 431–448Google Scholar
- An algorithm for the vehicle-dispatching problems. Oper. Res. Quart. (1969) 20:309–318Crossref, Google Scholar
- The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming (1985) 33:1–27Crossref, Google Scholar
- Polyhedral study of the capacitated vehicle routing problem. Math. Programming (1993) 60:21–52Crossref, Google Scholar
- CPLEX Optimization, Inc. Using the CPLEX™ callable library and CPLEX™ mixed integer library. (1994) (930 Tahoe Blvd., Bldg. 802, Incline Village, NV)Google Scholar
- Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254Crossref, Google Scholar
- Savings by split delivery routing. Transportation Sci. (1989) 23:141–145Link, Google Scholar
- Split delivery routing. Naval Res. Logist. (1990) 37:383–402Crossref, Google Scholar
- , Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Analysis of vehicle routing and inventory routing problems. Network Routing (1995) 8(North-Holland, Amsterdam, The Netherlands) 297–373Handbooks in OR&MSCrossref, Google Scholar
- , Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Vehicle routing. Network Routing (1995) 8(North-Holland, Amsterdam, The Netherlands) 1–33Handbooks in OR&MSCrossref, Google Scholar
- The bounded split delivery vehicle routing problem with grid networks distances. Asia Pacific J. Oper. Res. (1992) 9:101–116Google Scholar
- The split delivery vehicle scheduling problem with time windows and grid network distance. Comput. Oper. Res. (1995) 22:655–667Crossref, Google Scholar
- Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
- Vehicle routing. (1991) . Private communicationGoogle Scholar
- Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks (1981) 11:179–213Crossref, Google Scholar
- Rutas de vehículos con demanda compartida. (1995) . Ph.D. Dissertation. Department of Statistics and O.R., University of Valencia, Valencia, SpainGoogle Scholar
- The split delivery vehicle routing polyhedron: New families of facet defining inequalities. (2000) . Working paperGoogle Scholar
- Split-delivery routing heuristics in livestock feed distribution. J. Oper. Res. Soc. (1997) 48:107–116Crossref, Google Scholar
- Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. (1993) 41:421–451Crossref, Google Scholar
- TSPLIB—traveling salesman problem library. ORSA J. Comput. (1991) 3:376–384WWW-access: http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB/TSPLIB.htmlLink, Google Scholar
- Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. (1998) 76:261–286Crossref, Google Scholar

