PSFGA: Parallel processing and evolutionary computation for multiobjective optimisation
This paper deals with the study of the cooperation between parallel processing and evolutionary computation to obtain efficient procedures for solving multiobjective optimisation problems. We propose a new algorithm called PSFGA (parallel single front genetic algorithm), an elitist evolutionary algo...
Uloženo v:
| Vydáno v: | Parallel computing Ročník 30; číslo 5; s. 721 - 739 |
|---|---|
| Hlavní autoři: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.05.2004
|
| Témata: | |
| ISSN: | 0167-8191, 1872-7336 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This paper deals with the study of the cooperation between parallel processing and evolutionary computation to obtain efficient procedures for solving multiobjective optimisation problems. We propose a new algorithm called PSFGA (parallel single front genetic algorithm), an elitist evolutionary algorithm for multiobjective problems with a clearing procedure that uses a grid in the objective space for diversity maintaining purposes. Thus, PSFGA is a parallel genetic algorithm with a structured population in the form of a set of islands. The performance analysis of PSFGA has been carried out in a cluster system and experimental results show that our parallel algorithm provides adequate results in both, the quality of the solutions found and the time to obtain them. It has been shown that its sequential version also outperforms other previously proposed sequential procedures for multiobjective optimisation in the cases studied. |
|---|---|
| ISSN: | 0167-8191 1872-7336 |
| DOI: | 10.1016/j.parco.2003.12.012 |