arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.00173math.OC
收藏

时间敏感情境下多行程路径规划的近似解

Approximate Solutions for Multi-Trip Route Planning in Time-Sensitive Situations

Bahar Cavdar, Joseph Geunes, Xiaofeng Nie, Yue Wang

AI总结:

本文针对时间敏感的单车多行程紧急运输问题,提出救护车巴士路径问题的高效近似策略与启发式方法,以快速获得近最优整数解并最大化总体满意度。

摘要:

我们考虑需要将个体从其所在位置运送至某一设施、且仅使用一辆有容量限制车辆的紧急情境,其中运输时长对个体产生负面影响。调度员确定路径以最大化总体满意度。我们将该问题称为救护车巴士路径问题(Ambulance Bus Routing Problem)。我们为调度员开发了高效的近似策略,以将个体分配到多条路径中,刻画了松弛近似模型的最优解,并设计了一种启发式方法以快速获得近最优的整数解。

英文摘要:

We consider emergent situations that require transporting individuals from their locations to a facility using a single capacitated vehicle, where transportation duration has a negative impact on the individuals. A dispatcher determines routes to maximize total satisfaction. We call this problem the Ambulance Bus Routing Problem. We develop efficient approximate policies for the dispatcher to allocate individuals to multiple routes, characterize an optimal solution of the relaxed approximate model, and devise a heuristic to obtain a near-optimal integer solution quickly.

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

↑