Multiobjective Parallel Chaos Optimization Algorithm with Crossover and Merging Operation

Qingxian Li, Liangjiang Liu and Xiaofang Yuan

Mathematical Problems in Engineering, 2020, vol. 2020, 1-13

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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/1419290.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/1419290.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:1419290

DOI: 10.1155/2020/1419290

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().