论文信息 - A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem - 字舞流文

A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem

Mingzhou Jin | Kai Liu | R. Bowden

[1] Moshe Dror,et al. Savings by Split Delivery Routing , 1989, Transp. Sci..

[2] M. Dror,et al. Split delivery routing , 1990 .

[3] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[4] Moshe Dror,et al. Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[5] J. W. Giffin,et al. The split delivery vehicle scheduling problem with time windows and grid network distances , 1995, Comput. Oper. Res..

[6] Moshe Dror,et al. Split-delivery routeing heuristics in livestock feed distribution , 1997 .

[7] Gerard Sierksma,et al. Routing helicopters for crew exchanges on off-shore locations , 1998, Ann. Oper. Res..

[8] José-Manuel Belenguer,et al. A Lower Bound for the Split Delivery Vehicle Routing Problem , 2000, Oper. Res..

[9] Yavuz A. Bozer,et al. A shortest path approach to the multiple-vehicle routing problem with split pick-ups , 2006 .

[10] Alain Hertz,et al. A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

[11] Michael Bögl,et al. Multi-period vehicle routing and crew scheduling with outsourcing options , 2008 .