Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1530-1531 |
| Number of pages | 2 |
| Journal | Expert Systems with Applications |
| Volume | 41 |
| Issue number | 4 PART 1 |
| DOIs | |
| Publication status | Published - 2014 |
| Externally published | Yes |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 4 Quality Education
Keywords
- Combinatorial optimization
- Genetic algorithms
- Good practice
- Routing problems
- Traveling Salesman Problem
Fingerprint
Dive into the research topics of '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'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver