A solution to the transit assignment problem

被引:0
|
作者
Bell, MGH [1 ]
Schmöcker, JD [1 ]
机构
[1] Univ London Imperial Coll Sci Technol & Med, Dept Civil & Environm Engn, Ctr Transport Studies, London, England
关键词
transit assignment; capacity restraint; risk-averse; Markov chain;
D O I
暂无
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
This paper describes a capacity constrained frequency- or headway-based transit assignment model which, by relaxing the assumption of flow conservation, can consider within-day dynamics. The probability of failing to board a service due to insufficient capacity is taken into account in route choice. Passengers mingle on platforms, so that the probability of failing to board a service is not a function of origin, destination or time of arrival at the platform. The presence of common lines is not taken into account. An example demonstrates the impact of the capacity constraint on the number of passengers boarding at each stop when passengers make risk-averse route choices.
引用
收藏
页码:263 / 279
页数:17
相关论文
共 50 条
  • [21] New Approach for Solution of the Planet Transit Problem
    Kjurkchieva, Diana P.
    Dimitrov, Dinko P.
    [J]. FROM INTERACTING BINARIES TO EXOPLANETS: ESSENTIAL MODELING TOOLS, 2012, (282): : 474 - +
  • [22] OPTIMAL SOLUTION FOR THE CHANNEL-ASSIGNMENT PROBLEM
    GUPTA, UI
    LEE, DT
    LEUNG, JYT
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1979, 28 (11) : 807 - 810
  • [23] Biological computation of the solution to the quadratic assignment problem
    Yang, Xiaofan
    Lu, Qing
    Li, Chuandong
    Liao, Xiaofeng
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 200 (01) : 369 - 377
  • [24] ALGORITHM FOR THE SOLUTION OF THE ASSIGNMENT PROBLEM FOR SPARSE MATRICES
    CARPANETO, G
    TOTH, P
    [J]. COMPUTING, 1983, 31 (01) : 83 - 94
  • [25] AN OPTIMAL SOLUTION TO A DOCK DOOR ASSIGNMENT PROBLEM
    TSUI, LY
    CHANG, CH
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1992, 23 (1-4) : 283 - 286
  • [26] An optimal solution to the "Philadelphia" channel assignment problem
    Janssen, JCM
    Kilakos, K
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1999, 48 (03) : 1012 - 1014
  • [27] SOLUTION OF AN ASSIGNMENT PROBLEM THROUGH REARRANGING PROCESS
    LUTTON, JL
    BONOMI, E
    FEIX, M
    [J]. ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS, 1986, 41 (3-4): : 121 - 132
  • [28] AN IMPROVED APPROACH TO SOLUTION OF THE FACULTY ASSIGNMENT PROBLEM
    YANG, CW
    PINENO, CJ
    [J]. SOCIO-ECONOMIC PLANNING SCIENCES, 1989, 23 (03) : 169 - 177
  • [29] An efficient solution to biobjective generalized assignment problem
    Zhang, Cai Wen
    Ong, Hoon Liong
    [J]. ADVANCES IN ENGINEERING SOFTWARE, 2007, 38 (01) : 50 - 58
  • [30] Formulation and Solution of the Probabilistic Bottleneck Assignment Problem
    Kuo, Ching-Chung
    [J]. ICOSCM 2009 - PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON OPERATIONS AND SUPPLY CHAIN MANAGEMENT, 2009, 3 : 430 - 431