2 citations · 4 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2022★ 1 cited
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems
Laurens Bliek, Paulo da Costa, Reza Refaei Afshar +19
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 (IJCA…
cs.AI2019★ 2 cited
Data-driven Policy on Feasibility Determination for the Train Shunting Problem
Paulo R. de O. da Costa, J. Rhuggenaath, Y. Zhang +3
Parking, matching, scheduling, and routing are common problems in train maintenance. In particular, train units are commonly maintained and cleaned at dedicated shunting yards. The…