Shortest paths in synchronized traffic-light networks

摘要

The time-constrained shortest path problem is an important generalization of the shortest path problem. The basic feature in time-constrained shortest path problem is considering when a node in the network can be visited under some time constraints. In this paper, a label-setting shortest path algorithm will be proposed to use in the synchronized traffic-light networks which uses the waiting times for green light (node costs) as well as the required times to pass the streets (link costs) to calculate the optimal routes.