一种公交网络最佳出行路线选择算法  

A Palette Images Encryption Algorithm Based on Chaotic Maps

作　　者：伍雁鹏[1] 刘水强[1] 雷军程[1] 

机构地区：[1]邵阳学院网络中心,湖南邵阳422000

出　　处：《湖南科技学院学报》2008年第4期119-121,共3页Journal of Hunan University of Science and Engineering

基　　金：湖南省教育厅重点资助项目06A066;邵阳市科技计划项目(53J07)

摘　　要：随着城市公交网络的扩展,选择合适的出行路线越来越重要。本文提出一种以最短出行时间、最少换乘次数、最小出行费用为目标的公交路线选择算法。在北京公交网络的试算结果表明了该算法效率高。While the public transit network of cities is growing up, finding out a proper traffic path is getting more and more important. A public tr.affic path searching algorithm is present with targets of the shortest traffic time, the minimal transfer times, and the least traffic cost. Experimental results of Beijing public transit network show the algorithm is efficient.

关 键 词：公交网络 公交换乘 出行路线 

分 类 号：U491[交通运输工程—交通运输规划与管理]