High performance computing for dynamic multi-objective optimisation Online publication date: Sun, 29-Mar-2009
by Mario Camara, Julio Ortega, Francisco De Toro
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 1, No. 4, 2008
Abstract: In this paper a generic parallel procedure for dynamic problems using evolutionary algorithms is presented. In dynamic multi-objective problems, the objective functions, the constraints and hence, also the solutions, can change over time and usually demand to be solved online. Thus, high performance computing approaches, such as parallel processing, should be applied to these problems to meet the solution constraints and quality requirements. Taking this into account, we introduce a generic parallel procedure for multi-objective evolutionary algorithms, through a master-slave paradigm. This generic parallel procedure is used to compare the parallel processing of a few multi-objective optimisation evolutionary algorithms: our proposed algorithms, SFGA and SFGA2, in conjunction with SPEA2 and NSGA-II. We also give a model to understand the benefits of parallel processing in dynamic multi-objective problems and the speedup results observed in our experiments.
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 High Performance Systems Architecture (IJHPSA):
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