IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/1336929.html
   My bibliography  Save this article

Mutation Strategy Based on Step Size and Survival Rate for Evolutionary Programming

Author

Listed:
  • Libin Hong
  • Chenjian Liu
  • Jiadong Cui
  • Fuchang Liu
  • Shi Cheng

Abstract

Evolutionary programming (EP) uses a mutation as a unique operator. Gaussian, Cauchy, Lévy, and double exponential probability distributions and single-point mutation were nominated as mutation operators. Many mutation strategies have been proposed over the last two decades. The most recent EP variant was proposed using a step-size-based self-adaptive mutation operator. In SSEP, the mutation type with its parameters is selected based on the step size, which differs from generation to generation. Several principles for choosing proper parameters have been proposed; however, SSEP still has limitations and does not display outstanding performance on some benchmark functions. In this work, we proposed a novel mutation strategy based on both the “step size†and “survival rate†for EP (SSMSEP). SSMSEP-1 and SSMSEP-2 are two variants of SSMSEP, which use “survival rate†or “step size†separately. Our proposed method can select appropriate mutation operators and update parameters for mutation operators according to diverse landscapes during the evolutionary process. Compared with SSMSEP-1, SSMSEP-2, SSEP, and other EP variants, the SSMSEP demonstrates its robustness and stable performance on most benchmark functions tested.

Suggested Citation

  • Libin Hong & Chenjian Liu & Jiadong Cui & Fuchang Liu & Shi Cheng, 2021. "Mutation Strategy Based on Step Size and Survival Rate for Evolutionary Programming," Discrete Dynamics in Nature and Society, Hindawi, vol. 2021, pages 1-13, October.
  • Handle: RePEc:hin:jnddns:1336929
    DOI: 10.1155/2021/1336929
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2021/1336929.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/ddns/2021/1336929.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/1336929?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
    ---><---

    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:hin:jnddns:1336929. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.