An improved farmland fertility algorithm with hyper-heuristic approach for solving travelling salesman problem

Basit Öğe Kaydı
dc.authoridBahman Arasteh / 0000-0001-5202-6315en_US
dc.authorscopusidBahman Arasteh / 39861139000en_US
dc.authorwosidBahman Arasteh / AAN-9555-2021en_US
dc.contributor.authorGharehchopogh, Farhad Soleimanian
dc.contributor.authorAbdollahzadeh, Benyamin
dc.contributor.authorArasteh, Bahman
dc.date.accessioned2022-11-11T08:07:10Z
dc.date.available2022-11-11T08:07:10Z
dc.date.issued2022en_US
dc.departmentİstinye Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Yazılım Mühendisliği Bölümüen_US
dc.description.abstractravelling Salesman Problem (TSP) is a discrete hybrid optimization problem considered NP-hard. TSP aims to discover the shortest Hamilton route that visits each city precisely once and then returns to the starting point, making it the shortest route feasible. This paper employed a Farmland Fertility Algorithm (FFA) inspired by agricultural land fertility and a hyper-heuristic technique based on the Modified Choice Function (MCF). The neighborhood search operator can use this strategy to automatically select the best heuristic method for making the best decision. Lin-Kernighan (LK) local search has been incorporated to increase the efficiency and performance of this suggested approach. 71 TSPLIB datasets have been compared with different algorithms to prove the proposed algorithm's performance and efficiency. Simulation results indicated that the proposed algorithm outperforms comparable methods of average mean computation time, average percentage deviation (PDav), and tour length.en_US
dc.identifier.citationGharehchopogh, F. S., Abdollahzadeh, B., & Arasteh, B. (2022). An Improved Farmland Fertility Algorithm with Hyper-Heuristic Approach for Solving Travelling Salesman Problem. CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES.en_US
dc.identifier.doi10.32604/cmes.2023.024172en_US
dc.identifier.scopus2-s2.0-85143197595en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://doi.org/10.32604/cmes.2023.024172
dc.identifier.urihttps://hdl.handle.net/20.500.12713/3320
dc.identifier.wosWOS:000861817300001en_US
dc.identifier.wosqualityQ2 - Q3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorArasteh, Bahman
dc.language.isoenen_US
dc.publisherTECH SCIENCE PRESSen_US
dc.relation.ispartofCMES-COMPUTER MODELING IN ENGINEERING & SCIENCESen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectTravelling Salesman Problemen_US
dc.subjectOptimizationen_US
dc.subjectFarmland Fertility Optimization Algorithmen_US
dc.subjectLin-Kernighanen_US
dc.titleAn improved farmland fertility algorithm with hyper-heuristic approach for solving travelling salesman problemen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
Ä°sim:
20220915152058_53302.pdf
Boyut:
487.38 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
Ä°ndir
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
Ä°ndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
Yazılım Mühendisliği Bölümü Makale Koleksiyonu