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

Multiobjective Parallel Chaos Optimization Algorithm with Crossover and Merging Operation

Author

Listed:
  • Qingxian Li
  • Liangjiang Liu
  • Xiaofang Yuan

Abstract

Chaos optimization algorithm (COA) usually utilizes chaotic maps to generate the pseudorandom numbers mapped as the decision variables for global optimization problems. Recently, COA has been applied to many single objective optimization problems and simulations results have demonstrated its effectiveness. In this paper, a novel parallel chaos optimization algorithm (PCOA) will be proposed for multiobjective optimization problems (MOOPs). As an improvement to COA, the PCOA is a kind of population-based optimization algorithm which not only detracts the sensitivity of initial values but also adjusts itself suitable for MOOPs. In the proposed PCOA, crossover and merging operation will be applied to exchange information between parallel solutions and produce new potential solutions, which can enhance the global and fast search ability of the proposed algorithm. To test the performance of the PCOA, it is simulated with several benchmark functions for MOOPs and mixed controller design. The simulation results show that PCOA is an alternative approach for MOOPs.

Suggested Citation

  • Qingxian Li & Liangjiang Liu & Xiaofang Yuan, 2020. "Multiobjective Parallel Chaos Optimization Algorithm with Crossover and Merging Operation," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-13, June.
    • Handle: RePEc:hin:jnlmpe:1419290
    DOI: 10.1155/2020/1419290
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/1419290.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2020/1419290.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/1419290?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:jnlmpe:1419290. 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.