Finding delay-resistant line concepts using a game-theoretic approach

Authors:
Anita Schöbel;Silvia Schwarze
Affiliations:
Institute for Numerical and Applied Mathematics, Göttingen, Germany 37083;Institute of Information Systems, Hamburg, Germany 20146
Venue:
Netnomics
Year:
2013

Citing 14
Cited 0

A Branch-and-Cut Approach for Solving Railway Line-Planning Problems

Transportation Science
Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network (Springer Optimization and Its Applications)

Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network (Springer Optimization and Its Applications)
A Column-Generation Approach to Line Planning in Public Transport

Transportation Science
Recoverable Robust Timetables on Trees

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Computing delay resistant railway timetables

Computers and Operations Research
Recoverable Robustness in Shunting and Timetabling

Robust and Online Large-Scale Optimization
Light Robustness

Robust and Online Large-Scale Optimization
A Bicriteria Approach for Robust Timetabling

Robust and Online Large-Scale Optimization
Design and evaluation of transportation networks: constructing transportation networks from perspectives of service integration, infrastructure investment and information system implementation

Netnomics
To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions

Transportation Science
A note on the online nature of the railway delay management problem

Networks
Engineering the modulo network simplex heuristic for the periodic timetabling problem

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Delay Management with Rerouting of Passengers

Transportation Science
Line planning in public transportation: models and methods

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a game-theoretic model for the line planning problem in public transportation, in which each line acts as player. Each player aims to minimize its own delay, which is dependent on the traffic load along its edges. We show that there exists a line plan at equilibrium, which minimizes the probability of delays of the transportation system. This result is achieved by showing that a potential function exists. Numerical results using close-to-real world data in the LinTim framework clearly show that our method indeed produces delay-resistant line concepts.