基于灰狼优化器的Levy飞行分解多目标优化

Masoumeh Khubroo, S. J. Mousavirad
{"title":"基于灰狼优化器的Levy飞行分解多目标优化","authors":"Masoumeh Khubroo, S. J. Mousavirad","doi":"10.1109/ICCKE48569.2019.8965178","DOIUrl":null,"url":null,"abstract":"The goal of an optimization technique is to find the best solution to an optimization problem. In a single-objective problem, the best solution is the optimal value for the objective function, while in a multi-objective problem, the selection of solutions is not a straightforward task because there are several objective functions which are in conflict. There are many diverse applications such as image processing and data mining, which can be formulated as a multi-objective problem. This paper presents a new decomposition-based multi-objective optimization method using the grey wolf optimizer, which transforms the problem into several sub-problems and examines all the sub-problems simultaneously. Our proposed algorithm obtains the Pareto front using a neighborhood relation among the sub-problems. The levy flight distribution has also been used which increases the exploration and exploitation features in the algorithm in order to improve the search ability. The performance of our proposed algorithm is evaluated on UF family of benchmark functions in terms of different metric such as inverted generational distance (IGD), generational distance (GD), hyper-volume (HV), and spacing (SP). The experimental results indicate the superior performance of the proposed method.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"74 1","pages":"155-161"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Levy Flight-based Decomposition Multi-objective Optimization Based on Grey Wolf Optimizer\",\"authors\":\"Masoumeh Khubroo, S. J. Mousavirad\",\"doi\":\"10.1109/ICCKE48569.2019.8965178\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The goal of an optimization technique is to find the best solution to an optimization problem. In a single-objective problem, the best solution is the optimal value for the objective function, while in a multi-objective problem, the selection of solutions is not a straightforward task because there are several objective functions which are in conflict. There are many diverse applications such as image processing and data mining, which can be formulated as a multi-objective problem. This paper presents a new decomposition-based multi-objective optimization method using the grey wolf optimizer, which transforms the problem into several sub-problems and examines all the sub-problems simultaneously. Our proposed algorithm obtains the Pareto front using a neighborhood relation among the sub-problems. The levy flight distribution has also been used which increases the exploration and exploitation features in the algorithm in order to improve the search ability. The performance of our proposed algorithm is evaluated on UF family of benchmark functions in terms of different metric such as inverted generational distance (IGD), generational distance (GD), hyper-volume (HV), and spacing (SP). The experimental results indicate the superior performance of the proposed method.\",\"PeriodicalId\":6685,\"journal\":{\"name\":\"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"74 1\",\"pages\":\"155-161\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE48569.2019.8965178\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE48569.2019.8965178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

优化技术的目标是找到优化问题的最佳解决方案。在单目标问题中,最优解是目标函数的最优值,而在多目标问题中,由于存在多个相互冲突的目标函数,解决方案的选择并不是一项简单的任务。有许多不同的应用,如图像处理和数据挖掘,可以表述为一个多目标问题。本文提出了一种新的基于分解的多目标优化方法,该方法利用灰狼优化器将问题分解为若干个子问题,并同时对所有子问题进行检验。该算法利用子问题之间的邻域关系得到Pareto前沿。该算法还采用了征费飞行分布,增加了算法的探索和开发特性,提高了搜索能力。我们提出的算法的性能在UF族基准函数上进行了评估,根据不同的度量,如倒代距离(IGD)、代距离(GD)、超体积(HV)和间隔(SP)。实验结果表明了该方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Levy Flight-based Decomposition Multi-objective Optimization Based on Grey Wolf Optimizer
The goal of an optimization technique is to find the best solution to an optimization problem. In a single-objective problem, the best solution is the optimal value for the objective function, while in a multi-objective problem, the selection of solutions is not a straightforward task because there are several objective functions which are in conflict. There are many diverse applications such as image processing and data mining, which can be formulated as a multi-objective problem. This paper presents a new decomposition-based multi-objective optimization method using the grey wolf optimizer, which transforms the problem into several sub-problems and examines all the sub-problems simultaneously. Our proposed algorithm obtains the Pareto front using a neighborhood relation among the sub-problems. The levy flight distribution has also been used which increases the exploration and exploitation features in the algorithm in order to improve the search ability. The performance of our proposed algorithm is evaluated on UF family of benchmark functions in terms of different metric such as inverted generational distance (IGD), generational distance (GD), hyper-volume (HV), and spacing (SP). The experimental results indicate the superior performance of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Parallel Jobs Scheduling Algorithm in The Cloud Computing Online QoS Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks using Network Coding Tasks Decomposition for Improvement of Genetic Network Programming Robust Real-time Magnetic-based Object Localization to Sensor’s Fault using Recurrent Neural Networks A Case Study for Presenting Bank Recommender Systems based on Bon Card Transaction Data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1