arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.02544cs.LGcs.AI
收藏

学习使用双向协作Transformer迭代求解路由问题

Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer

National University of Singapore(新加坡国立大学);University of Electronic Science and Technology of China(电子科技大学);Institute for Infocomm Research, A*STAR(新加坡科技研究局资讯通信研究院);The Hong Kong University of Science and Technology(香港科技大学);Singapore Institute of Manufacturing Technology, A*STAR(新加坡科技研究局新加坡制造技术研究院);Shandong University(山东大学)

Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang

摘要:

最近,Transformer已经成为解决车辆路径问题(VRP)的主流深度架构。然而,它是不太有效的学习改进模型的车辆路径问题,因为它的位置编码(PE)的方法是不适合代表车辆路径问题的解决方案。本文提出了一种新的双向协作Transformer(DACT)算法,该算法将节点和位置特征的嵌入分别进行学习,而不是像现有算法那样将它们融合在一起,从而避免潜在的噪声和不兼容的相关性。此外,通过新颖的循环位置编码(CPE)方法嵌入位置特征,以允许Transformer有效地捕获VRP解的圆形性和对称性(即,循环序列)。我们使用近端策略优化来训练DACT,并设计了一个课程学习策略,以获得更好的样本效率。我们将DACT应用于旅行商问题(TSP)和有容量限制的车辆路径问题(CVRP)的求解。结果表明,我们的DACT优于现有的Transformer为基础的改进模型,并表现出更好的泛化性能在不同的问题大小的合成和基准实例,分别。

英文摘要:

Recently, Transformer has become a prevailing deep architecture for solving vehicle routing problems (VRPs). However, it is less effective in learning improvement models for VRP because its positional encoding (PE) method is not suitable in representing VRP solutions. This paper presents a novel Dual-Aspect Collaborative Transformer (DACT) to learn embeddings for the node and positional features separately, instead of fusing them together as done in existing ones, so as to avoid potential noises and incompatible correlations. Moreover, the positional features are embedded through a novel cyclic positional encoding (CPE) method to allow Transformer to effectively capture the circularity and symmetry of VRP solutions (i.e., cyclic sequences). We train DACT using Proximal Policy Optimization and design a curriculum learning strategy for better sample efficiency. We apply DACT to solve the traveling salesman problem (TSP) and capacitated vehicle routing problem (CVRP). Results show that our DACT outperforms existing Transformer based improvement models, and exhibits much better generalization performance across different problem sizes on synthetic and benchmark instances, respectively.

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

↑