ALNS with Improved Operator Design Based on Divide-and-Conquer Algorithm for Solving Large-Scale CVRP

Wenle Wang, Xiaochun Lu () and Zheng Ni
Additional contact information
Wenle Wang: Beijing Jiaotong University
Xiaochun Lu: Beijing Jiaotong University
Zheng Ni: China State Railway Group Co., Ltd.

A chapter in LISS 2024, 2025, pp 218-227 from Springer

Abstract: Abstract To address the efficiency issue of the existing ALNS algorithm in solving large-scale CVRP, this paper introduces the concept of divide and conquer and incorporates the KD-tree algorithm into the design of operators. This integration aims to enhance the speed of the ALNS neighborhood search. The improved operators based on the KD-tree algorithm are compared with traditional ALNS algorithm operators using standard test cases. The results demonstrate a significant improvement in the speed of the ALNS algorithm after the integration of the KD-tree algorithm.ors informed by the KD-tree algorithm.

Keywords: ALNS; KD-tree; Destroy Operator; Repair Operator (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:lnopch:978-981-96-9697-0_18

Ordering information: This item can be ordered from
http://www.springer.com/9789819696970

DOI: 10.1007/978-981-96-9697-0_18

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().