版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:School of Computer Science Huanggang Normal University Huanggang Hubei438000 China Science and Technology on Blind Signal Processing Laboratory Southwest Electronics and Telecommunication Technology Research Institute Chengdu Sichuan610041 China School of Mechanical Engineering and Electronic Information China University of Geosciences Wuhan Hubei430074 China
出 版 物:《International Journal of Innovative Computing and Applications》 (Int. J. Innovative Comput. Appl.)
年 卷 期:2019年第10卷第1期
页 面:51-58页
核心收录:
学科分类:08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:This work is supported by the National Science Foundation of China under Grant 61673355 61271140 and 61203306 and by the high-performance computing platform of China University of Geosciences the high-performance computing platform of China University of Geosciences
摘 要:One difficulty in solving optimisation problems is the handling many local optima. The usual approaches to handle the difficulty are to introduce the niche-count into evolutionary algorithms (EAs) to increase population diversity. In this paper, we introduce the niche-count into the problems, not into the EAs. We construct a dynamic multi-objective optimisation problem (DMOP) for the single optimisation problem (SOP) and ensure both the DMOP and the SOP are equivalent to each other. The DMOP has two objectives: the original objective and a niche-count objective. The second objective aims to maintain the population diversity for handling the local optima difficulty during the search process. A dynamic version of a multi-objective evolutionary algorithm (DMOEA), specifically, HypE-DE, is used to solve the DMOP;consequently the SOP is solved. Experimental results show that the performance of the proposed method is significantly better than the state-of-the-art competitors on a set of test problems. Copyright © 2019 Inderscience Enterprises Ltd.