检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Bingfeng SI Ming ZHONG Xiaobao YANG Ziyou GAO
机构地区:[1]MOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, China [2]Department of Civil Engineering, University of New Brunswick, Fredericton, New Brunswick E3B 5A3, Canada
出 处:《Journal of Systems Science and Systems Engineering》2011年第2期155-172,共18页系统科学与系统工程学报(英文版)
基 金:supported by the National Natural Science Foundation of China (71071016,70901005);the Fundamental Research Funds for the Central Universities (2009JBM040,2009JBZ012);the Foundation of State Key Laboratory of Rail Traffic Control and Safety (RCS2010ZT001)
摘 要:This paper presents an augmented network model to represent urban transit system.Through such network model,the urban transit assignment problem can be easily modeled like a generalized traffic network.Simultaneously,the feasible route in such augmented transit network is then defined in accordance with the passengers' behaviors.The passengers' travel costs including walking time,waiting time,in-vehicle time and transfer time are formulated while the congestions at stations and the congestions in transit vehicles are all taken into account.On the base of these,an equilibrium model for urban transit assignment problem is presented and an improved shortest path method based algorithm is also proposed to solve it.Finally,a numerical example is provided to illustrate our approach.This paper presents an augmented network model to represent urban transit system.Through such network model,the urban transit assignment problem can be easily modeled like a generalized traffic network.Simultaneously,the feasible route in such augmented transit network is then defined in accordance with the passengers' behaviors.The passengers' travel costs including walking time,waiting time,in-vehicle time and transfer time are formulated while the congestions at stations and the congestions in transit vehicles are all taken into account.On the base of these,an equilibrium model for urban transit assignment problem is presented and an improved shortest path method based algorithm is also proposed to solve it.Finally,a numerical example is provided to illustrate our approach.
关 键 词:TRANSIT ASSIGNMENT augmented network CONGESTION transfer algorithm
分 类 号:U239.5[交通运输工程—道路与铁道工程] U491.123
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249