组合拍卖中基于混合突变策略的协同进化算法

Wei-gen Hou, Hongbin Dong, Guisheng Yin, Yuxin Dong
{"title":"组合拍卖中基于混合突变策略的协同进化算法","authors":"Wei-gen Hou, Hongbin Dong, Guisheng Yin, Yuxin Dong","doi":"10.1109/CEC.2015.7257270","DOIUrl":null,"url":null,"abstract":"To address computational complexity of winner determination in combinatorial auction, a new co-evolutionary algorithms is developed based on combining mixed mutation with self-organization optimization for finding high quality solutions quickly. Mixed mutation strategy can select adaptively mutation operators which are suitable for discrete space to maintain population diversity, self-organization optimization makes the search to jump out of local optima. This paper investigates two combination methods of mixed mutation and self-organization optimization, the results of experiment show the better performance of the second way (MMSEO2) that self-organization optimization is added to mixed mutation strategy set as a pure mutation operator. We compare the proposed algorithm with current well-known approximate algorithms for winner determination problem, and demonstrate that the proposed algorithm MMSEO2 produces competitive results and finds better solutions than other algorithms for large problem sizes.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A co-evolutionary algorithm based on mixed mutation strategy for WDP in combinatorial auction\",\"authors\":\"Wei-gen Hou, Hongbin Dong, Guisheng Yin, Yuxin Dong\",\"doi\":\"10.1109/CEC.2015.7257270\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To address computational complexity of winner determination in combinatorial auction, a new co-evolutionary algorithms is developed based on combining mixed mutation with self-organization optimization for finding high quality solutions quickly. Mixed mutation strategy can select adaptively mutation operators which are suitable for discrete space to maintain population diversity, self-organization optimization makes the search to jump out of local optima. This paper investigates two combination methods of mixed mutation and self-organization optimization, the results of experiment show the better performance of the second way (MMSEO2) that self-organization optimization is added to mixed mutation strategy set as a pure mutation operator. We compare the proposed algorithm with current well-known approximate algorithms for winner determination problem, and demonstrate that the proposed algorithm MMSEO2 produces competitive results and finds better solutions than other algorithms for large problem sizes.\",\"PeriodicalId\":403666,\"journal\":{\"name\":\"2015 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2015.7257270\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2015.7257270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对组合拍卖中标者确定的计算复杂性,提出了一种混合突变与自组织优化相结合的协同进化算法,以快速找到高质量的求解方案。混合突变策略可以选择适合于离散空间的自适应突变算子来保持种群多样性,自组织优化使搜索跳出局部最优。本文研究了混合突变与自组织优化的两种组合方法,实验结果表明,将自组织优化作为纯突变算子加入混合突变策略集的第二种方法(MMSEO2)具有更好的性能。我们将所提出的算法与目前已知的赢家确定问题的近似算法进行了比较,并证明所提出的算法MMSEO2产生了竞争性结果,并且在大问题规模上比其他算法找到了更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A co-evolutionary algorithm based on mixed mutation strategy for WDP in combinatorial auction
To address computational complexity of winner determination in combinatorial auction, a new co-evolutionary algorithms is developed based on combining mixed mutation with self-organization optimization for finding high quality solutions quickly. Mixed mutation strategy can select adaptively mutation operators which are suitable for discrete space to maintain population diversity, self-organization optimization makes the search to jump out of local optima. This paper investigates two combination methods of mixed mutation and self-organization optimization, the results of experiment show the better performance of the second way (MMSEO2) that self-organization optimization is added to mixed mutation strategy set as a pure mutation operator. We compare the proposed algorithm with current well-known approximate algorithms for winner determination problem, and demonstrate that the proposed algorithm MMSEO2 produces competitive results and finds better solutions than other algorithms for large problem sizes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信