Open AccessA bi‐level programming approach — Optimal transit fare under line capacity constraints
Author(s) -
Zhou Jing,
Lam William H. K.
Publication year - 2001
Publication title -
journal of advanced transportation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.577
H-Index - 46
eISSN - 2042-3195
pISSN - 0197-6729
DOI - 10.1002/atr.5670350204
Subject(s) - transit (satellite) , heuristic , flow network , public transport , computer science , line (geometry) , sensitivity (control systems) , network planning and design , mathematical optimization , transport engineering , programming paradigm , integer programming , linear programming , transit system , operations research , engineering , computer network , mathematics , algorithm , geometry , electronic engineering , programming language
The fare of a transit line is one of the important decision variables for transit network design. It has been advocated as an efficient means of coordinating the transit passenger flows and of alleviating congestion in the transit network. This paper shows how transit fare can be optimized so as to balance the passenger flow on the transit network and to reduce the overload delays of passengers at transit stops. A bi‐level programming method is developed to optimize the transit fare under line capacity constraints. The upper‐level problem seeks to minimize the total network travel time, while the lower‐level problem is a stochastic user equilibrium transit assignment model with line capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Numerical example is used to illustrate the application of the proposed model and solution algorithm.