An Adaptive Large Neighborhood Search for a Green Vehicle Routing Problem with Depot Sharing
Zixuan Wu,
Ping Lou,
Jianmin Hu (),
Yuhang Zeng and
Chuannian Fan
Additional contact information
Zixuan Wu: School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China
Ping Lou: School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China
Jianmin Hu: School of Information Engineering, Hubei University of Economics, Wuhan 430205, China
Yuhang Zeng: School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China
Chuannian Fan: School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China
Mathematics, 2025, vol. 13, issue 2, 1-22
Abstract:
In urban logistics distribution, vehicle carbon emissions during the distribution process significantly contribute to environmental pollution. While developing green logistics is critical for the sustainable growth of the logistics industry, existing studies often overlook the potential benefits of depot sharing among enterprises. By enabling depots belonging to different enterprises to be shared, it would shorten the distance traveled by vehicles returning to depots and reduce carbon emissions. And it would also reduce the number of depots being built. Therefore, a green vehicle routing problem with depot sharing is presented in the paper. To solve this problem, an improved adaptive large neighborhood search algorithm is presented, in which the Split strategy and two new operators are proposed to enhance solution quality and computational efficiency. Extensive numerical experiments are conducted on instances of varying scales to evaluate this algorithm, and also demonstrate its effectiveness and efficiency. Furthermore, the experimental results demonstrate that depot sharing significantly reduces carbon emissions, achieving an average optimization rate of 10.1% across all instances compared to returning to the original depot.
Keywords: green vehicle routing problem; depot sharing; carbon emission; adaptive large neighborhood search algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/13/2/214/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/2/214/ (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:13:y:2025:i:2:p:214-:d:1564077
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 ().