An Ant Colony Optimization Memorizing Better Solutions (ACO-MBS) for Traveling Salesman Problem
| dc.contributor.author | Ekmekci, D. | |
| dc.date.accessioned | 2024-09-29T16:20:50Z | |
| dc.date.available | 2024-09-29T16:20:50Z | |
| dc.date.issued | 2019 | |
| dc.department | Karabük Üniversitesi | en_US |
| dc.description | 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies, ISMSIT 2019 -- 11 October 2019 through 13 October 2019 -- Ankara -- 156063 | en_US |
| dc.description.abstract | Ant Colony Optimization (ACO) is a population-based meta-heuristic method that mimics the foraging behavior of the ant colony in real life. The pheromone approach as the highlight method of the algorithm is the most effective factor in determining the moving of ants. Therefore, the problem of tuning the pheromone trail is an important topic for ACO that deserves attention. In this paper, a novel method which memorizes the solution costs and updates the pheromone trail according to the memorized costs is introduced for updating the pheromone trail in ACO. The performance of the proposed method was simulated on the Travelling Salesman Problem (TSP) and compared with the versions of ACO algorithm. © 2019 IEEE. | en_US |
| dc.identifier.doi | 10.1109/ISMSIT.2019.8932768 | |
| dc.identifier.isbn | 978-172813789-6 | |
| dc.identifier.scopus | 2-s2.0-85077982574 | en_US |
| dc.identifier.scopusquality | N/A | en_US |
| dc.identifier.uri | https://doi.org/10.1109/ISMSIT.2019.8932768 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14619/9362 | |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
| dc.relation.ispartof | 3rd International Symposium on Multidisciplinary Studies and Innovative Technologies, ISMSIT 2019 - Proceedings | en_US |
| dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | ant colony optimization | en_US |
| dc.subject | pheromone updating | en_US |
| dc.subject | traveling salesman problem | en_US |
| dc.title | An Ant Colony Optimization Memorizing Better Solutions (ACO-MBS) for Traveling Salesman Problem | en_US |
| dc.type | Conference Object | en_US |
