Design of test problems for discrete estimation of distribution algorithms

Authors:
Shih-Ming Wang;Jie-Wei Wu;Wei-Ming Chen;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 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 8
Cited 0

Finding Multimodal Solutions Using Restricted Tournament Selection

Proceedings of the 6th 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
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 problem with adjustable degrees of overlap and conflict among subproblems

Proceedings of the 14th annual conference on Genetic and evolutionary computation
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two types of problem structures, overlapping and conflict structures, are challenging for the estimation of distribution algorithms (EDAs) to solve. To test the capabilities of different EDAs of dealing with overlapping and conflict structures, some test problems have been proposed. However, the upper-bound of the degree of overlap and the effect of conflict have not been fully investigated. This paper investigates how to properly define the degree of overlap and the degree of conflict to reflect the difficulties of problems for the EDAs. A new test problem is proposed with the new definitions of the degree of overlap and the degree of conflict. A framework for building the proposed problem is presented, and some model-building genetic algorithms are tested by the problem. This test problem can be applied to further researches on overlapping and conflict structures.