华南理工大学学报(自然科学版) ›› 2005, Vol. 33 ›› Issue (9): 41-44.

• • 上一篇    下一篇

公共交通路网描述方法及诱导模型设计

邹亮 徐建闽   

  1. 华南理工大学 交通学院,广东 广州 510640
  • 收稿日期:2004-11-29 出版日期:2005-09-25 发布日期:2005-09-25
  • 通信作者: 邹亮(1979-),男,博士生,主要从事智能交通系统技术方面的研究 E-mail:muscle1979@126.com
  • 作者简介:邹亮(1979-),男,博士生,主要从事智能交通系统技术方面的研究
  • 基金资助:

    华南理工大学自然科学基金资助项目(E5320271)

Description and Guidance M odel Design of Public Transportation Networks

Zou Liang  Xu Jian-min   

  1. College of Trafic and Communications,South China Univ.of Tech.,Guangzhou 510640,Guangdong,China
  • Received:2004-11-29 Online:2005-09-25 Published:2005-09-25
  • Contact: 邹亮(1979-),男,博士生,主要从事智能交通系统技术方面的研究 E-mail:muscle1979@126.com
  • About author:邹亮(1979-),男,博士生,主要从事智能交通系统技术方面的研究
  • Supported by:

    华南理工大学自然科学基金资助项目(E5320271)

摘要: 在采用传统的公共交通路网描述方法的公交网络中,会出现大量两节点问有多条同向边的情况,这使得无法求解公交网络中的最短路径问题.有鉴于此,文中提出了一种新的公交路网描述方法,该方法克服了以上问题,使得所有经典的最短路径算法都能够用于公交诱导系统.在此基础上设计了3个单目标和一个多目标公交诱导模型来满足不同乘客的需求,同时对文中提出的描述方法和模型的有效性进行了证明,最后,以广州市的公交线路网络为例,对所提出的公交诱导模型进行了试验,结果表明所提出的方法和模型是十分有效的.

关键词: 公共交通, 交通网络, 诱导模型, 最短路径

Abstract:

In the public transportation networks described by the traditional methods,there is more than one link in the same direction between two nodes.So no way can be adopted to solve the shortest path problem in public trans.portation networks.To solve this problem,this paper brings forward a new description of public tran sportation net· works,by which all classic algorithms for the shortest path problem can be applied to the public transportation gui-dance system.Moreover,three single.objective and a multi·objective public transportation guidance models based on this description are proposed to satisfy different passengers.The effectiveness of the proposed description and models are then proved,and the proposed models are finally implemented in the public networks of Guangzhou,in-dicating that the proposed description and models are very efective.

Key words: public transportation, transportation network, guidance model, shortest path