Enhancement of traveling salesman problem by hybridization of greedy and 2-opt techniques
Cheng-Fa Tsai, Yao Chiang · 2016
This investigation presents a new metaheuristic algorithm called GR-2opt, that hybridizes the greedy algorithm and the 2-opt method to solve the traveling salesman problem (TSP). The developed method integrates an excellent strategy for interactively improving the candidate solution. To confirm the presented approach, various experiments are carried out to compare the proposed algorithm with numerous well-known approaches, utilizing numerous TSP benchmark problems. Based on the results of the simulations, GR-2opt solves the traveling salesman problem significantly more effectively than other schemes. Notably, the proposed method yields an excellent solution within a very short time. As our best knowledge, the proposed TSP technique may be one of the best methods in the world currently.