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

Authors:
Hsu-Hao Yang;Yen-Liang Chen
Affiliations:
-;-
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2004

Citing 5
Cited 1

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
The quickest path problem

Computers and Operations Research
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Finding the k Shortest Paths

SIAM Journal on Computing
Shortest Path Algorithms: An Evaluation Using Real Road Networks

Transportation Science

Finding K shortest looping paths in a traffic-light network

Computers and Operations Research

Quantified Score

Hi-index	0.98

Visualization

Abstract

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.