Cargando…
Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem
Genetic algorithms are powerful search methods inspired by Darwinian evolution. To date, they have been applied to the solution of many optimization problems because of the easy use of their properties and their robustness in finding good solutions to difficult problems. The good operation of geneti...
Autores principales: | Contreras-Bolton, Carlos, Parada, Victor |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4569577/ https://www.ncbi.nlm.nih.gov/pubmed/26367182 http://dx.doi.org/10.1371/journal.pone.0137724 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm
por: Liu, Guangjun, et al.
Publicado: (2022) -
Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator
por: Hussain, Abid, et al.
Publicado: (2017) -
Solving the Traveling Salesman's Problem Using the African Buffalo Optimization
por: Odili, Julius Beneoluchi, et al.
Publicado: (2016) -
A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model
por: Wang, Zhaocai, et al.
Publicado: (2022)