Abstract
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 a algorithm on route planning which minimize the distance as well as 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.
