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

A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems

Author

Listed:
  • Hongfeng Wang
  • Shengxiang Yang
  • W.H. Ip
  • Dingwei Wang

Abstract

Many real-world optimisation problems are both dynamic and multi-modal, which require an optimisation algorithm not only to find as many optima under a specific environment as possible, but also to track their moving trajectory over dynamic environments. To address this requirement, this article investigates a memetic computing approach based on particle swarm optimisation for dynamic multi-modal optimisation problems (DMMOPs). Within the framework of the proposed algorithm, a new speciation method is employed to locate and track multiple peaks and an adaptive local search method is also hybridised to accelerate the exploitation of species generated by the speciation method. In addition, a memory-based re-initialisation scheme is introduced into the proposed algorithm in order to further enhance its performance in dynamic multi-modal environments. Based on the moving peaks benchmark problems, experiments are carried out to investigate the performance of the proposed algorithm in comparison with several state-of-the-art algorithms taken from the literature. The experimental results show the efficiency of the proposed algorithm for DMMOPs.

Suggested Citation

  • Hongfeng Wang & Shengxiang Yang & W.H. Ip & Dingwei Wang, 2012. "A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems," International Journal of Systems Science, Taylor & Francis Journals, vol. 43(7), pages 1268-1283.
  • Handle: RePEc:taf:tsysxx:v:43:y:2012:i:7:p:1268-1283
    DOI: 10.1080/00207721.2011.605966
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2011.605966?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. Umberto Bartoccini & Arturo Carpi & Valentina Poggioni & Valentino Santucci, 2019. "Memes Evolution in a Memetic Variant of Particle Swarm Optimization," Mathematics, MDPI, vol. 7(5), pages 1-13, May.

    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:43:y:2012:i:7:p:1268-1283. 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.