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.authorAllahverdi, Novruz
dc.date.accessioned2020-03-26T18:59:42Z
dc.date.available2020-03-26T18:59:42Z
dc.date.issued2015
dc.departmentSelçuk Üniversitesi, Teknoloji Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.description.abstractIn 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.citationAllahverdi, 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.endpage53en_US
dc.identifier.issn2147-6799en_US
dc.identifier.issn2147-6799en_US
dc.identifier.issue2en_US
dc.identifier.startpage52en_US
dc.identifier.urihttp://www.trdizin.gov.tr/publication/paper/detail/TVRreU9UWXpNdz09
dc.identifier.urihttps://hdl.handle.net/20.500.12395/31595
dc.identifier.volume3en_US
dc.indekslendigikaynakTR-Dizinen_US
dc.institutionauthorAllahverdi, Novruz
dc.language.isoenen_US
dc.relation.ispartofInternational Journal of Intelligent Systems and Applications in Engineeringen_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectGenetic algorithmsen_US
dc.subjectTraveling Salesman Problemen_US
dc.subjectalgorithm Greedy Sub Tour Mutation (GSTM)
dc.titleAbout 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-1320en_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
Novruz Allahverdi.pdf
Boyut:
224.49 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Full Text Access