• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于解决路由问题的学习改进启发式算法

Learning Improvement Heuristics for Solving Routing Problems.

作者信息

Wu Yaoxin, Song Wen, Cao Zhiguang, Zhang Jie, Lim Andrew

出版信息

IEEE Trans Neural Netw Learn Syst. 2022 Sep;33(9):5057-5069. doi: 10.1109/TNNLS.2021.3068828. Epub 2022 Aug 31.

DOI:10.1109/TNNLS.2021.3068828
PMID:33793405
Abstract

Recent studies in using deep learning (DL) to solve routing problems focus on construction heuristics, whose solutions are still far from optimality. Improvement heuristics have great potential to narrow this gap by iteratively refining a solution. However, classic improvement heuristics are all guided by handcrafted rules that may limit their performance. In this article, we propose a deep reinforcement learning framework to learn the improvement heuristics for routing problems. We design a self-attention-based deep architecture as the policy network to guide the selection of the next solution. We apply our method to two important routing problems, i.e., the traveling salesman problem (TSP) and the capacitated vehicle routing problem (CVRP). Experiments show that our method outperforms state-of-the-art DL-based approaches. The learned policies are more effective than the traditional handcrafted ones and can be further enhanced by simple diversifying strategies. Moreover, the policies generalize well to different problem sizes, initial solutions, and even real-world data set.

摘要

最近利用深度学习(DL)解决路由问题的研究集中在构造启发式算法上,其解决方案仍远未达到最优。改进启发式算法有很大潜力通过迭代优化解决方案来缩小这一差距。然而,经典的改进启发式算法均由手工制定的规则引导,这可能会限制其性能。在本文中,我们提出了一个深度强化学习框架来学习路由问题的改进启发式算法。我们设计了一种基于自注意力的深度架构作为策略网络,以指导下一个解决方案的选择。我们将我们的方法应用于两个重要的路由问题,即旅行商问题(TSP)和容量受限车辆路径问题(CVRP)。实验表明,我们的方法优于基于DL的现有方法。所学习到的策略比传统手工制定的策略更有效,并且可以通过简单的多样化策略进一步增强。此外,这些策略能很好地推广到不同的问题规模、初始解决方案,甚至是真实世界的数据集。

相似文献

1
Learning Improvement Heuristics for Solving Routing Problems.用于解决路由问题的学习改进启发式算法
IEEE Trans Neural Netw Learn Syst. 2022 Sep;33(9):5057-5069. doi: 10.1109/TNNLS.2021.3068828. Epub 2022 Aug 31.
2
Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem.用于解决异构容量车辆路径问题的深度强化学习
IEEE Trans Cybern. 2022 Dec;52(12):13572-13585. doi: 10.1109/TCYB.2021.3111082. Epub 2022 Nov 18.
3
Learning Feature Embedding Refiner for Solving Vehicle Routing Problems.用于解决车辆路径问题的学习特征嵌入优化器
IEEE Trans Neural Netw Learn Syst. 2024 Nov;35(11):15279-15291. doi: 10.1109/TNNLS.2023.3285077. Epub 2024 Oct 29.
4
Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems.遗传编程超启发式算法与车辆协作求解不确定容量弧路由问题。
Evol Comput. 2020 Winter;28(4):563-593. doi: 10.1162/evco_a_00267. Epub 2019 Nov 15.
5
Reinforcement Learning With Multiple Relational Attention for Solving Vehicle Routing Problems.
IEEE Trans Cybern. 2022 Oct;52(10):11107-11120. doi: 10.1109/TCYB.2021.3089179. Epub 2022 Sep 19.
6
Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem.杜宾斯最小最大旅行商问题的启发式算法与学习模型
Sensors (Basel). 2023 Jul 15;23(14):6432. doi: 10.3390/s23146432.
7
An accelerated end-to-end method for solving routing problems.一种加速的端到端路由问题求解方法。
Neural Netw. 2023 Jul;164:535-545. doi: 10.1016/j.neunet.2023.05.003. Epub 2023 May 10.
8
A Predictive-Reactive Approach with Genetic Programming and Cooperative Coevolution for the Uncertain Capacitated Arc Routing Problem.基于遗传编程和协同进化的不确定带容量约束弧路由问题的预测-反应式方法。
Evol Comput. 2020 Summer;28(2):289-316. doi: 10.1162/evco_a_00256. Epub 2019 Apr 23.
9
Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems.容量受限车辆路径问题的约束适应度景观分析
Entropy (Basel). 2021 Dec 28;24(1):53. doi: 10.3390/e24010053.
10
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem.一种用于容量受限车辆路径问题的改进型冠状病毒群体免疫优化器。
J King Saud Univ Comput Inf Sci. 2022 Sep;34(8):4782-4795. doi: 10.1016/j.jksuci.2021.06.013. Epub 2021 Jun 24.

引用本文的文献

1
Energy-Saving Multi-Agent Deep Reinforcement Learning Algorithm for Drone Routing Problem.用于无人机路径规划问题的节能多智能体深度强化学习算法
Sensors (Basel). 2024 Oct 18;24(20):6698. doi: 10.3390/s24206698.
2
Multiobjective problem modeling of the capacitated vehicle routing problem with urgency in a pandemic period.疫情期间带紧急情况的容量约束车辆路径问题的多目标问题建模
Neural Comput Appl. 2023;35(5):3865-3882. doi: 10.1007/s00521-022-07921-y. Epub 2022 Oct 15.
3
Solving pickup and drop-off problem using hybrid pointer networks with deep reinforcement learning.
使用深度强化学习的混合指针网络解决接送问题。
PLoS One. 2022 May 26;17(5):e0267199. doi: 10.1371/journal.pone.0267199. eCollection 2022.
4
Hybrid pointer networks for traveling salesman problems optimization.混合指针网络在旅行商问题优化中的应用。
PLoS One. 2021 Dec 14;16(12):e0260995. doi: 10.1371/journal.pone.0260995. eCollection 2021.
5
Deep Reinforcement Learning for Indoor Mobile Robot Path Planning.深度强化学习在室内移动机器人路径规划中的应用。
Sensors (Basel). 2020 Sep 25;20(19):5493. doi: 10.3390/s20195493.