Vehicle routing problem with steep roads

Abstract Most routing decisions assume that routing costs are modelled as a weighted sum of total distance and time traveled by delivery vehicles. However, this assumption does not apply for logistics operations in cities with significant road grades. We study an extension to the VRP model that plans vehicle routes considering the combined impact of detailed road grade information and vehicle load-weight in fuel consumption cost. We refer to this model as the VRP with Steep Roads (VRP-SR), which is formulated as an integer linear program and solved heuristically. In simulated experiments performed for a mountainous metropolitan region in Chile, we estimate operating cost reductions up to 12.4 % when compared to the real cost of a plan disregarding road grade information. In addition, we obtain valuable managerial insights from our routing plans; our planned routes tend to initially use roads with relatively small grades to avoid abrupt altitude changes with a loaded vehicle. Higher altitude changes are planned after the vehicle unloads a significant fraction of its cargo. Also, we identify instances in which it is cheaper to insert an intermediate depot visit to drop off weight and split a feasible route in two subroutes to travel over mountainous areas with a lighter vehicle.

[1]  David Simchi-Levi,et al.  The logic of logistics , 1997 .

[2]  Jan Fabian Ehmke,et al.  Vehicle routing to minimize time-dependent emissions in urban areas , 2016, Eur. J. Oper. Res..

[3]  Marcus Poggi de Aragão,et al.  New Exact Algorithms for the Capacitated Vehicle Routing Problem , 2014, Vehicle Routing.

[4]  Richard W. Cuthbertson,et al.  The Logic of Logistics: Theory, Algorithms and Applications for Logistics Management , 1998, J. Oper. Res. Soc..

[5]  Gilbert Laporte,et al.  The fleet size and mix pollution-routing problem , 2014 .

[6]  Mir Saman Pishvaee,et al.  Alternative fuel vehicle-routing problem: A life cycle analysis of transportation fuels , 2019, Journal of Cleaner Production.

[7]  Abdullah Konak,et al.  The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion , 2016 .

[8]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

[9]  Jörn Schönberger,et al.  Reducing greenhouse gas emissions of a heterogeneous vehicle fleet , 2014 .

[10]  G. Jia,et al.  Vehicle Routing Problems with Fuel Consumption and Stochastic Travel Speeds , 2017 .

[11]  Miguel A. Figliozzi,et al.  Vehicle Routing Problem for Emissions Minimization , 2010 .

[12]  Feng Liu,et al.  An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem , 2016, Appl. Comput. Intell. Soft Comput..

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

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

[15]  Gilbert Laporte,et al.  The bi-objective Pollution-Routing Problem , 2014, Eur. J. Oper. Res..

[16]  Matthew Barth,et al.  Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model , 2005 .

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

[18]  Bruce L. Golden,et al.  Plowing with precedence: A variant of the windy postman problem , 2013, Comput. Oper. Res..

[19]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[20]  Dominik Goeke,et al.  Routing a mixed fleet of electric and conventional vehicles , 2015, Eur. J. Oper. Res..

[21]  Zissis Samaras,et al.  METHODOLOGY FOR CALCULATING TRANSPORT EMISSIONS AND ENERGY CONSUMPTION , 1999 .

[22]  Gilbert Laporte,et al.  A review of recent research on green road freight transportation , 2014, Eur. J. Oper. Res..

[23]  de Ag Ton Kok,et al.  Analysis of Travel Times and CO2 Emissions in Time‐Dependent Vehicle Routing , 2012 .

[24]  Lawrence Bodin,et al.  Approximate Traveling Salesman Algorithms , 1980, Oper. Res..

[25]  Marcus Poggi de Aragão,et al.  A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem , 2007, WEA.

[26]  Gyu M. Lee,et al.  A Lagrangian Relaxation-Based Solution Method for a Green Vehicle Routing Problem to Minimize Greenhouse Gas Emissions , 2017 .

[27]  Emrah Demir,et al.  An exact approach for the pollution-routing problem , 2014 .

[28]  Gilbert Laporte,et al.  An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows , 2019, Eur. J. Oper. Res..

[29]  Bruce L. Golden,et al.  The downhill plow problem with multiple plows , 2014, J. Oper. Res. Soc..

[30]  Richard W. Eglese,et al.  Fuel emissions optimization in vehicle routing problems with time-varying speeds , 2016, Eur. J. Oper. Res..

[31]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

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

[33]  Yiyo Kuo,et al.  Optimizing the VRP by minimizing fuel consumption , 2011 .

[34]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[35]  Kanok Boriboonsomsin,et al.  Energy and emissions impacts of a freeway-based dynamic eco-driving system , 2009 .

[36]  Edgar E. Blanco,et al.  A new statistical method of assigning vehicles to delivery areas for CO2 emissions reduction , 2016 .