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

Basit Öğe Kaydı
dc.contributor.authorAlbayrak, Murat
dc.contributor.authorAllahverdi, Novruz
dc.date.accessioned2020-03-26T18:14:08Z
dc.date.available2020-03-26T18:14:08Z
dc.date.issued2011
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIn this study, a new mutation operator has been developed to increase Genetic Algorithm (GA) performance to find the shortest distance in the known Traveling Salesman Problem (TSP). We called this method as Greedy Sub Tour Mutation (GSTM). There exist two different greedy search methods and a component that provides a distortion in this new operator. The developed GSTM operator was tested with simple GA mutation operators in 14 different TSP examples selected from TSPLIB. The application of this GSTM operator gives much more effective results regarding to the best and average error values. The GSTM operator used with simple GAs decreases the best error values according to the other mutation operators with the ratio of between 74.24% and 88.32% and average error values between 59.42% and 79.51%. (C) 2010 Elsevier Ltd. All rights reserved.en_US
dc.description.sponsorshipSelcuk University in TurkeySelcuk University [07201054/2008]en_US
dc.description.sponsorshipThis study is supported as research project by the Unit of Scientific Research Projects of Selcuk University in Turkey (Project No. 07201054/2008).en_US
dc.identifier.doi10.1016/j.eswa.2010.07.006en_US
dc.identifier.endpage1320en_US
dc.identifier.issn0957-4174en_US
dc.identifier.issn1873-6793en_US
dc.identifier.issue3en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage1313en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.eswa.2010.07.006
dc.identifier.urihttps://hdl.handle.net/20.500.12395/26322
dc.identifier.volume38en_US
dc.identifier.wosWOS:000284863200006en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherPERGAMON-ELSEVIER SCIENCE LTDen_US
dc.relation.ispartofEXPERT SYSTEMS WITH APPLICATIONSen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectGenetic Algorithmen_US
dc.subjectMutation operatoren_US
dc.subjectGreedy methodsen_US
dc.subjectTraveling Salesman Problemen_US
dc.subjectOptimizationen_US
dc.titleDevelopment a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithmsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu