Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning

DOI10.1007/978-3-031-15791-2_14zbMath1522.68499arXiv2207.01443OpenAlexW4296193419MaRDI QIDQ6041315

Inaam Ashraf, Alexander Gembus, Jonas K. Falkner, Genesis Cuizon, Christian Löwens, Lars Schmidt-Thieme

Publication date: 26 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.01443

zbMATH Keywords

deep reinforcement learningheterogeneous attentiontraveling salesperson problem with precedence constraints

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Combinatorial optimization (90C27)

Cites Work

• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• An inexact algorithm for the sequential ordering problem
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers

This page was built for publication: Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning