ESTIMATION OF SHORTEST ROUTE BASED ON TIME IN A ROAD NETWORK

摘要

The invention relates to a device (DEC) for rapidly estimating the shortest route based on time between a source node (Ns) and a destination node (Nd) in a graph at a given time (T0), which carries out a bi-directional search of the nodes along the shortest route, including a forward search and a backward search. Means (MT1, MT2, MT3) are provided for determining, in a forward search, the shortest route times between the source node and nodes to be explored based on functions of provisional route time (Fc) varying in time, which are respectively associated with the oriented graph arcs. Means (MT1, MT2) determine, in a backward search, the shortest route times between nodes to be explored in a backward search and the destination node based on static functions (Binf) respectively associated with the oriented graph arcs.