About a discussion 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; 3, pp. 1313-1320
Yükleniyor...
Tarih
2015
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In the Short Communication published in Expert Systems with Application in volume 41 2014, (Comments on "Albayrak, M., & Allahverdi 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" [1]: A Proposal of Good Practice; E. Osaba, E. Onieva, F. Diaz, R. Carballedo, Volume: 41, Issue: 4, Pages: 1530-1531, Part: 1, March 2014) [4] the Osoba E. et al have discussed our method to solve the Traveling Salesman Problem pointing that we use our developed new algorithm to compare different versions of a classical genetic algorithm, each of one with a different mutation operator and they write that this can generate some controversy. Here we shortly analyze the comment of Osaba E. et al. to show that our comparing method has a chance of existence.
Açıklama
Anahtar Kelimeler
Genetic algorithms, Traveling Salesman Problem, algorithm Greedy Sub Tour Mutation (GSTM)
Kaynak
International Journal of Intelligent Systems and Applications in Engineering
WoS Q Değeri
Scopus Q Değeri
Cilt
3
Sayı
2
Künye
Allahverdi, N. (2015). About a Discussion 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; 3, pp. 1313-1320. International Journal of Intelligent Systems and Applications in Engineering, 3(2), 52-53.
