候选集自适应控制提高蚁群算法的性能

The 2003 Congress on Evolutionary Computation, 2003. CEC '03. Pub Date : 2003-12-08 DOI:10.1109/CEC.2003.1299826

I. Watanabe, Shouichi Matsui

{"title":"候选集自适应控制提高蚁群算法的性能","authors":"I. Watanabe, Shouichi Matsui","doi":"10.1109/CEC.2003.1299826","DOIUrl":null,"url":null,"abstract":"The performance of ant colony optimization (ACO) algorithms with candidate sets is high for large optimization problems, but it is difficult to set the size of candidate sets to optimal in advance. We propose an adaptive control mechanism of candidate sets based on pheromone concentrations for improving the performance of ACO algorithms and report the results of computational experiments using the graph coloring problems.","PeriodicalId":416243,"journal":{"name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Improving the performance of ACO algorithms by adaptive control of candidate set\",\"authors\":\"I. Watanabe, Shouichi Matsui\",\"doi\":\"10.1109/CEC.2003.1299826\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of ant colony optimization (ACO) algorithms with candidate sets is high for large optimization problems, but it is difficult to set the size of candidate sets to optimal in advance. We propose an adaptive control mechanism of candidate sets based on pheromone concentrations for improving the performance of ACO algorithms and report the results of computational experiments using the graph coloring problems.\",\"PeriodicalId\":416243,\"journal\":{\"name\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2003.1299826\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2003.1299826","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 31

摘要

具有候选集的蚁群优化算法在求解大型优化问题时具有较高的性能，但难以预先确定候选集的最优大小。我们提出了一种基于信息素浓度的候选集自适应控制机制，以提高蚁群算法的性能，并报告了使用图着色问题的计算实验结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Improving the performance of ACO algorithms by adaptive control of candidate set

The performance of ant colony optimization (ACO) algorithms with candidate sets is high for large optimization problems, but it is difficult to set the size of candidate sets to optimal in advance. We propose an adaptive control mechanism of candidate sets based on pheromone concentrations for improving the performance of ACO algorithms and report the results of computational experiments using the graph coloring problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

自引率

0.00%

发文量