The first AI4TSP competition: Learning to solve stochastic routing problems

Yingqian Zhang*, Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Robbert Reijnen, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, More Authors

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

10 Downloads (Pure)


This paper reports on the first international competition on AI for the traveling salesman problem (TSP) at the International Joint Conference on Artificial Intelligence 2021 (IJCAI-21). The TSP is one of the classical combinatorial optimization problems, with many variants inspired by real-world applications. This first competition asked the participants to develop algorithms to solve an orienteering problem with stochastic weights and time windows (OPSWTW). It focused on two learning approaches: surrogate-based optimization and deep reinforcement learning. In this paper, we describe the problem, the competition setup, and the winning methods, and give an overview of the results. The winning methods described in this work have advanced the state-of-the-art in using AI for stochastic routing problems. Overall, by organizing this competition we have introduced routing problems as an interesting problem setting for AI researchers. The simulator of the problem has been made open-source and can be used by other researchers as a benchmark for new learning-based methods. The instances and code for the competition are available at

Original languageEnglish
Article number103918
Number of pages18
JournalArtificial Intelligence
Publication statusPublished - 2023


  • AI for TSP competition
  • Deep reinforcement learning
  • Routing problem
  • Stochastic combinatorial optimization
  • Surrogate-based optimization
  • Travelling salesman problem

Cite this