合乘出行信息检索的路径匹配算法  

Path Matching Algorithm for Carpool Information Retrieval

作　　者：翟泳[1] 杨金梁[1] 连剑[1] 樊铭渠[1] 

机构地区：[1]山东科技大学,青岛266510

出　　处：《交通与计算机》2007年第1期27-30,共4页Computer and Communications

摘　　要：研究合乘出行信息检索算法。低效率的信息交流方式制约了合乘出行方式的发展,针对现有合乘信息检索方式的不足,在区域—区域匹配算法的基础上,引入图的概念,提出了一个基于交通路网的路径匹配算法,并给出了算法复杂度分析。该算法利用交通路网中各结点间的距离关系,可以检索给定起迄点间及起迄点各自邻近结点群之间存在的出行信息,并能根据合乘出行路径特点对检索出的信息进行分析、评价和优选,以方便出行者进行合乘组织。最后用一个仿真实例表明算法的有效性。Pool travel was limited by the low efficient rideshare information communication. In order to improve the existing methodology of carpool information retrieval, on the basis of the region to region algorithm and by the use of the graph theory, an algorithm based on traffic network and its complexity analysis were presented. The algorithm, which uses the distance relation of the nodes in the traffic network, can search information of trips, between given OD points and trips which intersect groups of respective adjacent points of OD points, and can analyze, evaluate, and filter these information in the light of characteristic of carpool path so that the carpool formation is convenient for ride matching. The feasibility of the algorithm is proved by a simulation in the end.

关 键 词：合乘 信息检索 路径 算法 合乘匹配 

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