An improved 2-OPT optimisation scheme for Hamilton loop Online publication date: Thu, 03-Dec-2020
by Sun Bo; Lu Shicai; You Yongquan; Ren Chuanxiang
International Journal of Computer Applications in Technology (IJCAT), Vol. 64, No. 2, 2020
Abstract: Aiming at the problem that the traditional traffic route planning has a single target strategy and cannot be adjusted according to the actual situation, a multi-lane planning model based on Hamilton loops is proposed, which uses the characteristics of Hamilton loops to cover all nodes in the set and uses the nearest neighbour algorithm to obtain the initial loop. The improved 2-OPT algorithm avoids the problem caused by randomness and improves the efficiency of 2-OPT algorithm. In the case of considering road congestion, the introduction of speed parameters and comprehensive influence factors can give different path planning schemes according to different actual situations, and find the shortest time path and the shortest path, which makes Hamilton loop model more practical. The simulation results verify that the improved model can meet different planning requirements, achieve more targeted path planning, optimise the path planning scheme, and enhance people's travel efficiency.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook