返回
A fast multi-objective optimization using an efficient ideal gas molecular movement algorithm
DOI:10.1007/s00366-016-0485-7.png)
摘要
En 中文
Recently, the ideal gas molecular movement (IGMM) algorithm was proposed by the authors as a new metaheuristic optimization technique for solving SOPs. In this paper, the intention is to extend the IGMM to solve MOPs while some modifications to the algorithm are taken place. The major improvement to the algorithm comprises usage of a neighbor-based non-dominated selection technique and defining a set of non-dominated solutions stored in an archive causing a globally faster convergence of the procedure. To evaluate the proposed algorithm, a set of standard benchmark problems, the so-called ZDT functions and two engineering benchmarks, are solved and the results were compared with five known multi-objective algorithms provided in the literature. Three different performance metrics; generational distance, spacing and maximum spread are introduced as well to evaluate multi-objective optimization problems. The Wilcoxon's rank-sum nonparametric statistical test was also attempted which resulted on the fact that the proposed algorithm may exhibit a significantly better performance than those other techniques. The results from the real engineering applications also prove the advancement of the MO-IGMM performance in practice. Compared to five other multi-objective optimization evolutionary algorithms, simulation results show that in most cases, the proposed MO-IGMM is capable to find a much better uniformly spread of solutions with a faster convergence to the true Pareto optimal front.
Keyword:
IGMM algorithm
Metaheuristic
Multi-objective
Engineering design problems
Pareto front
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.7K
被引数:
9.3K
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Improving a multi-objective differential evolution optimizer using fuzzy adaptation and -medoids clustering使用模糊自适应和-medoids聚类改进多目标差分进化优化器
SOFT COMPUTING
IF2.5

