期刊文献+

公交网络多路径选择启发式算法研究 被引量:12

Study on Heuristic Algorithm for Public Transport Network Multi-Path Selection
下载PDF
导出
摘要 公交乘客出行路径选择算法是公交乘客信息系统的核心技术。建立了公交网络出行路径选择的数学模型,在Dijkstra算法和迭代惩罚法的基础上,设计了公交网络多路径选择的启发式算法,并结合实际公交网络进行了算法的验证。算法合理考虑了换乘因素和距离因素对公交出行者路径选择行为的共同影响,能够生成多条备选路径供出行者选择。对于公交乘客信息系统相关技术的研究开发具有参考价值。 Optimal path algorithm of public transport networks is a key technique in public transport passenger information system. This paper describes the path choice model of the public transport networks, designs a heuristic algorithm for the public transport network multi-path selection based on the Dijkstra's algorithm and the Iterative Penalty Method, and tests the algorithm with a real public transport network. It is found that the proposed algorithm can efficiently consider both the transfer factor and the distance factor of the path choice of public transport passengers, and can select multiple paths for public transport passengers. The conclusion can be the reference for research and development of public transport passenger information system.
出处 《城市交通》 2005年第3期23-26,共4页 Urban Transport of China
关键词 公交网络 多路径 迭代惩罚 启发式算法 public transport networks multi-path iterative penalty heuristic algorithm
  • 相关文献

参考文献8

二级参考文献22

  • 1蒋冰蕾.交通网络用户平衡模型解释初探[J].东南大学学报(自然科学版),1996,26(1):57-62. 被引量:6
  • 2卢开澄 卢华朝.图论及其应用[M].北京:清华大学出版社,1997..
  • 3Spiess H.A New Assignment Model for Transit Network[J].Transportation Research,1989,23B.
  • 4李修刚 杨晓光 王炜 邓学钧.基于GIS的城市交通规划数据库研究[M].科学出版社,2000..
  • 5Kuby M, X. Zhongyi, X. Xiaodong. A Minimax method for finding the k best differentiated paths[J]. Geographical Analysis. Vol. 29, No. 4, pp. 298-313.
  • 6Lombard K. , Church R L. The gateway shortest path problem : generating alternative routes for a corridor location problem[J]. Geographical Systems, Vol. 1 ,pp25-45.
  • 7Ahjia R K, et al. Network flows :theory, algorithms, and applications[M]. Rentive-Hall, Englewood Cliffs, NJ.
  • 8Yen J Y. Finding the k shortest loopless paths in a newwork[J]. Management Science. Vol. 17,No11,pp712-716.
  • 9Miaou S P, Chin S. M. Computing k-shortest path for nuclear spent fuel highway transportation[J]. European Journal of Operational Research. Vol. 53. pp64-80.
  • 10Shier D R. On algorithms for finding the k shortest paths in a network[J]. Networks. Vol. 17. pp341-352.

共引文献71

同被引文献49

引证文献12

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部