A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem

Basit Öğe Kaydı
dc.contributor.authorIlhan, Ilhan
dc.contributor.authorGokmen, Gazi
dc.date.accessioned2024-02-23T13:55:51Z
dc.date.available2024-02-23T13:55:51Z
dc.date.issued2022
dc.departmentNEÜen_US
dc.description.abstractThe traveling salesman problem (TSP) is one of the most popular combinatorial optimization problems today. It is a problem that is easy to identify but hard to solve. Therefore, it belongs to the class of NP-hard optimization problems, and it is a problem of high time complexity. The TSP can be used to solve various real-world problems. Therefore, researchers use it as a standard test bench for performance evaluation of new algorithms. In this study, a new simulated annealing algorithm with crossover operator was proposed, and it was called LBSA-CO. The LBSA-CO is a population-based metaheuristic method. In this method, a list-based temperature cooling schedule, which can adapt to the topology of the solution space of the problem, was used. The solutions in the population were improved with the inversion, insertion and 2-opt local search operators. The order crossover (OX1) and genetic edge recombination crossover (ER) operators were applied to the improved solutions to accelerate the convergence. In addition, the Taguchi method was used to tune the parameters of the LBSA-CO. The proposed method was tested on 65 well-known TSP instances. The results indicated that this method performs better than the state-of-the-art methods on many instances.en_US
dc.identifier.doi10.1007/s00521-021-06883-x
dc.identifier.endpage7652en_US
dc.identifier.issn0941-0643
dc.identifier.issn1433-3058
dc.identifier.issue10en_US
dc.identifier.scopus2-s2.0-85122664036en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage7627en_US
dc.identifier.urihttps://doi.org/10.1007/s00521-021-06883-x
dc.identifier.urihttps://hdl.handle.net/20.500.12452/10985
dc.identifier.volume34en_US
dc.identifier.wosWOS:000740617500001en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer London Ltden_US
dc.relation.ispartofNeural Computing & Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectCooling Scheduleen_US
dc.subjectGenetic Edge Recombination Crossoveren_US
dc.subjectOrder Crossoveren_US
dc.subjectSimulated Annealingen_US
dc.subjectThe Taguchi Methoden_US
dc.subjectThe Traveling Salesman Problemen_US
dc.titleA list-based simulated annealing algorithm with crossover operator for the traveling salesman problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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