The first K shortest unique-arc walks in a traffic-light network

Hsu Hao Yang, Yen Liang Chen

研究成果: 雜誌貢獻期刊論文同行評審

3 引文 斯高帕斯(Scopus)

摘要

In this article, we present an algorithm to find the first K shortest unique-arc walks in a traffic-light network. Each node of the present network is associated with a repeated sequence of different windows to model operations of traffic signals and intersection movements. Unlike conventional simple or looping paths, we refer to the paths in this paper as unique-arc walks because they may include repeated nodes but will exclude repeated arcs. Using the heap structure, we develop an algorithm to find the first K shortest unique-arc walks in time O(Kr|V|3|A|), where |V| is the number of nodes, |A| is the number of arcs, and r represents the number of different windows associated with a node.

原文???core.languages.en_GB???
頁(從 - 到)1453-1464
頁數12
期刊Mathematical and Computer Modelling
40
發行號13
DOIs
出版狀態已出版 - 12月 2004

指紋

深入研究「The first K shortest unique-arc walks in a traffic-light network」主題。共同形成了獨特的指紋。

引用此