An improved SPEA2 algorithm with adaptive selection of evolutionary operators scheme for multiobjective optimization problems (Q1793615)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6953602
Language Label Description Also known as
default for all languages
No label defined
    English
    An improved SPEA2 algorithm with adaptive selection of evolutionary operators scheme for multiobjective optimization problems
    scientific article; zbMATH DE number 6953602

      Statements

      An improved SPEA2 algorithm with adaptive selection of evolutionary operators scheme for multiobjective optimization problems (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      12 October 2018
      0 references
      Summary: A fixed evolutionary mechanism is usually adopted in the multiobjective evolutionary algorithms and their operators are static during the evolutionary process, which causes the algorithm not to fully exploit the search space and is easy to trap in local optima. In this paper, a SPEA2 algorithm which is based on adaptive selection evolution operators (AOSPEA) is proposed. The proposed algorithm can adaptively select simulated binary crossover, polynomial mutation, and differential evolution operator during the evolutionary process according to their contribution to the external archive. Meanwhile, the convergence performance of the proposed algorithm is analyzed with Markov chain. Simulation results on the standard benchmark functions reveal that the performance of the proposed algorithm outperforms the other classical multiobjective evolutionary algorithms. Editorial remark: At the request of the authors, this article has been retracted. The article was published without the knowledge or approval of Zhen Chen who graduated from the School of Computer and Communication Technology, Lanzhou University of Technology and wrote this article.
      0 references
      0 references
      0 references

      Identifiers