.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
multi-objective optimization
metaheuristics
hybridization
parallelism
optimization under uncertainty
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K
Organization
Cited Papers
.png){kind=icon}
An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more