When Are Deliveries Profitable?

The paper aims to optimize the final part of a firm’s value chain with regard to attended last-mile deliveries. It is assumed that to be profitable, e-commerce businesses need to maximize the overall value of fulfilled orders (rather than their number), while also limiting costs of delivery. To do so, it is essential to decide which delivery requests to accept and which time windows to offer to which consumers. This is especially relevant for attended deliveries, as delivery fees usually cannot fully compensate costs of delivery given tight delivery time windows. The literature review shows that existing order acceptance techniques often ignore either the order value or the expected costs of delivery. The paper presents an iterative solution approach: after calculating an approximate transport capacity based on forecasted expected delivery requests and a cost-minimizing routing, actual delivery requests are accepted or rejected aiming to maximize the overall value of orders given the computed transport capacity. With the final set of accepted requests, the routing solution is updated to minimize costs of delivery. The presented solution approach combines well-known methods from revenue management and time-dependent vehicle routing. In a computational study for a German metropolitan area, the potential and the limits of value-based demand fulfillment as well as its sensitivity regarding forecast accuracy and demand composition are investigated.

[1]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[2]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[3]  Erwin W. Hans,et al.  Vehicle routing under time-dependent travel times: The impact of congestion avoidance , 2012, Comput. Oper. Res..

[4]  BräysyOlli,et al.  Vehicle Routing Problem with Time Windows, Part II , 2005 .

[5]  Richard W. Eglese,et al.  Vehicle routing and scheduling with time-varying data: A case study , 2010, J. Oper. Res. Soc..

[6]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[7]  Catherine Cleophas,et al.  Recent developments in demand forecasting for airline revenue management , 2009 .

[8]  Heinrich Kuhn,et al.  Designing decision support systems for value-based management: A survey and an architecture , 2012, Decis. Support Syst..

[9]  K. Littlewood. Special Issue Papers: Forecasting and control of passenger bookings , 2005 .

[10]  K. Talluri,et al.  The Theory and Practice of Revenue Management , 2004 .

[11]  M. Punakivi,et al.  Identifying the success factors in e‐grocery home delivery , 2001 .

[12]  Hartmut Stadtler,et al.  Supply chain management and advanced planning--basics, overview and challenges , 2005, Eur. J. Oper. Res..

[13]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[14]  E. Voorde,et al.  Characteristics and Typology of Last-mile Logistics from an Innovation Perspective in an Urban Context , 2011 .

[15]  Richard W. Eglese,et al.  Choice-Based Demand Management and Vehicle Routing in E-Fulfillment , 2016, Transp. Sci..

[16]  Hideki Hashimoto,et al.  An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..

[17]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[18]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[19]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[20]  Jan Fabian Ehmke,et al.  Floating car based travel times for city logistics , 2012 .

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

[22]  Richard H Zeni,et al.  Improved Forecast Accuracy in Airline Revenue Management by Unconstraining Demand Estimates from Censored Data , 2001 .

[23]  Miguel Figliozzi,et al.  A ROUTE IMPROVEMENT ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME DEPENDENT TRAVEL TIMES , 2009 .

[24]  Jan Fabian Ehmke,et al.  Advanced routing for city logistics service providers based on time-dependent travel times , 2012, J. Comput. Sci..

[25]  Peter Paul Belobaba,et al.  Air travel demand and airline seat inventory management , 1987 .

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

[27]  Jan Fabian Ehmke,et al.  Customer acceptance mechanisms for home deliveries in metropolitan areas , 2014, Eur. J. Oper. Res..

[28]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[29]  Julian Allen,et al.  BESTUFS good practice guide on urban freight transport , 2007 .

[30]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[31]  Herbert Meyr,et al.  Revenue management and demand fulfillment: matching applications, models, and software , 2007, OR Spectr..

[32]  B. Vinod Advances in inventory control , 2006 .

[33]  Martin W. P. Savelsbergh,et al.  Decision Support for Consumer Direct Grocery Initiatives , 2005, Transp. Sci..