Resumen
This short note presents a discussion arisen after reading "Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms", by Murat Albayrak and Novruz Allahverdi, (2011). Expert System with Applications (38) (pp. 1313-1320). The discussed paper presents a new greedy mutation operator to solve the well-known Traveling Salesman Problem. To prove the quality of their new operator, the authors compare different versions of a classical genetic algorithm, each of one with a different mutation operator. The experimentation shown by the authors can generate some controversy. In this short note, we explain the origin of this controversy and we bring a solution to prevent it in future publications.
| Idioma original | Inglés |
|---|---|
| Páginas (desde-hasta) | 1530-1531 |
| Número de páginas | 2 |
| Publicación | Expert Systems with Applications |
| Volumen | 41 |
| N.º | 4 PART 1 |
| DOI | |
| Estado | Publicada - 2014 |
| Publicado de forma externa | Sí |
ODS de las Naciones Unidas
Este resultado contribuye a los siguientes Objetivos de Desarrollo Sostenible
-
ODS 4: Educación de calidad
Huella
Profundice en los temas de investigación de 'Comments on "albayrak, M., & Allahverdy N. (2011). Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313-1320": A proposal of good practice'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver