Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem

This paper presents an adaptation of the flying ant colony optimization (FACO) algorithm to solve the traveling salesman problem (TSP). This new modification is called dynamic flying ant colony optimization (DFACO). FACO was originally proposed to solve the quality of service (QoS)-aware web service...

Descripción completa

Detalles Bibliográficos
Autores principales: Dahan, Fadl, El Hindi, Khalil, Mathkour, Hassan, AlSalman, Hussien
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6514928/
https://www.ncbi.nlm.nih.gov/pubmed/30999688
http://dx.doi.org/10.3390/s19081837

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6514928/
https://www.ncbi.nlm.nih.gov/pubmed/30999688
http://dx.doi.org/10.3390/s19081837

Ejemplares similares