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

10/06/2021
by   Yining Ma, et al.
6

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.

READ FULL TEXT

page 6

page 7

page 8

page 9

page 11

page 12

page 14

page 17

research
02/09/2020

A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems

Recent researches show that machine learning has the potential to learn ...
research
12/19/2020

Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problems

We present a novel deep reinforcement learning method to learn construct...
research
11/12/2021

Generalized Nested Rollout Policy Adaptation with Dynamic Bias for Vehicle Routing

In this paper we present an extension of the Nested Rollout Policy Adapt...
research
08/27/2023

Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy

Machine learning has been adapted to help solve NP-hard combinatorial op...
research
10/26/2021

Learning Collaborative Policies to Solve NP-hard Routing Problems

Recently, deep reinforcement learning (DRL) frameworks have shown potent...
research
05/31/2023

Towards Omni-generalizable Neural Methods for Vehicle Routing Problems

Learning heuristics for vehicle routing problems (VRPs) has gained much ...
research
06/28/2021

Complexity-based partitioning of CSFI problem instances with Transformers

In this paper, we propose a two-steps approach to partition instances of...

Please sign up or login with your details

Forgot password? Click here to reset