The first AI4TSP competition: Learning to solve stochastic routing problems
Authors:
- Yingqian ZhangYZYingqian Zhang
- Laurens BliekLBLaurens Bliek
- Paulo da CostaPCPaulo da Costa
- Reza Refaei AfsharRAReza Refaei Afshar
- Robbert ReijnenRRRobbert Reijnen
- Tom CatshoekTCTom Catshoek
- Daniël VosDVDaniël Vos
- Sicco VerwerSVSicco Verwer
- Fynn Schmitt-UlmsFSFynn Schmitt-Ulms
- André HottungAHAndré Hottung
- Tapan ShahTSTapan Shah
- Meinolf SellmannMSMeinolf Sellmann
Open Access
- 3 April 2023
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 319
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- A reinforcement learning approach to the orienteering problem with time windowsComputers & Operations Research, 2021
- Machine learning for combinatorial optimization: A methodological tour d’horizonEuropean Journal of Operational Research, 2021
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problemComputers & Operations Research, 2020
- The clustered team orienteering problemComputers & Operations Research, 2019
- Solving the stochastic time-dependent orienteering problem with time windowsEuropean Journal of Operational Research, 2016
- Taking the Human Out of the Loop: A Review of Bayesian OptimizationProceedings of the IEEE, 2015
- Mixed Integer Evolution Strategies for Parameter OptimizationEvolutionary Computation, 2013
- An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time WindowsTransportation Science, 2006
- Solving the Orienteering Problem through Branch-and-CutINFORMS Journal on Computing, 1998
- An Optimal Algorithm for the Traveling Salesman Problem with Time WindowsOperations Research, 1995