Article ID: | iaor20014163 |
Country: | Netherlands |
Volume: | 90 |
Start Page Number: | 203 |
End Page Number: | 219 |
Publication Date: | Aug 1999 |
Journal: | Annals of Operations Research |
Authors: | Haase Knut, Kohlmorgen Udo, Schmeck Hartmut |
Keywords: | computational analysis: parallel computers, programming: travelling salesman |
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 neighbourhood 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.