A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem

Basit Öğe Kaydı
dc.contributor.authorGulcu, Saban
dc.contributor.authorMahi, Mostafa
dc.contributor.authorBaykan, Omer Kaan
dc.contributor.authorKodaz, Halife
dc.date.accessioned2020-03-26T19:52:46Z
dc.date.available2020-03-26T19:52:46Z
dc.date.issued2018
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThis article presented a parallel cooperative hybrid algorithm for solving traveling salesman problem. Although heuristic approaches and hybrid methods obtain good results in solving the TSP, they cannot successfully avoid getting stuck to local optima. Furthermore, their processing duration unluckily takes a long time. To overcome these deficiencies, we propose the parallel cooperative hybrid algorithm (PACO-3Opt) based on ant colony optimization. This method uses the 3-Opt algorithm to avoid local minima. PACO-3Opt has multiple colonies and a master-slave paradigm. Each colony runs ACO to generate the solutions. After a predefined number of iterations, each colony primarily runs 3-Opt to improve the solutions and then shares the best tour with other colonies. This process continues until the termination criterion meets. Thus, it can reach the global optimum. PACO-3Opt was compared with previous algorithms in the literature. The experimental results show that PACO-3Opt is more efficient and reliable than the other algorithms.en_US
dc.identifier.doi10.1007/s00500-016-2432-3en_US
dc.identifier.endpage1685en_US
dc.identifier.issn1432-7643en_US
dc.identifier.issn1433-7479en_US
dc.identifier.issue5en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage1669en_US
dc.identifier.urihttps://dx.doi.org/10.1007/s00500-016-2432-3
dc.identifier.urihttps://hdl.handle.net/20.500.12395/36278
dc.identifier.volume22en_US
dc.identifier.wosWOS:000426566400025en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSPRINGERen_US
dc.relation.ispartofSOFT COMPUTINGen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectAnt colony optimizationen_US
dc.subjectParallel algorithmen_US
dc.subject3-Opt algorithmen_US
dc.subjectTraveling salesman problemen_US
dc.subjectMaster-slave paradigmen_US
dc.titleA parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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