Relational Implementation of Simple Parallel Evolutionary Algorithms
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.
KeywordsEvolutionary Algorithm Vertex Cover Relational Algebra Present Solution Binary Decision Diagram
Unable to display preview. Download preview PDF.
- 3.Berghammer, R., Hoffmann, T., Leoniuk, B., Milanese, U.: Prototyping and programming with relations. Electronic Notes in Theoretical Computer Science 44 (2003)Google Scholar
- 6.Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In: Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM (2000)Google Scholar
- 7.Hromkovic, J.: Algorithms for hard problems. In: Introduction to combinatorial optimization, randomization, approximation, and heuristics. Springer, Heidelberg (2001)Google Scholar
- 8.Leoniuk, B.: ROBDD-based implementation of relational algebra with applications (in German). Ph.D. thesis, Inst. für Inf. und Prak. Math., Univ. Kiel (2001)Google Scholar
- 9.Milanese, U.: On the implementation of a ROBDD-based tool for the manipulation and visualization of relations (in German). Ph.D. thesis, Inst. für Inf. und Prak. Math., Univ. Kiel (2003)Google Scholar
- 11.Wegener, I.: Branching programs and binary decision diagrams – theory and applications. SIAM Monographs on Discr. Math. and Appl. (2000)Google Scholar