A hybrid multiobjective evolutionary algorithm model based on local linear embedding
Summary: Based on the following property: under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimisation problems (MOPs) is a piecewise continuous \((m - 1) - D\) manifold (where \(m\) is the number of objectives), a hybrid multiobjective evolutionary algorithm model based on local linear embedding is proposed for continuous MOPs. At each generation: 1) via local linear embedding and its improved algorithms, the proposed algorithm digs out a nonlinear manifold in the decision space; 2) the new trial solutions are built through the manifold of step 1; 3) a non-dominated sorting-based selection is used for choosing solutions and produce the next generation. Systematic experiments have shown that the algorithm can find out nonlinear manifold hidden in the decision space of MOPs and guide rapid convergence of algorithm.
- A research overview of manifold-learning-based multiobjective evolutionary algorithm
- A novel model-based multi-objective evolutionary algorithm
- An hybrid neural/genetic approach to continuous multi-objective optimization problems.
- A new evolutionary approach for multiobjective optimization
- A multiobjective evolutionary algorithm based on mixture Gaussian models
This page was built for publication: A hybrid multiobjective evolutionary algorithm model based on local linear embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224010)
