Please use this identifier to cite or link to this item:
Title: Differential evolution with large initial populations
Authors: Qian, Yanfei
Keywords: Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Qian, Y. (2022). Differential evolution with large initial populations. Master's thesis, Nanyang Technological University, Singapore.
Abstract: This paper proposed a novel method to determine which individuals can enter from the first search phase to the second phase search. An orthogonal array constructs the initial population. The first search phase is neighborhood-based search, and game theory is also introduced. After finishing the first phase, there are two criteria to enter the next phase. One is a traditional standard, fitness. Another is the score, which is generated from the game. This new algorithm, named OGLSHADE-CS, involves other techniques: linear population reduction, success history base adaption, multi-strategy mutation, and conservative selection. This algorithm and some state-of-the-art algorithms test the 2020 CEC benchmark suite. They are compared using some statistic tests. The results show that game theory can improve performance.
Schools: School of Electrical and Electronic Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
  Restricted Access
2.57 MBAdobe PDFView/Open

Page view(s)

Updated on Apr 14, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.