TY - JOUR
T1 - An improved teaching-learning-based optimization for constrained evolutionary optimization
AU - Wang, Bing-Chuan
AU - Li, Han-Xiong
AU - Feng, Yun
PY - 2018/8
Y1 - 2018/8
N2 - When extending a global optimization technique for constrained optimization, we must balance not only diversity and convergence but also constraints and objective function. Based on these two criteria, the famous teaching-learning-based optimization (TLBO) is improved for constrained optimization. To balance diversity and convergence, an efficient subpopulation based teacher phase is designed to enhance diversity, while a ranking- differential-vector-based learner phase is proposed to promote convergence. In addition, how to select the teacher in the teacher phase and how to rank two solutions in the learner phase have a significant impact on the tradeoff between constraints and objective function. To address this issue, a dynamic weighted sum is formulated. Furthermore, a sim- ple yet effective restart strategy is proposed to settle complicated constraints. By adopting the ε constraint-handling technique as the constraint-handling technique, a constrained optimization evolutionary algorithm, i.e., improved TLBO (ITLBO), is proposed. Experiments on a broad range of benchmark test functions reveal that ITLBO shows better or at least competitive performance against other constrained TLBOs and some other constrained op- timization evolutionary algorithms
AB - When extending a global optimization technique for constrained optimization, we must balance not only diversity and convergence but also constraints and objective function. Based on these two criteria, the famous teaching-learning-based optimization (TLBO) is improved for constrained optimization. To balance diversity and convergence, an efficient subpopulation based teacher phase is designed to enhance diversity, while a ranking- differential-vector-based learner phase is proposed to promote convergence. In addition, how to select the teacher in the teacher phase and how to rank two solutions in the learner phase have a significant impact on the tradeoff between constraints and objective function. To address this issue, a dynamic weighted sum is formulated. Furthermore, a sim- ple yet effective restart strategy is proposed to settle complicated constraints. By adopting the ε constraint-handling technique as the constraint-handling technique, a constrained optimization evolutionary algorithm, i.e., improved TLBO (ITLBO), is proposed. Experiments on a broad range of benchmark test functions reveal that ITLBO shows better or at least competitive performance against other constrained TLBOs and some other constrained op- timization evolutionary algorithms
KW - Constrained optimization
KW - Constraints
KW - Convergence
KW - Diversity
KW - Objective function
KW - TLBO
KW - Tradeoff
UR - http://www.scopus.com/inward/record.url?scp=85047097906&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85047097906&origin=recordpage
U2 - 10.1016/j.ins.2018.04.083
DO - 10.1016/j.ins.2018.04.083
M3 - RGC 21 - Publication in refereed journal
SN - 0020-0255
VL - 456
SP - 131
EP - 144
JO - Information Sciences
JF - Information Sciences
ER -