A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem

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.

Authors

• Saman Ahmadi Royal Melbourne Institute of Technology
• Guido Tack Monash University
• Daniel D. Harabor Monash University
• Philip Kilby

Keywords

No keywords are indexed for this paper.