A pseudo parallel ant algorithm with an adaptive migration controller
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, Ying | - |
dc.contributor.author | Zhang, Jun | - |
dc.contributor.author | Xiao, Jing | - |
dc.date.accessioned | 2023-12-08T09:33:45Z | - |
dc.date.available | 2023-12-08T09:33:45Z | - |
dc.date.issued | 2008-11 | - |
dc.identifier.issn | 0096-3003 | - |
dc.identifier.issn | 1873-5649 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115965 | - |
dc.description.abstract | This paper presents a pseudo parallel ant algorithm in the continuous domain. The solution vector of the optimized problem is divided into two independent sub-vectors. The proposed algorithm comprises two cooperative colonies, each of which contains tunable and untunable sub-vectors. The colonies optimize their own tunable sub-vectors while their untunable sub-vectors remain unchanged before migration. The excellent tunable sub-vectors in one colony are transferred to the other colony as untunable sub-vectors through a stagnation-based asynchronous migration controller, which adaptively determines the timing and the contents of the migration according to the degree of the stagnation. The proposed parallel ant algorithm with the controller can improve the solution quality and the convergence speed of the ant algorithm in high dimensional space. Numerical experiments are conducted to verify the efficiency of the proposed method. (C) 2008 Elsevier Inc. All rights reserved. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | A pseudo parallel ant algorithm with an adaptive migration controller | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1016/j.amc.2008.05.070 | - |
dc.identifier.scopusid | 2-s2.0-54249169493 | - |
dc.identifier.wosid | 000260370000019 | - |
dc.identifier.bibliographicCitation | Applied Mathematics and Computation, v.205, no.2, pp 677 - 687 | - |
dc.citation.title | Applied Mathematics and Computation | - |
dc.citation.volume | 205 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 677 | - |
dc.citation.endPage | 687 | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | COLONY OPTIMIZATION | - |
dc.subject.keywordPlus | SYSTEM | - |
dc.subject.keywordAuthor | Ant colony optimization (ACO) | - |
dc.subject.keywordAuthor | Asynchronous parallel algorithm | - |
dc.subject.keywordAuthor | Parallel ACO | - |
dc.subject.keywordAuthor | Continuous problems | - |
dc.subject.keywordAuthor | Migration | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0096300308003469?pes=vor | - |
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.