Soccer game optimization for travelling salesman problem
Hindriyanto Dwi Purnomo, Charitas Fibriani, Ramos Somya, Hui‐Ming Wee · 2017
Soccer Game Optimization is a metaheuristics algorithm that integrates competitiveness and cooperation in its procedure. Soccer Game Optimization can be used to solve continuous as well as discrete problems. In this research, the Soccer Game Optimization is implemented to solve symmetric Travelling Salesman Problem. A constructed algorithm is used to initialize solutions. The move off operator implements four type of greedy local search; the 2-opt algorithm, 3-opt algorithm, greedy reconnection and sub tour rotation on a neighbor list; which can be selected one at a time. The move forward operator is based on the distance-preserving crossover. Based on 25 benchmark problems, the performance of the proposed method is compared with the self-organizing neural network, Real-Valued Antibody Network, and Genetic Algorithm. The experiment results show that the proposed method outperforms the above-mentioned algorithms in most problems. However, its computational cost is higher than above methods.