Improved Chicken Swarm Optimization Algorithm to Solve the Travelling Salesman Problem

Fayçal Chebihi, Mohammed essaid Riffi, Amine Agharghor, Soukaina Cherif Bourki Semlali, Abdelfattah Haily

Abstract


This paper proposes a novel discrete bio-inspired chicken swarm optimization algorithm (CSO) to solve the problem of the traveling salesman problem (TSP) which is one of the most known problems used to evaluate the performance of the new metaheuristics. This problem is solved by applying a local search method 2-opt in order to improve the quality of the solutions. The DCSO as a swarm system of the algorithm increases the level of diversification, in the same way the hierarchical order of the chicken swarm and the behaviors of chickens increase the level of intensification. In this contribution, we redefined the basic different operators and operations of the CSO algorithm. The performance of the algorithm is tested on a symmetric TSP benchmark dataset from TSPLIB library. Therefore, the algorithm provides good results in terms of both optimization accuracy and robustness comparing to other metaheuristics.


Keywords


TSP,2-OPT, CSO, DCSO, TSPLIB,NP-HARD

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v12.i3.pp1054-1062

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics