Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/5205
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kıran, Mustafa Servet | - |
dc.contributor.author | Beşkirli, Mehmet | - |
dc.date.accessioned | 2024-03-16T09:49:28Z | - |
dc.date.available | 2024-03-16T09:49:28Z | - |
dc.date.issued | 2024 | - |
dc.identifier.issn | 2313-7673 | - |
dc.identifier.uri | https://doi.org/10.3390/biomimetics9020118 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/5205 | - |
dc.description.abstract | This paper presents a novel approach based on the ant system algorithm for solving discrete optimization problems. The proposed method is based on path construction, path improvement techniques, and the footprint mechanism. Some information about the optimization problem and collective intelligence is used in order to create solutions in the path construction phase. In the path improvement phase, neighborhood operations are applied to the solution, which is the best of the population and is obtained from the path construction phase. The collective intelligence in the path construction phase is based on a footprint mechanism, and more footprints on the arc improve the selection chance of this arc. A selection probability is also balanced by using information about the problem (e.g., the distance between nodes for a traveling salesman problem). The performance of the proposed method has been investigated on 25 traveling salesman problems and compared with state-of-the-art algorithms. The experimental comparisons show that the proposed method produced comparable results for the problems dealt with in this study. | en_US |
dc.language.iso | en | en_US |
dc.publisher | MDPI | en_US |
dc.relation.ispartof | Biomimetics | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | ant system algorithm | en_US |
dc.subject | collective intelligence | en_US |
dc.subject | footprint mechanism | en_US |
dc.subject | path construction | en_US |
dc.subject | path improvement | en_US |
dc.subject | traveling salesman problem | en_US |
dc.subject | Particle Swarm Optimization | en_US |
dc.subject | Bee Colony Algorithm | en_US |
dc.subject | Tsp | en_US |
dc.title | A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.3390/biomimetics9020118 | - |
dc.identifier.pmid | 38392165 | en_US |
dc.identifier.scopus | 2-s2.0-85185956015 | en_US |
dc.department | KTÜN | en_US |
dc.identifier.volume | 9 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.wos | WOS:001170124800001 | en_US |
dc.institutionauthor | Kıran, Mustafa Servet | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 54403096500 | - |
dc.authorscopusid | 56267333200 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.openairetype | Article | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.03. Department of Computer Engineering | - |
Appears in Collections: | PubMed İndeksli Yayınlar Koleksiyonu / PubMed Indexed Publications Collections Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
CORE Recommender
WEB OF SCIENCETM
Citations
1
checked on Oct 5, 2024
Page view(s)
62
checked on Oct 7, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.