Multi-objective chaos game optimization

Nima Khodadadi, Laith Abualigah, Qasem Al-Tashi, Seyedali Mirjalili

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

The Chaos Game Optimization (CGO) has only recently gained popularity, but its effective searching capabilities have a lot of potential for addressing single-objective optimization issues. Despite its advantages, this method can only tackle problems formulated with one objective. The multi-objective CGO proposed in this study is utilized to handle the problems with several objectives (MOCGO). In MOCGO, Pareto-optimal solutions are stored in a fixed-sized external archive. In addition, the leader selection functionality needed to carry out multi-objective optimization has been included in CGO. The technique is also applied to eight real-world engineering design challenges with multiple objectives. The MOCGO algorithm uses several mathematical models in chaos theory and fractals inherited from CGO. This algorithm's performance is evaluated using seventeen case studies, such as CEC-09, ZDT, and DTLZ. Six well-known multi-objective algorithms are compared with MOCGO using four different performance metrics. The results demonstrate that the suggested method is better than existing ones. These Pareto-optimal solutions show excellent convergence and coverage.

Original languageEnglish
JournalNeural Computing and Applications
DOIs
Publication statusPublished - 2023

Keywords

  • Algorithm
  • Artificial Intelligence
  • Bechmark
  • CEC benchmark
  • Chaos game optimization
  • Engineering problems
  • Multi-objective optimization
  • Optimization

Fingerprint

Dive into the research topics of 'Multi-objective chaos game optimization'. Together they form a unique fingerprint.

Cite this