Notice of RetractionPractical algorithm for shortest path on large networks with time-dependent edge-length

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The shortest path problem in network has been studied widely and intensively over years, both in theoretical and in computational viewpoints. Many speed-up techniques for Dijkstra´s algorithm have been developed. However, only few of those techniques work in time-dependent networks. This paper studies how to promptly answer the shortest path between a pair of nodes over a large time-dependent road network, to cater for the increasing interest in the advanced transportation systems. A fast algorithm is proposed for an approximate time-dependent shortest path (TDSP). The proposed algorithm works on a subnetwork derived from the static shortest path between the given pair of nodes. The size of the subnetwork can be modulated according to the given traffic period for high solution quality. An extensive experimental results on a real-world environments (Singapore road network) show that the traditional algorithm is improved by up to 90% in terms of runtime. In addition, about 65% random instances can be exactly solved and most instances can be solved within the error of 3%.