A novel model-based multi-objective evolutionary algorithm
by Maocai Wang; Guangming Dai; Lei Peng; Zhiming Song; Li Mo
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 2, 2016

Abstract: In multi-objective evolutionary algorithm (MOEA), modelling method is a crucial part. Moreover, variable linkages enable the modelling process more complex for multi-objective optimisation problems. The Karush-Kulm-Tucker condition shows that the Pareto set of a continuous MOP with m objectives is a piecewise continuous (m-1)-dimensional manifold. How to use this regularity property to model continuous MOP with variable linkages has been the research focus. In this paper, a model-based multi-objective evolutionary algorithm based on regression analysis (MMEA-RA) for continuous multi-objective optimisation problems with variable linkages is put forward. In the algorithm, the optimisation problem is modelled as a promising area in the decision space by a probability distribution, and the centroid of the probability distribution is (m-1)-dimensional piecewise continuous manifold. The least squares algorithm is used to build such a model. Systematic experiments have shown that, compared with two state-of-the-art algorithms, MMEA-RA performs excellent on a set of test instances with variable linkages.

Online publication date: Fri, 06-May-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

Username:        Password:          Forgotten your 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