Cargando…
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...
Autores principales: | Dahan, Fadl, El Hindi, Khalil, Mathkour, Hassan, AlSalman, Hussien |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2019
|
Materias: | |
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 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Solving the Traveling Salesman's Problem Using the African Buffalo Optimization
por: Odili, Julius Beneoluchi, et al.
Publicado: (2016) -
Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem
por: Stodola, Petr, et al.
Publicado: (2020) -
Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm
por: Liu, Guangjun, et al.
Publicado: (2022) -
A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem
por: Jiang, Zi-bin, et al.
Publicado: (2016)