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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
