Vehicle selection for a multi-compartment vehicle routing problem

Abstract This paper addresses the vehicle routing and selection problem of single and multi-compartment vehicles for grocery distribution. Retailers used to rely on single-compartment vehicles (SCV), and transported only one temperature-specific product segment with this vehicle type. Retailers now have the option of using multi-compartment vehicles (MCV) due to technological advances. Products requiring differing temperature zones can be transported jointly as the loading area is split into separate compartments. Both vehicle types cause different costs for loading, transportation and unloading. In literature either the use of SCVs or MCVs has been considered without a distinction between vehicle-dependent costs and the use of both vehicle types in the fleet to achieve a cost-optimal fleet mix. We therefore identify vehicle-dependent costs within empirical data collection and present an extended multi-compartment vehicle routing problem (MCVRP) for the vehicle selection. We solve the problem with a Large Neighborhood Search. Our numerical experiments are based on the insights we draw from a real-life case with a retailer. In further experiments we show that the mixed fleet is always better than an exclusive fleet of SCVs or MCVs and state which factors influence the cost reduction. A mixed fleet can reduce costs by up to 30%. As a result, mixed fleets are advisable in grocery distribution and vehicle selection should be part of the MCVRP.

[1]  Heinrich Kuhn,et al.  Delivery pattern and transportation planning in grocery retailing , 2016, Eur. J. Oper. Res..

[2]  G. Dueck New optimization heuristics , 1993 .

[3]  Pasquale Avella,et al.  Solving a fuel delivery problem by heuristic and exact approaches , 2004, Eur. J. Oper. Res..

[4]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[5]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[6]  Franz Rothlauf,et al.  Vehicle routing with compartments: applications, modelling and heuristics , 2011, OR Spectr..

[7]  Maria Grazia Speranza,et al.  Multicommodity vs. Single-Commodity Routing , 2016, Transp. Sci..

[8]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[9]  Gilbert Laporte,et al.  A heuristic for the multi-period petrol station replenishment problem , 2008, Eur. J. Oper. Res..

[10]  Massimiliano Caramia,et al.  A Milk Collection Problem with Incompatibility Constraints , 2010, Interfaces.

[11]  Bruce L. Golden,et al.  The fleet size and mix vehicle routing problem , 1984, Comput. Oper. Res..

[12]  Gerrit K. Janssens,et al.  Vehicle routing problems with loading constraints: state-of-the-art and future directions , 2015, OR Spectr..

[13]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

[14]  Sanne Wøhlk,et al.  Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems , 2017, EURO J. Transp. Logist..

[15]  Daniele Vigo,et al.  Routing a Heterogeneous Fleet of Vehicles , 2008 .

[16]  Alexander H. Hübner,et al.  Demand and supply chain planning in grocery retail: an operations planning framework , 2013 .

[17]  Luc Muyldermans,et al.  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm , 2010, Eur. J. Oper. Res..

[18]  Alexander H. Hübner,et al.  Loading constraints for a multi-compartment vehicle routing problem , 2018, OR Spectrum.

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

[20]  Alexander H. Hübner,et al.  Distribution systems in omni-channel retailing , 2016 .

[21]  Paolo Toth,et al.  Vehicle Routing , 2014, Vehicle Routing.

[22]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[23]  Gilbert Laporte,et al.  Classification, models and exact algorithms for multi-compartment delivery problems , 2015, Eur. J. Oper. Res..

[24]  Gilbert Laporte,et al.  A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia☆ , 2015 .

[25]  Emmanuel D. Chajakis,et al.  Scheduling Deliveries in Vehicles with Multiple Compartments , 2003, J. Glob. Optim..

[26]  Justin C. Goodson,et al.  A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands , 2015, Eur. J. Oper. Res..

[27]  Maria Grazia Speranza,et al.  A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes , 2018, Ann. Oper. Res..

[28]  Michael G. Sternbeck,et al.  Integrative retail logistics: An exploratory study , 2013 .

[29]  Nubia Velasco,et al.  Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands , 2008, Transp. Sci..

[30]  Nubia Velasco,et al.  A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands , 2008, Comput. Oper. Res..

[31]  Alexander H. Hübner,et al.  Retail logistics in the transition from multi-channel to omni-channel , 2016 .

[32]  Alexander H. Hübner,et al.  A Multi-Compartment Vehicle Routing Problem with Loading and Unloading Costs , 2019, Transp. Sci..

[33]  Maria Grazia Speranza,et al.  A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes , 2015, Annals of Operations Research.

[34]  Marcus Ritt,et al.  An iterated tabu search for the multi-compartment vehicle routing problem , 2017, Comput. Oper. Res..