A New Local Search-Based Multiobjective Optimization Algorithm

被引:132
作者
Chen, Bili [1 ]
Zeng, Wenhua [1 ]
Lin, Yangbin [2 ]
Zhang, Defu [2 ]
机构
[1] Xiamen Univ, Software Sch, Xiamen 361005, Fujian, Peoples R China
[2] Xiamen Univ, Sch Informat Sci & Engn, Xiamen 361005, Fujian, Peoples R China
关键词
Diversity; local search; multiobjective optimization; nondominated sorting; test problems; EVOLUTIONARY ALGORITHM; GENETIC ALGORITHM; DIFFERENTIAL EVOLUTION; PERFORMANCE ASSESSMENT; IMMUNE ALGORITHM; HYBRID; DIVERSITY; DOMINANCE;
D O I
10.1109/TEVC.2014.2301794
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a new multiobjective optimization framework based on nondominated sorting and local search (NSLS) is introduced. The NSLS is based on iterations. At each iteration, given a population P, a simple local search method is used to get a better population P', and then the nondominated sorting is adopted on P. P' to obtain a new population for the next iteration. Furthermore, the farthest-candidate approach is combined with the nondominated sorting to choose the new population for improving the diversity. Additionally, another version of NSLS (NSLS-C) is used for comparison, which replaces the farthest-candidate method with the crowded comparison mechanism presented in the nondominated sorting genetic algorithm II (NSGA-II). The proposed method (NSLS) is compared with NSLS-C and the other three classic algorithms: NSGA-II, MOEA/D-DE, and MODEA on a set of seventeen bi-objective and three tri-objective test problems. The experimental results indicate that the proposed NSLS is able to find a better spread of solutions and a better convergence to the true Pareto-optimal front compared to the other four algorithms. Furthermore, the sensitivity of NSLS is also experimentally investigated in this paper.
引用
收藏
页码:50 / 73
页数:24
相关论文
共 85 条
[1]  
Abbass H. A., 2002, International Journal on Artificial Intelligence Tools (Architectures, Languages, Algorithms), V11, P531, DOI 10.1142/S0218213002001039
[2]   Convergence Acceleration Operator for Multiobjective Optimization [J].
Adra, Salem F. ;
Dodd, Tony J. ;
Griffin, Ian A. ;
Fleming, Peter J. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (04) :825-847
[3]   Multiobjective Particle Swarm Algorithm With Fuzzy Clustering for Electrical Power Dispatch [J].
Agrawal, Shubham ;
Panigrahi, B. K. ;
Tiwari, Manoj Kumar .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (05) :529-541
[4]   Modenar: Multi-objective differential evolution algorithm for mining numeric association rules [J].
Alatas, Bilal ;
Akin, Erhan ;
Karci, Ali .
APPLIED SOFT COMPUTING, 2008, 8 (01) :646-656
[5]   An efficient Differential Evolution based algorithm for solving multi-objective optimization problems [J].
Ali, Musrrat. ;
Siarry, Patrick ;
Pant, Millie. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 217 (02) :404-416
[6]   A Modified Differential Evolution Algorithm and Its Application to Engineering Problems [J].
Ali, Musrrat ;
Pant, Millie ;
Abraham, Ajith .
2009 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION, 2009, :196-+
[7]   Crowding population-based ant colony optimisation for the multi-objective travelling salesman problem [J].
Angus, Daniel .
2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN MULTI-CRITERIA DECISION MAKING, 2007, :333-340
[8]  
[Anonymous], 2004, ANT COLONY OPTIMIZAT
[9]  
[Anonymous], 1998, Technical Report TR-98-03
[10]  
[Anonymous], 2008, MULTIOBJECTIVE OPTIM