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

多故障和多中断情况下的鲁棒线路规划

Robust Line Planning in case of Multiple Pools and Disruptions

Apostolos Bessas, Spyros Kontogiannis, Christos Zaroliagis

摘要:

本文从鲁棒性的角度研究了公交线路规划问题。我们提出了一种机制,强大的线规划的情况下,多个线池,当线运营商有一个不同的效用函数,每个池。我们进行了实验研究,我们的机制在合成和现实世界的数据,显示快速收敛到最佳。我们还探讨了各种各样的情况下,从任意的初始状态(待解决)到以前的最佳解决方案(待恢复)的小中断。后一种情况下,我们的实验表明,我们的机制可以用作一个在线恢复方案,使系统重新收敛到其最佳的速度非常快。

英文摘要:

We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple line pools, when the line operators have a different utility function per pool. We conduct an experimental study of our mechanism on both synthetic and real-world data that shows fast convergence to the optimum. We also explore a wide range of scenarios, varying from an arbitrary initial state (to be solved) to small disruptions in a previously optimal solution (to be recovered). Our experiments with the latter scenario show that our mechanism can be used as an online recovery scheme causing the system to re-converge to its optimum extremely fast.

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

↑