Relational implementation of simple parallel evolutionary algorithms
Date
2006
Authors
Kehden, B.
Neumann, F.
Berghammer, R.
Editors
MacCaull, W.
Winter, M.
Duntsch, I.
Winter, M.
Duntsch, I.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Relational Methods in Computer Science : 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra and Workshop of COST Action 274: TARSKI : St. Catharines, ON, Canada, February 22-26, 2005 : Selected Revised Papers / W. MacCaull, M. Winter, I. Düntsch (eds.), pp.161-172
Statement of Responsibility
Britta Kehden, Frank Neumann, and Rudolf Berghammer
Conference Name
International Seminar on Relational Methods in Computer Science (8th : 2005 : St Catharines, Ontario, Canada)
DOI
Abstract
Randomized search heuristics, among them evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to hard problems in combinatorial optimization to get near-optimal solutions. We present a new approach implementing simple parallel evolutionary algorithms by relational methods. Populations are represented as relations which are implicitly encoded by (reduced, ordered) binary decision diagrams. Thereby, the creation and evaluation is done in parallel, which increases efficiency considerably.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© Springer-Verlag Berlin Heidelberg 2006