Cargando…
Annealing Ant Colony Optimization with Mutation Operator for Solving TSP
Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simul...
Autor principal: | Mohsen, Abdulqader M. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5143786/ https://www.ncbi.nlm.nih.gov/pubmed/27999590 http://dx.doi.org/10.1155/2016/8932896 |
Ejemplares similares
-
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)
por: Hao, Tan, et al.
Publicado: (2023) -
Solving Dynamic Delivery Services Using Ant Colony Optimization
por: Martins, Miguel S. E., et al.
Publicado: (2020) -
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
por: Dahan, Fadl, et al.
Publicado: (2019) -
Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem
por: Stodola, Petr, et al.
Publicado: (2020) -
Metaheuristics for hard optimization: simulated annealing, tabu search, evolutionary and genetic algorithms, ant colonies,… methods and case studies
por: Dréo, Johann, et al.
Publicado: (2006)