Loading...
Please wait, while we are loading the content...
Similar Documents
Experiences with Fine-grained Parallel Genetic Algorithms
| Content Provider | Semantic Scholar |
|---|---|
| Author | Kohlmorgen, Algorithms Udo Schmeck, Hartmut Haase, K. |
| Copyright Year | 1996 |
| Abstract | In this paper we present some results of our systematic studies of ne-grained parallel versions of the island model of genetic algorithms and of variants of the neighborhood model (also called diiusion model) on the massively parallel computer MasPar MP1 with 16k processing elements. These parallel genetic algorithms have been applied to a range of diierent problems (e.g. traveling salesperson, capacitated lot sizing, ressource constrained project scheduling, ow shop, and warehouse location problems) in order to obtain an empirical basis for statements on their optimization quality. |
| File Format | PDF HTM / HTML |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
