arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.05291cs.AI
收藏

空中救护车编队优化调度算法研究

Algorithms for Optimizing Fleet Staging of Air Ambulances

Lakehead University(湖首大学);Royal Military College of Canada(加拿大皇家军事学院)

Joseph Tassone, Geoffrey Pond, Salimur Choudhury

摘要:

在灾难情况下,空中救护的快速反应往往是病人生存的决定性因素。障碍加剧了这种情况,地理位置偏远和车辆安置的限制使其成为一项艰巨的任务。考虑到这些因素,应急人员的安排是一项至关重要的关键决定。利用实际任务数据,构造了一个整数线性规划的最优覆盖问题。为了进行准确的比较,Guidance优化器使用开发的模型进行编程,并根据性能进行计时。创建了一个解决方案,该解决方案实现了基础排名,然后是基于本地和禁忌搜索的算法。局部搜索算法证明不足以最大化覆盖率,而禁忌搜索实现了接近最优的结果。在后一种情况下,车辆的总行驶距离最小化,运行时间明显优于Guidelines生成的运行时间。此外,利用并行CUDA处理的变体进一步降低了算法运行时间。随着测试任务数量的增加,这些被证明是优越的,同时也保持了相同的最小距离。

英文摘要:

In a disaster situation, air ambulance rapid response will often be the determining factor in patient survival. Obstacles intensify this circumstance, with geographical remoteness and limitations in vehicle placement making it an arduous task. Considering these elements, the arrangement of responders is a critical decision of the utmost importance. Utilizing real mission data, this research structured an optimal coverage problem with integer linear programming. For accurate comparison, the Gurobi optimizer was programmed with the developed model and timed for performance. A solution implementing base ranking followed by both local and Tabu search-based algorithms was created. The local search algorithm proved insufficient for maximizing coverage, while the Tabu search achieved near-optimal results. In the latter case, the total vehicle travel distance was minimized and the runtime significantly outperformed the one generated by Gurobi. Furthermore, variations utilizing parallel CUDA processing further decreased the algorithmic runtime. These proved superior as the number of test missions increased, while also maintaining the same minimized distance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑