{"title":"蚁群优化改变迟钝蚁率及其在QAP中的应用","authors":"Shozo Shimomura, H. Matsushita, Y. Nishio","doi":"10.1109/IJCNN.2011.6033592","DOIUrl":null,"url":null,"abstract":"In our previous study, we have proposed an Ant Colony Optimization with Intelligent and Dull Ants (IDACO) which contains two kinds of ants. We have applied IDACO to various Traveling Salesman Problems (TSPs) and confirmed its effectiveness. This study proposes an Ant Colony Optimization Changing the Rate of Dull Ants (IDACO-CR) and its Application to Quadratic Assignment Problems (QAPs). In addition to the existence of the dull ants which cannot trail the pheromone, the rate of dull ants in IDACO-CR is changed flexibly and automatically in the simulation, depending on the problem. We investigate the behavior of IDACO-CR in detail and the effect of changing the rate of dull ants. Simulation results show that IDACO-CR gets out from the local optima by changing the rate of dull ants, and we confirm that IDACO-CR obtains the effective results in solving complex optimization problems.","PeriodicalId":415833,"journal":{"name":"The 2011 International Joint Conference on Neural Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ant Colony Optimization Changing the Rate of Dull Ants and its application to QAP\",\"authors\":\"Shozo Shimomura, H. Matsushita, Y. Nishio\",\"doi\":\"10.1109/IJCNN.2011.6033592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In our previous study, we have proposed an Ant Colony Optimization with Intelligent and Dull Ants (IDACO) which contains two kinds of ants. We have applied IDACO to various Traveling Salesman Problems (TSPs) and confirmed its effectiveness. This study proposes an Ant Colony Optimization Changing the Rate of Dull Ants (IDACO-CR) and its Application to Quadratic Assignment Problems (QAPs). In addition to the existence of the dull ants which cannot trail the pheromone, the rate of dull ants in IDACO-CR is changed flexibly and automatically in the simulation, depending on the problem. We investigate the behavior of IDACO-CR in detail and the effect of changing the rate of dull ants. Simulation results show that IDACO-CR gets out from the local optima by changing the rate of dull ants, and we confirm that IDACO-CR obtains the effective results in solving complex optimization problems.\",\"PeriodicalId\":415833,\"journal\":{\"name\":\"The 2011 International Joint Conference on Neural Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2011 International Joint Conference on Neural Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCNN.2011.6033592\",\"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 2011 International Joint Conference on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.2011.6033592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ant Colony Optimization Changing the Rate of Dull Ants and its application to QAP
In our previous study, we have proposed an Ant Colony Optimization with Intelligent and Dull Ants (IDACO) which contains two kinds of ants. We have applied IDACO to various Traveling Salesman Problems (TSPs) and confirmed its effectiveness. This study proposes an Ant Colony Optimization Changing the Rate of Dull Ants (IDACO-CR) and its Application to Quadratic Assignment Problems (QAPs). In addition to the existence of the dull ants which cannot trail the pheromone, the rate of dull ants in IDACO-CR is changed flexibly and automatically in the simulation, depending on the problem. We investigate the behavior of IDACO-CR in detail and the effect of changing the rate of dull ants. Simulation results show that IDACO-CR gets out from the local optima by changing the rate of dull ants, and we confirm that IDACO-CR obtains the effective results in solving complex optimization problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
