[1]牛学勤,王炜.基于最短路搜索的多路径公交客流分配模型研究[J].东南大学学报(自然科学版),2002,32(6):917-919.[doi:10.3969/j.issn.1001-0505.2002.06.020]
 Niu Xueqin,Wang Wei.Study on the model of transit network multi-path assignment based on shortest path search[J].Journal of Southeast University (Natural Science Edition),2002,32(6):917-919.[doi:10.3969/j.issn.1001-0505.2002.06.020]
点击复制

基于最短路搜索的多路径公交客流分配模型研究()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
32
期数:
2002年第6期
页码:
917-919
栏目:
交通运输工程
出版日期:
2002-11-20

文章信息/Info

Title:
Study on the model of transit network multi-path assignment based on shortest path search
作者:
牛学勤 王炜
东南大学交通学院,南京 210096
Author(s):
Niu Xueqin Wang Wei
Transportation College, Southeast University, Nanjing 210096, China
关键词:
公交客流分配 最短路搜索 多路径分配 有效路径集
Keywords:
transit network assignment shortest path search multi-path assignment valid path set
分类号:
U121
DOI:
10.3969/j.issn.1001-0505.2002.06.020
摘要:
提出了一种首先采用最短路算法搜索有效路径集,再根据有效路径的广义费用,由改进的Logit模型确定每条有效路径的选择概率,进而计算每条线路客流量的公交客流分配模型.其中,任意两交通区之间的有效路径集是以换乘次数最少为准则,通过对不同选择情况下公交路网进行最短路搜索而获取.该模型既体现了乘客的费用最小的选择心理,又反映了出行线路多样性的实际情况,而且算法简单、有效.初步实践证明,具有较强的实用性.
Abstract:
A practical public transportation assignment model is put forward. The model uses the shortest path algorithm to search the valid path set(between any two traffic district)that subject to the terms of minimum bus change times, and then calculates every valid path’s choosing probability according to their utilities, finally calculates the passenger value of this path’s. This model meets the passenger’s path-selecting psychology of minimum cost and reflects the fact of path-selecting multiplicity. The algorithm is simple and practical.

参考文献/References:

[1] 魏恒.建立混合交通流条件下公交线路客流费用函数的理论方法[J].北京工业大学学报,1993,19(1):21-25.
  Wei Heng.Research on the traffic assignment model for transit network[J].Journal of Beijing Polytechnic University,1993,19(1):21-25.(in Chinese)
[2] 陆化普.交通规划理论与方法[M].北京:清华大学出版社,1998.255-256.
[3] 刘灿齐,杨佩昆.基于最短路径的城市干道网规划的算法研究[J].中国公路学报,2000,13(4):105-107.
  Liu Canqi,Yang Peikun.Urban main road network planning algorithm on shortest-path[J].China Journal of Highway and Transport,2000,13(2):105-107.(in Chinese)
[4] 王炜,杨新苗,陈学武.城市公共交通系统规划方法与管理技术[M].北京:科学出版社,2002.113.
[5] 过秀成,吕慎.基于合作竞争类OD联合方式划分轨道客流分配模型研究[J].中国公路学报,2000,13(4):91-94.
  Guo Xiucheng,Lu Sheng.Study of URT’s joint split assignment model on cooperative and competitive OD matrix[J].China Journal of Highway and Transport,2000,13(4):91-94.(in Chinese)

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金项目资助(59838310).
作者简介: 牛学勤(1965—),男,博士生; 王炜(联系人),男,博士,教授,博士生导师,weiwang@public1.ptt.js.cn.
更新日期/Last Update: 2002-11-20