Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Wenle Wang,
  • Xiaochun Lu,
  • Zheng Ni

摘要

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.