Improved Chicken Swarm Optimization Algorithm to Solve the Travelling Salesman Problem
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 sea...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2018-12-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02293 am a22003373u 4500 | ||
|---|---|---|---|
| 001 | ijeecs12897_9905 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Chebihi, Fayçal |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Riffi, Mohammed essaid |e author |
| 700 | 1 | 0 | |a Agharghor, Amine |e author |
| 700 | 1 | 0 | |a Cherif Bourki Semlali, Soukaina |e author |
| 700 | 1 | 0 | |a Haily, Abdelfattah |e author |
| 245 | 0 | 0 | |a Improved Chicken Swarm Optimization Algorithm to Solve the Travelling Salesman Problem |
| 260 | |b Institute of Advanced Engineering and Science, |c 2018-12-01. | ||
| 500 | |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/12897 | ||
| 520 | |a 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. | ||
| 540 | |a Copyright (c) 2018 Institute of Advanced Engineering and Science | ||
| 540 | |a http://creativecommons.org/licenses/by-nc/4.0 | ||
| 546 | |a eng | ||
| 690 | |||
| 690 | |a TSP,2-OPT, CSO, DCSO, TSPLIB,NP-HARD | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |2 local | |
| 786 | 0 | |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 12, No 3: December 2018; 1054-1062 | |
| 786 | 0 | |n 2502-4760 | |
| 786 | 0 | |n 2502-4752 | |
| 786 | 0 | |n 10.11591/ijeecs.v12.i3 | |
| 787 | 0 | |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/12897/9905 | |
| 856 | 4 | 1 | |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/12897/9905 |z Get fulltext |