A new hybrid memetic multi-objective optimization algorithm for multi-objective optimization

被引:27
作者
Luo, Jianping [1 ,2 ,3 ]
Yang, Yun [1 ,2 ,3 ]
Liu, Qiqi [1 ,2 ,3 ]
Li, Xia [1 ,2 ,3 ]
Chen, Minrong [1 ,2 ,3 ]
Gao, Kaizhou [1 ,2 ,3 ]
机构
[1] Guangdong Key Lab Intelligent Informat Proc, Shenzhen, Peoples R China
[2] Shenzhen Key Lab Media Secur, Shenzhen, Peoples R China
[3] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China
基金
中国国家自然科学基金;
关键词
Evolutionary computing; Hybrid computing; Multiple objective programming; Algorithm diversity; Shuffled frog leaping algorithm; Extremal optimization; NONDOMINATED SORTING APPROACH; FROG LEAPING ALGORITHM; EVOLUTIONARY ALGORITHM; PERFORMANCE; COMPUTATION; MOEA/D; MODEL; TIME;
D O I
10.1016/j.ins.2018.03.012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To deal with the multi-objective optimization problems (MOPS), a meta-heuristic based on an improved shuffled frog leaping algorithm (ISFLA) which belongs to memetic evolution is presented. For the MOPs, both diversity maintenance and searching effectiveness are crucial for algorithm evolution. In this work, modified calculation of crowding distance to evaluate the density of a solution, memeplex clustering analyses based on a grid to divide the population, and new selection measure of global best individual are proposed to ensure the diversity of the algorithm. A multi-objective extremal optimization procedure (MEOP) is also introduced and incorporated into ISFLA to enable the algorithm to evolve more effectively. Finally, the experimental tests on thirteen unconstrained MOPs and DTLZ many-objective problems show that the proposed algorithm is flexible to handle MOPs and many-objective problems. The effectiveness and robustness of the proposed algorithm are also analyzed in detail. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:164 / 186
页数:23
相关论文
共 47 条
[1]  
Alfredo G. H. D., 2011, INFORM SCI, V181, P3101
[2]   PUNCTUATED EQUILIBRIUM AND CRITICALITY IN A SIMPLE-MODEL OF EVOLUTION [J].
BAK, P ;
SNEPPEN, K .
PHYSICAL REVIEW LETTERS, 1993, 71 (24) :4083-4086
[3]  
Boettcher S., 1999, P GEN EV COMP C NEW, P101
[4]   A novel particle swarm optimizer hybridized with extremal optimization [J].
Chen, Min-Rong ;
Li, Xia ;
Zhang, Xi ;
Lu, Yong-Zai .
APPLIED SOFT COMPUTING, 2010, 10 (02) :367-373
[5]  
Dawkins R., 1976, SELFISH GENE, P5
[6]   Evaluating the ε-domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions [J].
Deb, K ;
Mohan, M ;
Mishra, S .
EVOLUTIONARY COMPUTATION, 2005, 13 (04) :501-525
[7]  
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[10]  
Drechsler N, 2001, LECT NOTES COMPUT SC, V1993, P154