Balanced Explore-Exploit clustering based Distributed Evolutionary Algorithm for Multi-objective Optimisation

Most parallel evolutionary algorithms for single and multi-objective optimisation are motivated by the reduction of the computation time and the resolution of larger problems. Another promising alternative is to create new distributed schemes that improve the behaviour of the search process of such...

Full description

Saved in:
Bibliographic Details
Published in:Studies in Informatics and Control 2011, Vol.20 (2), p.97
Main Authors: GZARA, Mariem, ESSABRI, Abdelbasset
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Most parallel evolutionary algorithms for single and multi-objective optimisation are motivated by the reduction of the computation time and the resolution of larger problems. Another promising alternative is to create new distributed schemes that improve the behaviour of the search process of such algorithms. In multi-objective optimisation problems, more exploration of the search space is required to obtain the whole or the best approximation of the Pareto Optimal Front. In this paper, we present a new clustering-based parallel multi-objective evolutionary algorithm that balances between the two main concepts in metaheuristics, which are exploration and exploitation of the search space. The proposed algorithm is implemented and tested on several standard multi-objective test functions using a network of multiple computers.
ISSN:1220-1766
1841-429X
DOI:10.24846/v20i2y201102