Asynchronous optimization of part logistics routing problem

The solution to the capacitated vehicle routing problem (CVRP) is vital for optimizing logistics. However, the transformation of real-world logistics problems into the CVRP involves diverse constraints, interactions between various routes, and a balance between optimization performance and computation load. In this study, we propose a systematic model originating from the part logistic routing problem (PLRP), which is a two-dimensional loading capacitated pickup-and-delivery problem that considers time windows, multiple uses of vehicles, queuing, transit, and heterogeneous vehicles. The newly introduced queuing and transit complicate the problem, and to the best of our knowledge, it cannot be solved using existing methods or the standard commercial optimizer. Hence, this problem has caused the existing research to develop, generalize, and extend into the two-dimensional CVRP (2L-CVRP). To solve this problem, we provide a framework that decouples the combination of 2L-CVRP and global optimization engineering and derives an efficient and realistic solver that integrates diverse types of intelligent algorithms. These algorithms include: (1) a heuristic algorithm for initializing feasible solutions by imitating manual planning, (2) asynchronous simulated annealing (SA) and Tabu search (TS) algorithms to accelerate the optimization of global routes based on novel bundling mechanics, (3) dynamic programming for routing, (4) heuristic algorithms for packing, (5) simulators to review associated time-related constraints, and (6) truck-saving processes to promote the optimal solution and reduce the number of trucks. Moreover, the performances of the SA and TS solver algorithms are compared in terms of various size scales of data to obtain an empirical recommendation for selection. The proposed model successfully established an intelligent management system that can provide systematic solutions for logistics planning, resulting in higher performance and lower costs compared to that of manual planning.

[1]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[2]  Sunderesh S. Heragu,et al.  The EMS vehicle patient transportation problem during a demand surge , 2021, J. Glob. Optim..

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

[4]  Z.A.M.S. Juman,et al.  Survey on Ten Years of Multi-Depot Vehicle Routing Problems: Mathematical Models, Solution Methods and Real-Life Applications , 2021 .

[5]  Yan Li,et al.  A green vehicle routing model based on modified particle swarm optimization for cold chain logistics , 2019, Ind. Manag. Data Syst..

[6]  Yinghui Xu,et al.  Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method , 2017, ArXiv.

[7]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[8]  André Langevin,et al.  Two-Dimensional Pickup and Delivery Routing Problem with Loading Constraints , 2008 .

[9]  Raafat Elshaer,et al.  A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants , 2020, Comput. Ind. Eng..

[10]  Kris Braekers,et al.  The vehicle routing problem: State of the art classification and review , 2016, Comput. Ind. Eng..

[11]  Naoufel Cheikhrouhou,et al.  A study on the heterogeneous fleet of alternative fuel vehicles: Reducing CO2 emissions by means of biodiesel fuel , 2018, Transportation Research Part D: Transport and Environment.

[12]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[13]  LaporteGilbert,et al.  Vehicle routing with backhauls , 2018 .

[14]  Pierre Borne,et al.  Optimisation of the multi-depots pick-up and delivery problems with time windows and multi-vehicles using PSO algorithm , 2019, Int. J. Prod. Res..

[15]  Emile H. L. Aarts,et al.  Parallel implementations of the statistical cooling algorithm , 1986, Integr..

[16]  S. AdhiHarmoko,et al.  Introduction to Algorithms , 2005 .

[17]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[18]  Cláudio Alves,et al.  Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls , 2020, Int. Trans. Oper. Res..

[19]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[20]  Saoussen Krichen,et al.  An Adaptive Genetic Algorithm for Dynamic Vehicle Routing Problem with Backhaul and Two-dimensional loading constraints , 2020, 2020 International Multi-Conference on: “Organization of Knowledge and Advanced Technologies” (OCTA).

[21]  Graham Kendall,et al.  Evolving Bin Packing Heuristics with Genetic Programming , 2006, PPSN.

[22]  Alvaro Neuenfeldt Júnior,et al.  A SURVEY ON HEURISTICS FOR THE TWO-DIMENSIONAL RECTANGULAR STRIP PACKING PROBLEM , 2016 .

[23]  Gilbert Laporte,et al.  Vehicle routing with backhauls: Review and research perspectives , 2018, Comput. Oper. Res..

[24]  Loo Hay Lee,et al.  Vehicle capacity planning system: a case study on vehicle routing problem with time windows , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[25]  Ashish Bhaskar,et al.  An Adaptive Memetic Approach for Heterogeneous Vehicle Routing Problems with two-dimensional loading constraints , 2020, Swarm Evol. Comput..

[26]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[27]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[28]  Thibaut Vidal,et al.  A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet , 2019, Ann. Oper. Res..

[29]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

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

[31]  E. Hopper,et al.  A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.

[32]  John E. Mitchell,et al.  An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..

[33]  G Fauza,et al.  Solving Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) using BRKGA with local search , 2018 .

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

[35]  Sanjay Mohapatra,et al.  Survey of Methodologies for TSP and VRP , 2014 .

[36]  Andreas Bortfeldt,et al.  A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls , 2020, J. Sched..

[37]  Chris Hankin,et al.  Fast Multi-Scale Community Detection based on Local Criteria within a Multi-Threaded Algorithm , 2013, ArXiv.

[38]  Amy J. C. Trappey,et al.  The Design and Evaluation of a Supply Chain Logistic Hub for Automobile and Parts Distribution , 2008 .

[39]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[40]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[41]  Kenneth E. Iverson,et al.  A programming language , 1899, AIEE-IRE '62 (Spring).

[42]  Zorica Stanimirovic,et al.  Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture , 2020, Int. Trans. Oper. Res..

[43]  Neda Manavizadeh,et al.  Designing a multi-objective model for a hazardous waste routing problem considering flexibility of routes and social effects , 2020 .

[44]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[46]  Emmanouil E. Zachariadis,et al.  Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints , 2017, Oper. Res..

[47]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[48]  Mahdi Alinaghian,et al.  A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem , 2017, J. Oper. Res. Soc..

[49]  Rui Yan,et al.  Logistic Optimization for Multi Depots Loading Capacitated Electric Vehicle Routing Problem From Low Carbon Perspective , 2020, IEEE Access.

[50]  Gilbert Laporte,et al.  A review of vehicle routing with simultaneous pickup and delivery , 2020, Comput. Oper. Res..

[51]  Graham Kendall,et al.  A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics , 2010, IEEE Transactions on Evolutionary Computation.

[52]  Anupam Shukla,et al.  Vehicle Routing Problem with Time Windows Using Meta-Heuristic Algorithms: A Survey , 2018, Harmony Search and Nature Inspired Optimization Algorithms.

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

[54]  Mark Sh. Levin,et al.  Bin Packing Problems (Promising Models and Examples) , 2018, Journal of Communications Technology and Electronics.