A Generalized Bin Packing Problem for parcel delivery in last-mile logistics

Abstract In this paper, we present a new problem arising at a tactical level of setting a last-mile parcel delivery service in a city by considering different Transportation Companies (TC), which differ in cost and service quality. The courier must decide which TCs to select for the service in order to minimize the total cost and maximize the total service quality. We show that the problem can be modeled as a new packing problem, the Generalized Bin Packing Problem with bin-dependent item profits (GBPPI), where the items are the parcels to deliver and the bins are the TCs. The aim of the GBPPI is to select the appropriate fleet from TCs and determine the optimal assignment of parcels to vehicles such that the overall net cost is minimized. This cost takes into account both transportation costs and service quality. We provide a Mixed Integer Programming formulation of the problem, which is the starting point for the development of efficient heuristics that can address the GBPPI for instances involving up to 1000 items. Extensive computational tests show the accuracy of the proposed methods. Finally, we present a last-mile logistics case study of an international courier which addresses this problem.

[1]  Teodor Gabriel Crainic,et al.  Extreme Point-Based Heuristics for Three-Dimensional Bin Packing , 2008, INFORMS J. Comput..

[2]  Teodor Gabriel Crainic,et al.  An efficient metaheuristic for multi-dimensional multi-container packing , 2011, 2011 IEEE International Conference on Automation Science and Engineering.

[3]  James H. Bookbinder,et al.  Optimal Quoting of Delivery Time by a Third Party Logistics Provider: The Impact of Shipment Consolidation and Temporal Pricing Schemes , 2012, Eur. J. Oper. Res..

[4]  Daniele Manerba,et al.  The Traveling Purchaser Problem and its variants , 2017, Eur. J. Oper. Res..

[5]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[6]  Guido Perboli,et al.  New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty , 2019, Comput. Oper. Res..

[7]  Guido Perboli,et al.  The Multi-Handler Knapsack Problem under Uncertainty , 2014, Eur. J. Oper. Res..

[8]  Guido Perboli,et al.  Packing problems in Transportation and Supply Chain: new problems and trends , 2014 .

[9]  Mehdi Serairi,et al.  Relaxations and exact solution of the variable sized bin packing problem , 2011, Comput. Optim. Appl..

[10]  Teodor Gabriel Crainic,et al.  Parallel Meta-Heuristics , 2010 .

[11]  Qing Liu,et al.  Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions , 2016 .

[12]  Abdenour Labed,et al.  Efficient algorithms for the offline variable sized bin-packing problem , 2013, J. Glob. Optim..

[13]  M. Roccotelli,et al.  A Review of Last Mile Logistics Innovations in an Externalities Cost Reduction Vision , 2018 .

[14]  Teodor Gabriel Crainic,et al.  Efficient lower bounds and heuristics for the variable cost and size bin packing problem , 2011, Comput. Oper. Res..

[15]  Teodor Gabriel Crainic,et al.  New bin packing fast lower bounds , 2007, Comput. Oper. Res..

[16]  Mark Goh,et al.  Collaborative Urban Logistics – Synchronizing the Last Mile a Singapore Research Perspective , 2014 .

[17]  Guido Perboli,et al.  The stochastic generalized bin packing problem , 2012, Discret. Appl. Math..

[18]  Guido Perboli,et al.  A New Taxonomy of Smart City Projects , 2014 .

[19]  Heinrich Kuhn,et al.  Product allocation to different types of distribution center in retail logistics networks , 2018, Eur. J. Oper. Res..

[20]  Mauricio G. C. Resende,et al.  GRASP: basic components and enhancements , 2011, Telecommun. Syst..

[21]  Daniele Vigo,et al.  A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution , 2018, Eur. J. Oper. Res..

[22]  Mauro Maria Baldi,et al.  On the generalized bin packing problem , 2017, Int. Trans. Oper. Res..

[23]  Mehdi Serairi,et al.  Heuristics for the variable sized bin-packing problem , 2009, Comput. Oper. Res..

[24]  Daniele Manerba,et al.  Attended Home Delivery: reducing last-mile environmental impact by changing customer habits , 2018 .

[25]  Teodor Gabriel Crainic,et al.  Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic , 2016, Eur. J. Oper. Res..

[26]  T. Crainic,et al.  Asymptotic results for the Generalized Bin Packing Problem , 2014 .

[27]  Nils Boysen,et al.  Scheduling last-mile deliveries with truck-based autonomous robots , 2018, Eur. J. Oper. Res..

[28]  Teodor Gabriel Crainic,et al.  Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items , 2012, Annals of Operations Research.

[29]  Christian Blum,et al.  Variable neighbourhood search for the variable sized bin packing problem , 2012, Comput. Oper. Res..

[30]  K. Hjort,et al.  What's in the parcel locker? Exploring customer value in e-commerce last mile delivery , 2017, Journal of Business Research.

[31]  David L. Woodruff,et al.  Bin Packing Problems with Uncertainty on Item Characteristics: An Application to Capacity Planning in Logistics , 2014 .

[32]  Michael Saint-Guillain,et al.  Simulation–optimisation framework for City Logistics: an application on multimodal last-mile delivery , 2018 .

[33]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[34]  Guido Perboli,et al.  The multi-path Traveling Salesman Problem with stochastic travel costs , 2017, EURO J. Transp. Logist..

[35]  R. Tadei,et al.  A new open-source system for strategic freight logistics planning: the SYNCHRO-NET optimization tools , 2018 .

[36]  Teodor Gabriel Crainic,et al.  The Generalized Bin Packing Problem , 2012 .

[37]  Guido Perboli,et al.  The capacitated transshipment location problem with stochastic handling utilities at the facilities , 2012, Int. Trans. Oper. Res..

[38]  Teodor Gabriel Crainic,et al.  Computing the asymptotic worst-case of bin packing lower bounds , 2007, Eur. J. Oper. Res..

[39]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .