Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
SIAM Review
Barrier Trees on Poset-Valued Landscapes
Genetic Programming and Evolvable Machines
A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint
Proceedings of the 3rd International Conference on Genetic Algorithms
Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms
Evolutionary Computation
Algebraic theory of recombination spaces
Evolutionary Computation
Barrier trees for search analysis
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Large Barrier Trees for Studying Search
IEEE Transactions on Evolutionary Computation
Visualization for the Physical Sciences
Computer Graphics Forum
Topology-based visualization of transformation pathways in complex chemical systems
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes defined over general multiparent search operators based on a suitable notion of topological connectedness that depends explicitly on the search operator. We show that in the case of recombination spaces, path-connectedness coincides with connectedness as defined by the mutation operator alone. In contrast, topological connectedness is more general and depends on the details of the recombination operators as well. Barrier trees can be meaningfully defined for both concepts of connectedness.