Journal of System Simulation
Abstract
Abstract: This paper considers the problem that some customers' goods cannot be mixed in logistics distribution. Based on the traditional green vehicle routing problem with simultaneous pickup and delivery, customers are divided into three types: priority delivery, non-priority only pickup without delivery, and non-priority pickup with delivery. A single objective nonlinear optimization model is established to minimize the total cost. A hybrid heuristic method based on simulated annealing and adaptive large neighborhood search algorithm is designed. An improved saving algorithm is used to construct the initial solution. And 5 kinds of destruction operators and 2 kinds of repair operators are used in the simulated annealing algorithm framework for adaptive large neighborhood search, until stability is achieved. The simulation results indicate that the proposed method can effectively reduce total costs and the number of vehicles, and has fast convergence speed and strong stability.
Recommended Citation
Cui, Huanhuan and Guan, Lihe
(2025)
"A Hybrid Heuristic Algorithm for Solving the Green VRP with Priority Delivery,"
Journal of System Simulation: Vol. 37:
Iss.
2, Article 9.
DOI: 10.16182/j.issn1004731x.joss.23-1125
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol37/iss2/9
First Page
413
Last Page
423
CLC
TP391.9
Recommended Citation
Cui Huanhuan, Guan Lihe. A Hybrid Heuristic Algorithm for Solving the Green VRP with Priority Delivery[J]. Journal of System Simulation, 2025, 37(2): 413-423.
DOI
10.16182/j.issn1004731x.joss.23-1125
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons