全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于GBAS的公交出行最优路径选择算法

, PP. 154-158

Keywords: 交通工程,公共交通,最优路径,基于图的蚁群系统,公交出行,换乘

Full-Text   Cite this paper   Add to My Lib

Abstract:

通过对城市公交网络的描述,结合居民公交出行路径选择的特征,提出了以换乘次数最少为首要目标,以出行距离最短为次要目标的基于GBAS(基于图的蚁群系统)的公交出行最优路径选择算法。算法让分群蚂蚁从起点站行走至终点站后,在所有走过的路径中,通过对换乘次数和出行距离进行计算后选择最优路径,并对该路径上的信息素进行加强,其他路径上的信息素进行挥发,经过若干次外循环迭代后,分群蚂蚁会选择信息素最强的路径行走,即为公交出行的最优路径。用一个算例对算法的有效性进行验证。

References

[1]  张国伍,钱大琳.公共交通线路网多条最短路径算法
[2]  [J].系统工程理论与实践,1992.12 (4):22-26.ZHANG Guowu,QIAN Dalin.Multi Shortest Path Algorithm of Public Transportation Network
[3]  [J].Systems Engineering-Theory & Practice,1992,12(4):22-26.
[4]  杨新苗,王炜,马文腾.基于GIS的公交乘客出行路径选择模型
[5]  [J].东南大学学报:自然科学版,2000,30(6):87-91.YANC Xinmiao,WANG Wei,MA Wenteng.GIS-based Public Transit Passenger Route Choice Model
[6]  [J].Journal of Southeast University:Natural Science Edition,2000,30(6):87-91.
[7]  李文勇,王炜,陈学武.公交出行路径蚂蚁算法
[8]  [J].交通运输工程学报,2004,4(4):102-105.LI Wenyong,WANG Wei,CHEN Xuewu.Bus Travel Transit Path Based on Ant Algorithm
[9]  [J].Journal of Traffic and Transportation Engineering,2004,4(4):102-105.
[10]  KONCZ N,GREENFELD J,MOUSKOS K.A Strategy for Solving Static Multiple Optimal Path Transit Network Problems
[11]  [J].Journal of Transportation Engineering,1996,122(3):218-225.
[12]  GUTJAHR W J.A Craph-based Ant System and Its Convergence
[13]  [J].Future Generation Computer System,2000,16(8):873-888.
[14]  [J].Journal of University of Shanghai for Science and Technology,2006,28(1):63-67.
[15]  李永亮.基于蚁群算法的公交出行方案研究
[16]  [D].北京:北京交通大学,2008.LI Yongliang.Research of Transit Trip Plan Based on Ant Colony Algorithm
[17]  [D].Beijing:Beijing Jiaotong University,2008.
[18]  高为民.基于蚁群算法的公交网络最短路径问题研究
[19]  [J].交通与计算机,2007,25(1):49-51.GAO Weimin.Problem of Shortest Path in Bus Net Based on Ant Algorithm
[20]  [J].Computer and Communications,2007,25(1):49-51.
[21]  闫小勇,牛学勤.公交网络多路径选择启发式算法研究
[22]  [J].城市交通,2005,3(3):23-26.YAN Xiaoyong,NIU Xueqin.Study on Heuristic Algorithm for Public Transport Network Multi-path Selection
[23]  [J].Urban Transport of China,2005,3(3):23-26.
[24]  靳凯文,李春葆,秦前清.基于蚁群算法的最短路径搜索方法研究
[25]  [J].公路交通科技,2006,23(3):128-130.JIN Kaiwen,LI Chunbao,QIN Qianqing.Study on Shortest Path Search Method Based on Ant Algorithm
[26]  [J].Journal of Highway and Transportation Research and Development,2006,23(3):128-130.
[27]  赵巧霞,马志强,张发.以最小换乘次数和站数为目标的公交出行算法
[28]  [J].计算机应用,2004,24(12):135-137.ZHAO Qiaoxia,MA Zhiqiang,ZHANG Fa.Algorithm for Public Transit Trip with Minimal Transfer Times and Stops
[29]  [J].Computer Applications,2004,24(12):135-137.
[30]  王莉,李文权.公共交通系统最佳路径算法
[31]  [J].东南大学学报:自然科学版,2004,34(2):561-564.WANG Li,LI Wenquan.Best-routing Algorithm for Public Transportation System
[32]  [J].Journal of Southeast University:Natural Science Edition,2004,34(2):561-564.
[33]  何胜学,范炳全,严凌.公交网络最优路径的一种改进求解算法
[34]  [J].上海理工大学学报,2006,28(1):63-67.HE Shengxue,FAN Bingquan,YAN Ling.Improved Optimal Path Searching Algorithm in Transit Network

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133