.png){kind=icon}
返回
Multi-objective optimization using metaheuristics: non-standard algorithms
.png){kind=icon}
OA
AI
DOI：10.1111/j.1475-3995.2011.00808.x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent years, the application of metaheuristic techniques to solve multi-objective optimization problems (MOPs) has become an active research area. Solving these kinds of problems involves obtaining a set of Pareto-optimal solutions in such a way that the corresponding Pareto front fulfills the requirements of convergence to the true Pareto front and uniform diversity. Most studies on metaheuristics for multi-objective optimization are focused on Evolutionary Algorithms, and some of the state-of-the-art techniques belong to this class of algorithms. Our goal in this paper is to study open research lines related to metaheuristics but focusing on less explored areas to provide new perspectives to those researchers interested in multi-objective optimization. In particular, we focus on non-evolutionary metaheuristics, hybrid multi-objective metaheuristics, parallel multi-objective optimization, and multi-objective optimization under uncertainty. We analyze these issues and discuss open research lines.
Keyword:
multi-objective optimization
metaheuristics
hybridization
parallelism
optimization under uncertainty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
PREAI
分享收藏分享收藏分享收藏
Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏
查看更多内容