Abstract
According to the basic principles of the shortest route algorithm in Graphic Theory, an algorithm on the question of the optimal route for the network with restrictive path is brought forward. Firstly, the road network is transformed into the one without any restrictive conditions. Then the model for optimizing the route on the road network is built taking least traveling time as the objective. Finally, the traditional Dijkstra algorithm is used to solve the problem. The result of computer simulation shows that this method is practical and feasible. The model and its algorithm could be used to get the optimal route on the road transport network with restrictive conditions in a very short time and to realize the function of guiding drivers to the optimal route in an inducement system.
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.
