基于双向搜索的公交路径选择算法及优化模型  

Selection Algorithm and Optimum Model of Public Transportation Routes Based on Two-Way Search

作　　者：张玉春[1] 韩秀华[2] 臧雪柏[3] 

机构地区：[1]吉林大学公共计算机教学与研究中心,长春130025 [2]吉林大学交通学院,长春130025 [3]吉林大学计算机科学与技术学院,长春130012

出　　处：《吉林大学学报（信息科学版）》2009年第6期579-584,共6页Journal of Jilin University（Information Science Edition）

基　　金：国家十一五科技支撑计划基金资助项目(2006BAC21B01-4);吉林省科技发展计划基金资助项目(20080527)

摘　　要：为了解决人们出行公交路径选择问题,分析了公交网络的特点,对最短路径常用算法进行比较,提出一种基于双向搜索的公交网络路径选择算法。为了选择最优路径,综合考虑出行时间、出行费用和换乘次数等因素,给出一个综合评价指数模型,并用算例对算法和模型的可行性进行验证。基于数据库理论,算法用数据库表示公交网络,用数据库查询技术实现最优乘车路经选择,易于实现,执行效率较高。In order to solve the public transportation route choice problem, the feature of public transportation network, compares algorithms of shortest route, and selection algorithm of public transportation network routes is analyzed based on two-way search. In order to select optimum route, thinking about the factors which are time of transfers, cost of running and times of transfers, a compound evaluation index model is obtained. An example is given to validate possibility of the algorithm and the model. Based on the database theory, the algorithm expresses the public transportation network with the database, realizes the most superior riding pass choice with the database inquiry technology, it is easy to realize, and to be efficient.

关 键 词：公交网络 最短路径 最优路径 广度优化搜索 综合评价指数模型 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]