Reliable pre-trip multi-path planning and dynamic adaptation for a centralized road navigation system

In this paper, an integrated approach combining offline pre-computation of optimal candidate paths with online path retrieval and dynamic adaptation is proposed for a dynamic navigation system in a centralized system architecture. Based on a static traffic data file, a partially disjoint candidate path set is constructed prior to the trip using a heuristic link weight increment method. This method satisfies reasonable path constraints that meet the drivers' preferences as well as alternative path constraints that limit the joint failure probability for candidate paths. The characteristics of the proposed algorithm are the following: 1) the response time for online navigation demand is nearly linear with network size and less dependent on system load; 2) the veracity of the pre-trip route plan based on the static data file is improved by taking travel time reliability into account; and 3) system optimization can be approximated without sacrificing driver preferences. The algorithm is tested on randomly generated road networks and the numerical results show the efficiency of the approach.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[3]  Andrés Marzal,et al.  Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison , 1999, WAE.

[4]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[5]  T de la Barra,et al.  Multidimensional path search and assignment , 1993 .

[6]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[7]  Anand Srinivasan,et al.  A New Algorithm to Compute Alternate Paths in Reliable OSPF ( ROSPF ) , 2002 .

[8]  Erhan Erkut,et al.  On finding dissimilar paths , 2000, Eur. J. Oper. Res..

[9]  Ismaïl Chabini,et al.  Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks , 2002, IEEE Trans. Intell. Transp. Syst..

[10]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[11]  Nagui M. Rouphail,et al.  A Decision Support System for Dynamic Pre-Trip Route Planning , 1996 .

[12]  Don J. Torrieri.  Algorithms for finding an optimal set of short disjoint paths in a communication network , 1992, IEEE Trans. Commun..

[13]  Chi-Kang Lee,et al.  A multiple-path routing strategy for vehicle route guidance systems , 1994 .

[14]  S. H. Ahmad.  A Simple Technique for Computing Network Reliability , 1982, IEEE Transactions on Reliability.