Hybrid Optimization Algorithm for Vehicle Routing Problem with Simultaneous Delivery-Pickup

Autor: LI Jun, DUAN Yurong, HAO Liyan, ZHANG Weiwei
Jazyk: čínština
Rok vydání: 2022
Předmět:
Zdroj: Jisuanji kexue yu tansuo, Vol 16, Iss 7, Pp 1623-1632 (2022)
Druh dokumentu: article
ISSN: 1673-9418
DOI: 10.3778/j.issn.1673-9418.2105024
Popis: In order to provide reasonable and effective decision support for logistics enterprises in vehicle distribu-tion path planning, this paper studies the vehicle routing problem with simultaneous delivery-pickup and time windows (VRPSDPTW) for single distribution center distribution mode, and establishes a mathematical model with the objective of minimizing the total distribution cost. According to the characteristics of the model, a hybrid optimization algorithm (SA-ALNS) based on the combination of simulated annealing (SA) and adaptive large-scale neighborhood search (ALNS) is proposed. An insertion heuristic algorithm based on time and distance weighting is used to construct the initial solution of the problem. A variety of delete and insert operators are introduced to optimize the path with adaptive selection strategy. Through the feedback mechanism, the probability of each operator being selected is gradually adjusted to make the algorithm more inclined to choose the operator with better optimization effect. The Metropolis criterion of simulated annealing mechanism is used to control the solution updating. In the simulation experiment, 56 large-scale examples are tested, and other intelligent optimization algori-thms such as p-SA algorithm, DCS algorithm and VNS-BSTS are compared and statistically analyzed. The results show that the algorithm is feasible and superior in solving the vehicle routing problem with simultaneous delivery-pickup and time windows. The research results greatly enrich the related research of vehicle routing problem (VRP).
Databáze: Directory of Open Access Journals