An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery

Abstract This paper presents a study about the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints (2L-CVRP) and its three variants: allowing split delivery (2L-SDVRP), with green requirements (G2L-CVRP), and integrating split delivery with green requirements (G2L-SDVRP). When considering split delivery, a customer can be served by more than one vehicle. The green variant takes into consideration the CO2 emission. Our objective is to analyze the cost benefits obtained with the aggregation of split delivery and the reduction of CO2 emission. Mathematical models are presented for each variant, and instances are solved with a branch-and-cut approach. We develop a tailored procedure to address the packing subproblem, including the computation of lower bounds, a constructive-based heuristic, and a constraint programming formulation. Computational experiments performed on literature instances and newly created ones show that the proposed approach can outperform previous results. Besides that, the green variant has solutions with low emissions of CO2. The variant with split delivery has solutions with lower cost but at the expense of higher computing time.

[1]  Jin Zhang,et al.  Particle Swarm Optimization for Split Delivery Vehicle Routing Problem , 2018, Asia Pac. J. Oper. Res..

[2]  Emmanouil E. Zachariadis,et al.  Integrated distribution and loading planning via a compact metaheuristic algorithm , 2013, Eur. J. Oper. Res..

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

[4]  Daniele Vigo,et al.  An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints , 2007, Transp. Sci..

[5]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[6]  Maria Grazia Speranza,et al.  Vehicle routing problems with split deliveries , 2012, Int. Trans. Oper. Res..

[7]  Tom Van Woensel,et al.  An Exact Approach for a Variant of the Pollution-Routing Problem , 2017, Transp. Sci..

[8]  Eduardo C. Xavier,et al.  A Branch-and-Cut Approach for the Vehicle Routing P roblem with Two-dimensional Loading Constraints , 2009 .

[9]  Gilbert Laporte,et al.  A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem , 2011, Comput. Oper. Res..

[10]  Messaoud Elhassania,et al.  A HYBRID ANT COLONY SYSTEM FOR GREEN CAPACITATED VEHICLE ROUTING PROBLEM IN SUSTAINBALE TRANSPORT , 2013 .

[11]  Andrew Lim,et al.  A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints , 2015, Eur. J. Oper. Res..

[12]  Anand Subramanian,et al.  An iterated local search heuristic for the split delivery vehicle routing problem , 2015, Comput. Oper. Res..

[13]  Michel Gendreau,et al.  An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints , 2014, Oper. Res..

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

[15]  Yuri Frota,et al.  Green Vehicle Routing and Scheduling Problem with Split Delivery , 2018, Electron. Notes Discret. Math..

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

[17]  Claudia Archetti,et al.  Branch-and-cut algorithms for the split delivery vehicle routing problem , 2014, Eur. J. Oper. Res..

[18]  Marcus Poggi de Aragão,et al.  Improved lower bounds for the Split Delivery Vehicle Routing Problem , 2010, Oper. Res. Lett..

[19]  A. Palmer.  The development of an integrated routing and carbon dioxide emissions model for goods vehicles , 2007 .

[20]  Emmanouil E. Zachariadis,et al.  A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints , 2009, Eur. J. Oper. Res..

[21]  José-Manuel Belenguer,et al.  A Lower Bound for the Split Delivery Vehicle Routing Problem , 2000, Oper. Res..

[22]  Thibaut Vidal,et al.  A speed and departure time optimization algorithm for the pollution-routing problem , 2015, Eur. J. Oper. Res..

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

[24]  Ulrich Derigs,et al.  Local search-based metaheuristics for the split delivery vehicle routing problem , 2010, J. Oper. Res. Soc..

[25]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[26]  Thiago Alves de Queiroz,et al.  Grids for cutting and packing problems: a study in the 2D knapsack problem , 2020, 4OR.

[27]  Maria Grazia Speranza,et al.  The Split Delivery Vehicle Routing Problem: A Survey , 2008 .

[28]  Daniele Vigo,et al.  Recent advances on two-dimensional bin packing problems , 2002, Discret. Appl. Math..

[29]  Herbert Kopfer,et al.  Emission Vehicle Routing Problem with Split Delivery and a Heterogeneous Vehicle Fleet , 2015, ICCL.

[30]  Meead Saberi,et al.  A Continuous Approximation Model for the Vehicle Routing Problem for Emissions Minimization at the Strategic Level , 2015 .

[31]  Stephen C. H. Leung,et al.  Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem , 2011, Comput. Oper. Res..

[32]  Philippe Lacomme,et al.  A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem , 2011, Comput. Oper. Res..

[33]  Zhenzhen Zhang,et al.  A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints , 2018, Eur. J. Oper. Res..

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

[35]  Antoine Jouglet,et al.  A new constraint programming approach for the orthogonal packing problem , 2008, Comput. Oper. Res..

[36]  Eduardo C. Xavier,et al.  A branch-and-cut approach for the vehicle routing problem with loading constraints , 2016, Expert Syst. Appl..

[37]  Bruce L. Golden,et al.  Recent Developments in Modeling and Solving the Split Delivery Vehicle Routing Problem , 2008 .

[38]  Zhenzhen Zhang,et al.  An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints , 2015 .

[39]  Maria Grazia Speranza,et al.  The value of integrating loading and routing , 2017, Eur. J. Oper. Res..

[40]  Manuel Iori,et al.  AN ANNOTATED BIBLIOGRAPHY OF COMBINED ROUTING AND LOADING PROBLEMS , 2013 .

[41]  Adil Bellabdaoui,et al.  Split delivery and pickup vehicle routing problem with two-dimensional loading constraints , 2016, 2016 11th International Conference on Intelligent Systems: Theories and Applications (SITA).

[42]  Stephen C. H. Leung,et al.  Simulated annealing for the vehicle routing problem with two-dimensional loading constraints , 2010 .

[43]  Stephen C. H. Leung,et al.  A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem , 2012, Comput. Oper. Res..

[44]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[45]  W. H. Ip,et al.  Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem , 2014 .

[46]  Michel Gendreau,et al.  Solving the hub location problem in a star–star network , 2008 .

[47]  Yuchun Xu,et al.  Development of a fuel consumption optimization model for the capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[48]  Manuel Iori,et al.  The Meet-in-the-Middle Principle for Cutting and Packing Problems , 2018, INFORMS J. Comput..

[49]  Alain Hertz,et al.  A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

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

[51]  B. Golden,et al.  Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .