A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem
| العنوان: | A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem |
|---|---|
| المؤلفون: | Saman Ahmadi, Guido Tack, Daniel D. Harabor, Philip Kilby |
| المصدر: | Proceedings of the AAAI Conference on Artificial Intelligence. 35:12217-12224 |
| بيانات النشر: | Association for the Advancement of Artificial Intelligence (AAAI), 2021. |
| سنة النشر: | 2021 |
| مصطلحات موضوعية: | General Medicine |
| الوصف: | 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. |
| تدمد: | 2374-3468 2159-5399 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::c5ba32882edeb75ba628367124071d81 https://doi.org/10.1609/aaai.v35i14.17450 |
| رقم الأكسشن: | edsair.doi...........c5ba32882edeb75ba628367124071d81 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 23743468 21595399 |
|---|