Curtois, Timothy and Laesanklang, Wasakorn and Landa-Silva, Dario and Mesgarpour, Mohammad and Qu, Yi (2017) Towards collaborative optimisation in a shared-logistics environment for pickup and delivery operations. In: 6th International Conference on Operations Research and Enterprise Systems (ICORES

This paper gives an overview of research work in progress within the COSLE (Collaborative Optimisation in a Shared Logistics Environment) project between the University of Nottingham and Microlise Ltd. This is an R&D project that seeks to develop optimisation technology to enable more efficient collaboration in transportation, particularly real-world operational environments involving pickup and delivery problems. The overall aim of the project is to integrate various optimisation techniques into a framework that facilitates collaboration in a shared freight transport logistics environment with the overall goal of reducing empty mileage.

[1]  Vehicle Routing Software Survey: Higher expectations drive transformation , 2019, Volume 43, Number 1, February 2016.

[2]  Edmund K. Burke,et al.  The late acceptance Hill-Climbing heuristic , 2017, Eur. J. Oper. Res..

[3]  Angel A. Juan,et al.  Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions , 2015, Int. Trans. Oper. Res..

[4]  Sergio García,et al.  A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem , 2014, Ann. Oper. Res..

[5]  Gilbert Laporte,et al.  A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading , 2014, Comput. Oper. Res..

[6]  Haijun Wang,et al.  Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake , 2014 .

[7]  Xin Wang,et al.  Collaborative transportation planning of less-than-truckload freight , 2014, OR Spectr..

[8]  Kamlesh Mathur,et al.  An efficient column-generation-based algorithm for solving a pickup-and-delivery problem , 2011, Comput. Oper. Res..

[9]  Fabien Lehuédé,et al.  An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..

[10]  Kjetil Fagerholt,et al.  The Maritime Pickup and Delivery Problem with Time Windows and Split Loads , 2011, INFOR Inf. Syst. Oper. Res..

[11]  Feng Chu,et al.  Coordination of split deliveries in one-warehouse multi-retailer distribution systems , 2011, Comput. Ind. Eng..

[12]  Shigenobu Kobayashi,et al.  Guided Ejection Search for the Pickup and Delivery Problem with Time Windows , 2010, EvoCOP.

[13]  Xiangtong Qi,et al.  A practical split vehicle routing problem with simultaneous pickup and delivery , 2009, 2009 16th International Conference on Industrial Engineering and Engineering Management.

[14]  Chelsea C. White,et al.  An empirical study on the benefit of split loads with the pickup and delivery problem , 2009, Eur. J. Oper. Res..

[15]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[16]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[17]  Chelsea C. White,et al.  Pickup and Delivery with Split Loads , 2008, Transp. Sci..

[18]  Martin W. P. Savelsbergh,et al.  Reducing Truckload Transportation Costs Through Collaboration , 2007, Transp. Sci..

[19]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[20]  Mikael Rönnqvist,et al.  Cost Allocation in Collaborative Forest Transportation , 2006, Eur. J. Oper. Res..

[21]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[22]  Marc Salomon,et al.  Joint Route Planning Under Varying Market Conditions , 2006 .

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

[24]  Mekki Ksouri,et al.  A new hybrid evolutionary approach for the pickup and delivery problem with time windows , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[25]  Russell Bent,et al.  A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2003, Comput. Oper. Res..

[26]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

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

[28]  Andrew Lim,et al.  A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

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

[30]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

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

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

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

[35]  Maria Grazia Speranza,et al.  Vehicle routing problems with split deliveries , 2012, Int. Trans. Oper. Res..

[36]  W. Dullaert,et al.  Horizontal Cooperation in Transport and Logistics: A Literature Review , 2007, Transportation Journal.

[37]  L. V. Bruggen.  The pickup and delivery problem with time windows , 1990 .