Genetic Algorithms and Book Embeddings: A Dual Layered Approach

The genetic algorithm (GA) has been applied to a wide variety of problems where truly optimal solutions are computationally intractable. One such problem is the book embedding problem from graph theory. A book embedding is an ordering of vertices along a line (the spine) with the edges embedded in half-planes (the pages) extruding from the line so that the edges do not cross. The goal is to find the minimal number of halfplanes needed to embed a given graph. This problem is known to be NP-complete. The paper shows that the GA can be used to generate counter-examples to conjectured minimum bounds.

[1]  Paul C. Kainen,et al.  Extension of a theorem of Whitney , 2007, Appl. Math. Lett..

[2]  Peter F. Stadler,et al.  Relevant Cycles in Biopolymers and Random Graphs , 1999 .

[3]  Ivan Stojmenovic,et al.  A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks , 2002, J. Parallel Distributed Comput..

[4]  S. Ganzerli,et al.  Trusses, NP-Completeness, and Genetic Algorithms , 2006 .

[5]  D. Palma.  Info-gap uncertainty in structural optimization via genetic algorithms , 2004 .

[6]  Chang Wook Ahn,et al.  On the practical genetic algorithms , 2005, GECCO '05.

[7]  Arnold L. Rosenberg,et al.  Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[8]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[9]  David R. Wood,et al.  On Linear Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  M. Burkhart,et al.  Efficiency of genetic algorithms for optimal structural design considering convex models of uncertainty , 2002 .

[12]  Douglas B. West,et al.  Pagenumber of complete bipartite graphs , 1988, J. Graph Theory.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Uday Kumar Chakraborty,et al.  Genetic and evolutionary computing , 2008, Inf. Sci..

[15]  Mihalis Yannakakis,et al.  Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.

[16]  Manolis Papadrakakis,et al.  Structural design optimization considering uncertainties , 2008 .

[17]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[18]  George F. Luger,et al.  AI Algorithms, Data Structures, and Idioms in Prolog, Lisp, and Java for Artificial Intelligence: Structures and Strategies for Complex Problem Solving , 2008 .

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.