Experiences with fine‐grainedparallel genetic algorithms

U. Kohlmorgen, H. Schmeck and K. Haase

Annals of Operations Research, 1999, vol. 90, issue 0, 203-219

Abstract: In this paper, we present some results of our systematic studies of fine‐grained parallelversions 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 16kprocessing elements. These parallel genetic algorithms have been applied to a range ofdifferent problems (e.g. traveling salesman, capacitated lot sizing, resource‐constrainedproject scheduling, flow shop, and warehouse location problems) in order to obtain anempirical basis for statements on their optimization quality. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018912715283 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:90:y:1999:i:0:p:203-219:10.1023/a:1018912715283

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018912715283

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().