IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v47y2016i3p691-706.html
   My bibliography  Save this article

The use of explicit building blocks in evolutionary computation

Author

Listed:
  • Chalermsub Sangkavichitr
  • Prabhas Chongstitvatana

Abstract

This paper proposes a new algorithm to identify and compose building blocks. Building blocks are interpreted as common subsequences between good individuals. The proposed algorithm can extract building blocks from a population explicitly. Explicit building blocks are identified from shared alleles among multiple chromosomes. These building blocks are stored in an archive. They are recombined to generate offspring. The additively decomposable problems and hierarchical decomposable problems are used to validate the algorithm. The results are compared with the Bayesian optimisation algorithm, the hierarchical Bayesian optimisation algorithm, and the chi-square matrix. This proposed algorithm is simple, effective, and fast. The experimental results confirm that building block identification is an important process that guides the recombination procedure to improve the solutions. In addition, the method efficiently solves hard problems.

Suggested Citation

  • Chalermsub Sangkavichitr & Prabhas Chongstitvatana, 2016. "The use of explicit building blocks in evolutionary computation," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(3), pages 691-706, February.
  • Handle: RePEc:taf:tsysxx:v:47:y:2016:i:3:p:691-706
    DOI: 10.1080/00207721.2014.901580
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2014.901580
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2014.901580?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander V Spirov & Ekaterina M Myasnikova, 2022. "Heuristic algorithms in evolutionary computation and modular organization of biological macromolecules: Applications to in vitro evolution," PLOS ONE, Public Library of Science, vol. 17(1), pages 1-42, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:47:y:2016:i:3:p:691-706. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.