Route planning via facilities in time dependent network

Present, fast growing century, includes people for fast and efficient travelling of their path from source to destination by covering at least one of the facilities in their path. As everyone in today´s scenario wants to cover their distance from source by attending some facilities in their path and then reach to destination within a required time. This paper focus on algorithm with time dependent shortest path for optimal route planning via facility (i.e petrol, grocery etc). The algorithm here includes optimal path from source to destination which minimize the travel time and provide with covering at least one facility within the required time. We present here an algorithm for route planning which minimize the travel distance as well as travel time from source to destination.