A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA) and its variants. The proposed algorithm is motivated by the observation that genes common to all the individuals of a GA have a high probability of surviving the evolution and ending up...

Descripción completa

Detalles Bibliográficos
Autores principales: Tsai, Chun-Wei, Tseng, Shih-Pang, Chiang, Ming-Chao, Yang, Chu-Sing, Hong, Tzung-Pei
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4032739/
https://www.ncbi.nlm.nih.gov/pubmed/24892038
http://dx.doi.org/10.1155/2014/178621

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4032739/
https://www.ncbi.nlm.nih.gov/pubmed/24892038
http://dx.doi.org/10.1155/2014/178621

Ejemplares similares