Incentive-Compatible Robust Line Planning
- 2.8k Downloads
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their frequencies in an underlying railway network infrastructure, which are robust to fluctuations of real-time parameters of the solution. In this work, we investigate a variant of robust line planning stemming from recent regulations in the railway sector that introduce competition and free railway markets, and set up a new application scenario: there is a (potentially large) number of line operators that have their lines fixed and operate as competing entities issuing frequency requests, while the management of the infrastructure itself remains the responsibility of a single entity, the network operator. The line operators are typically unwilling to reveal their true incentives, while the network operator strives to ensure a fair (or socially optimal) usage of the infrastructure, e.g., by maximizing the (unknown to him) aggregate incentives of the line operators.
By investigating a resource allocation mechanism (originally developed in the context of communication networks), we show that a socially optimal solution can be accomplished in certain situations via an anonymous incentive-compatible pricing scheme for the usage of the shared resources that is robust against the unknown incentives and the changes in the demands of the entities.This brings up a new notion of robustness, which we call incentive-compatible robustness, that considers as robustness of the system its tolerance to the entities’ unknown incentives and elasticity of demands, aiming at an eventual stabilization to an equilibrium point that is as close as possible to the social optimum.
KeywordsUtility Function Price Scheme Social Optimum Resource Price Line Planning
Unable to display preview. Download preview PDF.
- 2.ARRIVAL Deliverable D1.2, New Theoretical Notion of the Prices of Robustness and Recoverability, ARRIVAL Project, Version 2 (July 2007)Google Scholar
- 3.Bertsekas, D.: Nonlinear Programming, 2nd edn. Athena Scientific (1999)Google Scholar
- 5.Borndörfer, R., Grötschel, M., Lukac, S., Mitusch, M., Schlechte, T., Schultz, S., Tanner, A.: An Auctioning Approach to Railway Slot Allocation. Competition and Regulation in Network Industries 1(2), 163–196 (2006)Google Scholar
- 7.Dienst, H.: Linienplanung im spurgeführten Personenverkehr mit Hilfe eines heuristischen Verfahrens, PhD thesis, Technische Universität Braunschweig (1978)Google Scholar
- 8.Fischetti, M., Monaci, M.: Light Robustness. Technical Report ARRIVAL-TR-0119, ARRIVAL Project (January 2008)Google Scholar
- 15.Kontogiannis, S., Zaroliagis, C.: Robust Line Planning under Unknown Incentives and Elasticity of Frequencies. In: Proc. 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems – ATMOS 2008 (2008)Google Scholar
- 16.Liebchen, C., Lübbecke, M., Möhring, R., Stiller, S.: Recoverable Robustness. Technical Report ARRIVAL-TR-0066, ARRIVAL Project (August 2007)Google Scholar
- 17.Liebchen, C., Lübbecke, M., Möhring, R., Stiller, S.: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 1–27. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 18.Schöbel, A., Scholl, S.: Line Planning with Minimal Traveling Time. In: Proc. 5th Workshop on Algorithmic Methods and Models for Optimization of Railways – ATMOS (2005)Google Scholar
- 19.Schöbel, A., Schwarze, S.: A Game-Theoretic Approach to Line Planning. In: Proc. 6th Workshop on Algorithmic Methods and Models for Optimization of Railways – ATMOS (2006)Google Scholar
- 20.Scholl, S.: Customer-oriented line planning. PhD thesis, Technische Universität Kaiserslautern (2005)Google Scholar
- 21.Srikant, R.: The Mathematics of Internet Congestion Control. Birkauser (2004)Google Scholar