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...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 90; p. 203
Main Authors: Kohlmorgen, Udo, Schmeck, Hartmut, Haase, Knut
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01.01.1999
Subjects:
Algorithms
Genetic algorithms
Genetic engineering
Islands
Mutation
Neighborhoods
Operations research
Optimization
Population
Project management
Scheduling
Studies
Warehousing
ISSN:0254-5330, 1572-9338
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1023/a:1018912715283