剩余最短路径算法应用于起迄点交通调查统计

从研究旅行者的出行行为特征出发，并结合道路网拓扑关系，提出一种全新的剩余最短路径算法，用于起迄点交通量调查统计．对于每个起迄点对，先找到连接这个起迄点对的最短路径，再把这个路径上调查到的交通量从路段上转移到该起迄点对上．再寻找剩余的下一个最短路径，也把相应的路径调查交通量从路段上转移到起迄点对上．这样重复下去，直到该起迄点对的交通量全部从调查路段上转移至起迄点对．该方法可以有效解决交通出行被重复统计和被遗漏的情况，还可以为今后的起迄点调查提供更合理的测点．

An Application of Residual Shortest Route Algorithm in Traffic OD Survey

Based on a study of the driver's route choice travel behavior and the properties of transportation networks,a novel algorithm of residual shortest route is proposed to support the traffic OD(origin-destination) survey.For a specific OD pair,the shortest connecting route is firstly identified,and the observed route flow is calculated and then transferred from the survey stations to the OD pair.Then the next residual shortest route is identified,and its route flow is also calculated and transferred from the survey stations to the OD pair.The process is repeated until all traffic of this OD pair is removed from the survey stations.The above procedure is adopted for all OD pairs.Furthermore,another procedure is presented to estimate the missing OD demands on the basis of the survey data.The algorithm proposed in this paper can effectively resolve the problems of double counting and data missing in OD survey.Furthermore,it can also provide more suitable survey locations in future's OD survey.