A New Method for Travelling Salesman Problem Relied on Growth Optimization
International journal of intelligent engineering and systems · 2024
This paper shows a novel method relied on growth optimization (GO) algorithm for searching the shortest tour length of the travelling salesman problem (TSP).GO is a recent algorithm relied on the idea of learning and reflecting of people in the society.To enhance performance of GO, the 2-opt local search technique is applied for adjusting the candidate solutions created by GO.The effectiveness of GO is validated on five TSP instances consisting of the 14-city, 30-city, 48-city, 52-city and 76-city.The error between the optimal tour length value obtained by GO and the best-known value for these instances is 0.0000%, 0.0000%, 0.0021%, 0.0314% and 0.0004%, respectively.Furthermore, the comparisons to the methods in the literature in term of the optimal and mean tour length values have shown that GO reaches the better values compared to other prvious methods.Thus, the proposed GO approach is a potential method for the TSP problem.