Lightweight Computation of Overlaid Traffic Flows by Shortest Origin-Destination Trips

Hiroyuki GOTO  Yohei KAKIMOTO  Yoichi SHIMAKAWA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.1   pp.320-323
Publication Date: 2019/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.320
Type of Manuscript: LETTER
Category: General Fundamentals and Boundaries
road network,  traffic flow,  shortest path,  origin-destination trip,  GIS,  

Full Text: PDF(1.3MB)
>>Buy this Article

Given a network G(V,E), a lightweight method to calculate overlaid origin-destination (O-D) traffic flows on all edges is developed. Each O-D trip shall select the shortest path. While simple implementations for single-source/all-destination and all-pair trips need O(L·n) and O(L·n2) in worst-case time complexity, respectively, our technique is executed with O(m+n) and O(m+n2), where n=|V|, m=|E|, and L represents the maximum arc length. This improvement is achieved by reusing outcomes of priority queue-based algorithms. Using a GIS dataset of a road network in Tokyo, Japan, the effectiveness of our technique is confirmed.