A Lower Bound for the Split Delivery Vehicle Routing Problem

References

  • Araque J. R. A polyhedral approach to vehicle routing. (1989) Presented at ORSA/TIMS MeetingNew YorkGoogle Scholar
  • Augerat P., Belenguer J. M., Benavent E., Corberan A., Naddef D., Rinaldi G. Computational results with a branch and cut code for the vehicle routing problem. (1995) . Technical Report RR949-M. Institut IMAG, Grenoble, FranceGoogle Scholar
  • Bodin L. D., Golden B. L., Assad A. A., Ball M. O. Routing and scheduling of vehicles and crews: The state of the art. Comput. Oper. Res. (1983) 10:63–211CrossrefGoogle Scholar
  • Campos V., Mota E. Heuristic procedures for the capacitated vehicle routing problem. Comput. Optim. Appl. (2000) . ForthcomingCrossrefGoogle Scholar
  • Christofides N., 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
  • Christofides N., Eilon S. An algorithm for the vehicle-dispatching problems. Oper. Res. Quart. (1969) 20:309–318CrossrefGoogle Scholar
  • Cornuejols G., Fonlupt J., Naddef D. The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming (1985) 33:1–27CrossrefGoogle Scholar
  • Cornuejols G., Harche F. Polyhedral study of the capacitated vehicle routing problem. Math. Programming (1993) 60:21–52CrossrefGoogle 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
  • Dror M., Laporte G., Trudeau P. Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254CrossrefGoogle Scholar
  • Dror M., Trudeau P. Savings by split delivery routing. Transportation Sci. (1989) 23:141–145LinkGoogle Scholar
  • Dror M., Trudeau P. Split delivery routing. Naval Res. Logist. (1990) 37:383–402CrossrefGoogle Scholar
  • Federgruen A., Simchi-Levi D., 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&MSCrossrefGoogle Scholar
  • Fisher M., 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&MSCrossrefGoogle Scholar
  • Frizzell P. W., Giffin J. W. The bounded split delivery vehicle routing problem with grid networks distances. Asia Pacific J. Oper. Res. (1992) 9:101–116Google Scholar
  • Frizzell P. W., Giffin J. W. The split delivery vehicle scheduling problem with time windows and grid network distance. Comput. Oper. Res. (1995) 22:655–667CrossrefGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
  • Harche F., Rinaldi G. Vehicle routing. (1991) . Private communicationGoogle Scholar
  • Magnanti T. Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks (1981) 11:179–213CrossrefGoogle Scholar
  • Martinez M. C. Rutas de vehículos con demanda compartida. (1995) . Ph.D. Dissertation. Department of Statistics and O.R., University of Valencia, Valencia, SpainGoogle Scholar
  • Martinez M. C., Mota E., Rinaldi G. The split delivery vehicle routing polyhedron: New families of facet defining inequalities. (2000) . Working paperGoogle Scholar
  • Mullaseril P. A., Dror M., Leung J. Split-delivery routing heuristics in livestock feed distribution. J. Oper. Res. Soc. (1997) 48:107–116CrossrefGoogle Scholar
  • Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) CrossrefGoogle Scholar
  • Osman I. H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. (1993) 41:421–451CrossrefGoogle Scholar
  • Reinelt G. TSPLIB—traveling salesman problem library. ORSA J. Comput. (1991) 3:376–384WWW-access: http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB/TSPLIB.htmlLinkGoogle Scholar
  • Sierksma G., Tijssen G. A. Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. (1998) 76:261–286CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.