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
dc.contributor.author | Allahverdi, Novruz | |
dc.date.accessioned | 2020-03-26T18:59:42Z | |
dc.date.available | 2020-03-26T18:59:42Z | |
dc.date.issued | 2015 | |
dc.department | Selçuk Üniversitesi, Teknoloji Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.description.abstract | 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. | en_US |
dc.identifier.citation | 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. | |
dc.identifier.endpage | 53 | en_US |
dc.identifier.issn | 2147-6799 | en_US |
dc.identifier.issn | 2147-6799 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.startpage | 52 | en_US |
dc.identifier.uri | http://www.trdizin.gov.tr/publication/paper/detail/TVRreU9UWXpNdz09 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/31595 | |
dc.identifier.volume | 3 | en_US |
dc.indekslendigikaynak | TR-Dizin | en_US |
dc.institutionauthor | Allahverdi, Novruz | |
dc.language.iso | en | en_US |
dc.relation.ispartof | International Journal of Intelligent Systems and Applications in Engineering | en_US |
dc.relation.publicationcategory | Makale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Genetic algorithms | en_US |
dc.subject | Traveling Salesman Problem | en_US |
dc.subject | algorithm Greedy Sub Tour Mutation (GSTM) | |
dc.title | 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 | en_US |
dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Yükleniyor...
- İsim:
- Novruz Allahverdi.pdf
- Boyut:
- 224.49 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Full Text Access