Multi-objective Estimation of Distribution Algorithm based on Voronoi and local search

Elham Mohagheghi, M. Akbarzadeh-T.
{"title":"Multi-objective Estimation of Distribution Algorithm based on Voronoi and local search","authors":"Elham Mohagheghi, M. Akbarzadeh-T.","doi":"10.1109/ICCKE.2016.7802115","DOIUrl":null,"url":null,"abstract":"In this paper we propose an Estimation of Distribution Algorithm (EDA) equipped with Voronoi and local search based on leader for multi-objective optimization. We introduce an algorithm that can keep the balance between the exploration and exploitation using the local information in the searched areas through the global estimation of distribution algorithm. Moreover, the probability model in EDA, receives special statistical information about the amount of the variables and their important dependency. The proposed algorithm uses the Voronoi diagram in order to produce the probability model. By using this model, there will be a selection based on the area instead of selection based on the individual, and all individual information could use to produce new solution. In the proposed algorithm, considering the simultaneous use of global information about search area, local information of the solutions and the Voronoi based probability model lead to produce more diverse solutions and prevent sticking in local optima. Also, in order to reduce the data dimension, the principle component analysis is proposed. Several benchmarks functions with different complexity like linear and non-linear relationship between the variables, the continues\\-discontinues and convex\\non-convex optima fronts use to show the algorithm performance.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2016.7802115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper we propose an Estimation of Distribution Algorithm (EDA) equipped with Voronoi and local search based on leader for multi-objective optimization. We introduce an algorithm that can keep the balance between the exploration and exploitation using the local information in the searched areas through the global estimation of distribution algorithm. Moreover, the probability model in EDA, receives special statistical information about the amount of the variables and their important dependency. The proposed algorithm uses the Voronoi diagram in order to produce the probability model. By using this model, there will be a selection based on the area instead of selection based on the individual, and all individual information could use to produce new solution. In the proposed algorithm, considering the simultaneous use of global information about search area, local information of the solutions and the Voronoi based probability model lead to produce more diverse solutions and prevent sticking in local optima. Also, in order to reduce the data dimension, the principle component analysis is proposed. Several benchmarks functions with different complexity like linear and non-linear relationship between the variables, the continues\-discontinues and convex\non-convex optima fronts use to show the algorithm performance.
基于Voronoi和局部搜索的多目标分布估计算法
本文提出了一种结合Voronoi和基于leader的局部搜索的多目标优化分布估计算法(EDA)。通过全局估计分布算法,提出了一种利用搜索区域的局部信息来平衡搜索和开发的算法。此外,EDA中的概率模型接收关于变量数量及其重要依赖关系的特殊统计信息。该算法使用Voronoi图来生成概率模型。通过使用这个模型,将有一个基于区域的选择,而不是基于个体的选择,所有的个体信息可以用来产生新的解决方案。在该算法中,考虑到同时使用搜索区域的全局信息、解的局部信息以及基于Voronoi的概率模型,可以产生更多样化的解,避免陷入局部最优。为了降低数据维数,提出了主成分分析方法。使用不同复杂度的基准函数,如变量之间的线性和非线性关系、连续/间断和凸/非凸最优前,来显示算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信