Open AccessComparative study between elephant herding optimization (EHO) and U-turning ant colony optimization (U-TACO) in solving symmetric traveling salesman problem (STSP)
Author(s) -
Saman M. Almufti,
Ridwan Boya Marqas,
Renas Rajab Asaad
Publication year - 2019
Publication title -
journal of advanced computer science and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-4332
DOI - 10.14419/jacst.v8i2.29403
Subject(s) - ant colony optimization algorithms , travelling salesman problem , metaheuristic , herding , swarm intelligence , mathematical optimization , swarm behaviour , computer science , optimization problem , parallel metaheuristic , extremal optimization , clan , ant colony , artificial intelligence , meta optimization , algorithm , particle swarm optimization , mathematics , geography , forestry , sociology , anthropology
Swarm Intelligence is an active area of researches and one of the most well-known high-level techniques intended to generat, select or find a heuristic that optimize solutions of optimization problems.Elephant Herding optimization algorithm (EHO) is a metaheuristic swarm based search algorithm, which is used to solve various optimi-zation problems. The algorithm is deducted from the behavior of elephant groups in the wild. Were elephants live in a clan with a leader matriarch, while the male elephants separate from the group when they reach adulthood. This is used in the algorithm in two parts. First, the clan updating mechanism. Second, the separation mechanism.U-Turning Ant colony optimization (U-TACO) is a swarm-based algorithm uses the behavior of real ant in finding the shortest way be-tween its current location and a source of food for solving optimization problems. U-Turning Ant colony Optimization based on making partial tour as an initial state for the basic Ant Colony algorithm (ACO).In this paper, a Comparative study has been done between the previous mentioned algorithms (EHO, U-TACO) in solving Symmetric Traveling Salesman Problem (STSP) which is one of the most well-known NP-Hard problems in the optimization field. The paper pro-vides tables for the results obtained by EHO and U-TACO for various STSP problems from the TSPLIB95.