A multi-objective improved teaching-learning based optimization algorithm (MO-ITLBO)

被引:84
作者
Patel, Vivek K. [1 ]
Savsani, Vimal J. [2 ]
机构
[1] Gujarat Technol Univ, Ahmadabad, Gujarat, India
[2] Pandit Deendayal Petr Univ, Gandhinagar 382007, Gujarat, India
关键词
Teaching learning based optimization; Improved teaching learning based; optimization; Multi-objective optimization; Inverted generational distance; EVOLUTIONARY ALGORITHM; PERFORMANCE ASSESSMENT; GENETIC ALGORITHM; PARTICLE SWARM; CONVERGENCE; SEARCH; MOEA/D;
D O I
10.1016/j.ins.2014.05.049
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents an efficient multi-objective improved teaching-learning based optimization (MO-ITLBO) algorithm for solving multi-objective optimization problems. The proposed algorithm uses a grid-based approach in order to keep diversity in the external archive. Pareto dominance is incorporated into the MO-ITLBO algorithm in order to allow this heuristic to handle problems with several objective functions. The qualities of the solution are computed based on the Pareto dominance notion. The performance of the MO-ITLBO algorithm is assessed by applying it on a set of standard test problems proposed for the Congress on Evolutionary Computation 2009 (CEC 2009) competition. The results obtained using the proposed algorithm is compared with the other state-of-the-art algorithms available in the literature. Moreover, the performance of the MO-ITLBO algorithm is also compared with the multi-objective version of the basic teaching-learning based optimization algorithm (MO-TLBO). The statistical analysis of the experimental work is also carried out by conducting Friedman's rank test and Holm post hoc procedure. The results show that the proposed approach is competitive and effective compared to other algorithms contemplated in this work and it can also find the result with greater precision. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:182 / 200
页数:19
相关论文
共 57 条
[1]   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
[2]   Interactive particle swarm: A Pareto-adaptive metaheuristic to multiobjective optimization [J].
Agrawal, Shubham ;
Dashora, Yogesh ;
Tiwari, Manoj Kumar ;
Son, Young-Jun .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2008, 38 (02) :258-277
[3]   A multi-objective artificial bee colony algorithm [J].
Akbari, Reza ;
Hedayatzadeh, Ramin ;
Ziarati, Koorush ;
Hassanizadeh, Bahareh .
SWARM AND EVOLUTIONARY COMPUTATION, 2012, 2 :39-52
[4]  
Akbari R, 2012, INT J INNOV COMPUT I, V8, P715
[5]  
[Anonymous], 2010, P C EV COMP 18 23 JU
[6]   Enhancing MOEA/D with Guided Mutation and Priority Update for Multi-objective Optimization [J].
Chen, Chih-Ming ;
Chen, Ying-ping ;
Zhang, Qingfu .
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, :209-+
[7]   Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts [J].
Chen, Yu ;
Zou, Xiufen .
INFORMATION SCIENCES, 2014, 262 :62-77
[8]   Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front [J].
Chen, Yu ;
Zou, Xiufen ;
Xie, Weicheng .
INFORMATION SCIENCES, 2011, 181 (16) :3336-3355
[9]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[10]  
Coello Coello C. A., 2007, Genetic and Evolutionary Computation, V5, DOI DOI 10.1007/978-0-387-36797-2