“集合燃烧”算法在公交网络查询中的应用  

"Aggregate-combustion" arithmetic and its application in the query system of transit network

作　　者：王昉旸[1] 于丽娜[1] 郑保华[1] 闫心丽[2] 

机构地区：[1]沈阳药科大学药学院,辽宁沈阳110016 [2]沈阳药科大学基础学院,辽宁沈阳110016

出　　处：《辽宁工程技术大学学报（社会科学版）》2008年第4期380-382,共3页Journal of Liaoning Technical University(Social Science Edition)

摘　　要：针对如何快速查找满足乘客不同需求的最佳路线问题,提出了可以快速查找最优路线的"集合燃烧"算法。以北京公交车线路网为例,使用Matlab编程实现了"集合燃烧"算法。与其他传统算法相比,此算法处理信息量更大,运行速度更快。"集合燃烧"算法还可用于处理其他需更换交通方式的路线决策问题。For any transit network,the core issue of query system is how to find the best path quickly. This article abstracts an empower map which includes transit impedance information. ＂Aggregate--combustion arithmetic＂, based on the matrix of the map,can be used for the search for the best path. We use Matlab to search for the best path in transit network of Beijing. In comparison to other algorithms, the result can be figured out more quickly with more information. It is also useful for ＂aggregate--combustion arithmetic＂ to solve other decision--making problems.

关 键 词：“集合燃烧”算法 公交网络 最优路线 MATLAB 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]