A parametric hybrid method for the traveling salesman problem

Basit Öğe Kaydı
dc.contributor.authorKizilates G.
dc.contributor.authorNuriyeva F.
dc.date.accessioned2019-10-26T21:34:56Z
dc.date.available2019-10-26T21:34:56Z
dc.date.issued2013
dc.departmentEge Üniversitesien_US
dc.description.abstractThe traveling salesman problem (TSP) is one of the typical NP-Hard problems of combinatorial optimization area. This paper proposes a new hyper heuristic algorithm named Parametric Hybrid Method (PHM) based on The Farthest Vertex (FV) and Greedy heuristics for solving the traveling salesman problem. In addition, many problem instances from TSPLIB (traveling salesman problem library) were solved with NN, Greedy and PHM algorithms. The experimental results show that the new hybrid algorithm is more effective and efficient than both Greedy and Nearest Neighbor algorithms.en_US
dc.identifier.endpage466en_US
dc.identifier.issn1300686X
dc.identifier.issn1300-686Xen_US
dc.identifier.issue3en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage459en_US
dc.identifier.urihttps://hdl.handle.net/11454/17914
dc.identifier.volume18en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofMathematical and Computational Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGreedy algorithmen_US
dc.subjectHyper heuristic algorithmen_US
dc.subjectNearest neighbor algorithmen_US
dc.subjectParametric hybrid algorithmen_US
dc.subjectTraveling salesman problemen_US
dc.titleA parametric hybrid method for the traveling salesman problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu