Abstract
When solving multi-objective optimization problems, an important issue is how to promote convergence and distribution of solution set simultaneously. To address the above issue, a novel optimization algorithm, named as multi-objective modified teaching-learning-based optimization (MOMTLBO), is proposed. Firstly, a grouping teaching strategy based on pareto dominance relationship is proposed to strengthen the convergence efficiency. Afterward, a diversified learning strategy is presented to enhance the distribution. Meanwhile, differential operations are incorporated to the proposed algorithm. By the above process, the search ability of the algorithm can be encouraged. Additionally, a set of well-known benchmark test functions including ten complex problems proposed for CEC2009 is used to verify the performance of the proposed algorithm. The results show that MOMTLBO exhibits competitive performance against other comparison algorithms. Finally, the proposed algorithm is applied to the aerodynamic optimization of airfoils.
Keywords
Introduction
Many of the issues in scientific research, engineering and management can be transformed into optimization problems, which may involve multiple conflicting optimization objectives and are called multi-objective optimization problems (MOPs). Nature-inspired algorithms are effective method to solve MOPs due to the fact that they have many advantages such as global optimization performance, strong versatility, easy parallel processing, can handle different types of decision variables, and they do not depend on whether the objective functions and constraints are convex or differentiable [1], which include genetic algorithm [2–4], particle swarm optimization [5–7], differential evolution [8–10], etc. The existing nature-inspired multi-objective optimization algorithms can be mainly divided into three categories: algorithms based on pareto dominance relationship [11, 12], algorithms based on decomposition [13, 14] and algorithms based on performance metrics [15, 16]. The algorithms based on pareto dominance relationship is firstly to use pareto dominance relationship to prescreen the non-dominated solutions in the population. Then, other specific strategies are used to further select some excellent solutions from all non-dominated solutions. The algorithms based on decomposition transforms the original multi-objective optimization problem into several simple sub-optimization problems by using a set of uniform weight vectors in the objective space. These kinds of methods often have high efficiency. However, because the optimization process depends on the weight vectors and is affected by the distribution of vectors, the effect of these methods on the multi-objective optimization problems with irregular pareto front is not ideal. The algorithms based on performance metrics selects some excellent solutions and retains them by calculating the contribution of the solution to the specific performance metrics of the population. HV [17] is a commonly used metrics that can evaluate convergence and distribution simultaneously. Since HV can evaluate the convergence and distribution of the population at the same time, these methods can finally obtain a set of solutions with good convergence and distribution. Nevertheless, the calculation process of HV is relatively complex. Calculating HV frequently in the optimization process will significantly increase the time complexity of the algorithm.
Teaching-learning-based optimization (TLBO) is a well-known nature-inspired algorithm proposed by Rao et al. recently [18], which simulates the teaching and learning process of teachers and students. TLBO has the characteristics of fast convergence, high accuracy, few parameters, and is used in the fields of function optimization [19], engineering optimization [20–22], clustering [23] and other optimization problems [24–27]. In recent years, scholars have developed numerous improved TLBO algorithms to solve MOPs. Zou et al. [28] introduced the non-dominated sorting and crowding distance of NSGA-II [11] into TLBO and proposed multi-objective optimization using teaching-learning-based optimization (MOTLBO), which solved three-dimensional Two-Bar truss design problem and four-dimensional I-beam design problem respectively. Medina et al. [29] proposed a multi-objective teaching and learning optimization algorithm (MOTLA/D) based on decomposition strategy which solved the reactive power system optimization problem. Niknam et al. [30] proposed θ-multi-objective teaching-learning-based optimization which is applied to the dynamic economic emission dispatch problem.
However, few existing multi-objective TLBOs focus on solving high-dimensional complex problems. To address above issue, this article tries to develop a modified teaching-learning-based optimization (MOMTLBO) algorithm which is based on pareto dominance relationship to strengthen the convergence and distribution on high-dimensional complex problems. The main contributions of this paper are highlighted as follows. A grouping teaching strategy based on pareto dominance relationship is proposed to strengthen the convergence efficiency. A diversified learning strategy is presented to enhance the distribution. Differential operations are incorporated to encourage the searchability of the algorithm. A set of well-known benchmark test functions including ten complex high-dimensional problems proposed for CEC2009 is used to verify the performance of the proposed algorithm. The aerodynamic optimization of airfoils is calculated to verify the effectiveness of MOMTLBO on real-world complex optimization problems.
The remainder of this paper is organized as follows. Section 2 briefly introduces the basic TLBO. The proposed algorithm, MOMTLBO, is elaborated in Section 3. Numerical experiments are presented in Section 4. Section 5 applies the proposed algorithm to the aerodynamic optimization of airfoils. Finally, Section 6 concludes this paper.
Teaching-learning-based optimization (TLBO)
TLBO is a nature-inspired optimization algorithm that simulates the teaching and learning process of teachers and students. Solutions in the population are given two concepts of “teacher” and “student”. “Teacher” is the best solution selected from all the solutions, represented by
The selection operator implements the greedy law after teacher phase and learner phase. When reaching the termination condition, the best solution is outputted as the optimization result.
A MOMTLBO algorithm is described in this section.
Algorithm framework
Algorithm 1 shows the procedure of the proposed algorithm.
Initially, uniform sampling is applied to initialize the population
Algorithm 2 shows the procedure of the teacher phase. In this phase, a grouping teaching strategy is executed to strengthen the convergence efficiency.
Firstly, the pareto dominance is used on objective functions of all solutions to find all non-dominated solutions and the number of the non-dominated solutions is
The procedure of the learner phase is shown in Algorithm 3. In this phase, a diversified learning strategy is adopted to strength the distribution.
At the beginning of learner phase, the pareto dominance is used on objective functions of all solutions. Afterward, two kinds of solutions move according to different strategies. To be specific, non-dominated solutions update by using Equation (4):
where
Similarly, a differential vector is introduced. In addition, if
where
In order to show the superiority of proposed approach, the MOMTLBO algorithm is compared with NSGA-II [11], MOEA/D [13], GDE3 [33], SMS-EMOA [15], and MOTLBO [28]. NSGA-II is one of the most popular algorithms based on pareto dominance relationship, which is widely used in engineering optimization because of its good performance. MOEA/D is a classical algorithm based on decomposition strategy. Due to the differential evolution operation is integrated into our approach, GDE3, which is a differential evolution algorithm based on pareto dominance relationship with good performance, is selected as one comparison algorithm in the experiments. SMS-EMOA is an algorithm based on HV metric and MOTLBO is a modified TLBO based on pareto dominance relationship. A set of well-known benchmark test functions UF from CEC2009 [34] is selected for performance testing, which contains 10 extremely complex high-dimensional unconstrained problems due to the fact that there is a strong correlation between decision variables.
In the experiment, the population size is set to 100 and the maximum number of function evaluations is set to 300000 [34]. The additional parameters of algorithms are set as follows. MOMTLBO and NSGA-II use simulated binary crossover which the crossover index is 20 and crossover probability is 1 and use polynomial mutation which the mutation index is 20 and mutation probability is 1/d (d is the dimension of the decision space). To avoid the influence of randomness, each algorithm runs 30 times independently for each problem. Experiments are executed on the optimization platform PlatEMO [35]. Two performance metrics are used in experiments: inverted generational distance (IGD) [36] and hypervolume (HV) [17], which can evaluate the quality of obtained solution set in terms of both convergence and distribution. Note that a smaller IGD value and a larger HV value means a better quality of solution set obtained by an algorithm. The comparison results of experiments on IGD value are shown in Table 1.
Results of IGD
Results of IGD
+, -, and ≈ represent the performance of the competitor is significantly better than, worse than, and similar to the MOMTLBO based on the Wilcoxon rank sum test at 0.05 significance level. The data in Table 1 represent mean (standard deviation) of IGD value.
As shown in Table 1, according to the result of Wilcoxon rank sum test, the proposed algorithm is significantly better than other comparison algorithms on seven, seven, four, seven, and seven test functions respectively, which indicates that MOMTLBO achieves superior performance against other competitors. Next, to further analyze experimental results, the results of Friedman test on IGD value are shown in Table 2.
Results of Friedman test on IGD
As shown in Table 2, it is obvious that MOMTLBO gains the first ranking among six algorithms, followed by NSGA-II, which means MOMTLBO obtains the best results among all comparison algorithms. In addition, the comparison results of experiments on HV value are shown in Table 3.
Results of HV
+, -, and ≈ represent the performance of the competitor is significantly better than, worse than, and similar to the MOMTLBO based on the Wilcoxon rank sum test at 0.05 significance level. The data in Table 3 represent mean (standard deviation) of HV value.
As far as Wilcoxon rank sum test in Table 3 is concerned, MOMTLBO exhibits significantly better than other competitors on six, seven, five, six, and seven test functions respectively. Then, the results of Friedman test on HV value are shown in Table 4.
Results of Friedman test on HV
In terms of Friedman test in Table 4, MOMTLBO achieves the first ranking among all algorithms similarly. The above analysis demonstrates that MOMTLBO exhibits better performance against other five competitors.
In this section, MOMTLBO is applied to deal with the aerodynamic optimization of RAE2822 airfoils, with the aim of investigating its effectiveness in solving the real-world MOPs.
Problem formulation
Because its objectives are highly nonlinear and multimodal, aerodynamic optimization of airfoils is one of the most challenging problems in the aerospace engineering. In this problem, lift-drag ratios in two states are selected as optimization objectives. The first state is

The flow field grid of RAE2822 airfoil.
As same as Section 4, five other algorithms are adopted as compared algorithms in this experiment. For all algorithms, the population size is set to 100 and the maximum number of function evaluations is set to 10000. The optimization results are shown in Fig. 2.

The optimization results obtained by six algorithms.
It can be seen in Fig. 2 that this problem has an irregular Pareto front. Obviously, the convergence of MOMTLBO is the best among six algorithms. Although the distribution of GDE3 seems more satisfactory to some extent, but the convergence of that is the worst among all algorithms. However, the results of MOMTLBO can obtain better distribution while acquire superior convergence against other compared algorithms at the same time, especially in (
Comparison of baseline and optimum
It can be seen from Table 5 that after optimization, the lift-drag ratio in two states increases 9.5% and 46.0%, respectively. Finally, to further compare performance of six algorithms, the optimization processes at the number of function evaluations (FEs) is 2000, 4000, 6000 and 8000 are shown in Fig. 3.

Optimization processes comparisons among six algorithms.
As shown in Fig. 3, the convergence speed of MOMTLBO is more prompt than other algorithms, which can also indicate that for complex engineering optimization problems, MOMTLBO can obtain the pareto front by consuming fewer FEs.
In this work, a multi-objective modified teaching-learning-based optimization algorithm (MOMTLBO) is proposed. Firstly, a grouping teaching strategy is proposed to strengthen the convergence efficiency. Afterward, a diversified learning strategy is presented to enhance the distribution. Additionally, differential operations are incorporated to increase the search ability of the algorithm.
From the comparative experiments based on CEC2009 benchmark test functions, the performance of MOMTLBO is better than that of five well-known comparison algorithms in terms of IGD and HV. Moreover, MOMTLBO is applied to the aerodynamic optimization of RAE2822 airfoils to verify its capability. The results show that MOMTLBO can obtain pareto front with better convergence and distributions simultaneously against other five competitors. Furthermore, after optimization by MOMTLBO, the lift-drag ratios of RAE2822 airfoil in two states are improved 9.5% and 46.0% respectively.
In engineering optimization problems, there usually exist problems with more than three conflicting objectives that need to be optimized at the same time. Those problems are commonly known as many-objective optimization problems. For these problems, the simple selection method based on pareto dominance relationship will no longer be applicable, and the large search space requires strong search performance of the algorithm. Therefore, designing new selection methods and better search strategies for MOMTLBO to solve many-objective optimization problems will be an important direction of our future work.
