Abstract
The travelling salesman problem (TSP) is probably the most famous and extensively studied problem in the field of combinatorial optimisation. This problem is in the fields of logistics, transportation, and distribution. Since the TSP is NP-hard, many heuristics for the TSP have been developed. In this paper, we developed a novel local search heuristic, based on nearest insertion into the convex hull construction heuristic for solving Euclidean TSP. The proposed method, nearest insertion into the convex hull local search (NICH-LS) is used to improve the initial tour, which is taken from a tour construction heuristic, multi-agent reinforcement learning (MARL) heuristic, by locally manipulating the order of nodes in the consecutive partial tours of the initial tour. Changing the order of nodes in a partial tour is done via constructing the NICH tour of these nodes and replacing the partial tour with the modified partial tour, if its length is reduced. The proposed novel local search heuristic is applied to 29 benchmark instances from TSPLIB. The computational results show the efficiency of the proposed local search compared with five state-of-the-art heuristics.
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.
