Short communication: 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

Authors:
E. Osaba;E. Onieva;F. Diaz;R. Carballedo;A. Perallos
Affiliations:
-;-;-;-;-
Venue:
Expert Systems with Applications: An International Journal
Year:
2014

Citing 5
Cited 0

Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Computers and Operations Research
Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms

Expert Systems with Applications: An International Journal
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Computers and Operations Research
A new genetic algorithm for the asymmetric traveling salesman problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

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.