大城市公共交通网络最优路径算法研究
|
摘要
快速发展的小汽车交通引发的交通拥堵及其附带问题已成为大城市的一个共性且难以解决的问题。优先发展公共交通,提升其运行服务水平是缓解城市交通拥堵的关键。公交乘客如何安全、快捷、方便、准点、经济和舒适的完成出行是衡量公共交通运行服务水平的重要基准。现代社会经济和公交系统的发展,使得乘客在出行行为、出行心理、出行目的、出行时间、出行环境及个体属性等因素发生了很大的变化。狭义上的公交最短路径已难以指导公交出行者的出行。
结合现在城市公共交通系统的发展水平与趋势,论文分析了公交系统的模式构成、运营特点和公交时刻表属性,从网络联通特性、公交站点换乘特性、公交线路弧段特性和时间费用几个方面进行阐述。乘客公交出行时会考虑自身偏好、出行目的、外界环境等多种因素,并根据自身的经验和实时获取的有限信息来综合判断。论文从乘客出行行为心理过程出发,总结分析了乘客公交出行路径的影响因素、选择原则与衡量标准,并结合武汉公交调查的实证分析,重新定义了公交出行的最优路径选择原则。
考虑到城市公交网络多模式、多属性的特点以及乘客出行要求多元化,论文采用GIS对公交网络进行描述,提出了多模式公交网络数据模型,将公交网络空间数据与属性数据进行了结合。通过分析乘客公交出行的行为——时间链属性,讨论了步行弧段、等待弧段、换乘弧段和行车弧段组成的出行时间阻抗,论文结合合理步行时间和步行范围内的换乘,统一转换了换乘惩罚和票价费用,构建了路径广义阻抗函数模型。论文概述了现有算法的基本特点和应用于多模式公交网络的局限性,提出了基于公交时刻表约束下的最优路径算法,采用了双层搜索的思想,并给出了算法具体步骤流程以及实证讨论研究。
通过与其它寻优算法原则所得到的结果对比分析,表明论文提出的模型算法能更好的反映乘客的出行行为心理过程和最优选择原则,为传统公交模式向多模式公交转变下的乘客出行路径选择提供了一种思路方法。
The traffic congestion and accompanying problems caused by rapid development of automobile traffic have become a common and difficult to resolve in metropolis. Giving priority to the development of public transport and enhancing its operational service levels is the key to ease urban traffic congestion. Passengers complete trips, who consider safe, fast, convenient, punctuality, economy and comfort as the important benchmark to measure the level of public transport services. The factors such as the trip behavior, trip psychology, trip purposes, trip time, environment and the individual attributes have changed greatly. The shortest bus path in a narrow sense has been difficult to guide the bus traveler.
Combining the development level and trends of urban public transit system, the paper analyzes the mode composition, operational characteristics and schedules property of public transit system, and describes from several aspects of the characteristics of network unicorn, transfer, bus lines arc and time costs etc. Passengers will consider themselves preferences, trip purpose, the external environment and other factors, and judge comprehensively according to their own experience and real-time limited information. From the behavior psychological processes of the passengers traveling, the paper summarizes and analyzes the impact factors, principles of selection and measurement standards of trip path, and re-defines the principle of the optimal path selection through an empirical analysis of the survey in Wuhan.
Taking into account the multi-mode and multi-attribute characteristics of urban public transit network, and passenger trip diversification, the paper uses GIS to describe the public transit network and proposes multi-modal transit network data model, which combines the spatial data and attribute data together. By analyzing the trip time chain property of passengers behavior, and discussing the time impedance consist of foot arcs, waiting arcs, transfer arc segment and traveling arc sections, the paper builds a generalized impedance function model of path considering a reasonable walking distance and the transfers with converting transfer penalty and fare cost unifiedly. The paper outlines the basic characteristics and limitations of existing algorithms applying to the multi-modal public transit network, and proposes an optimal path algorithm based on public transit timetables, which uses a double-search idea, and gives specific steps of the algorithm flow as well as the empirical study.
Comparing with the results obtained from the other algorithms and principles shows that the proposed model algorithm can reflect passenger travel behavior psychological processes and the optimal choice principles much better, the paper provides an alternative method for the selection of passengers' trip path under the situation of changing form the traditional bus transit models to multi-mode.
结合现在城市公共交通系统的发展水平与趋势,论文分析了公交系统的模式构成、运营特点和公交时刻表属性,从网络联通特性、公交站点换乘特性、公交线路弧段特性和时间费用几个方面进行阐述。乘客公交出行时会考虑自身偏好、出行目的、外界环境等多种因素,并根据自身的经验和实时获取的有限信息来综合判断。论文从乘客出行行为心理过程出发,总结分析了乘客公交出行路径的影响因素、选择原则与衡量标准,并结合武汉公交调查的实证分析,重新定义了公交出行的最优路径选择原则。
考虑到城市公交网络多模式、多属性的特点以及乘客出行要求多元化,论文采用GIS对公交网络进行描述,提出了多模式公交网络数据模型,将公交网络空间数据与属性数据进行了结合。通过分析乘客公交出行的行为——时间链属性,讨论了步行弧段、等待弧段、换乘弧段和行车弧段组成的出行时间阻抗,论文结合合理步行时间和步行范围内的换乘,统一转换了换乘惩罚和票价费用,构建了路径广义阻抗函数模型。论文概述了现有算法的基本特点和应用于多模式公交网络的局限性,提出了基于公交时刻表约束下的最优路径算法,采用了双层搜索的思想,并给出了算法具体步骤流程以及实证讨论研究。
通过与其它寻优算法原则所得到的结果对比分析,表明论文提出的模型算法能更好的反映乘客的出行行为心理过程和最优选择原则,为传统公交模式向多模式公交转变下的乘客出行路径选择提供了一种思路方法。
The traffic congestion and accompanying problems caused by rapid development of automobile traffic have become a common and difficult to resolve in metropolis. Giving priority to the development of public transport and enhancing its operational service levels is the key to ease urban traffic congestion. Passengers complete trips, who consider safe, fast, convenient, punctuality, economy and comfort as the important benchmark to measure the level of public transport services. The factors such as the trip behavior, trip psychology, trip purposes, trip time, environment and the individual attributes have changed greatly. The shortest bus path in a narrow sense has been difficult to guide the bus traveler.
Combining the development level and trends of urban public transit system, the paper analyzes the mode composition, operational characteristics and schedules property of public transit system, and describes from several aspects of the characteristics of network unicorn, transfer, bus lines arc and time costs etc. Passengers will consider themselves preferences, trip purpose, the external environment and other factors, and judge comprehensively according to their own experience and real-time limited information. From the behavior psychological processes of the passengers traveling, the paper summarizes and analyzes the impact factors, principles of selection and measurement standards of trip path, and re-defines the principle of the optimal path selection through an empirical analysis of the survey in Wuhan.
Taking into account the multi-mode and multi-attribute characteristics of urban public transit network, and passenger trip diversification, the paper uses GIS to describe the public transit network and proposes multi-modal transit network data model, which combines the spatial data and attribute data together. By analyzing the trip time chain property of passengers behavior, and discussing the time impedance consist of foot arcs, waiting arcs, transfer arc segment and traveling arc sections, the paper builds a generalized impedance function model of path considering a reasonable walking distance and the transfers with converting transfer penalty and fare cost unifiedly. The paper outlines the basic characteristics and limitations of existing algorithms applying to the multi-modal public transit network, and proposes an optimal path algorithm based on public transit timetables, which uses a double-search idea, and gives specific steps of the algorithm flow as well as the empirical study.
Comparing with the results obtained from the other algorithms and principles shows that the proposed model algorithm can reflect passenger travel behavior psychological processes and the optimal choice principles much better, the paper provides an alternative method for the selection of passengers' trip path under the situation of changing form the traditional bus transit models to multi-mode.
引文
[20]Mark Hickman.Robust Passenger Itinerary Planning Using Transit AVL Data[J].The 82nd Annual Meeting of the Transportation Research Board.January,2003.
[21]ShuGuang Li,YanMing Su.Optimal transit path finding algorithm based on geographic information system[C].2003,IEEE,1670-1673.
[22]Fang Zhao,Large-Scale Transit Network Optimization by Minimizing User Cost and Transfers[J].Journal of Public Transportation,Vol.9,No.2,2006,107-129.
[23]Jiamin Zhao.Maged Dessouky.Satish Bukkapatnam.Optimal Slack Time for Schedule-Based Transit Operations[J].Transportation Science.Vol.40,No.4,November 2006,pp.529-539.
[24]Christopher Cherry,Mark Hickman,Anirudh Garg.Design of a Map-Based Transit Itinerary Planner[J].Journal of Public Transportation,Vol.9,No.2,2006.45-68.
[25]WU Qiujin,Hartley J.Using K-Shortest Paths Algorithms to Accommodate User Preferences in the Optimization of Public Transport Travel[C],The 8th International Conference on Applications of Advanced Technologies in Transportation Engineering.U.S:ASCE,2004,181-186.
[26]Desmond Rainsford,William A.Mackaness.Mobile Journey Planning for Bus Passengers[J].GIScience 2002,LNCS 2478,2002:228-242.
[27]Sang Ngnyen,Stefano Pallottino,Federico Malucelli.A Modeling Framework for Passenger Assignment on a Transport Network with Timetables[J].Transportation Science Vol.35,No.3,August 2001:238-249.
[28]Agostino Nuzzolo,Francesco Russo,Umberto Crisalli.A Doubly Dynamic Schedule-based Assignment Model for Transit Networks[J].Transportation Science.Vol.35,No.3,August 2001:268-285.
[29]C.O.Tong,S.C.Wong.A stochastic transit assignment model using a dynamic schedule-based network[J].Transportation Research Part B,1999,33:107-121.
[30]冯林,孙宇哲.基于层次空间推理的公交最优乘车方案[J].计算机工程,2005,31(21):55-57.
[31]侯刚,周宽久.基于换乘次数最少的公交网络最优路径模型研究[J].计算机技术与发展.2008,18(1):44-47.
[32]张国伍,钱大琳.公共交通线路网多条最短路径算法[J].系统工程理论与实践,1992,12(4):22-26.
[33]Koncz N,Greenfeld J,Mouskos K.A Strategy for Solving Static Multiple Optimal Path Transit Network Problems[J].Journal of Transportation Engineering,1996,122(3):218-225.
[34]苏爱华,施法中.公交网络换乘问题的一种实现[J].工程图学学报,2005,4:55-59.
[35]郑朝晖.公交网络中最优路径算法的探索[J].太原师范学院学报(自然科学版),2008.7(2):37-43.
[36]张林峰,范炳全,吕智林.公交网络换乘矩阵的分析与算法[J].系统工程,2003,21(6):92-96.
[37]闫小勇,牛学勤.公交网络多路径选择启发式算法研究[J].城市交通,2005,3(3):23-26.
[38]胡霍真,戴光明,李颖.公交网络的最短路径算法及实现[J].微机发展,2005,15(9):21-23.
[39]扈震,张发勇,刘书良.城市公交换乘数据模型研究及算法实现[J].电信网技术,2007,4:71-74.
[40]王杰臣,毛海成等.图的节点-弧段联合结构表示法及其在GIS最优路径选取中的应用[J].测绘学报,2000,29(1):47-51.
[41]Friedrich,M.,Wekeck,S.,A schedule-based Transit Assignment Model addressing the Passengers' Choice among competing Connections,Proceedings of Conference[J]."The Schedule-Based approach in Dynamic Transit Modeling:Theory and Applications",Ischia,2002:159-173.
[42]高为民.基于蚂蚁算法的公交网络最短路径问题研究[J].交通与计算机,2007,25(1):94-96.
[43]张帅,彭玉青等.蚂蚁算法在公交查询最短路径求法中的应用[J].华中科技大学学报(自然科学版),2003,31:313-315.
[44]卜雷,蒲云等.城市公交车路线选择的遗传算法[J].世界科技研究与发展,2004,26(1):52-54
[45]Shinhae LEE,Seungjae LEE.A transit assignment model on stochastic networks[J].Journal of the Eastern Asia Society for Transportation Studies,2003,5:1635-1646.
[46]Zhan Guo,Nigel H.M.Wilson Modeling the Effects of Transit System Transfers on Travel Behavior:The Case of Commuter Rail and Subway in Downtown Boston[C].TRB 2007,Annual Meeting CD-ROM.
[47]郭寒英,石红国.考虑出行者心理的城市公共交通适应性探讨[J].人类工效学,2006,12(1):11-13.
[48]闻辉,刘岳峰,郑江华等.基于时间链的公交网络数据模型研究[J].地理与地理信息科学,2005,21(3):35-38.
[49]Angelica Lozano,Giovanni Storchi.Shortest viable path algorithm in multimodal networks [J].Transportation Research Part A,2001,35(3):225-241.
[50]廖楚江,蔡忠亮,杜清运,王长耀.基于最少换乘的公交最优路径算法的设计与实现[J].武汉大学学报(信息科学版),2005,31(10):904-907.
[51]钱臻,陆化普.一种公交网络客流分配方法及其实用性研究[J].清华大学学报(自然科学版),2005,45(9):1170-1174.
[52]Friedrich,Hofs(a|¨)β,Wekeck.Timetable-based Transit Assignment Using Branch &Bound[C].2001,TRB.
[53]C.O.Tong and S.C.Wang."Minimum path algorithms for a schedule-based transit network with a general fare structure," in Niguel H.M.Wilson and Agostino Nuzzolo(Eds.),Schedule-based Dynamic Transit Modeling:Theory and Applications,Dordrecht:Kluwer,2004:241-261.
[54]C.O.Tong and A.J.Richardson."A computer model for finding the time-dependent minimum path in a transit system with fixed schedules,"[J]Journal of Advanced Transportation,1984,18(2):145-161.
[55]Ruihong Huang:A Schedule-based Path finding Algorithm for Transit Networks Using Pattern First Search.[J].Geoinformatica.2007,11:269-285.
[56]葛亮,王炜,杨明,邓卫.基于站点的公交网络配流实用模型与算法研究[J].公路交通科技,2004,21(10):105-108.
[57]张生瑞,严海.城市公共交通规划的理论与实践[M].北京:中国铁道出版社,2007,8.
[58]陈小鸿.城市客运交通系统[M]上海:同济大学出版社,2008.
[59]王炜,杨新苗等.城市公共交通系统规划方法与管理技术[M].科学出版社,2002.
[60]徐循初.城市道路与交通规划[M].北京:中国建筑工业出版社,2007.
[61]李永亮.基于蚁群算法的公交出行方案研究[D].北京交通大学硕士论文,2008.
[62]城市公共交通分类标准CJJ/T 114-2007[S].中华人民共和国建设部,2007.
[63]武汉公交查询-811路[EB/OL].[2009-06-09].http://www.8684.com/line/811lu.html
[64]刘光明,蔡先华等.一种城市公交查询的算法及其应用[J].交通运输工程与信息学报,2005.3(2):87-91.
[65]李林波,吴兵.交通方式选择中心理因素影响分析[J].山东交通学院学报,2003,11(3):27-31.
[66]王凌.城市公交乘客信息系统研究[M].西安:西南交通大学,2007.
[67]网上调查的优势与劣势分析[EB/OL].[2009-07-09].http://www.zjol.com.cn/05cjr/system/2006/03/20/006524749.shtml
[68]空调车票价期待”破冰”[EB/OL].[2009-10-4].http://news.cjn.cn/ttdd/200908/t975136.htm
[69]王家耀.空间信息系统原理[M].北京:科学出版社,2001.
[70]王静霞,张国华,黎明.城市智能公共交通管理系统[M].北京:中国建筑工业出版社,2008.
[71]毕军,付梦印,张宁河.一种改进的蚁群算法求解最短路径问题[J].机算机工程与应用2003,3:107-109.
[72]苏莹,王英杰等.一种建立公交网络的最短路径改进算法[J].地球信息科学,2005,7(2):99-104.
[73]COLORNI ALBERTO,DORIGOM,MANIEZZO.Distributed optimization by ant colonies [C].Proc.of the First European Conf.on Artificial Life.Paris:Elsevier Publishing,1991:134-142.
[74]Marco Dorigo,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperating agents[J].IEEET ransactions on System,Man,and Cybernetics,Part B,1996,26(1):29-41.
[75]尹朝庆.人工智能方法与应用[M].武汉:华中科技大学出版社,2007.
[76]卢厚清,张永利,李宏伟等.一种改进的蚁群求解算法[J]东南大学学报(自然科学版)2006,36 sup(1):176-180.
[77]HaGERSTRANDT.What about people in regional science[J].Papers of the Regional Science Association,1970,(24):1-21.
[78]GOODCHILD M EGIS and transportation:status and challenges[J].Geolnformatica,2000,4(2):127-139.
[79]THORLACIUS P.Time-and-SpaceModeling of PublicTransport Systems Using the New Features of the ArcInfo Version 7.1 ARC NETWORK Module[C].ESRI Users Conference,1998.
[80]杨明,王炜,陈学武等.基于GIS的城市公交出行时间链研究[J].公路交通科技,2004,21(5):117-120.
[81]陆锋.基于层次空间推理的交通网络行车最优路径算法[J].武汉测绘科技大学学报,2000,25(3):226-232.
[21]ShuGuang Li,YanMing Su.Optimal transit path finding algorithm based on geographic information system[C].2003,IEEE,1670-1673.
[22]Fang Zhao,Large-Scale Transit Network Optimization by Minimizing User Cost and Transfers[J].Journal of Public Transportation,Vol.9,No.2,2006,107-129.
[23]Jiamin Zhao.Maged Dessouky.Satish Bukkapatnam.Optimal Slack Time for Schedule-Based Transit Operations[J].Transportation Science.Vol.40,No.4,November 2006,pp.529-539.
[24]Christopher Cherry,Mark Hickman,Anirudh Garg.Design of a Map-Based Transit Itinerary Planner[J].Journal of Public Transportation,Vol.9,No.2,2006.45-68.
[25]WU Qiujin,Hartley J.Using K-Shortest Paths Algorithms to Accommodate User Preferences in the Optimization of Public Transport Travel[C],The 8th International Conference on Applications of Advanced Technologies in Transportation Engineering.U.S:ASCE,2004,181-186.
[26]Desmond Rainsford,William A.Mackaness.Mobile Journey Planning for Bus Passengers[J].GIScience 2002,LNCS 2478,2002:228-242.
[27]Sang Ngnyen,Stefano Pallottino,Federico Malucelli.A Modeling Framework for Passenger Assignment on a Transport Network with Timetables[J].Transportation Science Vol.35,No.3,August 2001:238-249.
[28]Agostino Nuzzolo,Francesco Russo,Umberto Crisalli.A Doubly Dynamic Schedule-based Assignment Model for Transit Networks[J].Transportation Science.Vol.35,No.3,August 2001:268-285.
[29]C.O.Tong,S.C.Wong.A stochastic transit assignment model using a dynamic schedule-based network[J].Transportation Research Part B,1999,33:107-121.
[30]冯林,孙宇哲.基于层次空间推理的公交最优乘车方案[J].计算机工程,2005,31(21):55-57.
[31]侯刚,周宽久.基于换乘次数最少的公交网络最优路径模型研究[J].计算机技术与发展.2008,18(1):44-47.
[32]张国伍,钱大琳.公共交通线路网多条最短路径算法[J].系统工程理论与实践,1992,12(4):22-26.
[33]Koncz N,Greenfeld J,Mouskos K.A Strategy for Solving Static Multiple Optimal Path Transit Network Problems[J].Journal of Transportation Engineering,1996,122(3):218-225.
[34]苏爱华,施法中.公交网络换乘问题的一种实现[J].工程图学学报,2005,4:55-59.
[35]郑朝晖.公交网络中最优路径算法的探索[J].太原师范学院学报(自然科学版),2008.7(2):37-43.
[36]张林峰,范炳全,吕智林.公交网络换乘矩阵的分析与算法[J].系统工程,2003,21(6):92-96.
[37]闫小勇,牛学勤.公交网络多路径选择启发式算法研究[J].城市交通,2005,3(3):23-26.
[38]胡霍真,戴光明,李颖.公交网络的最短路径算法及实现[J].微机发展,2005,15(9):21-23.
[39]扈震,张发勇,刘书良.城市公交换乘数据模型研究及算法实现[J].电信网技术,2007,4:71-74.
[40]王杰臣,毛海成等.图的节点-弧段联合结构表示法及其在GIS最优路径选取中的应用[J].测绘学报,2000,29(1):47-51.
[41]Friedrich,M.,Wekeck,S.,A schedule-based Transit Assignment Model addressing the Passengers' Choice among competing Connections,Proceedings of Conference[J]."The Schedule-Based approach in Dynamic Transit Modeling:Theory and Applications",Ischia,2002:159-173.
[42]高为民.基于蚂蚁算法的公交网络最短路径问题研究[J].交通与计算机,2007,25(1):94-96.
[43]张帅,彭玉青等.蚂蚁算法在公交查询最短路径求法中的应用[J].华中科技大学学报(自然科学版),2003,31:313-315.
[44]卜雷,蒲云等.城市公交车路线选择的遗传算法[J].世界科技研究与发展,2004,26(1):52-54
[45]Shinhae LEE,Seungjae LEE.A transit assignment model on stochastic networks[J].Journal of the Eastern Asia Society for Transportation Studies,2003,5:1635-1646.
[46]Zhan Guo,Nigel H.M.Wilson Modeling the Effects of Transit System Transfers on Travel Behavior:The Case of Commuter Rail and Subway in Downtown Boston[C].TRB 2007,Annual Meeting CD-ROM.
[47]郭寒英,石红国.考虑出行者心理的城市公共交通适应性探讨[J].人类工效学,2006,12(1):11-13.
[48]闻辉,刘岳峰,郑江华等.基于时间链的公交网络数据模型研究[J].地理与地理信息科学,2005,21(3):35-38.
[49]Angelica Lozano,Giovanni Storchi.Shortest viable path algorithm in multimodal networks [J].Transportation Research Part A,2001,35(3):225-241.
[50]廖楚江,蔡忠亮,杜清运,王长耀.基于最少换乘的公交最优路径算法的设计与实现[J].武汉大学学报(信息科学版),2005,31(10):904-907.
[51]钱臻,陆化普.一种公交网络客流分配方法及其实用性研究[J].清华大学学报(自然科学版),2005,45(9):1170-1174.
[52]Friedrich,Hofs(a|¨)β,Wekeck.Timetable-based Transit Assignment Using Branch &Bound[C].2001,TRB.
[53]C.O.Tong and S.C.Wang."Minimum path algorithms for a schedule-based transit network with a general fare structure," in Niguel H.M.Wilson and Agostino Nuzzolo(Eds.),Schedule-based Dynamic Transit Modeling:Theory and Applications,Dordrecht:Kluwer,2004:241-261.
[54]C.O.Tong and A.J.Richardson."A computer model for finding the time-dependent minimum path in a transit system with fixed schedules,"[J]Journal of Advanced Transportation,1984,18(2):145-161.
[55]Ruihong Huang:A Schedule-based Path finding Algorithm for Transit Networks Using Pattern First Search.[J].Geoinformatica.2007,11:269-285.
[56]葛亮,王炜,杨明,邓卫.基于站点的公交网络配流实用模型与算法研究[J].公路交通科技,2004,21(10):105-108.
[57]张生瑞,严海.城市公共交通规划的理论与实践[M].北京:中国铁道出版社,2007,8.
[58]陈小鸿.城市客运交通系统[M]上海:同济大学出版社,2008.
[59]王炜,杨新苗等.城市公共交通系统规划方法与管理技术[M].科学出版社,2002.
[60]徐循初.城市道路与交通规划[M].北京:中国建筑工业出版社,2007.
[61]李永亮.基于蚁群算法的公交出行方案研究[D].北京交通大学硕士论文,2008.
[62]城市公共交通分类标准CJJ/T 114-2007[S].中华人民共和国建设部,2007.
[63]武汉公交查询-811路[EB/OL].[2009-06-09].http://www.8684.com/line/811lu.html
[64]刘光明,蔡先华等.一种城市公交查询的算法及其应用[J].交通运输工程与信息学报,2005.3(2):87-91.
[65]李林波,吴兵.交通方式选择中心理因素影响分析[J].山东交通学院学报,2003,11(3):27-31.
[66]王凌.城市公交乘客信息系统研究[M].西安:西南交通大学,2007.
[67]网上调查的优势与劣势分析[EB/OL].[2009-07-09].http://www.zjol.com.cn/05cjr/system/2006/03/20/006524749.shtml
[68]空调车票价期待”破冰”[EB/OL].[2009-10-4].http://news.cjn.cn/ttdd/200908/t975136.htm
[69]王家耀.空间信息系统原理[M].北京:科学出版社,2001.
[70]王静霞,张国华,黎明.城市智能公共交通管理系统[M].北京:中国建筑工业出版社,2008.
[71]毕军,付梦印,张宁河.一种改进的蚁群算法求解最短路径问题[J].机算机工程与应用2003,3:107-109.
[72]苏莹,王英杰等.一种建立公交网络的最短路径改进算法[J].地球信息科学,2005,7(2):99-104.
[73]COLORNI ALBERTO,DORIGOM,MANIEZZO.Distributed optimization by ant colonies [C].Proc.of the First European Conf.on Artificial Life.Paris:Elsevier Publishing,1991:134-142.
[74]Marco Dorigo,Maniezzo V,Colorni A.The ant system:optimization by a colony of cooperating agents[J].IEEET ransactions on System,Man,and Cybernetics,Part B,1996,26(1):29-41.
[75]尹朝庆.人工智能方法与应用[M].武汉:华中科技大学出版社,2007.
[76]卢厚清,张永利,李宏伟等.一种改进的蚁群求解算法[J]东南大学学报(自然科学版)2006,36 sup(1):176-180.
[77]HaGERSTRANDT.What about people in regional science[J].Papers of the Regional Science Association,1970,(24):1-21.
[78]GOODCHILD M EGIS and transportation:status and challenges[J].Geolnformatica,2000,4(2):127-139.
[79]THORLACIUS P.Time-and-SpaceModeling of PublicTransport Systems Using the New Features of the ArcInfo Version 7.1 ARC NETWORK Module[C].ESRI Users Conference,1998.
[80]杨明,王炜,陈学武等.基于GIS的城市公交出行时间链研究[J].公路交通科技,2004,21(5):117-120.
[81]陆锋.基于层次空间推理的交通网络行车最优路径算法[J].武汉测绘科技大学学报,2000,25(3):226-232.