MODELING CAPACITY OF URBAN RAIL TRANSIT NETWORK BASED ON BI-LEVEL PROGRAMMING

被引:0
|
作者
Hu, Jianqiang [1 ]
Li, Haiying [1 ]
Meng, Lingyun [1 ]
Xu, Xinyue [1 ]
机构
[1] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing, Peoples R China
关键词
Urban Rail Transit; Network; Bi-level programming; Genetic algorithm;
D O I
暂无
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
Capacity index of Urban Rail Transit (URT) Network plays an improtant role in rational utilization of system capacity and operation management. A definition and calculating method of the capacity of URT Network was first proposed according to the features of URT network and route choice behavior of rail passengers in this paper. Several aspects of influencing factors of URT capacity were analyzed. A hi-level programming model was presented to optimize the URT capacity besides the system utility.Upper level of the model aims at maximizing the total OD flow through the URT network, and the lower level model is one kind of Fisk Equilibrium model. A new kind of impendence function relevant to the lower level model was put forward in consideration of practical traveler behavior. Genetic algorithm technique was applied to solve the hi-level programming model on the premise that the bi-level programming problem be converted into a single-level programming which was achieved by reformulating the lower-level problem model to its equivalent Karush-Kuhn-Tucker conditions. Effective crossover and mutation operators were proposed to enhance the convergence of the Genetic algorithm. A simplified network of Beijing URT was designed and numerical examples were conducted to prove that the proposed model and algorithm are feasible and valid in calculating the capacity of such network.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Transit Network Design Based on the Bi-Level Programming
    Sun, Min
    [J]. 4TH INTERNATIONAL CONFERENCE ON ECONOMICS AND MANAGEMENT (ICEM), 2017, : 392 - 395
  • [2] Park and Ride facility location research of rail transit based on Bi-level programming model
    Wang Xian Guang
    Liu Zhen Guo
    Mai Yuan Yuan
    Sun Xiao Nian
    [J]. MATERIALS, TRANSPORTATION AND ENVIRONMENTAL ENGINEERING, PTS 1 AND 2, 2013, 779-780 : 1156 - 1161
  • [3] Research on the Bi-level Programming Model for Ticket fare pricing of Urban Rail Transit Based on Particle Swarm Optimization Algorithm
    Zhao Xueyu
    Yang Jiaqi
    [J]. INTELLIGENT AND INTEGRATED SUSTAINABLE MULTIMODAL TRANSPORTATION SYSTEMS PROCEEDINGS FROM THE 13TH COTA INTERNATIONAL CONFERENCE OF TRANSPORTATION PROFESSIONALS (CICTP2013), 2013, 96 : 633 - 642
  • [4] A bi-level programming approach - Optimal transit fare under line capacity constraints
    Zhou, J
    Lam, WHK
    [J]. JOURNAL OF ADVANCED TRANSPORTATION, 2001, 35 (02) : 105 - 124
  • [5] Bi-level programming model for reconstruction of urban branch road network
    Shi Feng
    Huang En-hou
    Chen Qun
    Wang Ying-zi
    [J]. JOURNAL OF CENTRAL SOUTH UNIVERSITY OF TECHNOLOGY, 2009, 16 (01): : 172 - 176
  • [6] Bi-level programming model for reconstruction of urban branch road network
    Feng Shi
    En-hou Huang
    Qun Chen
    Ying-zi Wang
    [J]. Journal of Central South University of Technology, 2009, 16 : 172 - 176
  • [7] Bi-level programming model for reconstruction of urban branch road network
    史峰
    黄恩厚
    陈群
    王英姿
    [J]. Journal of Central South University, 2009, 16 (01) : 172 - 176
  • [8] Study on the Bottleneck of Urban Rail Transit Capacity Based on Network
    Sudan
    [J]. PROCEEDINGS OF THE 2017 4TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTER (MACMC 2017), 2017, 150 : 713 - 718
  • [9] Research on Reversal Lane Application Method of Urban Road Network Based on the Bi-level Programming
    Yu, Qiuhong
    Tian, Rui
    [J]. PRACTICAL APPLICATIONS OF INTELLIGENT SYSTEMS, ISKE 2013, 2014, 279 : 983 - +
  • [10] Optimal subsidies for rail containers: a bi-level programming solution
    Yang, Jinglei
    Luo, Meifeng
    Shi, Meichao
    [J]. MARITIME POLICY & MANAGEMENT, 2020, 47 (02) : 172 - 187