A Hybrid Adaptive Simulated Annealing and Tempering Algorithm for Solving the Half-Open Multi-Depot Vehicle Routing Problem

Shichang Xiao (), Pan Peng, Peng Zheng and Zigao Wu
Additional contact information
Shichang Xiao: Logistics Engineering College, Shanghai Maritime University, Shanghai 201306, China
Pan Peng: Logistics Engineering College, Shanghai Maritime University, Shanghai 201306, China
Peng Zheng: Logistics Engineering College, Shanghai Maritime University, Shanghai 201306, China
Zigao Wu: Department of Mechanical Engineering, North China Electric Power University, Baoding 071003, China

Mathematics, 2024, vol. 12, issue 7, 1-21

Abstract: The half-open multi-depot vehicle routing problem (HOMDVRP) is a typical decision optimization problem in the field of collaborative logistics that considers resource sharing. This study aims to develop an effective meta-heuristic algorithm for solving the HOMDVRP. Firstly, a mixed-integer programming model of HOMDVRP is established to minimize the total travel distance of the vehicles. After that, a novel hybrid adaptive simulated annealing and tempering algorithm (HASATA) is proposed based on the features of HOMDVRP. The proposed algorithm combines the strengths of the simulated annealing algorithm and the large-neighborhood search algorithm to balance the algorithm’s searching capabilities in both breadth and depth. Meanwhile, an adaptive Markov chain length mechanism and a tempering mechanism are designed to improve the algorithm’s computational efficiency and convergence ability. Finally, simulation experiments are conducted to verify the effectiveness of the proposed model and the computational performance of the proposed algorithm. Four comparison algorithms are selected and analyzed using 24 groups of problem instances. The comparison results show that the proposed HASATA can solve the HOMDVRP more efficiently and obtain a solution with better optimization performance and satisfactory stability.

Keywords: collaborative logistics; half-open multi-depot vehicle routing problem; adaptive Markov chain length; improved large-neighborhood search; tempering mechanism (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/7/947/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/7/947/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:7:p:947-:d:1362332

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().