Experimental Analysis of New Heuristics for the TSP

Basit Öğe Kaydı
dc.contributor.authorNuriyeva, Fidan
dc.contributor.authorKizilates, Gozde
dc.contributor.authorBerberler, Murat Ersen
dc.contributor.editorAidaZade, K
dc.date.accessioned2019-10-27T21:33:43Z
dc.date.available2019-10-27T21:33:43Z
dc.date.issued2012
dc.departmentEge Üniversitesien_US
dc.description4th International Conference on Problems of Cybernetics and Informatics (PCI) -- SEP 12-14, 2012 -- Baku, AZERBAIJANen_US
dc.description.abstractIn this study, the three new heuristic algorithms which are proposed in [1] for the solution of traveling salesman problem is developed. In addition, the new versions of 2-opt and 3-opt algorithms are proposed. These algorithms are tested and their performances are compared with the well-known heuristic algorithms such as Nearest Neighbor, and Greedy algorithms.en_US
dc.description.sponsorshipIEEEen_US
dc.identifier.isbn978-1-4673-4502-6; 978-1-4673-4500-2
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://hdl.handle.net/11454/45348
dc.identifier.wosWOS:000320337500183en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherIeeeen_US
dc.relation.ispartof2012 Iv International Conference Problems of Cybernetics and Informatics (Pci)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjecttraveling salesman problemen_US
dc.subjectheuristic algorithmsen_US
dc.subjectlocal searchen_US
dc.titleExperimental Analysis of New Heuristics for the TSPen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

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