Convergence speed in multi-objective metaheuristics: Efficiency criteria and empirical study
From MaRDI portal
Publication:3062625
DOI10.1002/nme.2944zbMath1202.65081OpenAlexW1985102119MaRDI QIDQ3062625
Enrique Alba, Carlos A. Coello Coello, Juan J. Durillo, Francisco Luna, Antonio J. Nebro
Publication date: 28 December 2010
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.2944
Related Items (4)
An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria ⋮ Gradient subspace approximation: a direct search method for memetic computing ⋮ A new concept for fuzzy variable based non-linear programming problem with application on system reliability via genetic algorithm approach ⋮ Some convergence-based M-ary cardinal metrics for comparing performances of multi-objective optimizers
Uses Software
Cites Work
- Response surface approximation of Pareto optimal front in multi-objective optimization
- CALCULATION OF DECAY WIDTHS FOR ppμ* IN ADIABATIC REPRESENTATION METHOD USING A VARIATIONAL PROCEDURE
- MOCell: A cellular genetic algorithm for multiobjective optimization
- Handbook of metaheuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence speed in multi-objective metaheuristics: Efficiency criteria and empirical study