Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem
Metaheuristics is a term for optimization procedures/algorithms that can be applied to a wide range of problems. These problems for which metaheuristics are used usually fall in the NP-hard category, meaning that they cannot be solved in polynomial time. This means that as the input dataset gets lar...
Main Author: | Mohi El Din, Hatem |
---|---|
Format: | Others |
Language: | English |
Published: |
Blekinge Tekniska Högskola
2021
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:bth-21520 |
Similar Items
-
A BINARY SPACE PARTITIONED ANT COLONY OPTIMIZATION ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
by: Ståhlbom, Niclas
Published: (2021) -
The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities
by: Jamshid Salehi Sadaghiani
Published: (2010-10-01) -
The application of ant colony optimization in the solution of 3D traveling salesman problem on a sphere
by: Hüseyin Eldem, et al.
Published: (2017-08-01) -
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
by: Fadl Dahan, et al.
Published: (2019-04-01) -
Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem
by: Petr Stodola, et al.
Published: (2020-08-01)