Improved Collaborative Transport Planning at Dutch Logistics Service Provider Fritom

We study the collaborative transport planning for two autonomous business units of Fritom, a Dutch logistics service provider. This difficult planning problem does not fit any existing type of vehicle routing problem proposed in the academic literature; therefore, we define a new problem class, the generalized pickup and delivery problem. We also propose and evaluate methods to structure and improve Fritom’s existing collaborative transport planning process. Using an extensive real-world data set from Fritom, our experiments show that our proposed methods significantly outperform Fritom’s collaborative planning approach in total travel distance. We formulate managerial recommendations for Fritom and describe the implementation process for these recommendations. Finally, we present several recommendations for future research.

[1]  Michael Schwind,et al.  A combinatorial intra-enterprise exchange for logistics services , 2009, Inf. Syst. E Bus. Manag..

[2]  Xin Wang,et al.  Operational transportation planning of freight forwarding companies in horizontal coalitions , 2014, Eur. J. Oper. Res..

[3]  Gilbert Laporte,et al.  The Pickup And Delivery Problem With Time Windows And Transshipment , 2006 .

[4]  Herbert Kopfer,et al.  Collaborating freight forwarding enterprises , 2006, OR Spectr..

[5]  Tom Van Woensel,et al.  Multidepot Distribution Planning at Logistics Service Provider Nabuurs B.V , 2014, Interfaces.

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

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

[8]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

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

[10]  Christian Bierwirth,et al.  Solutions to the request reassignment problem in collaborative carrier networks , 2010 .

[11]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..

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

[13]  M. Goetschalckx,et al.  The vehicle routing problem with backhauls , 1989 .

[14]  Gilbert Laporte,et al.  Horizontal cooperation among freight carriers: request allocation and profit sharing , 2008, J. Oper. Res. Soc..

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

[16]  Maria Sameiro Carvalho,et al.  New mixed integer-programming model for the pickup-and-delivery problem with transshipment , 2014, Eur. J. Oper. Res..

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

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

[19]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[20]  Martín Matamala,et al.  The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..

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