paper-with-me

Papers

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

2021-10-06 · NeurIPS 2021 12 · Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang

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.

📄 PDF Abstract BibTeX arXiv:2110.02544

Code (2)

yining043/VRP-DACT 공식 구현 pytorch
yining043/TSP-improve pytorch

Tasks

Traveling Salesman Problem

Methods 이 논문이 사용한 방법론

Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Position-Wise Feed-Forward Layer 설명 없음
Adam 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…

Similar Papers 제목 키워드 기반

Learning to Delegate for Large-scale Vehicle Routing

2021-07-08 · NeurIPS 2021 12 · Sirui Li, Zhongxia Yan, Cathy Wu

Vehicle routing problems (VRPs) form a class of combinatorial problems with wide practical applications. While previous heuristic or learning-based works achieve decent solutions on small problem instances of up to 100 c…

Learning Improvement Heuristics for Solving Routing Problems

2019-12-12 · Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang 외

Recent studies in using deep learning to solve routing problems focus on construction heuristics, the solutions of which are still far from optimality. Improvement heuristics have great potential to narrow this gap by it…

Deep Reinforcement LearningReinforcement Learning

Supervised Permutation Invariant Networks for Solving the CVRP with Bounded Fleet Size

2022-01-05 · Daniela Thyssens, Jonas Falkner, Lars Schmidt-Thieme

Learning to solve combinatorial optimization problems, such as the vehicle routing problem, offers great computational advantages over classical operations research solvers and heuristics. The recently developed deep rei…

Combinatorial OptimizationDeep Reinforcement Learning

Leveraging Conflicting Constraints in Solving Vehicle Routing Problems

2021-03-15 · Sabino Francesco Roselli, Remco Vader, Martin Fabian, Knut Akesson

The Conflict-Free Electric Vehicle Routing Problem (CF-EVRP) is a combinatorial optimization problem of designing routes for vehicles to visit customers such that a cost function, typically the number of vehicles or the …

Combinatorial Optimization

Multi-Vehicle Routing Problems with Soft Time Windows: A Multi-Agent Reinforcement Learning Approach

2020-02-13 · Ke Zhang, Meng Li, Zhengchao Zhang, Xi Lin 외

Multi-vehicle routing problem with soft time windows (MVRPSTW) is an indispensable constituent in urban logistics distribution systems. Over the past decade, numerous methods for MVRPSTW have been proposed, but most are …

Computational EfficiencyDecoderMulti-agent Reinforcement Learningreinforcement-learning+2