In this paper we introduce the fare planning problem for public transport which consists in designing a system of fares maximizing revenue. We propose a new simple general model for this problem. It i s based on a demand function and constraints for the different fares. The constraints define the structure of the fare system, e.g., distance dependent fares or zone fares. We discuss a simple example with a quadratic demand function and distance dependent fares. Then we introduce a more realistic discrete choice model in which passengers choose between different alternatives depending on the numb er of trips per month. We demonstrate the examples by computational experiments.
Fare planning for public transport
ZIB-report ; 2005, 20
2005
Online-Ressource (17 S., 440,4 KB)
Langzeitarchivierung durch Technische Informationsbibliothek (TIB) / Leibniz-Informationszentrum Technik und Naturwissenschaften und Universitätsbibliothek
Report
Elektronische Ressource
Englisch
Automatic fare collection in public transport
TIBKAT | 1990
|Automatic fare collection in public transport
British Library Conference Proceedings | 1990
|Decrypting fare-free public transport in Tallinn, Estonia
Elsevier | 2017
|Public Transportation Fare Policy
NTIS | 1977
|