基于递归搜索的公交换乘算法研究  

Studies on Buses Exchange Algorithm Based on Recursive Search

作　　者：罗晟[1] 

机构地区：[1]中国地质大学信息工程学院,湖北武汉430071

出　　处：《通信技术》2010年第1期159-161,共3页Communications Technology

摘　　要：在城市的公共交通网络中,公交换乘是乘客出行的一个重要的问题。随着城市公交规模的不断扩大,有相当部分的出行难以直达,乘客必须换乘才可到达目的地。在研究公交换乘的最优路径算法时,有必要先了解乘客出行时所考虑的因素,通过对乘客出行心理、行为的研究来确定模型的优化目标和约束条件。文中从换乘算法、出行时间、出行距离等方面进行分析,在综合考虑相关因素的情况下,加权平均得出了一种最小换乘次数为主的广度优先算法,并应用于武汉号码百事通系统中。In urban traffic network, the transit exchange is the principal issue for passengers. With the on-going expansion of urban traffic scale, it is hard, to some extent, to get to the planned destination directly. However, the passengers have to exchange some buses and reach their destinations. In search of the better alternatives, it is necessary to know the related factors of the passengers and thus to determine the optimized goal and restrictions through the study of their psychology, behaviors. The paper makes its analysis on three parts： exchange algorithm, jouney time, travel distance. With all related factors and through weighing the average of minimum bases exchange, a broad optimization algorithm is obtained.

关 键 词：地理信息系统 公交换乘 数据模型 

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