Experiences with fine-grained parallel genetic algorithms
In this paper, we present some results of our systematic studies of fine-grained parallel versions of the island model of genetic algorithms and of variants of the neighborhood model (also called diffusion model) on the massively parallel computer MasPar MP1 with 16k processing elements. These paral...
Uložené v:
| Vydané v: | Annals of operations research Ročník 90; s. 203 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer Nature B.V
01.01.1999
|
| Predmet: | |
| ISSN: | 0254-5330, 1572-9338 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | In this paper, we present some results of our systematic studies of fine-grained parallel versions of the island model of genetic algorithms and of variants of the neighborhood model (also called diffusion model) on the massively parallel computer MasPar MP1 with 16k processing elements. These parallel genetic algorithms have been applied to a range of different problems (e.g. traveling salesman, capacitated lot sizing, resource-constrained project scheduling, flow shop, and warehouse location problems) in order to obtain an empirical basis for statements on their optimization quality. [PUBLICATION ABSTRACT] |
|---|---|
| Bibliografia: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 0254-5330 1572-9338 |
| DOI: | 10.1023/a:1018912715283 |