多目标二次分配问题的模糊粒子群算法

Mingyan Zhao, A. Abraham, C. Grosan, Hongbo Liu
{"title":"多目标二次分配问题的模糊粒子群算法","authors":"Mingyan Zhao, A. Abraham, C. Grosan, Hongbo Liu","doi":"10.1109/AMS.2008.169","DOIUrl":null,"url":null,"abstract":"The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of each flow for the mQAP, it is best to use Pareto optimization to obtain the Pareto front or an approximation of it. Although Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems, research on mQAP has not much been investigated. This paper introduces a fuzzy particle swarm algorithm to handle the Multiobjective Quadratic Assignment Problem (mQAP). In the fuzzy scheme, the representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is introduced between the particles in the swarm and the problem space in an efficient way. We evaluated the performance of the proposed approach. Empirical results illustrate that the approach can be applied for solving mQAP's very effectively.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"A Fuzzy Particle Swarm Approach to Multiobjective Quadratic Assignment Problems\",\"authors\":\"Mingyan Zhao, A. Abraham, C. Grosan, Hongbo Liu\",\"doi\":\"10.1109/AMS.2008.169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of each flow for the mQAP, it is best to use Pareto optimization to obtain the Pareto front or an approximation of it. Although Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems, research on mQAP has not much been investigated. This paper introduces a fuzzy particle swarm algorithm to handle the Multiobjective Quadratic Assignment Problem (mQAP). In the fuzzy scheme, the representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is introduced between the particles in the swarm and the problem space in an efficient way. We evaluated the performance of the proposed approach. Empirical results illustrate that the approach can be applied for solving mQAP's very effectively.\",\"PeriodicalId\":122964,\"journal\":{\"name\":\"2008 Second Asia International Conference on Modelling & Simulation (AMS)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Second Asia International Conference on Modelling & Simulation (AMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2008.169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2008.169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

多目标二次分配问题(mQAP)被认为是最难的优化问题之一,但在现实世界中有许多应用。由于可能无法简单地对mQAP的每个流的重要性进行加权,因此最好使用Pareto优化来获得Pareto前端或其近似值。尽管粒子群优化(PSO)算法在广泛的应用问题上表现出良好的性能,但对mQAP的研究还不多。介绍了一种处理多目标二次分配问题的模糊粒子群算法。在模糊格式中,将传统粒子群算法中粒子位置和速度的表示形式从实向量扩展到模糊矩阵。在群粒子与问题空间之间引入了一种新的有效映射。我们评估了所提出的方法的性能。实证结果表明,该方法可以非常有效地解决mQAP问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Fuzzy Particle Swarm Approach to Multiobjective Quadratic Assignment Problems
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of each flow for the mQAP, it is best to use Pareto optimization to obtain the Pareto front or an approximation of it. Although Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems, research on mQAP has not much been investigated. This paper introduces a fuzzy particle swarm algorithm to handle the Multiobjective Quadratic Assignment Problem (mQAP). In the fuzzy scheme, the representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is introduced between the particles in the swarm and the problem space in an efficient way. We evaluated the performance of the proposed approach. Empirical results illustrate that the approach can be applied for solving mQAP's very effectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信