Cargando…
A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem
The fruit fly optimization algorithm (FOA) is a newly developed bio-inspired algorithm. The continuous variant version of FOA has been proven to be a powerful evolutionary approach to determining the optima of a numerical function on a continuous definition domain. In this study, a discrete FOA (DFO...
Autores principales: | Jiang, Zi-bin, Yang, Qiong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5094794/ https://www.ncbi.nlm.nih.gov/pubmed/27812175 http://dx.doi.org/10.1371/journal.pone.0165804 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
por: Dahan, Fadl, et al.
Publicado: (2019) -
Genetic codes optimized as a traveling salesman problem
por: Attie, Oliver, et al.
Publicado: (2019) -
Hybrid pointer networks for traveling salesman problems optimization
por: Stohy, Ahmed, et al.
Publicado: (2021) -
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
por: Qian, Wenyang, et al.
Publicado: (2023)