arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.04073cs.ROcs.CCcs.MA
收藏

面向动态车辆故障的多仓库农村邮差问题的两阶段反应式拍卖框架

A Two-Stage Reactive Auction Framework for the Multi-Depot Rural Postman Problem with Dynamic Vehicle Failures

Department of Mechanical Engineering, University of Maryland(马里兰大学机械工程系);Department of Mechanical Engineering, The Catholic University of America(美国天主教大学机械工程系)

Eashwar Sathyamurthy, Jeffrey W. Herrmann, Shapour Azarm

AI总结:

针对多仓库农村邮差问题中车辆故障导致的任务中断,提出一种两阶段实时重调度框架,结合集中式拍卖与对等拍卖,在保证解质量的同时将重调度时间从小时级降至秒级。

摘要:

尽管无人车车队在运输、物流和巡检中提供了效率,但它们对故障的敏感性对任务连续性构成了重大挑战。我们研究了带有可充电和可重复使用车辆的多仓库农村邮差问题(MD-RPP-RRV),其中放置在多个仓库、具有容量约束的无人充电车辆在为基于弧的需求服务时可能发生故障。为了解决运行中意外的车辆故障,我们提出了一种两阶段实时重调度框架。首先,集中式拍卖快速生成可行的重调度方案;对于此阶段,我们推导了一个理论加性界,为最坏情况下的重调度惩罚提供了分析保证。其次,对等拍卖通过一个针对问题的磁场路由器对局部调度进行修复,以细化基线方案,该路由器利用通过敏感性分析校准的参数,确保计算增长可控。我们将该方法与模拟退火元启发式算法进行基准比较,以评估解质量和执行速度。在257个不同故障场景上的实验结果表明,与元启发式基线相比,该框架实现了平均运行时间减少超过95%,将重调度时间从小时级缩短到秒级,同时保持高质量的解。两阶段框架在大规模实例上表现出色,在近80%的场景中优于集中式拍卖,平均解改进超过12%。此外,它在59%和28%的场景中分别优于模拟退火的平均结果和最佳结果,为实时任务连续性提供了所需的鲁棒速度-质量权衡。

英文摘要:

Although unmanned vehicle fleets offer efficiency in transportation, logistics and inspection, their susceptibility to failures poses a significant challenge to mission continuity. We study the Multi-Depot Rural Postman Problem with Rechargeable and Reusable Vehicles (MD-RPP-RRV) with vehicle failures, where unmanned rechargeable vehicles placed at multiple depots with capacity constraints may fail while serving arc-based demands. To address unexpected vehicle breakdowns during operation, we propose a two-stage real-time rescheduling framework. First, a centralized auction quickly generates a feasible rescheduling solution; for this stage, we derive a theoretical additive bound that establishes an analytical guarantee on the worst-case rescheduling penalty. Second, a peer auction refines this baseline through a problem-specific magnetic field router for local schedule repair, utilizing parameters calibrated via sensitivity analysis to ensure controlled computational growth. We benchmark this approach against a simulated annealing metaheuristic to evaluate solution quality and execution speed. Experimental results on 257 diverse failure scenarios demonstrate that the framework achieves an average runtime reduction of over 95\% relative to the metaheuristic baseline, cutting rescheduling times from hours to seconds while maintaining high solution quality. The two-stage framework excels on large-scale instances, surpassing the centralized auction in nearly 80\% of scenarios with an average solution improvement exceeding 12\%. Moreover, it outperforms the simulated annealing mean and best results in 59\% and 28\% of scenarios, respectively, offering the robust speed-quality trade-off required for real-time mission continuity.

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

↑