The first AI4TSP competition: learning to solve stochastic routing problems
From MaRDI portal
Publication:6103656
DOI10.1016/j.artint.2023.103918arXiv2201.10453OpenAlexW4362588063MaRDI QIDQ6103656
No author found.
Publication date: 27 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.10453
travelling salesman problemrouting problemstochastic combinatorial optimizationsurrogate-based optimizationdeep reinforcement learningAI for TSP competition
Cites Work
- Learning heuristics for the TSP by policy gradient
- Solving the stochastic time-dependent orienteering problem with time windows
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Learning surrogate functions for the short-horizon planning in same-day delivery problems
- PyDGGA: distributed GGA for automatic configuration
- The clustered team orienteering problem
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- A reinforcement learning approach to the orienteering problem with time windows
- Solving the Orienteering Problem through Branch-and-Cut
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
This page was built for publication: The first AI4TSP competition: learning to solve stochastic routing problems
