Route planning via facilities with time dependent

In today´s century, people are looking for faster and efficient communication for travelling from source to destination via facilities. As the human tendency always try to go from source to cover or attend some facilities and then reach to destination within a required time. This paper focus on algorithm for optimal route planning via facility (i.e petrol, grocery etc) with time dependent shortest path. The algorithm proposed here to minimize the travel time and provide a optimal path from source to destination with the facilities come in our path. We present here an algorithm on route planning which minimize the distance as well as time from source to destination.