Analyzing Directed Acyclic Graph Recombination

This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described. As an experimental analysis indicates, a recombination operator using these units has sub-quadratic complexity in the graph size. It is also shown that a standard gene-transmission recombination operator is biased to produce solutions of lower edge-density than the parents' average. An unbiased allelic recombination operator provides better results on an ad-hoc test problem.

[1]  Nicholas J. Radcliffe,et al.  Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[2]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[3]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[4]  P. Gehler,et al.  An introduction to graphical models , 2001 .

[5]  Simon Handley,et al.  On the use of a directed acyclic graph to represent a population of computer programs , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[6]  Carlos Cotta,et al.  On the influence of the representation granularity in heuristic forma recombination , 2000, SAC '00.

[7]  Jason Cong,et al.  DAG-Map: graph-based FPGA technology mapping for delay optimization , 1992, IEEE Design & Test of Computers.

[8]  Riccardo Poli,et al.  Parallel Distributed Genetic Programming , 1996 .

[9]  Michael P. Wellman,et al.  Bayesian networks , 1995, CACM.

[10]  Song Li,et al.  Metis – An Object‐Oriented Toolkit for Constructing Virtual Reality Applications , 1999, Comput. Graph. Forum.

[11]  Pedro Larrañaga,et al.  Learning Bayesian network structures by searching for the best ordering with genetic algorithms , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[12]  Herman Ehrenburg.  Improved directed acyclic graph evaluation and the combine operator in genetic programming , 1996 .

[13]  Michel Cosnard,et al.  Automatic task graph generation techniques , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[14]  Luis M. de Campos,et al.  A new approach for learning belief networks using independence criteria , 2000, Int. J. Approx. Reason..

[15]  David A. Padua,et al.  Dependence graphs and compiler optimizations , 1981, POPL '81.