Year: 2020
Type: article
Abstract: Evolutionary algorithms based on hypervolume have demonstrated good performance for solving many-objective optimization problems. However, hypervolume needs prohibitively expensive computational effort. This paper proposes a simplified hypervolume calculation method which can be used to roughly evaluate the convergence and diversity of solutions. The main idea is to use the nearest neighbors of a particular solution to calculate the volume as the solution’s hypervolume value. Moreover, this paper improves the selection operator and the update strategy of external population according to the simplified hypervolume. Then, the proposed algorithm (SHEA) is compared with some state-of-the-art algorithms on fifteen test functions of CEC2018 MaOP competition, and the experimental results prove the feasibility of the proposed algorithm.
Source: Complexity
DOI: 10.1155/2020/8353154
Institution: Shaanxi Normal University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,760
Awards: G1170839758, G1251743232, G1572513237, G169550720, G2468528486, G2601127192, G2763570945, G2800471605, G316783314, G3257308832, G3360795578, G3894349201, G4868740807, G5358667250, G6140578506, G6193601323, G6221880073, G6485970289, G6581788575, G6839421957, G7195576720, 动态蛋白质网络复合物识别方法研究及其应用, G7549148348, G7778331940, G7779581260, G7904066442, G7905153775, G8513270824, G8659777408, G8686470721
OpenAlex ID: W3047608480
