基于双重限制的公交网络SUE配流模型及算法  

SUE assignment model and algorithm based on berth capacity and bottlenecks for transit networks

作　　者：张林峰[1] 范炳全[1] 马良[1] 吕智林[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《系统工程学报》2005年第3期278-284,共7页Journal of Systems Engineering

摘　　要：考虑站点泊车容量和运送能力双重限制条件下的公交网络系统随机平衡分配问题,建立了与其相等价的数学规划模型,并提出有效的迭代算法.由于线路容量的限制,会导致乘客的过载延迟,车辆排队会使过载延迟进一步增加.在该模型中,乘客的过载延迟时间可由相应容量约束的拉格朗日乘子计算得到,车辆排队延误时间由排队论的理论求得.最后,实例表明该模型和算法是合理和有效的.<Abstrcat> This paper proposes a stochastic user equilibrium assignment model for congested transit networks based on berth capacity and bottlenecks. The corresponding equivalent mathematical programming problem is formulated. In a congested transit network, the passenger overload delay is determined endogenously according to the characteristics of the congested transit network, and the equilibrium passenger overload delays in the congested transit network can be calculated by the Lagrange multipliers of the mathematical programming problem. The queuing delay of vehicles can be calculated by using queuing theory. An iterative algorithm is also put forward. Finally, an example is given to show that the proposed model and solution are rational and effective.

关 键 词：公交网络 泊车容量 能力限制 随机用户平衡 

分 类 号：U121[交通运输工程]