research-article

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

Authors:

Tian-Li YuAuthors Info & Claims

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

Pages 257 - 264

https://doi.org/10.1145/2330163.2330201

Published: 07 July 2012 Publication History

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.

References

[1]

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.

Digital Library

[2]

A. Barron, J. Rissenen, and B. Yu. The MDL principle in coding and modeling. IEEE Transactions on Information Theory, 44(6):2743--2760, 1998.

Digital Library

[3]

J.-H. Chang, C.-H. Hsueh, H. Lee, T.-L. Yu, and T.-Y. Ho. A test function with full controllability over overlapping and confliction between sub-problems. TEIL Report No. 2011003, National Taiwan University, Taipei, Taiwan, July 2011.

[4]

J.-H. Chang, C.-H. Hsueh, H. Lee, T.-L. Yu, and T.-Y. Ho. A test function with full controllability over overlapping: estimation of distribution algorithms. In GECCO (Companion), pages 61--62. ACM, 2011.

Digital Library

[5]

D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.

Digital Library

[6]

D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms. Kluwer Academic Publishers, Boston, MA, 2002.

Digital Library

[7]

D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333--362, 1992.

[8]

G. Harik. Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Urbana, IL, February 1999.

[9]

J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975.

Digital Library

[10]

H. Lee and T.-L. Yu. Off-line building block identification: Detecting building blocks directly from fitness without genetic algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2012), 2012.

Digital Library

[11]

M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 511--518, 2001.

[12]

M. Pelikan and D. E. Goldberg. Hierarchical BOA solves Ising spin glasses and MAXSAT. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), pages 1271--1282, 2003.

Digital Library

[13]

M. Pelikan, K. G. Helmut, and S. Kobe. Finding ground states of sherrington-kirkpatrick spin glasses with hierarchical boa and genetic algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2008), pages 447--454, 2008.

Digital Library

[14]

M. Pelikan, K. Sastry, D. E. Goldberg, M. V. Butz, and M. Hauschild. Performance of evolutionary algorithms on nk landscapes with nearest neighbor interactions and tunable overlap. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2009), pages 851--858, 2009.

Digital Library

[15]

D. Sherrington and S. Kirkpatrick. Solvable model of a spin-glass. Phys. Rev. Lett., 35:1792--1796, 1975.

[16]

D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, pages 38--45, 1993.

Digital Library

[17]

M. Tsuji, M. Munetomo, and K. Akama. A crossover for complex building blocks overlapping. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2006), pages 1337--1344, 2006.

Digital Library

[18]

T.-L. Yu, D. E. Goldberg, K. Sastry, C. F. Lima, and M. Pelikan. Dependency structure matrix, genetic algorithms,and effective recombination. Evolutionary Computation, vol. 17, no. 4, pp. 595--626, 2009.

Digital Library

[19]

T.-L. Yu, D. E. Goldberg, A. Yassine, and Y.-p. Chen. Genetic algorithm design inspired by organizational theory: Pilot study of a dependency structure matrix driven genetic algorithm. Proceedings of Artificial Neural Networks in Engineering (ANNIE 2003), pages 327--332, 2003.

[20]

T.-L. Yu, K. Sastry, and D. E. Goldberg. Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2005), pages 1217--1224, 2005.

Digital Library

Cited By

Ohnishi KKoga DYu T(2021)Test Problem in Which Bits Used for Fitness Calculation Depend on Bit Pattern2021 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI50451.2021.9660010(01-09)Online publication date: 5-Dec-2021
https://doi.org/10.1109/SSCI50451.2021.9660010
Wang SWu JChen WYu TAlba E(2013)Design of test problems for discrete estimation of distribution algorithmsProceedings of the 15th annual conference on Genetic and evolutionary computation10.1145/2463372.2463419(407-414)Online publication date: 6-Jul-2013
https://dl.acm.org/doi/10.1145/2463372.2463419

Index Terms

A test problem with adjustable degrees of overlap and conflict among subproblems
1. Computing methodologies
  1. Artificial intelligence
    1. Control methods
    2. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
      1. Dynamic programming

Recommendations

Design of test problems for discrete estimation of distribution algorithms
GECCO '13: Proceedings of the 15th annual conference on Genetic and evolutionary computation

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 ...
Off-line building block identification: detecting building blocks directly from fitness without genetic algorithms
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

This paper aims at detecting the existence of building blocks directly from the fitness function without performing genetic algorithms. To do so, this paper extends the convergence time model and the gambler's ruin model so they can be applied to a ...
The defined cliffs variant in dynamic environments: a case study using the shaky ladder hyperplane-defined functions
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

The shaky ladder hyperplane-defined functions (sl-hdfs) are a test suite utilized for exploring the behavior of the genetic algorithm (GA) in dynamic environments. This test suite can generate arbitrary problems with similar levels of difficulty and it ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

July 2012

1396 pages

ISBN:9781450311779

DOI:10.1145/2330163

Editor:
Terence Soule
University of Idaho, USA
,
General Chair:
Jason H. Moore
Dartmouth College, USA

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '12

Sponsor:

SIGEVO

GECCO '12: Genetic and Evolutionary Computation Conference

July 7 - 11, 2012

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
110
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ohnishi KKoga DYu T(2021)Test Problem in Which Bits Used for Fitness Calculation Depend on Bit Pattern2021 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI50451.2021.9660010(01-09)Online publication date: 5-Dec-2021
https://doi.org/10.1109/SSCI50451.2021.9660010
Wang SWu JChen WYu TAlba E(2013)Design of test problems for discrete estimation of distribution algorithmsProceedings of the 15th annual conference on Genetic and evolutionary computation10.1145/2463372.2463419(407-414)Online publication date: 6-Jul-2013
https://dl.acm.org/doi/10.1145/2463372.2463419

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten