Effective route planning in road networks using multi constraint routing algorithm

Today, applications that take the congestions caused by traffic jams into account already exist. During rush hour, it is common that multiple congestions occur on the road network. If the number of traffic jams is too big, the radio stations that transmit TMC messages to the end user often only report the longest traffic jams. Those applications use the Traffic Message Channel (TMC) technique to calculate a route around the congestion whenever the application receives a message about a traffic jam being present. The study for finding the optimal shortest path on graphs with nonnegative weights has taken many forms. The weights of a road network are usually either the length of the arcs or the time it takes to traverse the arc from one vertex to another. The latter depending on the length of the arc and the speed a vehicle is allowed to travel. The majority of route planning applications use the shortest path as a synonym for the fastest path. The Multi Constraint algorithm uses three arrays to calculate the shortest path. The first one contains the neighbors of each node. The second array stores the number of neighbors each node has, and the third contains the link weights. In order for the algorithm to work, the road network has to have all these arrays available.