arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.07076cs.LG
收藏

基于学习的车辆路径优化算法综述及实验研究

An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem

Central South University(中南大学);National University of Defense Technology(国防科技大学);University of Alberta(阿尔伯塔大学);King Abdulaziz University(阿卜杜勒阿齐兹国王大学);Polish Academy of Sciences(波兰科学院)

Bingjie Li, Guohua Wu, Yongming He, Mingfeng Fan, Witold Pedrycz

摘要:

车辆路径问题是一个典型的离散组合优化问题,人们已经提出了许多求解车辆路径问题及其变型的模型和算法。尽管已有的方法对这一领域的发展做出了很大的贡献,但这些方法要么在问题大小上受到限制,要么需要人工干预来选择参数。为了解决这些困难,许多研究都考虑了基于学习的优化(LBO)算法来解决车辆路径问题。本文回顾了该领域的最新进展,并将相关方法分为端到端方法和分步方法。我们从各个方面对综述的文章进行了统计分析,并设计了三个实验来评估四种代表性的LBO算法的性能。最后,我们总结了不同的LBO算法适用的问题类型,并提出了研究人员可以改进LBO算法的方向。

英文摘要:

Vehicle routing problem (VRP) is a typical discrete combinatorial optimization problem, and many models and algorithms have been proposed to solve the VRP and its variants. Although existing approaches have contributed a lot to the development of this field, these approaches either are limited in problem size or need manual intervening in choosing parameters. To solve these difficulties, many studies have considered the learning-based optimization (LBO) algorithms to solve the VRP. This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches. We performed a statistical analysis of the reviewed articles from various aspects and designed three experiments to evaluate the performance of four representative LBO algorithms. Finally, we conclude the applicable types of problems for different LBO algorithms and suggest directions in which researchers can improve LBO algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑