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
作者:
Highlights:
•
摘要
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.
论文关键词:Traveling Salesman Problem,Good practice,Genetic algorithms,Combinatorial optimization,Routing problems
论文评审过程:Available online 13 September 2013.
论文官网地址:https://doi.org/10.1016/j.eswa.2013.08.049