A Surrogate-assisted Memetic Algorithm for Interval Multi-objective Optimization

被引:0
作者
Sun, Jing [1 ]
Miao, Zhuang [2 ]
Gong, Dunwei [2 ,3 ]
机构
[1] Huaihai Inst Technol, Sch Sci, Lianyungang, Peoples R China
[2] China Univ Min & Technol, Sch Informat & Control Engn, Xuzhou, Peoples R China
[3] Qingdao Univ Sci & Technol, Sch Informat Sci & Technol, Qingdao, Peoples R China
来源
2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI) | 2017年
基金
中国国家自然科学基金;
关键词
Multi-objective optimization problem; interval; memetic algorithm; Surrogate model;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Interval multi-objective optimization problems (IMOPs) are ubiquitous and challenging. There are many optimizers for solving them; however, their drawbacks, such as the high computational cost and big uncertainty of the final front, hinder their applications in real-world situation. This paper proposes a surrogate-assisted interval multi-objective memetic algorithm (SA-IMOMA) that incorporates a surrogate model into the local search. In the framework of interval multi-objective memetic algorithms (IMOMAs), the fitness function of a local search is first defined by both the contribution of an individual to hyper-volume and the imprecision of the individual, and then a support vector machine (SVM) is trained and employed to evaluate local individuals so as to cut down the high computational cost of IMOMAs and further reduce the imprecision of the final front. The proposed algorithm was tested on 10 benchmark IMOPs and an IMOP in solar desalination. The empirical results indicate that SA-IMOMA is more economical than non-surrogate IMOMAs and superior to non-local-search IP-MOEA.
引用
收藏
页数:6
相关论文
共 16 条
[1]  
[Anonymous], 2001, 112 TIK ETH ZUR
[2]   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
[3]   Ant colony optimization with clustering for solving the dynamic location routing problem [J].
Gao, Shangce ;
Wang, Yirui ;
Cheng, Jiujun ;
Inazumi, Yasuhiro ;
Tang, Zheng .
APPLIED MATHEMATICS AND COMPUTATION, 2016, 285 :149-173
[4]   A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems [J].
Gong, Dunwei ;
Sun, Jing ;
Miao, Zhuang .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) :47-60
[5]  
Gong DW, 2016, IEEE C EVOL COMPUTAT, P1674, DOI 10.1109/CEC.2016.7743989
[6]   Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems [J].
Gong, Dunwei ;
Sun, Jing ;
Ji, Xinfang .
INFORMATION SCIENCES, 2013, 233 :141-161
[7]   Surrogate-assisted evolutionary computation: Recent advances and future challenges [J].
Jin, Yaochu .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (02) :61-70
[8]   A framework for evolutionary optimization with approximate fitness functions [J].
Jin, YC ;
Olhofer, M ;
Sendhoff, B .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (05) :481-494
[9]   Flood frequency analysis using multi-objective optimization based interval estimation approach [J].
Kasiviswanathan, K. S. ;
He, Jianxun ;
Tay, Joo-Hwa .
JOURNAL OF HYDROLOGY, 2017, 545 :251-262
[10]   Interval multi-objective optimisation of structures using adaptive Kriging approximations [J].
Li, Fangyi ;
Luo, Zhen ;
Rong, Jianhua ;
Zhang, Nong .
COMPUTERS & STRUCTURES, 2013, 119 :68-84