Self-Organizing Iterative Algorithm for Travelling Salesman Problem

Basit Öğe Kaydı
dc.contributor.authorNuriyev, Urfat
dc.contributor.authorUgurlu, Onur
dc.contributor.authorNuriyeva, Fidan
dc.date.accessioned2019-10-27T10:44:29Z
dc.date.available2019-10-27T10:44:29Z
dc.date.issued2018
dc.departmentEge Üniversitesien_US
dc.description18th International-Federation-of-Automatic-Control (IFAC) Conference on Technology, Culture and International Stability (TECIS) -- SEP 13-15, 2018 -- Baku, AZERBAIJANen_US
dc.description.abstractThis paper presents a self-organizing heuristic iterative algorithm for solving Travelling Salesman Problem. In the algorithm, firstly priority values of the edges are determined. Then, varied solutions are found. After that, the priority values of the edges are updated according to these solutions. Then, all the edges are sorted in descending order according to the priority values and in order to improve solutions an iterative algorithm is used. Greedy algorithm is used to find the solution in each iteration and the priority values of the edges are updated according to the solution. The proposed algorithm is compared with Nearest Neighbour and Greedy algorithm. Experimental results show that the proposed algorithm is efficient. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.en_US
dc.description.sponsorshipInt Federat Automat Control, Int Federat Automat Control, Tech Comm 9 5 Technol, Culture & Int Stabil, Int Federat Automat Control, Tech Comm 4 2 Mechatron Syst, Int Federat Automat Control, Tech Comm 4 3 Robot, Int Federat Automat Control, Tech Comm 5 2 Mfg Modelling Management & Control, Int Federat Automat Control, Tech Comm 7 5 Intelligent Autonomous Vehicles, Int Federat Automat Control, Tech Comm 9 1 Econ, Business, & Financial Syst, Int Federat Automat Control, Tech Comm 9 2 Social Impact Automaten_US
dc.identifier.doi10.1016/j.ifacol.2018.11.299
dc.identifier.endpage270en_US
dc.identifier.issn2405-8963
dc.identifier.issn2405-8963en_US
dc.identifier.issue30en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage268en_US
dc.identifier.urihttps://doi.org/10.1016/j.ifacol.2018.11.299
dc.identifier.urihttps://hdl.handle.net/11454/30987
dc.identifier.volume51en_US
dc.identifier.wosWOS:000451096700051en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherElsevier Science Bven_US
dc.relation.ispartofIfac Papersonlineen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectheuristicsen_US
dc.subjectartificial intelligenceen_US
dc.subjectcombinatorial optimizationen_US
dc.subjectNP-Hard problemsen_US
dc.subjectself-organizing algorithmsen_US
dc.titleSelf-Organizing Iterative Algorithm for Travelling Salesman Problemen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

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