Graph-based evolutionary algorithms

Abstract

Abstract-Evolutionary algorithms use crossover to combine information from pairs of solutions and use selection to retain the best solutions. Ideally, crossover takes distinct good features from each of the two structures involved. This process creates a conflict: progress results from crossing over structures with different features, but crossover produces new structures that are like their parents and so reduces the diversity on which it depends. As evolution continues, the algorithm searches a smaller and smaller portion of the search space. Mutation can help maintain diversity but is not a panacea for diversity loss. This paper explores evolutionary algorithms that use combinatorial graphs to limit possible crossover partners. These graphs limit the speed and manner in which information can spread giving competing solutions time to mature. This use of graphs is a computationally inexpensive method of picking a global level of tradeoff between exploration and exploitation. The results of using 26 graphs with a diverse collection of graphical properties are presented. The test problems used are: one-max, the De Jong functions, the Griewangk function in three to seven dimensions, the self-avoiding random walk problem in 9, 12, 16, 20, 25, 30, and 36 dimensions, the plus-one-recall-store (PORS) problem with = 15 16 and 17, location of length-six one-error-correcting DNA barcodes, and solving a simple differential equation semi-symbolically.The choice of combinatorial graph has a significant effect on the time-to-solution. In the cases studied, the optimal choice of graph improved solution time as much as 63-fold with typical impact being in the range of 15% to 100% variation. The graph yielding superior performance is found to be problem dependent. In general, the optimal graph diameter increases and the optimal average degree decreases with the complexity and difficulty of the fitness landscape. The use of diverse graphs as population structures for a collection of problems also permits a classification of the problems. A phylogenetic analysis of the problems using normalized time to solution on each graph groups the numerical problems as a clade together with one-max; self-avoiding walks form a clade with the semisymbolic differential equation solution; and the PORS and DNA barcode problems form a superclade with the numerical problems but are substantially distinct from them. This novel form of analysis has the potential to aid researchers choosing problems for a test suite.Index Terms-Evolutionary algorithm, graph-based algorithms, population structure, test suite.

An analysis of the effects of population structure on scalable multiobjective optimization problems

“…al., [10,11] and Bryden et. al., [2]. The results reported, using single objective problems, show how the topology of the network (or graph) used to constrain the interactions between individuals has a direct impact on the overall behaviour of the evolving population.…”

Optimization of a Hydraulic Mixing Nozzle

“…There are computationally expensive methods of preventing premature convergence, such as restarting the algorithm or niche specialization [Mitchell 1998]. Graph-based evolutionary algorithms [Bryden 2005] provide an alternative method of avoiding premature convergence. Members of an evolving population are placed on the vertices of a combinatorial graph; this has the effect of placing a geographic structure on the population.…”

“…Experiments suggest that the correct graph is a sparse one for difficult or polymodal problems and a highly connected one for simple or unimodal problems [Bryden 2005]. An ongoing effort to classify problems by their interaction with graphs [Ashlock 2006] seeks to make the selection of graphs more exact.…”

A study of mutational robustness as the product of evolutionary computation

“…Studying graph-based genetic algorithms [2,4], alternative means of selection, or other methods which control the interaction between members of the population pool could provide additional insight.…”