Applications of artificial atom algorithm to small-scale traveling salesman problems
dc.authorid | YILDIRIM, Ayse ERDOGAN/0000-0002-8983-8410 | |
dc.authorid | Karci, Ali/0000-0002-8489-8617 | |
dc.authorwosid | KARCI, Ali/A-9604-2019 | |
dc.authorwosid | YILDIRIM, Ayse ERDOGAN/W-4540-2018 | |
dc.authorwosid | Karci, Ali/AAG-5337-2019 | |
dc.contributor.author | Yildirim, Ayse Erdogan | |
dc.contributor.author | Karci, Ali | |
dc.date.accessioned | 2024-08-04T20:43:56Z | |
dc.date.available | 2024-08-04T20:43:56Z | |
dc.date.issued | 2018 | |
dc.department | İnönü Üniversitesi | en_US |
dc.description.abstract | Most of the meta-heuristic algorithms are based on the natural processes. They were inspired by physical, biological, social, chemical, social-biological, biological-geography, music, and hybrid processes. In this paper, artificial atom algorithm which was inspired by one of natural processes was applied to traveling salesman problem. The obtained results have shown that for small-scale TSP, artificial atom algorithm is closer to optimum than the other compared heuristic algorithms such as tabu search, genetic algorithm, particle swarm optimization, ant colony optimization, and their different combinations. | en_US |
dc.identifier.doi | 10.1007/s00500-017-2735-z | |
dc.identifier.endpage | 7631 | en_US |
dc.identifier.issn | 1432-7643 | |
dc.identifier.issn | 1433-7479 | |
dc.identifier.issue | 22 | en_US |
dc.identifier.scopus | 2-s2.0-85026786940 | en_US |
dc.identifier.scopusquality | Q2 | en_US |
dc.identifier.startpage | 7619 | en_US |
dc.identifier.uri | https://doi.org/10.1007/s00500-017-2735-z | |
dc.identifier.uri | https://hdl.handle.net/11616/97916 | |
dc.identifier.volume | 22 | en_US |
dc.identifier.wos | WOS:000448418300023 | en_US |
dc.identifier.wosquality | Q2 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Soft Computing | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Meta-heuristic approaches | en_US |
dc.subject | Traveling salesman problem | en_US |
dc.subject | Artificial atom algorithm | en_US |
dc.subject | Genetic algorithm | en_US |
dc.subject | Particle swarm optimization | en_US |
dc.subject | Ant colony optimization | en_US |
dc.title | Applications of artificial atom algorithm to small-scale traveling salesman problems | en_US |
dc.type | Article | en_US |