TY - JOUR AU - Ahmadi, Saman AU - Tack, Guido AU - Harabor, Daniel D. AU - Kilby, Philip PY - 2021/05/18 Y2 - 2024/03/29 TI - A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem JF - Proceedings of the AAAI Conference on Artificial Intelligence JA - AAAI VL - 35 IS - 14 SE - AAAI Technical Track on Search and Optimization DO - 10.1609/aaai.v35i14.17450 UR - https://ojs.aaai.org/index.php/AAAI/article/view/17450 SP - 12217-12224 AB - Resource constrained path finding is a well studied topic in AI, with real-world applications in different areas such as transportation and robotics. This paper introduces several heuristics in the resource constrained path finding context that significantly improve the algorithmic performance of the initialisation phase and the core search. We implement our heuristics on top of a bidirectional A* algorithm and evaluate them on a set of large instances. The experimental results show that, for the first time in the context of constrained path finding, our fast and enhanced algorithm can solve all of the benchmark instances to optimality, and compared to the state of the art algorithms, it can improve existing runtimes by up to four orders of magnitude on large-size network graphs. ER -