A Multimodel Prediction Method for Dynamic Multiobjective Evolutionary Optimization

被引:99
作者
Rong, Miao [1 ]
Gong, Dunwei [1 ,2 ]
Pedrycz, Witold [3 ]
Wang, Ling [4 ]
机构
[1] China Univ Min & Technol, Sch Informat & Control Engn, Xuzhou 221116, Jiangsu, Peoples R China
[2] Qingdao Univ Sci & Technol, Sch Informat Sci & Technol, Qingdao 266061, Peoples R China
[3] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 1H9, Canada
[4] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Sociology; Statistics; Optimization; Predictive models; Maintenance engineering; Mathematical model; Convergence; Dynamic multiobjective optimization; evolutionary algorithm (EA); multimodel prediction; particle swarm optimizer; type of the Pareto set (PS) change; ANT COLONY OPTIMIZATION; ALGORITHM; DIVERSITY; SEARCH; MEMORY;
D O I
10.1109/TEVC.2019.2925358
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A large number of prediction strategies are specific to a dynamic multiobjective optimization problem (DMOP) with only one type of the Pareto set (PS) change. However, a continuous DMOP with more than one type of the unknown PS change has been seldom investigated. We present a multimodel prediction approach (MMP) realized in the framework of evolutionary algorithms (EAs) to tackle the problem. In this paper, we first detect the type of the PS change, followed by the selection of an appropriate prediction model to provide an initial population for the subsequent evolution. To observe the influence of MMP on EAs, optimal solutions obtained by three classical dynamic multiobjective EAs with and without MMP are investigated. Furthermore, to investigate the performance of MMP, three state-of-the-art prediction strategies are compared on a large number of dynamic test instances under the same particle swarm optimizer. The experimental results demonstrate that the proposed approach outperforms its counterparts under comparison on most optimization problems.
引用
收藏
页码:290 / 304
页数:15
相关论文
共 65 条
[1]   D2MOPSO: MOPSO Based on Decomposition and Dominance with Archiving Using Crowding Distance in Objective and Solution Spaces [J].
Al Moubayed, N. ;
Petrovski, A. ;
McCall, J. .
EVOLUTIONARY COMPUTATION, 2014, 22 (01) :47-77
[2]  
[Anonymous], 1992, PARALLEL PROBLEM SOL
[3]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[4]  
Branke J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1875, DOI 10.1109/CEC.1999.785502
[5]  
Branke J., 2001, EVOLUTIONARY OPTIMIZ
[6]   Global memory schemes for dynamic optimization [J].
Bravo, Yesnier ;
Luque, Gabriel ;
Alba, Enrique .
NATURAL COMPUTING, 2016, 15 (02) :319-333
[7]   Query-Based Learning for Dynamic Particle Swarm Optimization [J].
Chang, Ray-I ;
Hsu, Hung-Min ;
Lin, Shu-Yu ;
Chang, Chu-Chun ;
Ho, Jan-Ming .
IEEE ACCESS, 2017, 5 :7648-7658
[8]   Flow Equilibrium Under Dynamic Traffic Assignment and Signal Control-An Illustration of Pretimed and Actuated Signal Control Policies [J].
Chen, Li-Wen ;
Hu, Ta-Yin .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2012, 13 (03) :1266-1276
[9]  
COBB HG, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P523
[10]   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