摘要
在采用传统的公共交通路网描述方法的公交网络中,会出现大量两节点间有多条同向边的情况,这使得无法求解公交网络中的最短路径问题.有鉴于此,文中提出了一种新的公交路网描述方法,该方法克服了以上问题,使得所有经典的最短路径算法都能够用于公交诱导系统.在此基础上设计了3个单目标和一个多目标公交诱导模型来满足不同乘客的需求,同时对文中提出的描述方法和模型的有效性进行了证明.最后,以广州市的公交线路网络为例,对所提出的公交诱导模型进行了试验,结果表明所提出的方法和模型是十分有效的.
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 transportation networks. To solve this problem, this paper brings forward a new description of public transportation networks, by which all classic algorithms for the shortest path problem can be applied to the public transportation guidance system. Moreover, three single-objective and a multi-objective public transportation guidance models based on this description are proposed to satisfy models are then proved, and the proposed dicating that the proposed description and different passengers. The effectiveness of the proposed description and models are finally implemented in the public networks of Guangzhou, inmodels are very effective.
出处
《华南理工大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2005年第9期41-44,共4页
Journal of South China University of Technology(Natural Science Edition)
基金
华南理工大学自然科学基金资助项目(E5320271)
关键词
公共交通
交通网络
诱导模型
最短路径
public transportation
transportation network
guidance model
shortest path