An Adaptive Variable Neighborhood Search for a Heterogeneous Fleet Vehicle Routing Problem with Three-Dimensional Loading Constraints

The paper addresses the heterogeneous fleet vehicle routing problem with three-dimensional (3D) loading constraints (3L-HFVRP), a new practical variant of the combined routing and loading problem. In this problem, the loads consist of a set of three-dimensional, rectangular shaped items. The fleet is composed of heterogeneous vehicles with different weight and space capacities. The objective is to serve all customers by selecting a set of vehicles such that the total transportation cost is minimized. The cost consists of the fixed cost of the selected vehicles and their travel cost. In addition, loading sequence related constraints frequently encountered in realistic applications are respected when loading and unloading the items. To solve this challenging problem, we develop an adaptive variable neighborhood search (AVNS) which utilizes an extreme point based first fit heuristic to find a feasible loading pattern for each route. We design two strategies to accelerate the loading and routing processes. The Trie data structure is used to record the loading information of routes already visited and to control the computational effort spent for each route. The Fibonacci heap data structure is used to maintain all of the possible moves and vehicle type assignments, which avoids the duplicated evaluation of some moves and unnecessary loading check of unpromising solutions. The robustness and effectiveness of the proposed algorithm is validated by computational tests performed both on some newly generated 3L-HFVRP instances and well-known benchmark instances from the literature for two simplified VRP variants: the capacitated vehicle routing problem with 3D loading constraints (3L-CVRP) and the pure heterogeneous fleet vehicle routing problem (HFVRP). The numerical experiments show that the proposed AVNS outperforms other algorithms in 3L-CVRP and improves several best known solutions reported in the literature. The results obtained for the pure HFVRP are very close to the best known solutions.

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

[2]  Guenther Fuellerer,et al.  Metaheuristics for vehicle routing problems with three-dimensional loading constraints , 2010, Eur. J. Oper. Res..

[3]  Bruce L. Golden,et al.  A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

[4]  Teodor Gabriel Crainic,et al.  Extreme Point-Based Heuristics for Three-Dimensional Bin Packing , 2008, INFORMS J. Comput..

[5]  José Brandão,et al.  A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem , 2009, Eur. J. Oper. Res..

[6]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[7]  Andrew Lim,et al.  A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP , 2012, Comput. Oper. Res..

[8]  Zhenzhen Zhang,et al.  A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints , 2013, Eur. J. Oper. Res..

[9]  José Brandão,et al.  A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem , 2011, Comput. Oper. Res..

[10]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[11]  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..

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

[13]  Puca Huachi Vaz Penna,et al.  An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem , 2013, J. Heuristics.

[14]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

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

[16]  Andrew Lim,et al.  A reference length approach for the 3D strip packing problem , 2012, Eur. J. Oper. Res..

[17]  Christos D. Tarantilis,et al.  A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows , 2008, J. Heuristics.

[18]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

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

[20]  Xiangyong Li,et al.  An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem , 2010 .

[21]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[22]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[23]  Michel Gendreau,et al.  A Tabu Search Algorithm for a Routing and Container Loading Problem , 2006, Transp. Sci..

[24]  Saïd Salhi,et al.  A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem , 2009, Eur. J. Oper. Res..

[25]  Emmanouil E. Zachariadis,et al.  A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem , 2009, IEEE Transactions on Intelligent Transportation Systems.

[26]  Marielle Christiansen,et al.  Industrial aspects and literature survey: Fleet composition and routing , 2010, Comput. Oper. Res..

[27]  Guenther Fuellerer,et al.  Ant colony optimization for the two-dimensional loading vehicle routing problem , 2009, Comput. Oper. Res..

[28]  Andreas Bortfeldt,et al.  A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints , 2012, Comput. Oper. Res..

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

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

[31]  Shuguang Liu,et al.  An effective genetic algorithm for the fleet size and mix vehicle routing problems , 2009 .

[32]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[33]  Manuel Iori,et al.  Routing problems with loading constraints , 2010 .

[34]  Philippe Lacomme,et al.  A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems , 2012, Eng. Appl. Artif. Intell..

[35]  Puca Huachi Vaz Penna,et al.  A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem , 2012, Eur. J. Oper. Res..

[36]  Lixin Miao,et al.  A hybrid approach for the vehicle routing problem with three-dimensional loading constraints , 2013, Comput. Oper. Res..

[37]  Wenbin Zhu,et al.  A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem , 2012, Eur. J. Oper. Res..

[38]  Philippe Lacomme,et al.  A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints , 2013, Eng. Appl. Artif. Intell..

[39]  Christian Prins,et al.  Two memetic algorithms for heterogeneous fleet vehicle routing problems , 2009, Eng. Appl. Artif. Intell..

[40]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

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

[42]  Shuguang Liu A hybrid population heuristic for the heterogeneous vehicle routing problems , 2013 .

[43]  Dong-wan Tcha,et al.  A column generation approach to the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

[44]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[45]  Michel Gendreau,et al.  A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints , 2008, Networks.