Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem
Swarm Intelligence algorithms are computational intelligence algorithms inspired from the collective behavior of real swarms such as ant colony, fish school, bee colony, bat swarm, and other swarms in the nature. Swarm Intelligence algorithms are used to obtain the optimal solution for NP-Hard pro...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Qubahan
2023-07-01
|
| Series: | Qubahan Academic Journal |
| Subjects: | |
| Online Access: | https://journal.qubahan.com/index.php/qaj/article/view/141 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832544470340468736 |
|---|---|
| author | Awaz Ahmad Shaban Jayson A. Dela Fuente Merdin Shamal Salih Resen Ismail Ali |
| author_facet | Awaz Ahmad Shaban Jayson A. Dela Fuente Merdin Shamal Salih Resen Ismail Ali |
| author_sort | Awaz Ahmad Shaban |
| collection | DOAJ |
| description |
Swarm Intelligence algorithms are computational intelligence algorithms inspired from the collective behavior of real swarms such as ant colony, fish school, bee colony, bat swarm, and other swarms in the nature. Swarm Intelligence algorithms are used to obtain the optimal solution for NP-Hard problems that are strongly believed that their optimal solution cannot be found in an optimal bounded time. Travels Salesman Problem (TSP) is an NP-Hard problem in which a salesman wants to visit all cities and return to the start city in an optimal time. In this article we are applying most efficient heuristic based Swarm Intelligence algorithms which are Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Bat algorithm (BA), and Ant Colony Optimization (ACO) algorithm to find a best solution for TSP which is one of the most well-known NP-Hard problems in computational optimization. Results are given for different TSP problems comparing the best tours founds by BA, ABC, PSO and ACO.
|
| format | Article |
| id | doaj-art-375986c5efa84bb9b40a6444d545696e |
| institution | Kabale University |
| issn | 2709-8206 |
| language | English |
| publishDate | 2023-07-01 |
| publisher | Qubahan |
| record_format | Article |
| series | Qubahan Academic Journal |
| spelling | doaj-art-375986c5efa84bb9b40a6444d545696e2025-02-03T10:12:39ZengQubahanQubahan Academic Journal2709-82062023-07-013210.48161/qaj.v3n2a141141Review of Swarm Intelligence for Solving Symmetric Traveling Salesman ProblemAwaz Ahmad Shaban0Jayson A. Dela Fuente1Merdin Shamal Salih2Resen Ismail Ali3Researcher, Duhok, Kurdistan Region - IraqNorthern Negros State College of Science Technology, PhilippinesResearcher, Duhok, Kurdistan Region - IraqResearcher, Duhok, Kurdistan Region - Iraq Swarm Intelligence algorithms are computational intelligence algorithms inspired from the collective behavior of real swarms such as ant colony, fish school, bee colony, bat swarm, and other swarms in the nature. Swarm Intelligence algorithms are used to obtain the optimal solution for NP-Hard problems that are strongly believed that their optimal solution cannot be found in an optimal bounded time. Travels Salesman Problem (TSP) is an NP-Hard problem in which a salesman wants to visit all cities and return to the start city in an optimal time. In this article we are applying most efficient heuristic based Swarm Intelligence algorithms which are Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Bat algorithm (BA), and Ant Colony Optimization (ACO) algorithm to find a best solution for TSP which is one of the most well-known NP-Hard problems in computational optimization. Results are given for different TSP problems comparing the best tours founds by BA, ABC, PSO and ACO. https://journal.qubahan.com/index.php/qaj/article/view/141Swarm IntelligenceNP-Hard problemTravels Salesman Problem (TSP)Particle Swarm Optimization (PSO)Artificial Bee Colony (ABC)Bat algorithm (BA) |
| spellingShingle | Awaz Ahmad Shaban Jayson A. Dela Fuente Merdin Shamal Salih Resen Ismail Ali Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem Qubahan Academic Journal Swarm Intelligence NP-Hard problem Travels Salesman Problem (TSP) Particle Swarm Optimization (PSO) Artificial Bee Colony (ABC) Bat algorithm (BA) |
| title | Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem |
| title_full | Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem |
| title_fullStr | Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem |
| title_full_unstemmed | Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem |
| title_short | Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem |
| title_sort | review of swarm intelligence for solving symmetric traveling salesman problem |
| topic | Swarm Intelligence NP-Hard problem Travels Salesman Problem (TSP) Particle Swarm Optimization (PSO) Artificial Bee Colony (ABC) Bat algorithm (BA) |
| url | https://journal.qubahan.com/index.php/qaj/article/view/141 |
| work_keys_str_mv | AT awazahmadshaban reviewofswarmintelligenceforsolvingsymmetrictravelingsalesmanproblem AT jaysonadelafuente reviewofswarmintelligenceforsolvingsymmetrictravelingsalesmanproblem AT merdinshamalsalih reviewofswarmintelligenceforsolvingsymmetrictravelingsalesmanproblem AT resenismailali reviewofswarmintelligenceforsolvingsymmetrictravelingsalesmanproblem |