A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

References

• Archetti C., Mansini R., Speranza M. G. Complexity and reducibility of the skip delivery problem. Transportation Sci. (2005) . ForthcomingGoogle Scholar
• Belenguer J. M., Martinez M. C., Mota E. A lower bound for the split delivery vehicle routing problem. Oper. Res. (2000) 48:801–810Link, Google Scholar
• Dror M., Levy L. A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routing. Comput. Oper. Res. (1986) 13:33–45Crossref, Google Scholar
• Dror M., Trudeau P. Savings by split delivery routing. Transportation Sci. (1989) 23:141–145Link, Google Scholar
• Dror M., Trudeau P. Split delivery routing. Naval Res. Logistics (1990) 37:383–402Crossref, Google Scholar
• Dror M., Laporte G., Trudeau P. Vehicle routing with split deliveries. Discrete Appl. Math. (1994) 50:239–254Crossref, Google Scholar
• Frizzell P. W., Giffin J. W. The split delivery vehicle scheduling problem with time windows and grid network distances. Comput. Oper. Res. (1995) 22:655–667Crossref, Google Scholar
• Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. (1992) 40:1086–1094Link, Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40:1276–1290Link, Google Scholar
• Lin S. Computer solutions of the traveling salesman problem. Bell System Tech. J. (1965) 44:2245–2269Crossref, Google Scholar
• Mullaseril P. A., Dror M., Leung J. Split-delivery routing in livestock feed distribution. J. Oper. Res. Soc. (1997) 48:107–116Crossref, Google Scholar
• Sierksma G., Tijssen G. A. Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. (1998) 76:261–286Crossref, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002) (SIAM, Philadelphia, PA) Crossref, Google Scholar