An elitist approach for solving the traveling salesman problem using an animalmigration optimization algorithm

Authors

EZGİ ÜLKER

DOI

10.3906/elk-1705-61

Abstract

This paper presents an improved version of the animal migration optimization (AMO) algorithm for solving the traveling salesman problem (TSP), which is classified as a combinatorial NP-hard problem. AMO is one of the recent metaheuristic algorithms inspired by the migration behavior of animals and has been efficiently applied to a variety of optimization problems. The algorithm is improved by reconstructing the neighborhood topology of each animal during the migration. This modified algorithm is called the elitist animal migration optimization (ELAMO) algorithm, since elitism is introduced as a way in which the positions of the leaders are considered for the neighborhood scheme. To observe the performance of ELAMO, it is compared with AMO and some efficient algorithms. The experimental results showed that the ELAMO algorithm has improved the solution quality of AMO and has produced effective or even competitive values for the selected TSP data sets.

Keywords

Animal migration, nature-inspired metaheuristics, optimization, traveling salesman problem

First Page

605

Last Page

617

Recommended Citation

ÜLKER, EZGİ (2018) "An elitist approach for solving the traveling salesman problem using an animalmigration optimization algorithm," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 26: No. 1, Article 50. https://doi.org/10.3906/elk-1705-61
Available at: https://journals.tubitak.gov.tr/elektrik/vol26/iss1/50