Quickest Path Selection Towards the Destination in Urban Environment

For the last few decades most of the world population is heading to the urban environment that is directly effecting the every aspect of the life. The pace of increasing vehicles is greatly higher than the expansion of the road network infrastructure in the urban areas. This causes severe traffic jams and increases the time a car stays on the road. Therefore, high carbon emissions pollute cities and degrade the quality of human life. In this paper authors focus on the quickest path selection algorithm by means of considering the passing time of each junction using a weighted graph. The experimental results show that our method is more efficient than other method.