多前沿公平分配的并行多目标进化算法

Abdelbasset Essabri, M. Gzara, T. Loukil
{"title":"多前沿公平分配的并行多目标进化算法","authors":"Abdelbasset Essabri, M. Gzara, T. Loukil","doi":"10.1109/GCC.2006.68","DOIUrl":null,"url":null,"abstract":"In multi-objective context, the evolutionary approach offers specific mechanisms such as Pareto selection, elitism and diversification. These techniques are proved to be efficient to characterize the Pareto front. However, their high computing time constitutes a major handicap for their expansion. The parallelization of multi-objective evolutionary algorithms (MOEAs) may be an efficient way to overcome this problem. This parallelization aims not only to achieve time saving by distributing the computational effort but also to get benefit from the algorithmic aspect by the cooperation between different populations and evolutionary schemes. In this paper we propose a new parallel multi-objective evolutionary algorithm with multi-front equitable distribution which is based on an elitist technique. Every population evolves differently on a processor and cooperates with the others to preserve genetic diversity and to obtain a set of diversified non dominated solutions","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Parallel Multi-Objective Evolutionary Algorithm with Multi-Front Equitable Distribution\",\"authors\":\"Abdelbasset Essabri, M. Gzara, T. Loukil\",\"doi\":\"10.1109/GCC.2006.68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In multi-objective context, the evolutionary approach offers specific mechanisms such as Pareto selection, elitism and diversification. These techniques are proved to be efficient to characterize the Pareto front. However, their high computing time constitutes a major handicap for their expansion. The parallelization of multi-objective evolutionary algorithms (MOEAs) may be an efficient way to overcome this problem. This parallelization aims not only to achieve time saving by distributing the computational effort but also to get benefit from the algorithmic aspect by the cooperation between different populations and evolutionary schemes. In this paper we propose a new parallel multi-objective evolutionary algorithm with multi-front equitable distribution which is based on an elitist technique. Every population evolves differently on a processor and cooperates with the others to preserve genetic diversity and to obtain a set of diversified non dominated solutions\",\"PeriodicalId\":280249,\"journal\":{\"name\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCC.2006.68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在多目标环境下,进化方法提供了特定的机制,如帕累托选择、精英主义和多样化。这些技术被证明是有效的表征帕累托锋面。然而,它们的高计算时间构成了它们扩展的主要障碍。多目标进化算法的并行化可能是克服这一问题的有效途径。这种并行化的目的不仅在于通过分配计算量来节省时间,而且在于通过不同种群和进化方案之间的合作来获得算法方面的好处。本文提出了一种基于精英技术的并行多目标公平分配进化算法。每个种群在同一处理机上进化的方式不同,并与其他种群合作,以保持遗传多样性,获得一套多样化的非显性解决方案
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Parallel Multi-Objective Evolutionary Algorithm with Multi-Front Equitable Distribution
In multi-objective context, the evolutionary approach offers specific mechanisms such as Pareto selection, elitism and diversification. These techniques are proved to be efficient to characterize the Pareto front. However, their high computing time constitutes a major handicap for their expansion. The parallelization of multi-objective evolutionary algorithms (MOEAs) may be an efficient way to overcome this problem. This parallelization aims not only to achieve time saving by distributing the computational effort but also to get benefit from the algorithmic aspect by the cooperation between different populations and evolutionary schemes. In this paper we propose a new parallel multi-objective evolutionary algorithm with multi-front equitable distribution which is based on an elitist technique. Every population evolves differently on a processor and cooperates with the others to preserve genetic diversity and to obtain a set of diversified non dominated solutions
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信