The Pickup and Delivery Problem with Split Loads

ACKNOWLEDGEMENTS While working on my Ph.D. at Georgia Tech and Michigan, I have received a great deal of support from many different people. My degree would not have been possible without this support. I would like to begin by thanking my two dissertation advisors, Dr. Ozlem Ergun and Dr. Chip White. Their guidance and encouragement was constant and unwavering. They helped open the door for me to countless new intellectual discoveries. While completing my Ph.D., I spent one year working as an intern for Federal Express.

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

[2]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[3]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[4]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[5]  Niaz A. Wassan,et al.  A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls , 2002 .

[6]  Jacques Desrosiers,et al.  A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..

[7]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[8]  Gur Mosheiov,et al.  The traveling salesman problem with delivery and backhauls , 1994, Oper. Res. Lett..

[9]  David Simchi-Levi,et al.  Analysis of vehicle routing and inventory-routing problems , 1995 .

[10]  Yazid Mati,et al.  A tabu search heuristic for the single vehicle pickup and delivery problem with time windows , 2001, J. Intell. Manuf..

[11]  Thomas M. Corsi,et al.  MEASURING FIRM STRATEGIC CHANGE IN THE REGULATED AND DEREGULATED MOTOR CARRIER INDUSTRY: AN 18 YEAR EVALUATION / JANE N. FEITLER, THOMAS M. CORSI, AND CURTIS M. GRIMM.. , 1997 .

[12]  Gur Mosheiov,et al.  The Travelling Salesman Problem with pick-up and delivery , 1994 .

[13]  Arthur V. Hill,et al.  An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .

[14]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

[15]  Paolo Toth,et al.  Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..

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

[17]  Daniele Vigo,et al.  Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..

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

[19]  Paolo Toth,et al.  An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..

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

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

[22]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[23]  Roberto Baldacci,et al.  An Exact Method for the Vehicle Routing Problem with Backhauls , 1999, Transp. Sci..

[24]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[25]  Jean-Yves Potvin,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows , 1997, Transp. Sci..

[26]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

[27]  F. Al-Khayyal.  Jointly constrained bilinear programs and related problems: an overview , 1990 .

[28]  Harilaos N. Psaraftis.  Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .

[29]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing , 1985, Transp. Sci..

[30]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[31]  E K Morlok,et al.  THE PARCEL SERVICE INDUSTRY IN THE U.S.: ITS SIZE AND ROLE IN COMMERCE , 2000 .

[32]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[33]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..

[34]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[35]  Raymond K. Cheung,et al.  Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls , 2003 .

[36]  Enrico Angelelli,et al.  The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery , 2002 .

[37]  Matteo Fischetti,et al.  An Additive Bounding Procedure for Combinatorial Optimization Problems , 1989, Oper. Res..

[38]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[39]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[40]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[41]  Martin W. P. Savelsbergh,et al.  Worst-Case Analysis for Split Delivery Vehicle Routing Problems , 2006, Transp. Sci..

[42]  Jacques Renaud,et al.  A heuristic for the pickup and delivery traveling salesman problem , 2000, Comput. Oper. Res..

[43]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[44]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

[45]  Thomas R. Sexton,et al.  Pickup and Delivery of Partial Loads with “Soft” Time Windows , 1986 .

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

[47]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[48]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[49]  Jan Karel Lenstra,et al.  Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows , 1993, Transp. Sci..

[50]  P. Healy,et al.  A new extension of local search applied to the Dial-A-Ride Problem , 1995 .

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

[52]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

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

[54]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[55]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[56]  L. V. Wassenhove,et al.  Quantitative approaches to distribution logistics and supply chain management , 2002 .

[57]  Said Salhi,et al.  An investigation into a new class of vehicle routing problem with backhauls , 2002 .

[58]  Charlotte Diane Jacobs.  The vehicle routing problem with backhauls , 1987 .

[59]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[60]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[62]  Candace Arai Yano,et al.  Vehicle Routing at Quality Stores , 1987 .

[63]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[64]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[65]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[66]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[67]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[68]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[69]  Paolo Toth,et al.  A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..

[70]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[71]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[72]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[73]  James Lewis Bander.  SEQUENTIAL DECISION PROBLEMS ARISING IN COMMERCIAL VEHICLE OPERATIONS , 1999 .

[74]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[75]  Michel Gendreau,et al.  An Approximation Algorithm for the Traveling Salesman Problem with Backhauls , 1997, Oper. Res..

[76]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[77]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[78]  Sylvie Gélinas,et al.  A new branching strategy for time constrained routing problems with application to backhauling , 1992, Ann. Oper. Res..

[79]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[80]  J Dethloff,et al.  Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls , 2002, J. Oper. Res. Soc..

[81]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[82]  Charlotte Jacobs-Blecha.  The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms , 1998 .

[83]  Loren K. Platzman,et al.  An O(N log N) planar travelling salesman heuristic based on spacefilling curves , 1982, Oper. Res. Lett..

[84]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..