Hyper multi-objective evolutionary algorithm for multi-objective optimization problems

被引:10
作者
Guo, Weian [1 ]
Chen, Ming [1 ]
Wang, Lei [2 ]
Wu, Qidi [2 ]
机构
[1] Tongji Univ, Sinogerman Coll Appl Sci, Shanghai 201804, Peoples R China
[2] Tongji Univ, Dept Elect & Informat Engn, Shanghai 201804, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-objective optimization problems; Hyper multi-objective evolutionary algorithm; Group; Coverage rate; PARTICLE SWARM OPTIMIZATION; BIOGEOGRAPHY-BASED OPTIMIZATION; GENETIC ALGORITHMS; SENSOR NETWORKS; DESIGN; SEGMENTATION; CONSTRUCTION;
D O I
10.1007/s00500-016-2163-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-objective optimization problems (MOPs) are very common in practice. To solve MOPs, many kinds of multi-objective evolutionary algorithms (MOEAs) are proposed. However, different MOEAs have different performances for different MOPs. Therefore, it is a time-consuming task to choose a suitable MOEA for a given problem. To pursue a competitive performance for various kinds of MOPs, in this paper, we propose a framework named hyper multi-objective evolutionary algorithm (HMOEA). In this framework, more than one MOEAs are employed, which is more adaptive to different problems. In HMOEA, the population will be randomly divided into several groups. In each group, a selected MOEA will be implemented. Therefore in the framework, the number of groups is equal to the number of the employed MOEAs. The size of each group, namely the size of sub-population in each group, is adjusted according to the corresponding MOEA's performance. If a MOEA performs well, its corresponding group will have a large size group, which means the MOEA obtains more computational resources. On the contrary, if a MOEA has a poor performance in current generation, its corresponding group will obtain only a few individuals. Although a MOEA does not perform very well in current generation, the framework will not abandon this MOEA, but provide it a group that has predefined small size. The reason is that an involvement of different MOEAs will increase the diversity of algorithms in the hyper framework, which is helpful for HMOEA to avoid local optima and also can help HMOEA be adaptive to different phases in the whole optimization process. To compare MOEAs' performances, coverage rate (CR) metric is used to evaluate the quality of MOEA and therefore decides the size of group for each MOEA. In numerical experiments, ZDT benchmarks are employed to test the proposed hyper framework. Several classic MOEAs are also used in comparisons. According to the comparison results, HMOEA can achieve very competitive performances, which demonstrates that the design is feasible and effective to solve MOPs.
引用
收藏
页码:5883 / 5891
页数:9
相关论文
共 42 条
[1]   Simulated annealing algorithm for prioritized multiobjective optimization-implementation in an adaptive model predictive control configuration [J].
Aggelogiannaki, Eleni ;
Sarimveis, Haralarnbos .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2007, 37 (04) :902-915
[2]   Comparison of various ternary simulated moving bed separation schemes by multi-objective optimization [J].
Agrawal, Gaurav ;
Kawajiri, Yoshiaki .
JOURNAL OF CHROMATOGRAPHY A, 2012, 1238 :105-113
[3]   Multi-objective optimization of a combined heat and power (CHP) system for heating purpose in a paper mill using evolutionary algorithm [J].
Ahmadi, P. ;
Almasi, A. ;
Shahriyari, M. ;
Dincer, I. .
INTERNATIONAL JOURNAL OF ENERGY RESEARCH, 2012, 36 (01) :46-63
[4]   Pareto archived dynamically dimensioned search with hypervolume-based selection for multi-objective optimization [J].
Asadzadeh, Masoud ;
Tolson, Bryan .
ENGINEERING OPTIMIZATION, 2013, 45 (12) :1489-1509
[5]   Multi-objective evolutionary routing protocol for efficient coverage in mobile sensor networks [J].
Attea, Bara'a A. ;
Khalil, Enan A. ;
Cosar, Ahmet .
SOFT COMPUTING, 2015, 19 (10) :2983-2995
[6]   Using investment satisfaction capability index based particle swarm optimization to construct a stock portfolio [J].
Chang, Jui-Fang ;
Shi, Peng .
INFORMATION SCIENCES, 2011, 181 (14) :2989-2999
[7]   Color Image Analysis by Quaternion-Type Moments [J].
Chen, Beijing ;
Shu, Huazhong ;
Coatrieux, Gouenou ;
Chen, Gang ;
Sun, Xingming ;
Coatrieux, Jean Louis .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2015, 51 (01) :124-144
[8]   Comparison of multi-objective optimization methodologies for engineering applications [J].
Chiandussi, G. ;
Codegone, M. ;
Ferrero, S. ;
Varesio, F. E. .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 63 (05) :912-942
[9]   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
[10]   Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems [J].
Deb, Kalyanmoy .
EVOLUTIONARY COMPUTATION, 1999, 7 (03) :205-230