Robust Line Planning in case of Multiple Pools and Disruptions

Details Robust Line Planning in case of Multiple Pools and Disruptions Robust Line Planning in case of Multiple Pools and Disruptions

2011-01-14

arxiv.org/abs/1101.2770v1

Computer Science

Computer Science and Game Theory

To appear in TAPAS 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Robust Line Planning in case of Multiple Pools and Disruptions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robust Line Planning in case of Multiple Pools and Disruptions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Line Planning in case of Multiple Pools and Disruptions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-79063