Multiobjective optimization based on reputation

被引:9
作者
Jiang, Siwei [1 ,2 ]
Zhang, Jie [1 ]
Ong, Yew-Soon [1 ]
机构
[1] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
[2] Singapore Inst Mfg Technol SIMTech, Singapore, Singapore
关键词
Multiobjective optimization; Multiobjective evolutionary algorithms; Adaption; Reputation; jMetal; DIFFERENTIAL EVOLUTION ALGORITHM; CONTROL PARAMETERS; GENETIC ALGORITHM; CROSSOVER; PROBABILITIES; ADAPTATION; ENSEMBLE; MUTATION; ONLINE; TRUST;
D O I
10.1016/j.ins.2014.07.020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To improve the robustness and ease-of-use of Evolutionary Algorithms (EM), adaptation on evolutionary operators and control parameters shows significant advantages over fixed operators with default parameter settings. To date, many successful research efforts to adaptive EAs have been devoted to Single-objective Optimization Problems (SOPs), whereas, few studies have been conducted on Multiobjective Optimization Problems (MOPS). Directly inheriting the adaptation mechanisms of SOPs in the MOPs context faces challenges due to the intrinsic differences between these two kinds of problems. To fill in this gap, in this paper, a novel Multiobjective Evolutionary Algorithm (MOEA) based on reputation is proposed as a unified framework for general MOEAs. The reputation concept is introduced for the first time to measure the dynamic competency of evolutionary operators and control parameters across problems and stages of the search in MOEAs. Based on the notion of reputation, individual solutions then select highly reputable evolutionary operators and control parameters. Experimental studies on 58 benchmark MOPs in jMetal confirm its superior performance over the classical MOEAs and other adaptive MOEAs. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:125 / 146
页数:22
相关论文
共 62 条
[41]   Classification of adaptive memetic algorithms: a comparative study [J].
Ong, YS ;
Lim, MH ;
Zhu, N ;
Wong, KW .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2006, 36 (01) :141-152
[42]   Meta-Lamarckian learning in memetic algorithms [J].
Ong, YS ;
Keane, AJ .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (02) :99-110
[43]   Multi-objective evolutionary algorithms based on the summation of normalized objectives and diversified selection [J].
Qu, B. Y. ;
Suganthan, P. N. .
INFORMATION SCIENCES, 2010, 180 (17) :3170-3181
[44]  
SCHAFFER JD, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P51
[45]  
Smith S., 2010, Practical tourism research, P1, DOI 10.1079/9781845936327.0001
[46]   ADAPTIVE PROBABILITIES OF CROSSOVER AND MUTATION IN GENETIC ALGORITHMS [J].
SRINIVAS, M ;
PATNAIK, LM .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1994, 24 (04) :656-667
[47]   Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces [J].
Storn, R ;
Price, K .
JOURNAL OF GLOBAL OPTIMIZATION, 1997, 11 (04) :341-359
[48]   Evolving better population distribution and exploration in evolutionary multi-objective optimization [J].
Tan, KC ;
Goh, CK ;
Yang, YJ ;
Lee, TH .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (02) :463-495
[49]   Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure [J].
Wang, Yao-Nan ;
Wu, Liang-Hong ;
Yuan, Xiao-Fang .
SOFT COMPUTING, 2010, 14 (03) :193-209
[50]   Differential Evolution with Composite Trial Vector Generation Strategies and Control Parameters [J].
Wang, Yong ;
Cai, Zixing ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (01) :55-66