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...

Descripción completa

Detalles Bibliográficos
Autor principal: Mohsen, Abdulqader M.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2016
Materias:
Research Article
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

Internet

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