文章基本信息

标题：Reducing the Computational Cost in Multi-objective Evolutionary Algorithms by Filtering Worthless Individuals
本地全文：下载
作者：Zahra Pourbahman ; Ali Hamzeh
期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2013
卷号：10
期号：5
出版社：IJCSI Press
摘要：The large number of exact fitness function evaluations makes evolutionary algorithms to have computational cost (especially in Multi Objective Problems (MOPs)). In some real- world problems, reducing number of these evaluations is much more valuable even by increasing computational complexity and spending more time. To fulfil this target, we introduce an effective factor, in spite of applied factor in Adaptive Fuzzy Fitness Granulation NSGA#1030;#1030; (AFFG_NSGA#1030;#1030;) algorithm, to filter out worthless individuals more precisely. Our proposed approach is compared with respect to AFFG_NSGA#1030;#1030;, using the Hypervolume (HV) and the Inverted Generational Distance (IGD) performance measures. The proposed method is applied to 1 traditional and 1 state-of-the-art benchmarks with considering 3 different dimensions. From an average performance view, the results indicate that although decreasing the number of fitness evaluations leads to have performance reduction but it is not tangible compared to what we gain.
关键词：Multi objective evolutionary algorithm optimization; Fitness approximation; Information granulation; Pareto optimal solutions.