Random Pairwise Competition Based Ant Selection for Pheromone Updating in Ant Colony Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cao, Hao | - |
dc.contributor.author | Yang, Qiang | - |
dc.contributor.author | Gao, Xu-Dong | - |
dc.contributor.author | Xu, Pei-Lan | - |
dc.contributor.author | Lu, Zhen-Yu | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2024-04-04T03:00:37Z | - |
dc.date.available | 2024-04-04T03:00:37Z | - |
dc.date.issued | 2023-10 | - |
dc.identifier.issn | 1062-922X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118452 | - |
dc.description.abstract | Ant Colony Optimization (ACO) has shown very promising performance in solving Traveling Salesman Problem (TSP). However, most existing ACO algorithms utilize either the absolutely best ants or all ants to update the pheromone matrix. This leads to either serious diversity loss or slow convergence. To alleviate these predicaments, this paper designs a random pairwise competition based ant selection for pheromone updating. Specifically, a number of ants are randomly selected from the ant colony and then are randomly paired together. Subsequently the better one in each pair is selected to update the pheromone matrix. In this way, a good balance between search diversity and search convergence is potentially maintained. Integrating this selection strategy along with a local search scheme into the ACO framework, a new ACO algorithm called random pairwise competition based ACO (RPCACO) is developed. Experiments conducted on 8 TSP instances from the TSPLIB benchmark set demonstrate that RPCACO is more effective and efficient than the five classical ACO algorithms in solving TSP. © 2023 IEEE. | - |
dc.format.extent | 6 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Random Pairwise Competition Based Ant Selection for Pheromone Updating in Ant Colony Optimization | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/SMC53992.2023.10394413 | - |
dc.identifier.scopusid | 2-s2.0-85187285207 | - |
dc.identifier.bibliographicCitation | 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp 1455 - 1460 | - |
dc.citation.title | 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC) | - |
dc.citation.startPage | 1455 | - |
dc.citation.endPage | 1460 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Ant Colony Optimization | - |
dc.subject.keywordAuthor | Local Search | - |
dc.subject.keywordAuthor | Pheromone Update | - |
dc.subject.keywordAuthor | Random Pairwise Competition | - |
dc.subject.keywordAuthor | Traveling Salesman Problem | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10394413 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.