A test problem with adjustable degrees of overlap and conflict among subproblems

Authors:
Wei-Ming Chen;Chung-Yu Shao;Po-Chun Hsu;Tian-Li Yu
Affiliations:
National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc
Venue:
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Year:
2012

Citing 13
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
The Design of Innovation: Lessons from and for Competent Genetic Algorithms

The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Mixing in Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A crossover for complex building blocks overlapping

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Finding ground states of Sherrington-Kirkpatrick spin glasses with hierarchical boa and genetic algorithms

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Dependency structure matrix, genetic algorithms, and effective recombination

Evolutionary Computation
Hierarchical BOA solves ising spin glasses and MAXSAT

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
A test function with full controllability over overlapping: estimation of distribution algorithms

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
The minimum description length principle in coding and modeling

IEEE Transactions on Information Theory
Off-line building block identification: detecting building blocks directly from fitness without genetic algorithms

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Design of test problems for discrete estimation of distribution algorithms

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the field of genetic algorithms (GAs), some researches on overlapping building blocks (BBs) have been proposed. To further study on overlapping BBs, we need to measure the performance of an algorithm to solve problems with over-lap among subproblems. Several test problems have been proposed, but the controllability over the degree of overlapping is not yet fully satisfactory. Our new test problem is designed with full controllability of overlapping as well as conflict, a specific type of overlap, among BBs. We present a framework for building the structure of this problem in this paper. Some model-building GAs are tested by the proposed problem. This test problem can be applied to further researches on overlapping and conflicting BBs.