Attended Home Delivery: reducing last-mile environmental impact by changing customer habits

Abstract Frequently, e-commerce customers pay additional costs for home delivery taking place in a restricted time window. We show how such a behavior is counterproductive in terms of last-mile routing operations. We consider two typical retailer policies to organize the service (a fast delivery in a restricted time interval or the presence of different time windows for each customer) and model them as optimization problems that minimize traveled distance as main cost source for the retailer. For both problems, we convert the obtained number of kilometers into gas emissions under different scenarios characterized by different time windows width. Results are extremely interesting, indicating more sustainable e-commerce customer-oriented strategies.

[1]  Martin W. P. Savelsbergh,et al.  Incentive Schemes for Attended Home Delivery Services , 2006, Transp. Sci..

[2]  Daniele Manerba,et al.  The Nurse Routing Problem with Workload Constraints and Incompatible Services , 2016 .

[3]  Anna Sciomachen,et al.  A mixed-integer model for solving ordering problems with side constraints , 1997, Ann. Oper. Res..

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

[5]  Maria Grazia Speranza,et al.  The distance constrained multiple vehicle traveling purchaser problem , 2014, Eur. J. Oper. Res..

[6]  Nasser A. El-Sherbeny,et al.  Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods , 2010 .

[7]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[8]  Elise Miller-Hooks,et al.  A Green Vehicle Routing Problem , 2012 .

[9]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[10]  Gilbert Laporte,et al.  The time-dependent pollution-routing problem , 2013 .

[11]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[12]  Gilbert Laporte,et al.  Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[13]  P. Beraldi,et al.  A Stochastic Programming Approach for the Traveling Purchaser Problem , 2017 .

[14]  Maria Grazia Speranza,et al.  A branch-and-cut algorithm for the Team Orienteering Problem , 2018, Int. Trans. Oper. Res..

[15]  Jan Fabian Ehmke,et al.  Vehicle Routing for Attended Home Delivery in City Logistics , 2012 .

[16]  Qiang Meng,et al.  Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots , 2008, Math. Comput. Model..

[17]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[18]  Martin W. P. Savelsbergh,et al.  Time Slot Management in Attended Home Delivery , 2008, Transp. Sci..

[19]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..