IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
Lightweight Computation of Overlaid Traffic Flows by Shortest Origin-Destination Trips
Hiroyuki GOTOYohei KAKIMOTOYoichi SHIMAKAWA
Author information
JOURNALS RESTRICTED ACCESS

2019 Volume E102.A Issue 1 Pages 320-323

Details
Abstract

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.

Information related to the author
© 2019 The Institute of Electronics, Information and Communication Engineers
Previous article
feedback
Top