Experience with fine-grained parallel genetic algorithms

DOI10.1023/A:1018912715283zbMath0937.90092OpenAlexW1994815518MaRDI QIDQ1808195

Knut Haase, Udo Kohlmorgen, Hartmut Schmeck

Publication date: 2 December 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018912715283

zbMATH Keywords

combinatorial optimizationisland modelneighborhood modelfine-grained parallel genetic algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (12)

Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Experimental investigation of heuristics for resource-constrained project scheduling: an update ⋮ New concepts for activity float in resource-constrained project management ⋮ A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. ⋮ New representation to reduce the search space for the resource-constrained project scheduling problem ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Activity list representation for a generalization of the resource-constrained project scheduling problem ⋮ Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem ⋮ Heuristic genetic algorithms for general capacitated lot-sizing problems

This page was built for publication: Experience with fine-grained parallel genetic algorithms