基于GIS和最小交通阻抗的公交出行最佳路径算法

The Optimal Path Algorithm for Public Transit Trip Based on GIS and Minimal Traffic Impedance

分析了现有公交出行最佳路径算法,并针对现有算法不完善的地方,根据乘客的出行心理,利用G IS的空间分析功能,提出了一种基于最小交通阻抗的公交出行最佳路径算法。首先根据城市公共交通网络的特点抽象出合理的公交网络模型,建立了此网络的拓扑关系,并用有效的数据结构存储此公交网络图;然后根据乘客的出行特点确定了合理的交通阻抗函数;为了进一步提高搜索效率设定了节点限制搜索区域;最后对算法的仿真实现证明了此算法的可行性和有效性。

The deficiency of current optimal path algorithms for public transit trip was analyzed. Taking passengers＇ trip psychology into account, an optimal path algorithm for public transit trip based on the spatial analytic functions of GIS and minimal traffic impedance was put forward to improve the deficiency of conventional algorithms. At first the reasonable public traffic network model was founded according to the characteristics of urban public traffic network, and topologic relations of the network were created. The valid data structure was adopted in storing the public traffic network graph. Secondly, the rational impedance function was determined according to passengers＇ trip characteristics. And the node-searched scope was confined reasonably in order to improve the searching efficiency. At last the realization of the algorithm proves the algorithm was feasible and valid.