Study of parametric relation in ant colony optimization approach to traveling salesman problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Luo, Xuyao | - |
dc.contributor.author | Yu, Fang | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-12-08T09:32:09Z | - |
dc.date.available | 2023-12-08T09:32:09Z | - |
dc.date.issued | 2006-08 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115846 | - |
dc.description.abstract | Presetting control parameters of algorithms are important to ant colony optimization (AGO). This paper presents an investigation into the relationship of algorithms performance and the different control parameter settings. Two tour building methods are used in this paper including the max probability selection and the roulette wheel selection. Four parameters are used, which are two control parameters of transition probability α and β, pheromone decrease factor p, and proportion factor q0 in building methods. By simulated result analysis, the parameter selection rule will be given. © Springer-Verlag Berlin Heidelberg 2006. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | Study of parametric relation in ant colony optimization approach to traveling salesman problem | - |
dc.type | Article | - |
dc.publisher.location | 독일 | - |
dc.identifier.doi | 10.1007/11816102_3 | - |
dc.identifier.scopusid | 2-s2.0-33749581521 | - |
dc.identifier.wosid | 000240085400003 | - |
dc.identifier.bibliographicCitation | Conference proceedings © 2006 Computational Intelligence and Bioinformatics International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006, Proceedings, Part III, v.4115 , pp 22 - 32 | - |
dc.citation.title | Conference proceedings © 2006 Computational Intelligence and Bioinformatics International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006, Proceedings, Part III | - |
dc.citation.volume | 4115 | - |
dc.citation.startPage | 22 | - |
dc.citation.endPage | 32 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Biochemistry & Molecular Biology | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Biochemical Research Methods | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | NEURAL-NETWORKS | - |
dc.subject.keywordPlus | POLYNOMIALS | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | SYSTEM | - |
dc.subject.keywordPlus | ROOTS | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/11816102_3?utm_source=getftr&utm_medium=getftr&utm_campaign=getftr_pilot | - |
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.