公交换乘算法的仿真研究  

Simulation Research on Bus Transfer Algorithm

作　　者：刘智琦[1] 李春贵[1] 

机构地区：[1]广西工学院计算机工程系,广西柳州545006

出　　处：《计算机仿真》2011年第9期342-345,共4页Computer Simulation

基　　金：广西科技攻关计划项目(桂科攻0815001-10);广西科技开发计划项目(桂科攻0992006-13)

摘　　要：研究建立城市公交换乘查询网络问题。传统的公交换乘算法忽略了公交乘客的出行寻求优化路径的心理,并且算法的时间效率较低。为了解决上述问题,提出乘坐公交车出行的最优方案为换乘次数最少并且距离最短的线路。首先建立了公交网络及最小换乘次数的数学模型,然后运用线性规划方法建立线性规划模型,重新构造公交站点的数据结构以改进原有的最小换乘算法,得到一个新的算法并用改进算法对线性规划模型进行求解。仿真结果表明:新算法为核心的公交网络查询仿真系统,在一定程度上可以提高城市公共交通系统的服务水平,为实际设计提供依据。Study the problem of bus transfer. The traditional algorithm ignores the journey psychology of passenger and it is low efficiency. According the journey psychology of passenger, it is presented that the optimal plan for travel by bus is minimal transfer times and the shortest path. To solve the above problem, the model of public transport net- work and the model of minimal transfer times are established at first. Then linear programming is used to establish the linear programming model. At the end, the data structure of bus stations is reconstructed to improve the original algo- rithm. A new algorithm is obtained to solve linear programming model. The simulation results show that the public traffic information query simulation system with the algorithm as the core can improve service levels of the city public transport system to some degree, and it provide a theoretical basis for the design.

关 键 词：公交换乘 最优方案 最小换乘次数 线性规划 

分 类 号：TB24[一般工业技术—工程设计测绘]