A bi‐level programming approach — Optimal transit fare under line capacity constraints
A bi‐level programming approach — Optimal transit fare under line capacity constraints
复制标题
DOI：
10.1002/atr.5670350204
复制
发表时间：
2001-06
影响因子：
2.3
通讯作者：
Jing Zhou;W. Lam
中科院分区：
文献类型：
--
作者：
Jing Zhou;W. Lam
公交线票价是公交线网设计的重要决策变量之一。它被认为是协调过境客流和缓解过境网络拥挤的有效手段。本文介绍了如何优化公交票价，以平衡公交网络上的客流，减少乘客在公交站点的超载延误。提出了一种双层规划方法来优化线路容量约束下的公交票价。上层问题的目标是使网络总行程时间最小化，下层问题是考虑线路容量约束的随机用户均衡交通分配模型。提出了一种基于灵敏度分析的启发式求解算法。最后用数值算例说明了该模型和求解算法的应用。
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.