Finding K shortest looping paths in a traffic-light network

Authors:
Hsu-Hao Yang;Yen-Liang Chen
Affiliations:
Department of Industrial Engineering & Management, National Chinyi Institute of Technology, Taiping, Taichung 411, Taiwan, Republic of China;Department of Information Management, National Central University, Chung-Li, Taiwan 320, Republic of China
Venue:
Computers and Operations Research
Year:
2005

Citing 4
Cited 3

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
The first K shortest unique-arc walks in a traffic-light network

Mathematical and Computer Modelling: An International Journal

An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Finding the K shortest paths in a schedule-based transit network

Computers and Operations Research
Finding the K shortest paths in a time-schedule network with constraints on arcs

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we consider a traffic-light network where every node in the network is associated with the constraint consisting of a repeated sequence of time windows. The constraint aims to simulate the operations of traffic-light control in an intersection of roads. With this kind of constraints in place, directions of routes when passing through the intersections can be formally modeled. The objective of this paper is to find the first K shortest looping paths in the traffic-light network. An algorithm of time complexity of O(rK2|V1|3) is developed, where r is the number of different windows of a node and |V1| is the number of nodes in the original network.