Abstract
Considering constructional algorithms for solving Traveling Salesman Problem (TSP), the solution process of Nearest Neighbor (NN) is the simplest one, but its performance is the worst. This paper proposes an improved NN algorithm for solving TSP in Euclidean Plane. Firstly, the algorithm searches four corner-nodes from all nodes, and gets a simple tour which only includes four corner-nodes, obtains four segments and their start nodes and end nodes, respectively. Then, each segment starts from current corner-node, and the algorithm selects a node as next target node from its multi-orientation nearest neighbor nodes, considering their distance and orientation comprehensively, and searching process repeatedly until each segment arrives at their end nodes. Furthermore, the algorithm inserts those rest nodes into a certain segment. At last, the algorithm connects four segments from stem to stern to form the final tour. Experimental results indicate that the proposed algorithm greatly improves the result of NN algorithm.
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.
