A hybrid multiobjective evolutionary algorithm model based on local linear embedding Online publication date: Mon, 08-Jun-2015
by Wei Zhan; Wenling You; Ming Zhang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 3, 2015
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook