Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
