# An Improved Teaching-Learning-Based Optimization Algorithm with Reinforcement Learning Strategy for Solving Optimization Problems

Authors: Di Wu; Shuang Wang; Qingxin Liu; Laith Abualigah; Heming Jia
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

This paper presents an improved teaching-learning-based optimization (TLBO) algorithm for solving optimization problems, called RLTLBO. First, a new learning mode considering the effect of the teacher is presented. Second, the Q-Learning method in reinforcement learning (RL) is introduced to build a switching mechanism between two different learning modes in the learner phase. Finally, ROBL is adopted after both the teacher and learner phases to improve the local optima avoidance ability of RLTLBO. These two strategies effectively enhance the convergence speed and accuracy of the proposed algorithm. RLTLBO is analyzed on 23 standard benchmark functions and eight CEC2017 test functions to verify the optimization performance. The results reveal that proposed algorithm provides effective and efficient performance in solving benchmark test functions. Moreover, RLTLBO is also applied to solve eight industrial engineering design problems. Compared with the basic TLBO and seven state-of-the-art algorithms, the results illustrate that RLTLBO has superior performance and promising prospects for dealing with real-world optimization problems. The source codes of the RLTLBO are publicly available athttps://github.com/WangShuang92/RLTLBO.


---

## Body

## 1. Introduction

In recent years, real-world optimization problems have become increasingly complex and diverse in a wide range of fields and disciplines. Traditional (mathematical) optimization methods, such as Newton's method and the gradient descent method can no longer meet the needs for solving current optimization problems. Thus, nontraditional methods, especially metaheuristic algorithms, are becoming increasingly pervasive among researchers [1–3]. Metaheuristics are algorithms based on intuition or experience, that can provide a feasible solution at an acceptable cost (referring to computing time and computational resources), and the deviation between the feasible solution and the optimal solution may not be predicted in advance. Metaheuristic optimization algorithms have the merits of being flexible, having few parameters and avoiding local optima. Additionally, they can be rapidly deployed and thus have been utilized for solving various optimization problems over the past decades [4, 5]. Some of the most representative meta-heuristic algorithms are listed as follows: genetic algorithms (GA) [6], differential evolution algorithm (DE) [7], simulated annealing (SA) [8], arithmetic optimization algorithm (AOA) [9], heat transfer relation-based optimization algorithm (HTOA) [10], particle swarm optimization (PSO) [11], salp swarm algorithm (SSA) [12], grey wolf optimizer (GWO) [13], whale optimization algorithm (WOA) [14], aquila optimizer (AO) [15], remora optimization algorithm (ROA) [16], etc.Teaching-learning-based optimization (TLBO) is a meta-heuristic algorithm proposed by Rao et al. in 2011 [17]. The TLBO method is inspired by the teaching-learning process in a class and simulates the influence of a teacher on learners. Due to the advantages of rapid convergence, absence of algorithm-specific parameters and easy implementation, TLBO has become a viral optimization algorithm and has been successfully applied to real-world problems in diverse fields. Aouf et al. [18] applied TLBO to optimize the parameters of the ANFIS structure to obtain the optimal trajectory and traveling time to address the navigation problem of the mobile robot in a strange environment. Singh et al. [19] studied the application of TLBO for optimal coordination of directional overcurrent relays (DOCRs) in a looped power system. Multiobjective TLBO was applied to solve the motif discovery problem (MDP) in the bioinformatics field by Gonzalez-Alvarez et al. [20], and obtained better solutions than other biology-based multiobjective evolutionary algorithms. All the above applications have suggested that TLBO can be effectively applied to many optimization problems in various fields.The improvement and hybrid algorithms of TLBO and their applications have also been studied by several researchers [21]. Kumar and Singh [22] developed a chaotic version of TLBO with different chaotic mechanisms. A local search method was also incorporated to guide the search direction between local and global search and to improve the quality of solution. The application of clustering problems proved the effectiveness of this algorithm. Taheri et al. [23] proposed a balanced TLBO with three modifications, called BTLBO. A weighted mean replaced the mean value in the teacher phase to maintain the diversity. The tutoring phase was added as a powerful local search mechanism for exploiting regions around the best solution. The restarting phase was introduced to improve the exploration ability by replacing inactive learners with randomly initialized learners. Ma et al. [24] proposed a modified TLBO (MTLBO) by introducing a population group mechanism into the basic TLBO. All students were divided into two groups and updated by different updating strategies. The MTLBO was also applied to establish the NOx emission model of a circulation fluidized bed boiler. Xu et al. [25] introduced dynamic-opposite learning (DOL) strategy into TLBO to overcome premature convergence. The asymmetric search space and the dynamic change in the characteristics of DOL help DOLTLBO to holistically improve the exploitation and exploration capabilities. Dong et al. [26] presented a KTLBO algorithm to achieve computationally expensive constrained optimization. The kriging-assisted two-phase optimization framework was used to alternately conduct global and local searches, achieving the search acceleration. KTLBO was also adopted to design the structure of a blended-wing-body underwater glider. Ren et al. [27] developed a multiobjective elitist feedback TLBO (MEFTO) for multiobjective optimization problems. The elitism strategy was used to store the best solutions obtained thus far. The proposed feedback phase allowed students to choose whether to study directly with the teacher or to motivate themselves, providing a novel way for students to improve themselves. Zhang et al. [28] proposed a hybrid algorithm based on TLBO and a neural network algorithm (NNA) named TLNNA to solve engineering optimization problems. The experimental results suggested that TLNNA has improved global search ability and fast convergence speed. By considering the features of the WOA and TLBO, Lakshmi and Mohanaiah [29] proposed a hybrid WOA-TLBO algorithm. This was also applied to solve the facial emotion recognition (FER) functional problem, and the reported results showed its effectiveness and high accuracy.The TLBO variants proposed previously have improved searchability and accelerated the convergence process, but they still struggle with premature convergence and insufficient learning processes. Thus, in this paper we propose an improved TLBO algorithm to solve industrial engineering optimization problems. Given the characteristics of TLBO, reinforcement learning (RL) in machine learning is introduced to the learner phase, and enables the algorithm to choose a more suitable learning mode, which can train the search agents to perform more beneficial actions. In addition, a random opposition-based learning (ROBL) strategy is added after the whole learner phase to facilitate the convergence acceleration and avoid local optima. The proposed improved TLBO with RH and ROBL strategies is called RLTLBO. The standard and CEC2017 benchmark functions and eight engineering design problems are used to test the exploration and exploitation capabilities of the proposed method. The RLTLBO algorithm is compared with some existing algorithms, including the basic TLBO and the Salp Swarm Algorithm (SSA), which are considered the classical algorithms, the Aquila Optimizer (AO), Harris Hawks Optimization (HHO) [30], and Horse herd Optimization Algorithm (HOA) [31], which are the recent new methods, and the memory-based Grey Wolf Optimizer (mGWO) [32], modified Ant Lion Optimizer (MALO) [33] and dynamic Sine Cosine Algorithm (DSCA) [34], which are the latest improved algorithms. The experimental results show that the proposed RLTLBO method is superior to the state-of-the-art algorithms in exploration and exploitation capabilities. Moreover, eight industrial engineering design problems are applied to evaluate the effectiveness of the algorithm when solving real-world optimization problems.The rest of this paper is organized as follows: Section2 provides a brief overview of the basic TLBO, RL, and ROBL strategies. Section 3 describes the proposed RLTLBO algorithm in detail. Simulations, experiments and an analysis of the results are presented in Section 4. Section 5 describes industrial engineering design problems. Finally, Section 6 concludes the paper.


## 2. Related Work

### 2.1. Teaching-Learning-Based Optimization

The TLBO algorithm mimics the influence of a teacher on the output of learners, which can be reflected by learners’ grades. As a highly learned person, the teacher gives their knowledge to the learners. The outcome of the learners is affected by the quality of the teacher. It is obvious that learners trained by a good teacher can achieve better results in terms of their grades. The optimization process of TLBO is divided into two phases: the teacher phase and the learner phase.


#### 2.1.1. Teacher Phase

The teacher phase simulates the teaching process of a teacher. The best one in the class is selected as the teacher, and then the teacher tries their best to improve the overall level of the class. The teaching process can be formulated as follows:(1)Xnew=Xold+randXteacher−TF⋅Mean,where Xnew and Xold represent the positions of the individual after and before learning, that is, the candidate solutions after and before updating. Xteacher is the position of the teacher, which is the best individual of the population. Mean indicates the average level of search agents in the population. TF is a teaching factor that determines the change of the mean value, and rand is a random number between 0 and 1. The value of TF can be either 1 or 2, which is a heuristic step and randomly decided with equal probability as TF = round (1 + rand (0, 1){2–1}).


#### 2.1.2. Learner Phase

In addition to learning new knowledge from the teacher, learners can also increase knowledge through interaction. In the mutual learning process, a learner can randomly learn knowledge from another learner with a better grade randomly. The expression of the learner phase can be written as follows:(2)Xnew=Xold+randXr1−Xr2fXr1<fXr2Xold+randXr2−Xr1otherwise,where Xr1 and Xr2 indicate the positions of two learners randomly selected from the population. f (·) is the fitness value. The comparison between two learners determines the learning direction. The individual with a poor grade learns from the individual with a better grade. The new individual with improvements after learning will be accepted, otherwise rejected.The flow chart of the TLBO algorithm is shown in Figure1.Figure 1
The flowchart of TLBO.


### 2.2. Reinforcement Learning (RL)

Machine learning algorithms are also widely used to solve various optimization problems [35]. Machine learning methods generally consist of four categories, as shown in Figure 2: supervised learning, unsupervised learning, semisupervised learning, and reinforcement learning (RL). In RL algorithms, the agent is trained to learn optimal actions in a complex environment. The agent is trained in different ways and uses its training experience in the subsequent actions. RL methods generally consist of model-free and model-based approaches. The model-free approaches can be divided into two subgroups: value-based and policy-based methods. The value-based algorithms are convenient for coordinating with meta-heuristic algorithms because they are model-free and policy-free, providing higher flexibility [36]. In the value-based RL approaches, the reinforcement agent learns from its actions and experience in the environment, such through reward and penalty. The agent measures the success of the action in completing the task goal through the reward penalty and then makes a decision based on its achievement.Figure 2
Classification of the reinforcement learning algorithms.The Q-Learning method is one of the representative algorithms among the value-based RL methods. In the Q-Learning method, the agent takes random actions and then obtains a reward or penalty. An experience is gradually constructed based on the agent's actions. Throughout process of building experience, a table called Q-Table is defined [37]. The agent considers all possible actions and tries to update its state according to the Q-Table values to select the best action that maximizes the current state's maximal rewards. Therefore, the agent in action determines whether to explore or exploit the environment.Compared to RL methods, meta-heuristic algorithms often require deep expert knowledge to establish the balance between different phases. RL methods can help discover optimal designs of parameters and more balanced strategies allowing the algorithm to switch between the exploration and exploitation phases. Metaheuristic methods usually operate with specific policies in certain situations, and thus, the dynamism is lower than that of RL algorithms, especially value-based methods. The agent in the value-based methods is online and operates beneficial actions through a reward-penalty mechanism without following any policy. Many types of research have been presented in the literature regarding the combination of meta-heuristics and RL [38–44].


### 2.3. Random Opposition-Based Learning (ROBL)

Random opposition-based learning (ROBL) is a variant of opposition-based learning (OBL) [45] proposed by Long et al. in 2019 [46]. OBL is a powerful optimization tool that simultaneously considers the fitness of an estimate and its corresponding opposite estimate to achieve a better candidate solution. In contrast from the basic OBL, ROBL utilizes a random term to improve the OBL strategy, which is defined as follows:(3)x^j=lj+uj−rand×xj,j=1,2,…,n,where x^j and xj indicate the opposite and original solutions, uj and lj are the upper and lower bound of the problem in jth dimension. The opposite solution is randomly selected in the opposite half of the search space. This solution is not only opposite, but also random, with a wider range of distributions. An example of ROBL solutions is shown in Figure 3. The opposite solution with a random term described by equation (3) is more stochastic than the basic OBL and can effectively help the algorithm jump out of the local optima.Figure 3
Example of ROBL solutions. Three sets of solutions (original solution, corresponding opposite solution (xobl), and random opposite solution (xrobl)) are labeled in a two-dimensional search space. The random opposite solutions are not only in the symmetric positions, but also with a wider range of distributions.


## 2.1. Teaching-Learning-Based Optimization

The TLBO algorithm mimics the influence of a teacher on the output of learners, which can be reflected by learners’ grades. As a highly learned person, the teacher gives their knowledge to the learners. The outcome of the learners is affected by the quality of the teacher. It is obvious that learners trained by a good teacher can achieve better results in terms of their grades. The optimization process of TLBO is divided into two phases: the teacher phase and the learner phase.


### 2.1.1. Teacher Phase

The teacher phase simulates the teaching process of a teacher. The best one in the class is selected as the teacher, and then the teacher tries their best to improve the overall level of the class. The teaching process can be formulated as follows:(1)Xnew=Xold+randXteacher−TF⋅Mean,where Xnew and Xold represent the positions of the individual after and before learning, that is, the candidate solutions after and before updating. Xteacher is the position of the teacher, which is the best individual of the population. Mean indicates the average level of search agents in the population. TF is a teaching factor that determines the change of the mean value, and rand is a random number between 0 and 1. The value of TF can be either 1 or 2, which is a heuristic step and randomly decided with equal probability as TF = round (1 + rand (0, 1){2–1}).


### 2.1.2. Learner Phase

In addition to learning new knowledge from the teacher, learners can also increase knowledge through interaction. In the mutual learning process, a learner can randomly learn knowledge from another learner with a better grade randomly. The expression of the learner phase can be written as follows:(2)Xnew=Xold+randXr1−Xr2fXr1<fXr2Xold+randXr2−Xr1otherwise,where Xr1 and Xr2 indicate the positions of two learners randomly selected from the population. f (·) is the fitness value. The comparison between two learners determines the learning direction. The individual with a poor grade learns from the individual with a better grade. The new individual with improvements after learning will be accepted, otherwise rejected.The flow chart of the TLBO algorithm is shown in Figure1.Figure 1
The flowchart of TLBO.


## 2.1.1. Teacher Phase

The teacher phase simulates the teaching process of a teacher. The best one in the class is selected as the teacher, and then the teacher tries their best to improve the overall level of the class. The teaching process can be formulated as follows:(1)Xnew=Xold+randXteacher−TF⋅Mean,where Xnew and Xold represent the positions of the individual after and before learning, that is, the candidate solutions after and before updating. Xteacher is the position of the teacher, which is the best individual of the population. Mean indicates the average level of search agents in the population. TF is a teaching factor that determines the change of the mean value, and rand is a random number between 0 and 1. The value of TF can be either 1 or 2, which is a heuristic step and randomly decided with equal probability as TF = round (1 + rand (0, 1){2–1}).


## 2.1.2. Learner Phase

In addition to learning new knowledge from the teacher, learners can also increase knowledge through interaction. In the mutual learning process, a learner can randomly learn knowledge from another learner with a better grade randomly. The expression of the learner phase can be written as follows:(2)Xnew=Xold+randXr1−Xr2fXr1<fXr2Xold+randXr2−Xr1otherwise,where Xr1 and Xr2 indicate the positions of two learners randomly selected from the population. f (·) is the fitness value. The comparison between two learners determines the learning direction. The individual with a poor grade learns from the individual with a better grade. The new individual with improvements after learning will be accepted, otherwise rejected.The flow chart of the TLBO algorithm is shown in Figure1.Figure 1
The flowchart of TLBO.


## 2.2. Reinforcement Learning (RL)

Machine learning algorithms are also widely used to solve various optimization problems [35]. Machine learning methods generally consist of four categories, as shown in Figure 2: supervised learning, unsupervised learning, semisupervised learning, and reinforcement learning (RL). In RL algorithms, the agent is trained to learn optimal actions in a complex environment. The agent is trained in different ways and uses its training experience in the subsequent actions. RL methods generally consist of model-free and model-based approaches. The model-free approaches can be divided into two subgroups: value-based and policy-based methods. The value-based algorithms are convenient for coordinating with meta-heuristic algorithms because they are model-free and policy-free, providing higher flexibility [36]. In the value-based RL approaches, the reinforcement agent learns from its actions and experience in the environment, such through reward and penalty. The agent measures the success of the action in completing the task goal through the reward penalty and then makes a decision based on its achievement.Figure 2
Classification of the reinforcement learning algorithms.The Q-Learning method is one of the representative algorithms among the value-based RL methods. In the Q-Learning method, the agent takes random actions and then obtains a reward or penalty. An experience is gradually constructed based on the agent's actions. Throughout process of building experience, a table called Q-Table is defined [37]. The agent considers all possible actions and tries to update its state according to the Q-Table values to select the best action that maximizes the current state's maximal rewards. Therefore, the agent in action determines whether to explore or exploit the environment.Compared to RL methods, meta-heuristic algorithms often require deep expert knowledge to establish the balance between different phases. RL methods can help discover optimal designs of parameters and more balanced strategies allowing the algorithm to switch between the exploration and exploitation phases. Metaheuristic methods usually operate with specific policies in certain situations, and thus, the dynamism is lower than that of RL algorithms, especially value-based methods. The agent in the value-based methods is online and operates beneficial actions through a reward-penalty mechanism without following any policy. Many types of research have been presented in the literature regarding the combination of meta-heuristics and RL [38–44].


## 2.3. Random Opposition-Based Learning (ROBL)

Random opposition-based learning (ROBL) is a variant of opposition-based learning (OBL) [45] proposed by Long et al. in 2019 [46]. OBL is a powerful optimization tool that simultaneously considers the fitness of an estimate and its corresponding opposite estimate to achieve a better candidate solution. In contrast from the basic OBL, ROBL utilizes a random term to improve the OBL strategy, which is defined as follows:(3)x^j=lj+uj−rand×xj,j=1,2,…,n,where x^j and xj indicate the opposite and original solutions, uj and lj are the upper and lower bound of the problem in jth dimension. The opposite solution is randomly selected in the opposite half of the search space. This solution is not only opposite, but also random, with a wider range of distributions. An example of ROBL solutions is shown in Figure 3. The opposite solution with a random term described by equation (3) is more stochastic than the basic OBL and can effectively help the algorithm jump out of the local optima.Figure 3
Example of ROBL solutions. Three sets of solutions (original solution, corresponding opposite solution (xobl), and random opposite solution (xrobl)) are labeled in a two-dimensional search space. The random opposite solutions are not only in the symmetric positions, but also with a wider range of distributions.


## 3. The Proposed RLTLBO Algorithm

### 3.1. New Learning Mode

The basic TLBO algorithm performs the learner phase after the teacher phase in each iteration. The search agent learns from other individuals in the learner phase. However, in the actual learning process, students learning from each other varies from person to person. Different students might choose different learning modes, such as formal communications, group discussions, presentations, etc. Moreover, the students might adjust the learning mode according to their learning situation during the learning process. Therefore, in this paper, we introduce another learning mode to diversify the learning methods of the students, which can be described in the equations as follows:(4)Xnew=Xold+rand1−tTXr3+tTXteacher−XoldfXr3<fXoldXold+rand1−tTXold+tTXteacher−Xr3otherwise,where Xr3 is the position of a learner randomly selected from the population. t and T are the current and maximum number of iterations.In this learning mode, the effect of the teacher is introduced. Sometimes the mutual learning between students is not always beneficial, and the partial intervention of the teacher is more helpful to students' improvement. Students will not only learn from each other but also ask the teacher for help. At the beginning of the iterations, the weight of mutual learning among students is larger, and the algorithm pays more attention to random learning, which can maintain population diversity and increase global searchability. In the later iteration stage, students consult more from the teacher and approach the teacher, enhancing the algorithms local searchability.


### 3.2. Learner Phase with RL Strategy

To enable students to adjust their learning mode more effectively, Q-Learning in RL is introduced to complete the switching between both learning modes. The student uses Q-Table values as a guide to decide between different learning modes. The Q-table is updated using a reward-penalty mechanism. The student selects the best state by calculating the benefit degree of each possible state and taking the leaning mode with the highest Q-values for the next step. The student obtains a reward or a penalty according to its actions after each step. The general pattern of the RL agent and environmental framework is shown in Figure4.Figure 4
Reinforcement learning agent and environment framework. at represents the current action st and st + 1 indicate the current and the next state, rt and rt + 1 indicate the current and the next reward, respectively.In the Q-Learning method, a reward table is used to reward or penalize the agent for its action or state compositions, which users can provide. The reward table in this work contains the positive (+1) or negative (−1) rewards for each state and action couple. The Q-Table can be considered the agents experience, which should be assigned a zero value for all units in the beginning. Consequently, the student updates Q-Table using the Bellman equation (5) and prepares the Q-Table for the next iteration [44].(5)Qt+1st,at←Qtst,at+λrt+1+γMaxQtst+1,a−Qtst,at,where st and st + 1 indicate the current and the next state respectively, Qt and Qt + 1 are the current Q-value and pre-estimated Q-value for the next state st + 1, and at represents the current action. λ and γ are the learning rate value and discount factor, respectively, which are numbers between 0 and 1. The learning rate determines how fast the algorithm should learn and controls the convergence of the learning process. The discount factor defines how much the algorithm learns from the mistake and controls the importance of future rewards. rt + 1 indicates the immediate reward or penalty an agent gets for taking current action.In each iteration, the agent uses equation (5) to calculate and weight each possible state and action for the next step, before choosing the best action (learning mode 1 or learning mode (2) with the highest likelihood to get closer to the best optimal solution. Examples of the reward table and Q-Table are displayed in Figure 5. This RL strategy helps establish a switching mechanism between different learning modes in the learner phase and find the most suitable decision scheme. Four optional actions can occur as listed below:(1)
When the student is learning in learning mode 1, they still decides to stay in learning mode 1(2)
When the student is learning in learning mode 2, they still decides to stay in learning mode 2(3)
When the student learns in learning mode 1, they decides to transition to learning mode 2(4)
When the student learns in learning mode 1, they decides to transition to learning mode 2Figure 5
The reward table and Q-Table example of RLTLBO. (a) Reward Table sample (b) Q-Table sample.
(a)(b)The most important value of the RL strategy is to help the algorithm switch between different learning modes as and when needed during the learner phase. For the above reason, the algorithm can find better solutions faster and more effectively in the search space, considerably increasing the search efficiency. Therefore, the convergence speed of the algorithm can be improved effectively.


### 3.3. The Detail of RLTLBO

In the improved TLBO algorithm, the teacher phase of basic TLBO is carried out first. Then, the learner phase with RL strategy is implemented to achieve effective and efficient investigation in the search space. Finally, ROBL is added to enhance the ability of local optima avoidability. The random opposite solution increases the probability of the algorithm finding a better solution. This variant of TLBO, which incorporates RL, is named RLTLBO. The pseudocode and the flowchart of the proposed RLTLBO algorithm are shown in Algorithm1 and Figure 6, respectively.Algorithm 1: Pseudocode of RLTLBO.
(1)
Set the initial values of the population size N and the maximum number of iterations T(2)
Initialize positions of the population X(3)
Initialize the reward table and Q-Table(4)
Whilet< T(5)
Update Xteacher and Mean(6)
Update individual using equation (1) % teacher phase(7)
If rand<0.5% learner phase(8)
If (learning mode 1 value > learning mode 2 value) % learning mode values is obtained by Q-Table(9)
Calculate new fitness value using equation (2) % learning mode 1(10)
If (new fitness value < current fitness value)(11)
Reward = 1(12)
Else(13)
Reward = −1(14)
End(15)
Else(16)
Calculate new fitness value using equation (4) % learning mode 2(17)
If (new fitness value < current fitness value)(18)
Reward = 1(19)
Else(20)
Reward = −1(21)
End(22)
End(23)
Else(24)
If (learning mode 1 value > learning mode 2 value) % learning mode values is obtained by Q-Table(25)
Calculate new fitness value using equation (2) % learning mode 1(26)
If (new fitness value < current fitness value)(27)
Reward = 1(28)
Else(29)
Reward = −1(30)
End(31)
Else(32)
Calculate new fitness value using equation (4) % learning mode 2(33)
If (new fitness value < current fitness value)(34)
Reward = 1(35)
Else(36)
Reward = −1(37)
End(38)
End(39)
End(40)
Update Q-Table using equation (5)(41)
ROBL strategy using equation (3)(42)
End while(43)
Return XteacherFigure 6
The flowchart of RLTLBO.


### 3.4. Computational Complexity Analysis

RLTLBO mainly consists of three components: initialization, fitness evaluation, and position updating. In the initialization phase, the computational complexity of positions generated is O(N). Then, the computational complexity of fitness evaluation for the solution is O(2 × N) during the iteration process. Finally, we utilize ROBL to keep the algorithm from falling into local optima. Thus, the computational complexities of position updating of RLTLBO is O(2 ×N × D), where D is the dimension size of the problem. Therefore, the total computational complexity of the proposed RLTLBO algorithm is O(3 × N + 2 × N × D).


## 3.1. New Learning Mode

The basic TLBO algorithm performs the learner phase after the teacher phase in each iteration. The search agent learns from other individuals in the learner phase. However, in the actual learning process, students learning from each other varies from person to person. Different students might choose different learning modes, such as formal communications, group discussions, presentations, etc. Moreover, the students might adjust the learning mode according to their learning situation during the learning process. Therefore, in this paper, we introduce another learning mode to diversify the learning methods of the students, which can be described in the equations as follows:(4)Xnew=Xold+rand1−tTXr3+tTXteacher−XoldfXr3<fXoldXold+rand1−tTXold+tTXteacher−Xr3otherwise,where Xr3 is the position of a learner randomly selected from the population. t and T are the current and maximum number of iterations.In this learning mode, the effect of the teacher is introduced. Sometimes the mutual learning between students is not always beneficial, and the partial intervention of the teacher is more helpful to students' improvement. Students will not only learn from each other but also ask the teacher for help. At the beginning of the iterations, the weight of mutual learning among students is larger, and the algorithm pays more attention to random learning, which can maintain population diversity and increase global searchability. In the later iteration stage, students consult more from the teacher and approach the teacher, enhancing the algorithms local searchability.


## 3.2. Learner Phase with RL Strategy

To enable students to adjust their learning mode more effectively, Q-Learning in RL is introduced to complete the switching between both learning modes. The student uses Q-Table values as a guide to decide between different learning modes. The Q-table is updated using a reward-penalty mechanism. The student selects the best state by calculating the benefit degree of each possible state and taking the leaning mode with the highest Q-values for the next step. The student obtains a reward or a penalty according to its actions after each step. The general pattern of the RL agent and environmental framework is shown in Figure4.Figure 4
Reinforcement learning agent and environment framework. at represents the current action st and st + 1 indicate the current and the next state, rt and rt + 1 indicate the current and the next reward, respectively.In the Q-Learning method, a reward table is used to reward or penalize the agent for its action or state compositions, which users can provide. The reward table in this work contains the positive (+1) or negative (−1) rewards for each state and action couple. The Q-Table can be considered the agents experience, which should be assigned a zero value for all units in the beginning. Consequently, the student updates Q-Table using the Bellman equation (5) and prepares the Q-Table for the next iteration [44].(5)Qt+1st,at←Qtst,at+λrt+1+γMaxQtst+1,a−Qtst,at,where st and st + 1 indicate the current and the next state respectively, Qt and Qt + 1 are the current Q-value and pre-estimated Q-value for the next state st + 1, and at represents the current action. λ and γ are the learning rate value and discount factor, respectively, which are numbers between 0 and 1. The learning rate determines how fast the algorithm should learn and controls the convergence of the learning process. The discount factor defines how much the algorithm learns from the mistake and controls the importance of future rewards. rt + 1 indicates the immediate reward or penalty an agent gets for taking current action.In each iteration, the agent uses equation (5) to calculate and weight each possible state and action for the next step, before choosing the best action (learning mode 1 or learning mode (2) with the highest likelihood to get closer to the best optimal solution. Examples of the reward table and Q-Table are displayed in Figure 5. This RL strategy helps establish a switching mechanism between different learning modes in the learner phase and find the most suitable decision scheme. Four optional actions can occur as listed below:(1)
When the student is learning in learning mode 1, they still decides to stay in learning mode 1(2)
When the student is learning in learning mode 2, they still decides to stay in learning mode 2(3)
When the student learns in learning mode 1, they decides to transition to learning mode 2(4)
When the student learns in learning mode 1, they decides to transition to learning mode 2Figure 5
The reward table and Q-Table example of RLTLBO. (a) Reward Table sample (b) Q-Table sample.
(a)(b)The most important value of the RL strategy is to help the algorithm switch between different learning modes as and when needed during the learner phase. For the above reason, the algorithm can find better solutions faster and more effectively in the search space, considerably increasing the search efficiency. Therefore, the convergence speed of the algorithm can be improved effectively.


## 3.3. The Detail of RLTLBO

In the improved TLBO algorithm, the teacher phase of basic TLBO is carried out first. Then, the learner phase with RL strategy is implemented to achieve effective and efficient investigation in the search space. Finally, ROBL is added to enhance the ability of local optima avoidability. The random opposite solution increases the probability of the algorithm finding a better solution. This variant of TLBO, which incorporates RL, is named RLTLBO. The pseudocode and the flowchart of the proposed RLTLBO algorithm are shown in Algorithm1 and Figure 6, respectively.Algorithm 1: Pseudocode of RLTLBO.
(1)
Set the initial values of the population size N and the maximum number of iterations T(2)
Initialize positions of the population X(3)
Initialize the reward table and Q-Table(4)
Whilet< T(5)
Update Xteacher and Mean(6)
Update individual using equation (1) % teacher phase(7)
If rand<0.5% learner phase(8)
If (learning mode 1 value > learning mode 2 value) % learning mode values is obtained by Q-Table(9)
Calculate new fitness value using equation (2) % learning mode 1(10)
If (new fitness value < current fitness value)(11)
Reward = 1(12)
Else(13)
Reward = −1(14)
End(15)
Else(16)
Calculate new fitness value using equation (4) % learning mode 2(17)
If (new fitness value < current fitness value)(18)
Reward = 1(19)
Else(20)
Reward = −1(21)
End(22)
End(23)
Else(24)
If (learning mode 1 value > learning mode 2 value) % learning mode values is obtained by Q-Table(25)
Calculate new fitness value using equation (2) % learning mode 1(26)
If (new fitness value < current fitness value)(27)
Reward = 1(28)
Else(29)
Reward = −1(30)
End(31)
Else(32)
Calculate new fitness value using equation (4) % learning mode 2(33)
If (new fitness value < current fitness value)(34)
Reward = 1(35)
Else(36)
Reward = −1(37)
End(38)
End(39)
End(40)
Update Q-Table using equation (5)(41)
ROBL strategy using equation (3)(42)
End while(43)
Return XteacherFigure 6
The flowchart of RLTLBO.


## 3.4. Computational Complexity Analysis

RLTLBO mainly consists of three components: initialization, fitness evaluation, and position updating. In the initialization phase, the computational complexity of positions generated is O(N). Then, the computational complexity of fitness evaluation for the solution is O(2 × N) during the iteration process. Finally, we utilize ROBL to keep the algorithm from falling into local optima. Thus, the computational complexities of position updating of RLTLBO is O(2 ×N × D), where D is the dimension size of the problem. Therefore, the total computational complexity of the proposed RLTLBO algorithm is O(3 × N + 2 × N × D).


## 4. Numerical Experiments and Results

In this section, two different kinds of benchmark functions are performed to evaluate the performance of the proposed RLTLBO algorithm. Standard benchmark functions are first tested to assess the algorithm in solving twenty-three simple numerical problems. Then, the CEC2017 benchmark functions are utilized to evaluate the algorithm in solving complex numerical problems. The RLTLBO is compared with three types of existing algorithms, including the classic methods, TLBO and SSA, the recently proposed algorithms, HOA [31], AO, and HHO [30], and the improved algorithms, mGWO [32], MALO [33] and DSCA [34]. For the consistency of all tests, we set the population size to N = 30, the dimension size to D = 30, and the maximum number of iterations to T = 500. All algorithms are run 30 times independently, and the average values and standard deviations are presented as the final experimental results. All experiments are implemented in MATLAB R2020b on a PC with Intel (R) Core (TM) i5-9500 CPU @ 3.00 GHz and RAM 16 GB memory on OS windows 10.


### 4.1. Standard Benchmark Function Experiments

Standard benchmark functions [47] can be divided into three types: unimodal, multimodal and fixed-dimension multimodal functions. Unimodal functions only have one global optimum and no local optima, which can be used to evaluate an algorithm's convergence rate and exploitation capability. Multimodal and fixed-dimension multimodal functions have a global optimum and multiple local optima. This characteristic makes these functions effective for testing the exploration and local optima avoidance abilities of an algorithm. The benchmark function details are listed in Tables 1–3.Table 1
Unimodal benchmark functions.
FunctionDimRangefminF1x=∑i=1nxi230[−100, 100]0F2x=∑i=1nxi+∏i=1nxi30[−10, 10]0F3x=∑i=1n∑j−1ixj230[−100, 100]0F4x=maxixi,1≤i≤n30[−100, 100]0F5x=∑i=1n−1100xi+1−xi22+xi−1230[−30, 30]0F6x=∑i=1nxi+5230[−100, 100]0F7x=∑i=1nixi4+random0,130[−1.28, 1.28]0Table 2
Multimodal benchmark functions.
FunctionDimRangefminF8x=∑i=1n−xisinxi30[−500, 500]−418.9829 × DimF9x=∑i=1nxi2−10cos2πxi+1030[−5.12, 5.12]0F10x=−20exp−0.21/n∑i=1nxi2−exp1/n∑i=1ncos2πxi+20+e30[−32, 32]0F11x=1/4000∑i=1nxi2−∏i=1ncosxi/i+130[−600, 600]0F12x=πn10sinπy1+∑i=1n−1yi−121+10sin2πyi+1+yn−12+∑i=1nuxi,10,100,4,whereyi=1+xi+1/4,uxi,a,k,m=kxi−amxi>a0−a<xi<ak−xi−amxi<−a30[−50, 50]0F13x=0.1sin23πx1+∑i=1nxi−121+sin23πxi+1+xn−121+sin22πxn+∑i=1nuxi,5,100,430[−50, 50]0Table 3
Fixed-dimension multimodal benchmark functions.
FunctionDimRangefminF14x=1/500+∑j=1251/j+∑i=12xi−aij6−12[−65, 65]0.998F15x=∑i=111ai−x1bi2+bix2/bi2+bix3+x424[−5, 5]0.00030F16x=4x12−2.1x14+1/3x16+x1x2−4x22+x242[−5, 5]−1.0316F17x=x2−5.1/4π2x12+5/πx1−62+101−1/8πcosx1+102[−5, 5]0.398F18x=1+x1+x2+1219−14x1+3x12−14x2+6x1x2+3x22×30+2x1−3x22×18−32x2+12x12+48x2−36x1x2+27x222[−2, 2]3F19x=−∑i=14ciexp−∑j=13aijxj−pij23[−1, 2]−3.86F20x=−∑i=14ciexp−∑j=16aijxj−pij26[0, 1]−3.32F21x=−∑i=15X−aiX−aiT+ci−14[0, 10]−10.1532F22x=−∑i=17X−aiX−aiT+ci−14[0, 10]−10.4028F23x=−∑i=110X−aiX−aiT+ci−14[0, 10]−10.5363


#### 4.1.1. Qualitative Results

The data results of the 23 standard benchmark functions are shown in Table4, and the optimal results are bolded. For the unimodal functions F1–F7, the RLTLBO algorithm achieves the best results among all comparative algorithms on most functions in average values and standard deviations, and only obtains worse results on F5–F6. The RLTLBO obtains the theoretical optimum of F1 and F3. It can be concluded from the comparison results that RLTLBO has strong competitiveness in the unimodal functions, which indicates that the excellent exploitation capability comes from the RL mechanism.Table 4
Results of algorithms on 23 standard benchmark functions.
FunctionRLTLBOTLBOmGWOMALODSCAHOAAOHHOSSAF1Mean0.00E +003.90E −794.26E −191.37E −032.55E −2883.13E −1362.34E −1048.97E −981.30E −07Std0.00E +006.59E −791.08E −181.56E −030.00E +001.21E −1351.08E −1034.16E −971.09E −07F2Mean1.29E −2234.17E −403.37E −126.86E +015.92E −1714.44E −682.82E −531.34E −481.79E +00Std0.00E +003.21E −402.54E −124.90E +010.00E +002.42E −671.13E −525.75E −481.15E +00F3Mean0.00E +002.50E −176.41E −014.81E +031.43E −2412.23E +022.22E −1017.16E −791.61E +03Std0.00E +004.35E −171.46E +002.18E +030.00E +005.03E +021.22E −1003.56E −781.03E +03F4Mean3.07E −2211.72E −322.42E −031.64E +011.97E −1345.04E −653.20E −532.51E −481.11E +01Std0.00E +001.76E −323.02E −034.23E +001.08E −1331.84E −641.75E −528.46E −483.74E +00F5Mean2.65E +012.42E +012.64E +019.86E −012.85E +012.89E +016.82E −031.22E −022.55E +02Std4.01E −017.41E −018.44E −015.21E +003.59E −017.45E −021.66E −021.79E −023.44E +02F6Mean9.03E −022.57E −064.54E −015.00E −046.01E +006.46E +004.43E −059.58E −051.28E −07Std1.15E −017.98E −063.20E −013.05E −041.61E −014.76E −016.15E −051.24E −041.13E −07F7Mean3.57E −051.12E −034.61E −031.05E −042.54E −045.88E −029.62E −051.68E −041.81E −01Std4.71E −053.06E −041.64E −037.89E −052.88E −044.10E −027.92E −051.36E −048.96E −02F8Mean−7.36E +03−7.85E +03−6.58E +03−1.22E +04−3.96E +03−4.30E +03−8.92E +03−1.25E +04−7.56E +03Std6.78E +029.32E +021.24E +031.08E +034.31E +027.82E +023.77E +038.42E +017.07E +02F9Mean0.00E +001.41E +011.70E +018.44E +010.00E +005.06E +010.00E +000.00E +005.19E +01Std0.00E +006.20E +009.11E +003.15E +010.00E +009.32E +010.00E +000.00E +001.88E +01F10Mean8.88E −167.05E −151.14E +004.77E +008.88E −166.10E −158.88E −168.88E −162.62E +00Std0.00E +001.60E −151.88E +002.64E +000.00E +002.42E −150.00E +000.00E +008.98E −01F11Mean0.00E +003.29E −044.86E −036.05E −020.00E +001.18E −010.00E +000.00E +002.24E −02Std0.00E +001.80E −039.13E −032.33E −020.00E +002.57E −010.00E +000.00E +001.45E −02F12Mean8.32E −045.38E −073.51E −021.60E −058.37E −011.23E +003.04E −061.02E −057.22E +00Std1.52E −032.76E −064.56E −021.16E −051.08E −012.42E −014.59E −061.12E −053.01E +00F13Mean2.00E +007.41E −023.83E −011.70E −032.76E +003.08E +004.57E −058.69E −052.19E +01Std1.17E +008.70E −022.15E −013.95E −035.11E −021.83E −011.18E −049.70E −051.44E +01F14Mean1.06E +009.98E −019.98E −011.46E +001.35E +002.78E +004.06E +001.36E +001.16E +00Std3.62E −010.00E +003.81E −127.69E −016.1E −012.07E +004.46E +009.52E −014.57E −01F15Mean3.55E −043.82E −043.04E −031.40E −038.91E −046.77E −035.00E −044.01E −043.55E −03Std1.02E −041.54E −046.91E −033.62E −033.99E −045.47E −031.10E −042.36E −046.71E −03F16Mean−1.03E +00−1.03E +00−1.03E +00−1.03E +00−1.03E +00−9.99E −01−1.03E +00−1.03E +00−1.03E +00Std6.58E −166.95E −163.39E −081.65E −133.99E −043.29E −023.01E −043.76E −091.83E −14F17Mean3.98E −013.98E −013.98E −013.98E −014.09E −013.99E −013.98E −013.98E −013.98E −01Std0.00E +000.00E +006.52E −095.57E −141.06E −021.08E −031.09E −044.60E −067.21E −15F18Mean3.00E +003.00E +003.00E +003.00E +003.00E +004.94E +003.03E +003.00E +003.00E +00Std4.95E −161.24E −151.03E −075.76E −138.33E −046.82E +005.73E −023.88E −072.87E −13F19Mean−3.86E +00−3.86E +00−3.86E +00−3.86E +00−3.82E +00−3.86E +00−3.85E +00−3.86E +00−3.86E +00Std2.71E −153.16E −151.08E −066.39E −132.33E −026.99E −046.96E −032.07E −031.09E −12F20Mean−3.31E +00−3.30E +00−3.23E +00−3.23E +00−2.80E +00−3.25E +00−3.16E +00−3.08E +00−3.23E +00Std2.95E −024.12E −026.47E −025.14E −022.71E −019.05E −028.91E −021.22E −016.22E −02F21Mean−1.02E +01−1.02E +01−9.98E +00−7.62E +00−3.27E +00−9.43E +00−1.01E +01−5.18E +00−8.07E +00Std6.04E −091.41E −039.30E −012.82E +001.54E +009.62E −012.09E −027.51E −013.28E +00F22Mean−1.04E +01−1.01E +01−1.04E +01−7.06E +00−3.87E +00−9.36E +00−1.04E +01−5.08E +00−9.32E +00Std1.23E −071.25E +004.45E −043.48E +001.17E +001.69E +005.50E −026.94E −032.51E +00F23Mean−1.05E +01−1.01E +01−1.05E +01−7.31E +00−4.19E +00−9.63E +00−1.05E +01−5.24E +00−7.89E +00Std1.57E −071.57E +003.42E −043.55E +001.11E +001.52E +002.23E −029.58E −013.59E +00For the multimodal and fixed-dimension multimodal functions F8–F23, it can be seen from Table4 that RLTLBO achieves the smallest average values and standard deviations on 12 of all 16 test functions compared to other methods, which indicates a very high accuracy and stability. Several poor results appear on F8 and F12–F14, but they are not the worst results. The satisfying results on the multimodal and fixed-dimension multimodal functions prove that the exploration and local optima avoidance capabilities of the RLTLBO are excellent, which might be derived from the ROBL strategy.Figure7 provides the convergence curves of RLTLBO and the comparative algorithms for 23 standard benchmark functions. The convergence rate reflected by convergence curves can show us the improvement of exploration and exploitation more intuitively. For F1–F4, F7, F9–F11, and F15–F21, the RLTLBO presents a faster convergence speed than other meta-heuristic algorithms, and the convergence accuracy is also the best. The RLTLBO is ranked in the second position in terms of convergence speed for F22 and F23. For benchmark functions F5–F6, F8, and F12–F14, the RLTLBO does not perform very well, the same as the results in Table 4.Figure 7
Convergence curves of 23 standard benchmark functions.


#### 4.1.2. The Wilcoxon Test

The Wilcoxon rank-sum test [48] results are listed in Table 5, which can assess the statistical performance differences between the RLTLBO algorithm and the comparative algorithms. A p-value less than 0.05 indicates a substantial difference between the two compared methods. It is obvious that the overwhelming majority p-values in Table 5 are less than 0.05, indicating that there are statistically and substantial differences between RLTLBO and the other methods. Combining the results in Table 4, it can be concluded that the RLTLBO algorithm outperforms the others. The competitive results of RLTLBO indicate that this algorithm has high capabilities of exploration and exploitation. In summary, the RLTLBO algorithm provides better results than other comparative algorithms.Table 5
p-Values from the Wilcoxon rank-sum test for the results in Table 4.
FunctionRLTLBO vs.TLBOmGWOMALODSCAHOAAOHHOSSAF16.10E −056.10E −056.10E −05NaN6.10E −056.10E −056.10E −056.10E −05F26.10E −056.10E −056.10E −056.10E −046.10E −056.10E −056.10E −056.10E −05F36.10E −056.10E −056.10E −051.56E −026.10E −056.10E −056.10E −056.10E −05F46.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F56.10E −053.30E −016.10E −056.10E −056.10E −056.10E −056.10E −058.54E −04F66.10E −051.22E −046.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F76.10E −056.10E −054.89E −016.10E −046.10E −054.89E −017.30E −026.10E −05F80.0102546.37E −026.10E −056.10E −056.10E −051.21E −016.10E −055.61E −01F96.10E −056.10E −056.10E −05NaN1.25E −01NaNNaN6.10E −05F106.10E −056.10E −056.10E −05NaN6.10E −05NaNNaN6.10E −05F11NaN1.95E −036.10E −05NaN3.12E −02NaNNaN6.10E −05F126.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F133.05E −046.10E −046.10E −053.89E −012.01E −036.10E −056.10E −053.05E −04F14NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F158.90E −012.01E −031.83E −046.10E −056.10E −056.10E −058.36E −036.10E −05F16NaN6.10E −056.10E −056.10E −056.10E −056.10E −051.22E −046.10E −05F17NaN6.10E −052.44E −046.10E −056.10E −056.10E −056.10E −059.76E −04F18NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F19NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F208.52E −014.13E −021.35E −016.10E −052.01E −036.10E −056.10E −053.05E −04F211.68E −016.10E −054.79E −026.10E −056.10E −056.10E −056.10E −051.03E −02F226.25E −026.10E −052.56E −026.10E −056.10E −056.10E −056.10E −054.13E −02F237.81E −036.10E −056.10E −056.10E −056.10E −056.10E −056.10E −052.56E −02


### 4.2. CEC2017 Benchmark Function Experiments

Standard benchmark function experiments prove the superior performance on simple optimization problems of the proposed RLTLBO algorithm. CEC2017 [49], one of the most challenging test suites, can help check the performance of complex optimization problems. Some hybrid and composition functions are selected to further test the performance of RLTLBO. These types of functions are precisely what the standard test functions do not have. The functional details and the comparison results are presented in Tables 6 and 7. As mentioned above, each method runs 30 times with 30 search agents and 500 iterations. From Table 7, the proposed RLTLBO achieves both the best average and standard deviation values on five of the eight all functions. For the remaining three functions, RLTLBO obtains one of the best average and standard deviation values. The RLTLBO completely exceeds the TLBO, MALO, HOA, AO, HHO, and SSA methods completely. The statistical results are also listed in Table 8. There are only seven p-values greater than 0.05 in all test functions, which means considerable differences between the RLTLBO and the compared methods. These results suggest that RLTLBO can achieve great results on complex problems as well.Table 6
Descriptions of the benchmark functions from CEC2017.
FunctionNameDimRangefminHybrid functions (N is basic number of functions)C13Hybrid function 3 (N = 3)10[−100, 100]1300C14Hybrid function 4 (N = 4)10[−100, 100]1400C15Hybrid function 5 (N = 4)10[−100, 100]1500C19Hybrid function 6 (N = 5)10[−100, 100]1900Composite functions (N is basic number of functions)C22Composite function 2 (N = 3)10[−100, 100]2200C25Composite function 5 (N = 5)10[−100, 100]2500C28Composite function 8 (N = 6)10[−100, 100]2800C29Composite function 9 (N = 6)10[−100, 100]2900Table 7
Comparison results of algorithms on CEC2017.
FunctionRLTLBOTLBOmGWOMALODSCAHOAAOHHOSSAC13Mean4.38E +036.04E +034.35E +031.78E +046.25E +051.53E +061.77E +041.70E +041.46E +04Std2.76E +034.33E +032.99E +031.30E +044.55E +051.28E +061.39E +041.03E +041.29E +04C14Mean1.46E +031.47E +031.47E +032.75E +034.78E +033.87E +032.36E +032.20E +033.35E +03Std1.81E +012.40E +011.98E +012.02E +033.76E +031.99E +031.12E +031.05E +033.10E +03C15Mean1.62E +031.73E +031.74E +038.28E +037.97E +032.49E +045.91E +037.35E +031.06E +04Std5.96E +011.44E +022.36E +025.72E +033.62E +031.54E +042.16E +033.10E +037.51E +03C19Mean2.00E +032.11E +032.65E +031.54E +043.37E +041.69E +042.10E +041.67E +048.46E +03Std9.63E +003.19E +021.68E +031.23E +043.00E +041.34E +042.88E +041.37E +046.44E +03C22Mean2.30E +032.30E +032.30E +002.30E +032.55E +032.47E +032.31E +032.41E +032.33E +03Std1.99E +018.68E +009.25E −012.88E +018.10E +014.58E +025.85E +003.85E +021.69E +02C25Mean2.92E +032.93E +032.92E +032.93E +033.12E +032.97E +032.94E +032.93E +032.92E +03Std2.32E +012.41E +012.33E +012.38E +016.48E +012.35E +012.50E +016.24E +012.45E +01C28Mean3.23E +033.30E +033.33E +033.31E +033.40E +033.50E +033.44E +033.45E +033.29E +03Std1.15E +021.60E +021.12E +021.47E +029.48E +011.06E +021.09E +021.45E +021.68E +02C29Mean3.18E +033.19E +033.17E +033.27E +033.38E +033.38E +033.26E +033.37E +033.27E +03Std1.84E +012.16E +012.13E +016.15E +015.77E +016.58E +015.87E +011.20E +027.20E +01Table 8
p values from the Wilcoxon rank-sum test for the results in Table 7.
FunctionRLTLBO vs.TLBOmGWOMALODSCAHOAAOHHOSSAC132.90E −023.59E −011.81E −026.10E −056.10E −056.10E −053.36E −031.22E −04C141.35E −014.37E −026.10E −056.10E −056.10E −056.10E −051.83E −046.10E −05C153.36E −038.36E −036.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05C191.24E −023.30E −028.54E −046.10E −056.10E −056.10E −056.10E −056.10E −05C224.27E −034.13E −024.04E −026.10E −056.10E −056.10E −056.10E −058.47E −02C255.61E −018.47E −018.47E −016.10E −052.01E −031.21E −021.69E −023.62E −01C282.48E −021.51E −024.79E −021.81E −021.53E −036.10E −045.37E −034.21E −02C294.54E −036.10E −046.10E −056.10E −056.10E −058.54E −046.10E −051.51E −02


## 4.1. Standard Benchmark Function Experiments

Standard benchmark functions [47] can be divided into three types: unimodal, multimodal and fixed-dimension multimodal functions. Unimodal functions only have one global optimum and no local optima, which can be used to evaluate an algorithm's convergence rate and exploitation capability. Multimodal and fixed-dimension multimodal functions have a global optimum and multiple local optima. This characteristic makes these functions effective for testing the exploration and local optima avoidance abilities of an algorithm. The benchmark function details are listed in Tables 1–3.Table 1
Unimodal benchmark functions.
FunctionDimRangefminF1x=∑i=1nxi230[−100, 100]0F2x=∑i=1nxi+∏i=1nxi30[−10, 10]0F3x=∑i=1n∑j−1ixj230[−100, 100]0F4x=maxixi,1≤i≤n30[−100, 100]0F5x=∑i=1n−1100xi+1−xi22+xi−1230[−30, 30]0F6x=∑i=1nxi+5230[−100, 100]0F7x=∑i=1nixi4+random0,130[−1.28, 1.28]0Table 2
Multimodal benchmark functions.
FunctionDimRangefminF8x=∑i=1n−xisinxi30[−500, 500]−418.9829 × DimF9x=∑i=1nxi2−10cos2πxi+1030[−5.12, 5.12]0F10x=−20exp−0.21/n∑i=1nxi2−exp1/n∑i=1ncos2πxi+20+e30[−32, 32]0F11x=1/4000∑i=1nxi2−∏i=1ncosxi/i+130[−600, 600]0F12x=πn10sinπy1+∑i=1n−1yi−121+10sin2πyi+1+yn−12+∑i=1nuxi,10,100,4,whereyi=1+xi+1/4,uxi,a,k,m=kxi−amxi>a0−a<xi<ak−xi−amxi<−a30[−50, 50]0F13x=0.1sin23πx1+∑i=1nxi−121+sin23πxi+1+xn−121+sin22πxn+∑i=1nuxi,5,100,430[−50, 50]0Table 3
Fixed-dimension multimodal benchmark functions.
FunctionDimRangefminF14x=1/500+∑j=1251/j+∑i=12xi−aij6−12[−65, 65]0.998F15x=∑i=111ai−x1bi2+bix2/bi2+bix3+x424[−5, 5]0.00030F16x=4x12−2.1x14+1/3x16+x1x2−4x22+x242[−5, 5]−1.0316F17x=x2−5.1/4π2x12+5/πx1−62+101−1/8πcosx1+102[−5, 5]0.398F18x=1+x1+x2+1219−14x1+3x12−14x2+6x1x2+3x22×30+2x1−3x22×18−32x2+12x12+48x2−36x1x2+27x222[−2, 2]3F19x=−∑i=14ciexp−∑j=13aijxj−pij23[−1, 2]−3.86F20x=−∑i=14ciexp−∑j=16aijxj−pij26[0, 1]−3.32F21x=−∑i=15X−aiX−aiT+ci−14[0, 10]−10.1532F22x=−∑i=17X−aiX−aiT+ci−14[0, 10]−10.4028F23x=−∑i=110X−aiX−aiT+ci−14[0, 10]−10.5363


### 4.1.1. Qualitative Results

The data results of the 23 standard benchmark functions are shown in Table4, and the optimal results are bolded. For the unimodal functions F1–F7, the RLTLBO algorithm achieves the best results among all comparative algorithms on most functions in average values and standard deviations, and only obtains worse results on F5–F6. The RLTLBO obtains the theoretical optimum of F1 and F3. It can be concluded from the comparison results that RLTLBO has strong competitiveness in the unimodal functions, which indicates that the excellent exploitation capability comes from the RL mechanism.Table 4
Results of algorithms on 23 standard benchmark functions.
FunctionRLTLBOTLBOmGWOMALODSCAHOAAOHHOSSAF1Mean0.00E +003.90E −794.26E −191.37E −032.55E −2883.13E −1362.34E −1048.97E −981.30E −07Std0.00E +006.59E −791.08E −181.56E −030.00E +001.21E −1351.08E −1034.16E −971.09E −07F2Mean1.29E −2234.17E −403.37E −126.86E +015.92E −1714.44E −682.82E −531.34E −481.79E +00Std0.00E +003.21E −402.54E −124.90E +010.00E +002.42E −671.13E −525.75E −481.15E +00F3Mean0.00E +002.50E −176.41E −014.81E +031.43E −2412.23E +022.22E −1017.16E −791.61E +03Std0.00E +004.35E −171.46E +002.18E +030.00E +005.03E +021.22E −1003.56E −781.03E +03F4Mean3.07E −2211.72E −322.42E −031.64E +011.97E −1345.04E −653.20E −532.51E −481.11E +01Std0.00E +001.76E −323.02E −034.23E +001.08E −1331.84E −641.75E −528.46E −483.74E +00F5Mean2.65E +012.42E +012.64E +019.86E −012.85E +012.89E +016.82E −031.22E −022.55E +02Std4.01E −017.41E −018.44E −015.21E +003.59E −017.45E −021.66E −021.79E −023.44E +02F6Mean9.03E −022.57E −064.54E −015.00E −046.01E +006.46E +004.43E −059.58E −051.28E −07Std1.15E −017.98E −063.20E −013.05E −041.61E −014.76E −016.15E −051.24E −041.13E −07F7Mean3.57E −051.12E −034.61E −031.05E −042.54E −045.88E −029.62E −051.68E −041.81E −01Std4.71E −053.06E −041.64E −037.89E −052.88E −044.10E −027.92E −051.36E −048.96E −02F8Mean−7.36E +03−7.85E +03−6.58E +03−1.22E +04−3.96E +03−4.30E +03−8.92E +03−1.25E +04−7.56E +03Std6.78E +029.32E +021.24E +031.08E +034.31E +027.82E +023.77E +038.42E +017.07E +02F9Mean0.00E +001.41E +011.70E +018.44E +010.00E +005.06E +010.00E +000.00E +005.19E +01Std0.00E +006.20E +009.11E +003.15E +010.00E +009.32E +010.00E +000.00E +001.88E +01F10Mean8.88E −167.05E −151.14E +004.77E +008.88E −166.10E −158.88E −168.88E −162.62E +00Std0.00E +001.60E −151.88E +002.64E +000.00E +002.42E −150.00E +000.00E +008.98E −01F11Mean0.00E +003.29E −044.86E −036.05E −020.00E +001.18E −010.00E +000.00E +002.24E −02Std0.00E +001.80E −039.13E −032.33E −020.00E +002.57E −010.00E +000.00E +001.45E −02F12Mean8.32E −045.38E −073.51E −021.60E −058.37E −011.23E +003.04E −061.02E −057.22E +00Std1.52E −032.76E −064.56E −021.16E −051.08E −012.42E −014.59E −061.12E −053.01E +00F13Mean2.00E +007.41E −023.83E −011.70E −032.76E +003.08E +004.57E −058.69E −052.19E +01Std1.17E +008.70E −022.15E −013.95E −035.11E −021.83E −011.18E −049.70E −051.44E +01F14Mean1.06E +009.98E −019.98E −011.46E +001.35E +002.78E +004.06E +001.36E +001.16E +00Std3.62E −010.00E +003.81E −127.69E −016.1E −012.07E +004.46E +009.52E −014.57E −01F15Mean3.55E −043.82E −043.04E −031.40E −038.91E −046.77E −035.00E −044.01E −043.55E −03Std1.02E −041.54E −046.91E −033.62E −033.99E −045.47E −031.10E −042.36E −046.71E −03F16Mean−1.03E +00−1.03E +00−1.03E +00−1.03E +00−1.03E +00−9.99E −01−1.03E +00−1.03E +00−1.03E +00Std6.58E −166.95E −163.39E −081.65E −133.99E −043.29E −023.01E −043.76E −091.83E −14F17Mean3.98E −013.98E −013.98E −013.98E −014.09E −013.99E −013.98E −013.98E −013.98E −01Std0.00E +000.00E +006.52E −095.57E −141.06E −021.08E −031.09E −044.60E −067.21E −15F18Mean3.00E +003.00E +003.00E +003.00E +003.00E +004.94E +003.03E +003.00E +003.00E +00Std4.95E −161.24E −151.03E −075.76E −138.33E −046.82E +005.73E −023.88E −072.87E −13F19Mean−3.86E +00−3.86E +00−3.86E +00−3.86E +00−3.82E +00−3.86E +00−3.85E +00−3.86E +00−3.86E +00Std2.71E −153.16E −151.08E −066.39E −132.33E −026.99E −046.96E −032.07E −031.09E −12F20Mean−3.31E +00−3.30E +00−3.23E +00−3.23E +00−2.80E +00−3.25E +00−3.16E +00−3.08E +00−3.23E +00Std2.95E −024.12E −026.47E −025.14E −022.71E −019.05E −028.91E −021.22E −016.22E −02F21Mean−1.02E +01−1.02E +01−9.98E +00−7.62E +00−3.27E +00−9.43E +00−1.01E +01−5.18E +00−8.07E +00Std6.04E −091.41E −039.30E −012.82E +001.54E +009.62E −012.09E −027.51E −013.28E +00F22Mean−1.04E +01−1.01E +01−1.04E +01−7.06E +00−3.87E +00−9.36E +00−1.04E +01−5.08E +00−9.32E +00Std1.23E −071.25E +004.45E −043.48E +001.17E +001.69E +005.50E −026.94E −032.51E +00F23Mean−1.05E +01−1.01E +01−1.05E +01−7.31E +00−4.19E +00−9.63E +00−1.05E +01−5.24E +00−7.89E +00Std1.57E −071.57E +003.42E −043.55E +001.11E +001.52E +002.23E −029.58E −013.59E +00For the multimodal and fixed-dimension multimodal functions F8–F23, it can be seen from Table4 that RLTLBO achieves the smallest average values and standard deviations on 12 of all 16 test functions compared to other methods, which indicates a very high accuracy and stability. Several poor results appear on F8 and F12–F14, but they are not the worst results. The satisfying results on the multimodal and fixed-dimension multimodal functions prove that the exploration and local optima avoidance capabilities of the RLTLBO are excellent, which might be derived from the ROBL strategy.Figure7 provides the convergence curves of RLTLBO and the comparative algorithms for 23 standard benchmark functions. The convergence rate reflected by convergence curves can show us the improvement of exploration and exploitation more intuitively. For F1–F4, F7, F9–F11, and F15–F21, the RLTLBO presents a faster convergence speed than other meta-heuristic algorithms, and the convergence accuracy is also the best. The RLTLBO is ranked in the second position in terms of convergence speed for F22 and F23. For benchmark functions F5–F6, F8, and F12–F14, the RLTLBO does not perform very well, the same as the results in Table 4.Figure 7
Convergence curves of 23 standard benchmark functions.


### 4.1.2. The Wilcoxon Test

The Wilcoxon rank-sum test [48] results are listed in Table 5, which can assess the statistical performance differences between the RLTLBO algorithm and the comparative algorithms. A p-value less than 0.05 indicates a substantial difference between the two compared methods. It is obvious that the overwhelming majority p-values in Table 5 are less than 0.05, indicating that there are statistically and substantial differences between RLTLBO and the other methods. Combining the results in Table 4, it can be concluded that the RLTLBO algorithm outperforms the others. The competitive results of RLTLBO indicate that this algorithm has high capabilities of exploration and exploitation. In summary, the RLTLBO algorithm provides better results than other comparative algorithms.Table 5
p-Values from the Wilcoxon rank-sum test for the results in Table 4.
FunctionRLTLBO vs.TLBOmGWOMALODSCAHOAAOHHOSSAF16.10E −056.10E −056.10E −05NaN6.10E −056.10E −056.10E −056.10E −05F26.10E −056.10E −056.10E −056.10E −046.10E −056.10E −056.10E −056.10E −05F36.10E −056.10E −056.10E −051.56E −026.10E −056.10E −056.10E −056.10E −05F46.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F56.10E −053.30E −016.10E −056.10E −056.10E −056.10E −056.10E −058.54E −04F66.10E −051.22E −046.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F76.10E −056.10E −054.89E −016.10E −046.10E −054.89E −017.30E −026.10E −05F80.0102546.37E −026.10E −056.10E −056.10E −051.21E −016.10E −055.61E −01F96.10E −056.10E −056.10E −05NaN1.25E −01NaNNaN6.10E −05F106.10E −056.10E −056.10E −05NaN6.10E −05NaNNaN6.10E −05F11NaN1.95E −036.10E −05NaN3.12E −02NaNNaN6.10E −05F126.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F133.05E −046.10E −046.10E −053.89E −012.01E −036.10E −056.10E −053.05E −04F14NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F158.90E −012.01E −031.83E −046.10E −056.10E −056.10E −058.36E −036.10E −05F16NaN6.10E −056.10E −056.10E −056.10E −056.10E −051.22E −046.10E −05F17NaN6.10E −052.44E −046.10E −056.10E −056.10E −056.10E −059.76E −04F18NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F19NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F208.52E −014.13E −021.35E −016.10E −052.01E −036.10E −056.10E −053.05E −04F211.68E −016.10E −054.79E −026.10E −056.10E −056.10E −056.10E −051.03E −02F226.25E −026.10E −052.56E −026.10E −056.10E −056.10E −056.10E −054.13E −02F237.81E −036.10E −056.10E −056.10E −056.10E −056.10E −056.10E −052.56E −02


## 4.1.1. Qualitative Results

The data results of the 23 standard benchmark functions are shown in Table4, and the optimal results are bolded. For the unimodal functions F1–F7, the RLTLBO algorithm achieves the best results among all comparative algorithms on most functions in average values and standard deviations, and only obtains worse results on F5–F6. The RLTLBO obtains the theoretical optimum of F1 and F3. It can be concluded from the comparison results that RLTLBO has strong competitiveness in the unimodal functions, which indicates that the excellent exploitation capability comes from the RL mechanism.Table 4
Results of algorithms on 23 standard benchmark functions.
FunctionRLTLBOTLBOmGWOMALODSCAHOAAOHHOSSAF1Mean0.00E +003.90E −794.26E −191.37E −032.55E −2883.13E −1362.34E −1048.97E −981.30E −07Std0.00E +006.59E −791.08E −181.56E −030.00E +001.21E −1351.08E −1034.16E −971.09E −07F2Mean1.29E −2234.17E −403.37E −126.86E +015.92E −1714.44E −682.82E −531.34E −481.79E +00Std0.00E +003.21E −402.54E −124.90E +010.00E +002.42E −671.13E −525.75E −481.15E +00F3Mean0.00E +002.50E −176.41E −014.81E +031.43E −2412.23E +022.22E −1017.16E −791.61E +03Std0.00E +004.35E −171.46E +002.18E +030.00E +005.03E +021.22E −1003.56E −781.03E +03F4Mean3.07E −2211.72E −322.42E −031.64E +011.97E −1345.04E −653.20E −532.51E −481.11E +01Std0.00E +001.76E −323.02E −034.23E +001.08E −1331.84E −641.75E −528.46E −483.74E +00F5Mean2.65E +012.42E +012.64E +019.86E −012.85E +012.89E +016.82E −031.22E −022.55E +02Std4.01E −017.41E −018.44E −015.21E +003.59E −017.45E −021.66E −021.79E −023.44E +02F6Mean9.03E −022.57E −064.54E −015.00E −046.01E +006.46E +004.43E −059.58E −051.28E −07Std1.15E −017.98E −063.20E −013.05E −041.61E −014.76E −016.15E −051.24E −041.13E −07F7Mean3.57E −051.12E −034.61E −031.05E −042.54E −045.88E −029.62E −051.68E −041.81E −01Std4.71E −053.06E −041.64E −037.89E −052.88E −044.10E −027.92E −051.36E −048.96E −02F8Mean−7.36E +03−7.85E +03−6.58E +03−1.22E +04−3.96E +03−4.30E +03−8.92E +03−1.25E +04−7.56E +03Std6.78E +029.32E +021.24E +031.08E +034.31E +027.82E +023.77E +038.42E +017.07E +02F9Mean0.00E +001.41E +011.70E +018.44E +010.00E +005.06E +010.00E +000.00E +005.19E +01Std0.00E +006.20E +009.11E +003.15E +010.00E +009.32E +010.00E +000.00E +001.88E +01F10Mean8.88E −167.05E −151.14E +004.77E +008.88E −166.10E −158.88E −168.88E −162.62E +00Std0.00E +001.60E −151.88E +002.64E +000.00E +002.42E −150.00E +000.00E +008.98E −01F11Mean0.00E +003.29E −044.86E −036.05E −020.00E +001.18E −010.00E +000.00E +002.24E −02Std0.00E +001.80E −039.13E −032.33E −020.00E +002.57E −010.00E +000.00E +001.45E −02F12Mean8.32E −045.38E −073.51E −021.60E −058.37E −011.23E +003.04E −061.02E −057.22E +00Std1.52E −032.76E −064.56E −021.16E −051.08E −012.42E −014.59E −061.12E −053.01E +00F13Mean2.00E +007.41E −023.83E −011.70E −032.76E +003.08E +004.57E −058.69E −052.19E +01Std1.17E +008.70E −022.15E −013.95E −035.11E −021.83E −011.18E −049.70E −051.44E +01F14Mean1.06E +009.98E −019.98E −011.46E +001.35E +002.78E +004.06E +001.36E +001.16E +00Std3.62E −010.00E +003.81E −127.69E −016.1E −012.07E +004.46E +009.52E −014.57E −01F15Mean3.55E −043.82E −043.04E −031.40E −038.91E −046.77E −035.00E −044.01E −043.55E −03Std1.02E −041.54E −046.91E −033.62E −033.99E −045.47E −031.10E −042.36E −046.71E −03F16Mean−1.03E +00−1.03E +00−1.03E +00−1.03E +00−1.03E +00−9.99E −01−1.03E +00−1.03E +00−1.03E +00Std6.58E −166.95E −163.39E −081.65E −133.99E −043.29E −023.01E −043.76E −091.83E −14F17Mean3.98E −013.98E −013.98E −013.98E −014.09E −013.99E −013.98E −013.98E −013.98E −01Std0.00E +000.00E +006.52E −095.57E −141.06E −021.08E −031.09E −044.60E −067.21E −15F18Mean3.00E +003.00E +003.00E +003.00E +003.00E +004.94E +003.03E +003.00E +003.00E +00Std4.95E −161.24E −151.03E −075.76E −138.33E −046.82E +005.73E −023.88E −072.87E −13F19Mean−3.86E +00−3.86E +00−3.86E +00−3.86E +00−3.82E +00−3.86E +00−3.85E +00−3.86E +00−3.86E +00Std2.71E −153.16E −151.08E −066.39E −132.33E −026.99E −046.96E −032.07E −031.09E −12F20Mean−3.31E +00−3.30E +00−3.23E +00−3.23E +00−2.80E +00−3.25E +00−3.16E +00−3.08E +00−3.23E +00Std2.95E −024.12E −026.47E −025.14E −022.71E −019.05E −028.91E −021.22E −016.22E −02F21Mean−1.02E +01−1.02E +01−9.98E +00−7.62E +00−3.27E +00−9.43E +00−1.01E +01−5.18E +00−8.07E +00Std6.04E −091.41E −039.30E −012.82E +001.54E +009.62E −012.09E −027.51E −013.28E +00F22Mean−1.04E +01−1.01E +01−1.04E +01−7.06E +00−3.87E +00−9.36E +00−1.04E +01−5.08E +00−9.32E +00Std1.23E −071.25E +004.45E −043.48E +001.17E +001.69E +005.50E −026.94E −032.51E +00F23Mean−1.05E +01−1.01E +01−1.05E +01−7.31E +00−4.19E +00−9.63E +00−1.05E +01−5.24E +00−7.89E +00Std1.57E −071.57E +003.42E −043.55E +001.11E +001.52E +002.23E −029.58E −013.59E +00For the multimodal and fixed-dimension multimodal functions F8–F23, it can be seen from Table4 that RLTLBO achieves the smallest average values and standard deviations on 12 of all 16 test functions compared to other methods, which indicates a very high accuracy and stability. Several poor results appear on F8 and F12–F14, but they are not the worst results. The satisfying results on the multimodal and fixed-dimension multimodal functions prove that the exploration and local optima avoidance capabilities of the RLTLBO are excellent, which might be derived from the ROBL strategy.Figure7 provides the convergence curves of RLTLBO and the comparative algorithms for 23 standard benchmark functions. The convergence rate reflected by convergence curves can show us the improvement of exploration and exploitation more intuitively. For F1–F4, F7, F9–F11, and F15–F21, the RLTLBO presents a faster convergence speed than other meta-heuristic algorithms, and the convergence accuracy is also the best. The RLTLBO is ranked in the second position in terms of convergence speed for F22 and F23. For benchmark functions F5–F6, F8, and F12–F14, the RLTLBO does not perform very well, the same as the results in Table 4.Figure 7
Convergence curves of 23 standard benchmark functions.


## 4.1.2. The Wilcoxon Test

The Wilcoxon rank-sum test [48] results are listed in Table 5, which can assess the statistical performance differences between the RLTLBO algorithm and the comparative algorithms. A p-value less than 0.05 indicates a substantial difference between the two compared methods. It is obvious that the overwhelming majority p-values in Table 5 are less than 0.05, indicating that there are statistically and substantial differences between RLTLBO and the other methods. Combining the results in Table 4, it can be concluded that the RLTLBO algorithm outperforms the others. The competitive results of RLTLBO indicate that this algorithm has high capabilities of exploration and exploitation. In summary, the RLTLBO algorithm provides better results than other comparative algorithms.Table 5
p-Values from the Wilcoxon rank-sum test for the results in Table 4.
FunctionRLTLBO vs.TLBOmGWOMALODSCAHOAAOHHOSSAF16.10E −056.10E −056.10E −05NaN6.10E −056.10E −056.10E −056.10E −05F26.10E −056.10E −056.10E −056.10E −046.10E −056.10E −056.10E −056.10E −05F36.10E −056.10E −056.10E −051.56E −026.10E −056.10E −056.10E −056.10E −05F46.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F56.10E −053.30E −016.10E −056.10E −056.10E −056.10E −056.10E −058.54E −04F66.10E −051.22E −046.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F76.10E −056.10E −054.89E −016.10E −046.10E −054.89E −017.30E −026.10E −05F80.0102546.37E −026.10E −056.10E −056.10E −051.21E −016.10E −055.61E −01F96.10E −056.10E −056.10E −05NaN1.25E −01NaNNaN6.10E −05F106.10E −056.10E −056.10E −05NaN6.10E −05NaNNaN6.10E −05F11NaN1.95E −036.10E −05NaN3.12E −02NaNNaN6.10E −05F126.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F133.05E −046.10E −046.10E −053.89E −012.01E −036.10E −056.10E −053.05E −04F14NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F158.90E −012.01E −031.83E −046.10E −056.10E −056.10E −058.36E −036.10E −05F16NaN6.10E −056.10E −056.10E −056.10E −056.10E −051.22E −046.10E −05F17NaN6.10E −052.44E −046.10E −056.10E −056.10E −056.10E −059.76E −04F18NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F19NaN6.10E −056.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05F208.52E −014.13E −021.35E −016.10E −052.01E −036.10E −056.10E −053.05E −04F211.68E −016.10E −054.79E −026.10E −056.10E −056.10E −056.10E −051.03E −02F226.25E −026.10E −052.56E −026.10E −056.10E −056.10E −056.10E −054.13E −02F237.81E −036.10E −056.10E −056.10E −056.10E −056.10E −056.10E −052.56E −02


## 4.2. CEC2017 Benchmark Function Experiments

Standard benchmark function experiments prove the superior performance on simple optimization problems of the proposed RLTLBO algorithm. CEC2017 [49], one of the most challenging test suites, can help check the performance of complex optimization problems. Some hybrid and composition functions are selected to further test the performance of RLTLBO. These types of functions are precisely what the standard test functions do not have. The functional details and the comparison results are presented in Tables 6 and 7. As mentioned above, each method runs 30 times with 30 search agents and 500 iterations. From Table 7, the proposed RLTLBO achieves both the best average and standard deviation values on five of the eight all functions. For the remaining three functions, RLTLBO obtains one of the best average and standard deviation values. The RLTLBO completely exceeds the TLBO, MALO, HOA, AO, HHO, and SSA methods completely. The statistical results are also listed in Table 8. There are only seven p-values greater than 0.05 in all test functions, which means considerable differences between the RLTLBO and the compared methods. These results suggest that RLTLBO can achieve great results on complex problems as well.Table 6
Descriptions of the benchmark functions from CEC2017.
FunctionNameDimRangefminHybrid functions (N is basic number of functions)C13Hybrid function 3 (N = 3)10[−100, 100]1300C14Hybrid function 4 (N = 4)10[−100, 100]1400C15Hybrid function 5 (N = 4)10[−100, 100]1500C19Hybrid function 6 (N = 5)10[−100, 100]1900Composite functions (N is basic number of functions)C22Composite function 2 (N = 3)10[−100, 100]2200C25Composite function 5 (N = 5)10[−100, 100]2500C28Composite function 8 (N = 6)10[−100, 100]2800C29Composite function 9 (N = 6)10[−100, 100]2900Table 7
Comparison results of algorithms on CEC2017.
FunctionRLTLBOTLBOmGWOMALODSCAHOAAOHHOSSAC13Mean4.38E +036.04E +034.35E +031.78E +046.25E +051.53E +061.77E +041.70E +041.46E +04Std2.76E +034.33E +032.99E +031.30E +044.55E +051.28E +061.39E +041.03E +041.29E +04C14Mean1.46E +031.47E +031.47E +032.75E +034.78E +033.87E +032.36E +032.20E +033.35E +03Std1.81E +012.40E +011.98E +012.02E +033.76E +031.99E +031.12E +031.05E +033.10E +03C15Mean1.62E +031.73E +031.74E +038.28E +037.97E +032.49E +045.91E +037.35E +031.06E +04Std5.96E +011.44E +022.36E +025.72E +033.62E +031.54E +042.16E +033.10E +037.51E +03C19Mean2.00E +032.11E +032.65E +031.54E +043.37E +041.69E +042.10E +041.67E +048.46E +03Std9.63E +003.19E +021.68E +031.23E +043.00E +041.34E +042.88E +041.37E +046.44E +03C22Mean2.30E +032.30E +032.30E +002.30E +032.55E +032.47E +032.31E +032.41E +032.33E +03Std1.99E +018.68E +009.25E −012.88E +018.10E +014.58E +025.85E +003.85E +021.69E +02C25Mean2.92E +032.93E +032.92E +032.93E +033.12E +032.97E +032.94E +032.93E +032.92E +03Std2.32E +012.41E +012.33E +012.38E +016.48E +012.35E +012.50E +016.24E +012.45E +01C28Mean3.23E +033.30E +033.33E +033.31E +033.40E +033.50E +033.44E +033.45E +033.29E +03Std1.15E +021.60E +021.12E +021.47E +029.48E +011.06E +021.09E +021.45E +021.68E +02C29Mean3.18E +033.19E +033.17E +033.27E +033.38E +033.38E +033.26E +033.37E +033.27E +03Std1.84E +012.16E +012.13E +016.15E +015.77E +016.58E +015.87E +011.20E +027.20E +01Table 8
p values from the Wilcoxon rank-sum test for the results in Table 7.
FunctionRLTLBO vs.TLBOmGWOMALODSCAHOAAOHHOSSAC132.90E −023.59E −011.81E −026.10E −056.10E −056.10E −053.36E −031.22E −04C141.35E −014.37E −026.10E −056.10E −056.10E −056.10E −051.83E −046.10E −05C153.36E −038.36E −036.10E −056.10E −056.10E −056.10E −056.10E −056.10E −05C191.24E −023.30E −028.54E −046.10E −056.10E −056.10E −056.10E −056.10E −05C224.27E −034.13E −024.04E −026.10E −056.10E −056.10E −056.10E −058.47E −02C255.61E −018.47E −018.47E −016.10E −052.01E −031.21E −021.69E −023.62E −01C282.48E −021.51E −024.79E −021.81E −021.53E −036.10E −045.37E −034.21E −02C294.54E −036.10E −046.10E −056.10E −056.10E −058.54E −046.10E −051.51E −02


## 5. Experiments on Industrial Engineering Design Problems

In this section, eight well-known constrained industrial engineering design problems, including the welded beam design problem, pressure vessel design problem, tension and compression spring design problem, speed reducer design problem, three-bar truss design problem, car crashworthiness design problem, tubular column design problem, and frequency-modulated sound wave design problem, are solved to further verify the performance of the proposed RLTLBO algorithm. The results of RLTLBO are compared to various optimization methods proposed in previous studies.


### 5.1. Welded Beam Design Problem

The purpose of this problem is to minimize the cost of the welded beam (Figure8). Four variables need to be optimized: the thickness of weld (h), the thickness of the bar (b), length of the bar (l), and height of the bar (t). The mathematical formulation is listed as follows:Considerz⟶=z1,z2,z3,z4=h,l,t,b.Minimizefz⟶=1.10471z12z2+0.04811z3z414.0+z2,  subject to(6)g1z⟶=τz⟶−τmax≤0,g2z⟶=σz⟶−σmax≤0,g3z⟶=δz⟶−δmax≤0,g4z⟶=z1−z4≤0,g5z⟶=P−Pcz⟶≤0,g6z⟶=0.125−z1≤0,g7z⟶=1.10471z12+0.04811z3z414.0+z2−5.0≤0.Variable range(7)0.1≤z1≤2,0.1≤z2≤10,0.1≤z3≤10,0.1≤z4≤2,where(8)τz⟶=τ′2+2τ′τ″z22R+τ″2,τ′=P2z1z2,τ″=MRJ,M=PL+z22,R=z224+z1+z322,J=22z1z2z2212+z1+z322,σz⟶=6PLz4z32,δz⟶=4PL3Ez33z4,Pcz⟶=4.013Ez32z46/36L21−z32LE4G,P=6000lb,L=14in,δmax=0.25in,E=30×106psi,G=12×106psi,τmax=13600psi,σmax=30000psi.Figure 8
Welded beam design problem.The RLTLBO is compared to SMA [50], WOA, MPA [51], MVO [52], GA, and HS [53] methods. The comparison results presented in Table 9 show the superior of the RLTLBO algorithm with a smaller cost than other algorithms.Table 9
Comparison results for the welded beam design problem.
AlgorithmOptimum variablesOptimum costhltbRLTLBO0.2057303.2530009.0366000.2057301.695200SMA [50]0.2054003.2589009.0384000.2058001.696040WOA [14]0.2053963.4842939.0374260.2062761.730499MPA [51]0.2057283.4705099.0366240.2057301.724853MVO [52]0.2054633.4731939.0445020.2056951.726450GA [6]0.2489006.1730008.1789000.2533002.430000HS [53]0.2442006.2231008.2915000.2400002.380700


### 5.2. Pressure Vessel Design Problem

The objective of this problem is to minimize the fabrication cost of the cylindrical pressure vessel to meet the pressure requirements. As shown in Figure9, four structural parameters in this problem need to be minimized, including the thickness of the shell (Ts), the thickness of the head (Th), inner radius (R), and the length of the cylindrical section without the head (L). The formulation of four optimization constraints can be described as follows:Considerx⟶=x1x2x3x4=TsThRL.Minimizefx⟶=0.6224x1x3x4+1.7781x2x32+3.1661x12x4+19.84x12x3, subject to(9)g1x⟶=−x1+0.0193x3≤0,g2x⟶=−x3+0.00954x3≤0,g3x⟶=−πx32x4−43πx33+1296000≤0,g4x⟶=x4−240≤0.Variable range(10)0≤x1≤99,0≤x2≤99,10≤x3≤200,10≤x4≤200.Figure 9
Pressure vessel design problem.From the results in Table10, it is obvious that RLTLBO can obtain superior optimal values compared to AO, SMA, WOA, GWO, MVO, GA, and ES [54].Table 10
Comparison results for the pressure vessel design problem.
AlgorithmOptimum variablesOptimum costTsThRLRLTLBO0.76989010.420109842.536830171.3489005926.77920AO [15]1.05400000.182806059.62190038.80500005949.22580SMA [50]0.79310000.393200040.671100196.2178005994.18570WOA [14]0.81250000.437500042.098270176.6389986059.74100GWO [13]0.81250000.434500042.089200176.7587006051.56390MVO [52]0.81250000.437500042.090738176.7386906060.80660GA [6]0.81250000.437500042.097398176.6540506059.94634ES [54]0.81250000.437500042.098087176.6405186059.74560


### 5.3. Tension/Compression Spring Design Problem

This problem aims to minimize the weight of the tension/compression spring (Figure10). Three variables need to be optimized, including the wire diameter (d), the number of active coils (N), and mean coil diameter (D). This problem can be described as follows:Considerx⟶=x1x2x3=dDN.Minimizefx⟶=x3+2x2x12,  subject to(11)g1x⟶=1−x23x371785x14≤0,g2x⟶=4x22−x1x212566x2x13−x14+15108x12≤0,g3x⟶=1−140.45x1x22x3≤0,g4x⟶=x1+x21.5−1≤0.Variable range(12)0.05≤x1≤2.00,0.25≤x2≤1.30,2.00≤x3≤15.00.Figure 10
Tension/compression spring design problem.The RLTLBO is compared to AO, SSA, WOA, GWO, PSO, GA, and HS algorithms. Results are listed in Table11 and show that the RLTLBO can obtain the best weight compared to all other algorithms.Table 11
Comparison results for the tension/compression spring design problem.
AlgorithmOptimum variablesOptimum weightdDNRLTLBO0.05511800.5059005.11670000.01093800AO [15]0.05024390.35262010.5425000.01116500SSA [12]0.05120700.34521512.0040320.01267630WOA [14]0.05120700.34521512.0040320.01267630GWO [13]0.05169000.35673711.2888500.01266600PSO [11]0.05172800.35764411.2445430.01267470GA [6]0.05148000.35166111.6322010.01270478HS [53]0.05115400.34987112.0764320.01267060


### 5.4. Speed Reducer Design Problem

In this case, the purpose is to minimize the weight of the speed reducer (Figure11). Seven variables are considered, including face width (x1), a module of teeth (x2), a discrete design variable on behalf of the teeth in the pinion (x3), length of the first shaft between bearings (x4), length of the second shaft between bearings (x5), diameters of the first shaft (x6), and diameters of the second shaft (x7). The mathematical formulation is listed as follows:Figure 11
Speed reducer design problem.Minimize(13)fx⟶=0.7854x1x22+3.3333x32+14.9334x3−43.0934−1.508x1x62+x72+7.4777x63+x73,subject to(14)g1x⟶=27x1x22x3−1≤0,g2x⟶=397.5x1x22x32−1≤0,g3x⟶=1.93x43x2x3x64−1≤0,g4x⟶=1.93x53x2x3x74−1≤0,g5x⟶=745x4/x2x32+16.9×106110.0x63−1≤0,g6x⟶=745x4/x2x32+157.5×10685.0x63−1≤0,g7x⟶=x2x340−1≤0,g8x⟶=5x2x1−1≤0,g9x⟶=x112x2−1≤0,g10x⟶=1.5x6+1.9x4−1≤0,g11x⟶=1.1x7+1.9x5−1≤0.Variable range(15)2.6≤x1≤3.6,0.7≤x2≤0.8,17≤x3≤28,7.3≤x4≤8.3,7.8≤x5≤8.3,2.9≤x6≤3.9,5.0≤x7≤5.5.Compared to AO, PSO, AOA, GA, SCA [55], HS, and FA [56], RLTLBO achieves better results in the speed reducer problem, as shown in Table 12.Table 12
Comparison results for the speed reducer design problem.
AlgorithmOptimum variablesOptimum weightx1x2x3x4x5x6x7RLTLBO3.4976000.700017.00007.300007.8000003.3500605.2855302995.43740AO [15]3.5021000.700017.00007.309907.7476003.3641005.2994003007.73280PSO [11]3.5001000.700017.00027.517707.7832003.3508005.2867003145.92200AOA [9]3.5038400.700017.00007.300007.7293303.3564905.2867002997.91570GA [6]3.5102530.700017.00008.350007.8000003.3622015.2877233067.56100SCA [55]3.5087550.700017.00007.300007.8000003.4610205.2892133030.56300HS [53]3.5201240.700017.00008.370007.8000003.3669705.2887193029.00200FA [56]3.5074950.700117.00007.7196748.0808543.3515125.2870513010.13749


### 5.5. Three-Bar Truss Design Problem

The three-bar truss design problem aims to minimize the weight of a truss with three bars by controlling the length of three bars (A1, A2, and A3) (Figure12). Three main constraints need to be satisfied, including deflection, stress, and buckling. The mathematical form of this problem is given:Considerx⟶=x1x2=A1A2.Minimizefx⟶=22x1+x2∗l  subject to(16)g1x⟶=2x1+x22x12+2x1x2P−σ≤0,g2x⟶=x22x12+2x1x2P−σ≤0,g3x⟶=12x2+x1P−σ≤0.Consider0≤x1,x2≤1, where l=100cm,P=2KN/cm2,σ=2KN/cm2.Figure 12
ThreE −bar truss design problem.The result of RLTLBO is listed in Table13, compared to AO, SSA, AOA, MVO, and GOA [57]. It can be observed that RLTLBO outperforms other algorithms in the literature.Table 13
Comparison results for the threE −bar truss design problem.
AlgorithmOptimum variablesOptimum weightx1x2RLTLBO0.7884200000000000.408110000000000263.852300000000AO [15]0.7926000000000000.396600000000000263.868400000000SSA [12]0.7886654100000000.408275784000000263.895840000000AOA [9]0.7936900000000000.394260000000000263.915400000000MVO [52]0.7886027600000000.408453070000000263.895849900000GOA [57]0.7888975555789730.407619570115153263.895881496069


### 5.6. Car Crashworthiness Design Problem

The car crashworthiness design problem aims to minimize the weight by optimizing eleven influence variables [58], including the thickness of B-Pillar inner (x1), B-pillar reinforcement (x2), floor side inner (x3), cross members (x4), door beam (x5), door beltline reinforcement (x6) and roof rail (x7), materials of B-Pillar inner (x8) and floor side inner (x9), barrier height (x10), and barrier hitting position (x11). This problem can be formulated as follows.Minimize(17)fx⟶=weight,subject to(18)g1x⟶=Faload in abdomen≤1kN,g2x⟶=V×Cudummy upper chest≤0.32m/s,g3x⟶=V×Cmdummy middle chest≤0.32m/s,g4x⟶=V×Cldummy lowere chest≤0.32m/s,g5x⟶=Δurupper rib deflection≤32mm,g6x⟶=Δmrmiddle rib deflection≤32mm,g7x⟶=Δlrlower rib deflection≤32mm,g8x⟶=Fpublic forcep≤4kN,g9x⟶=VMBPvelocityofV−pillaratmiddlepoint≤9.9mm/ms,g10x⟶=VFDvelocityoffrontdooratV−pillar≤15.7mm/ms..Variable range(19)0.5≤x1−x7≤1.5,x8,x9∈0.192,0.345,−30≤x10,x11≤30.The RLTLBO and DE, GA, FA, CS [59], GOA, and EOBL-GOA [58] are applied to solve the car crashworthiness problem. As shown in Table 14, compared to other methods, the proposed RLTLBO achieves the best result than others.Table 14
Comparison results for the car crashworthiness design problem.
AlgorithmRLTLBODE [7]GA [6]FA [55]CS [59]GOA [57]EOBL-GOA [58]x10.500000.500000.500050.500000.500000.500000.50000x21.116211.116701.280171.360001.116431.116701.11643x30.500000.500000.500010.500000.500000.500000.50000x41.302151.302081.033021.202001.302081.302081.30208x50.500000.500000.500010.500000.500000.500000.50000x61.500001.500000.500001.120001.500001.500001.50000x70.500000.500000.500000.500000.500000.500000.50000x80.345000.345000.349940.345000.345000.345000.34500x90.3328140.1920000.1920000.1920000.1920000.1920000.192000x10−19.58840−19.5493510.311908.87307−19.54935−19.54935−19.54935x110.019066−0.0043100.001670−18.998080−0.004310−0.004310−0.004310Optimal weight22.8424022.8429822.8565322.8429822.8429422.8447422.84294


### 5.7. Tubular Column Design Problem

The main intention is to find a minimum cost for a uniform column, making the tubular section be able to carry a compressive loadP = 2,500 kgf. The column is made of a material with a yield stress (σy) of 500 kgf/cm2, a modulus of elasticity (E) of 0.85 × 106 kgf/cm2, and a density (ρ) equal to 0.0025 kgf/cm3. The length (L) of the column is 250 cm. The cost of the column consists of material and construction costs. This problem is shown in Figure 13, and the optimization model of the problem is listed as follows.Figure 13
Tubular column design problem [59].Minimizefd,t=9.8dt+2d subject to(20)g1=Pπdtσy−1≤0,g2=8PL2π3Edtd2+t2−1≤0,g3=2.0d−1≤0,g4=d14−1≤0,g5=0.2t−1≤0,g6=t0.8−1≤0..From the comparison results in Table15, we can see that RLTLBO can obtain superior optimal cost compared to mGWO, DSCA, HOA, AO, HHO, and CS.Table 15
Comparison results for the tubular column design problem.
AlgorithmOptimum variablesOptimum costdtRLTLBO5.451200.2919626.53130mGWO5.450800.2920126.53270DSCA5.502500.2921426.79030HOA5.262600.3548728.86470AO5.463000.2965626.83540HHO5.443800.2931326.55820CS [59]5.451390.2919626.53217


### 5.8. Frequency-Modulated Sound Waves Design Problem

This problem aims to optimize the frequency-modulated (FM) synthesizer parameter in six dimensions [60]. The following equation is given for optimization X=a1,ω1,a2ω2,a3,ω3 as a sound wave, where ai (i = 1, 2, 3) is the amplitude and ωi (i = 1, 2, 3) is the angular frequency. This problem has the lowest value fX⟶sol=0. The objective function is calculated based on the square errors between the target wave and the estimated wave. This problem is modeled as follows.Minimize(21)fX⟶=∑t=0100yt−y0t2,where(22)yt=a1⋅sinω1⋅t⋅θ+a2⋅sinω2⋅t⋅θ+a3⋅sinω3⋅t⋅θ,y0t=1.0⋅sin5.0⋅t⋅θ−1.5⋅sin4.8⋅t⋅θ+2.0⋅sin4.9⋅t⋅θ,θ=2π100.The RLTLBO is compared with GWO, MFO [61], PSO, TSA [62], and FFA [63] algorithms, and the comparison results are listed in Table 16. It is obvious that the proposed method found a much better solution than the comparative algorithms.Table 16
Comparison results for the frequency-modulated sound waves design problem.
AlgorithmOptimum variablesOptimum costa1ω1a2ω2a3ω3RLTLBO−0.97498−5.0327−1.5640−4.7840−2.00604.90550.21738GWO [13]−0.66540−0.16841.5173−0.1287−4.1335−4.89978.47250MFO [61]0.614100.0432−4.32514.79230.83390.127811.89690PSO [11]−0.588605.0145−3.2779−4.9324−0.8562−0.147613.18070TSA [62]0.341504.78811.43090.11580.09750.548025.10520FFA [63]−0.562700.0525−3.47974.89301.1491−4.834517.42910In general, the excellent performance in solving industrial engineering design problems suggests that RLTLBO can be widely used in real-world optimization problems.


## 5.1. Welded Beam Design Problem

The purpose of this problem is to minimize the cost of the welded beam (Figure8). Four variables need to be optimized: the thickness of weld (h), the thickness of the bar (b), length of the bar (l), and height of the bar (t). The mathematical formulation is listed as follows:Considerz⟶=z1,z2,z3,z4=h,l,t,b.Minimizefz⟶=1.10471z12z2+0.04811z3z414.0+z2,  subject to(6)g1z⟶=τz⟶−τmax≤0,g2z⟶=σz⟶−σmax≤0,g3z⟶=δz⟶−δmax≤0,g4z⟶=z1−z4≤0,g5z⟶=P−Pcz⟶≤0,g6z⟶=0.125−z1≤0,g7z⟶=1.10471z12+0.04811z3z414.0+z2−5.0≤0.Variable range(7)0.1≤z1≤2,0.1≤z2≤10,0.1≤z3≤10,0.1≤z4≤2,where(8)τz⟶=τ′2+2τ′τ″z22R+τ″2,τ′=P2z1z2,τ″=MRJ,M=PL+z22,R=z224+z1+z322,J=22z1z2z2212+z1+z322,σz⟶=6PLz4z32,δz⟶=4PL3Ez33z4,Pcz⟶=4.013Ez32z46/36L21−z32LE4G,P=6000lb,L=14in,δmax=0.25in,E=30×106psi,G=12×106psi,τmax=13600psi,σmax=30000psi.Figure 8
Welded beam design problem.The RLTLBO is compared to SMA [50], WOA, MPA [51], MVO [52], GA, and HS [53] methods. The comparison results presented in Table 9 show the superior of the RLTLBO algorithm with a smaller cost than other algorithms.Table 9
Comparison results for the welded beam design problem.
AlgorithmOptimum variablesOptimum costhltbRLTLBO0.2057303.2530009.0366000.2057301.695200SMA [50]0.2054003.2589009.0384000.2058001.696040WOA [14]0.2053963.4842939.0374260.2062761.730499MPA [51]0.2057283.4705099.0366240.2057301.724853MVO [52]0.2054633.4731939.0445020.2056951.726450GA [6]0.2489006.1730008.1789000.2533002.430000HS [53]0.2442006.2231008.2915000.2400002.380700


## 5.2. Pressure Vessel Design Problem

The objective of this problem is to minimize the fabrication cost of the cylindrical pressure vessel to meet the pressure requirements. As shown in Figure9, four structural parameters in this problem need to be minimized, including the thickness of the shell (Ts), the thickness of the head (Th), inner radius (R), and the length of the cylindrical section without the head (L). The formulation of four optimization constraints can be described as follows:Considerx⟶=x1x2x3x4=TsThRL.Minimizefx⟶=0.6224x1x3x4+1.7781x2x32+3.1661x12x4+19.84x12x3, subject to(9)g1x⟶=−x1+0.0193x3≤0,g2x⟶=−x3+0.00954x3≤0,g3x⟶=−πx32x4−43πx33+1296000≤0,g4x⟶=x4−240≤0.Variable range(10)0≤x1≤99,0≤x2≤99,10≤x3≤200,10≤x4≤200.Figure 9
Pressure vessel design problem.From the results in Table10, it is obvious that RLTLBO can obtain superior optimal values compared to AO, SMA, WOA, GWO, MVO, GA, and ES [54].Table 10
Comparison results for the pressure vessel design problem.
AlgorithmOptimum variablesOptimum costTsThRLRLTLBO0.76989010.420109842.536830171.3489005926.77920AO [15]1.05400000.182806059.62190038.80500005949.22580SMA [50]0.79310000.393200040.671100196.2178005994.18570WOA [14]0.81250000.437500042.098270176.6389986059.74100GWO [13]0.81250000.434500042.089200176.7587006051.56390MVO [52]0.81250000.437500042.090738176.7386906060.80660GA [6]0.81250000.437500042.097398176.6540506059.94634ES [54]0.81250000.437500042.098087176.6405186059.74560


## 5.3. Tension/Compression Spring Design Problem

This problem aims to minimize the weight of the tension/compression spring (Figure10). Three variables need to be optimized, including the wire diameter (d), the number of active coils (N), and mean coil diameter (D). This problem can be described as follows:Considerx⟶=x1x2x3=dDN.Minimizefx⟶=x3+2x2x12,  subject to(11)g1x⟶=1−x23x371785x14≤0,g2x⟶=4x22−x1x212566x2x13−x14+15108x12≤0,g3x⟶=1−140.45x1x22x3≤0,g4x⟶=x1+x21.5−1≤0.Variable range(12)0.05≤x1≤2.00,0.25≤x2≤1.30,2.00≤x3≤15.00.Figure 10
Tension/compression spring design problem.The RLTLBO is compared to AO, SSA, WOA, GWO, PSO, GA, and HS algorithms. Results are listed in Table11 and show that the RLTLBO can obtain the best weight compared to all other algorithms.Table 11
Comparison results for the tension/compression spring design problem.
AlgorithmOptimum variablesOptimum weightdDNRLTLBO0.05511800.5059005.11670000.01093800AO [15]0.05024390.35262010.5425000.01116500SSA [12]0.05120700.34521512.0040320.01267630WOA [14]0.05120700.34521512.0040320.01267630GWO [13]0.05169000.35673711.2888500.01266600PSO [11]0.05172800.35764411.2445430.01267470GA [6]0.05148000.35166111.6322010.01270478HS [53]0.05115400.34987112.0764320.01267060


## 5.4. Speed Reducer Design Problem

In this case, the purpose is to minimize the weight of the speed reducer (Figure11). Seven variables are considered, including face width (x1), a module of teeth (x2), a discrete design variable on behalf of the teeth in the pinion (x3), length of the first shaft between bearings (x4), length of the second shaft between bearings (x5), diameters of the first shaft (x6), and diameters of the second shaft (x7). The mathematical formulation is listed as follows:Figure 11
Speed reducer design problem.Minimize(13)fx⟶=0.7854x1x22+3.3333x32+14.9334x3−43.0934−1.508x1x62+x72+7.4777x63+x73,subject to(14)g1x⟶=27x1x22x3−1≤0,g2x⟶=397.5x1x22x32−1≤0,g3x⟶=1.93x43x2x3x64−1≤0,g4x⟶=1.93x53x2x3x74−1≤0,g5x⟶=745x4/x2x32+16.9×106110.0x63−1≤0,g6x⟶=745x4/x2x32+157.5×10685.0x63−1≤0,g7x⟶=x2x340−1≤0,g8x⟶=5x2x1−1≤0,g9x⟶=x112x2−1≤0,g10x⟶=1.5x6+1.9x4−1≤0,g11x⟶=1.1x7+1.9x5−1≤0.Variable range(15)2.6≤x1≤3.6,0.7≤x2≤0.8,17≤x3≤28,7.3≤x4≤8.3,7.8≤x5≤8.3,2.9≤x6≤3.9,5.0≤x7≤5.5.Compared to AO, PSO, AOA, GA, SCA [55], HS, and FA [56], RLTLBO achieves better results in the speed reducer problem, as shown in Table 12.Table 12
Comparison results for the speed reducer design problem.
AlgorithmOptimum variablesOptimum weightx1x2x3x4x5x6x7RLTLBO3.4976000.700017.00007.300007.8000003.3500605.2855302995.43740AO [15]3.5021000.700017.00007.309907.7476003.3641005.2994003007.73280PSO [11]3.5001000.700017.00027.517707.7832003.3508005.2867003145.92200AOA [9]3.5038400.700017.00007.300007.7293303.3564905.2867002997.91570GA [6]3.5102530.700017.00008.350007.8000003.3622015.2877233067.56100SCA [55]3.5087550.700017.00007.300007.8000003.4610205.2892133030.56300HS [53]3.5201240.700017.00008.370007.8000003.3669705.2887193029.00200FA [56]3.5074950.700117.00007.7196748.0808543.3515125.2870513010.13749


## 5.5. Three-Bar Truss Design Problem

The three-bar truss design problem aims to minimize the weight of a truss with three bars by controlling the length of three bars (A1, A2, and A3) (Figure12). Three main constraints need to be satisfied, including deflection, stress, and buckling. The mathematical form of this problem is given:Considerx⟶=x1x2=A1A2.Minimizefx⟶=22x1+x2∗l  subject to(16)g1x⟶=2x1+x22x12+2x1x2P−σ≤0,g2x⟶=x22x12+2x1x2P−σ≤0,g3x⟶=12x2+x1P−σ≤0.Consider0≤x1,x2≤1, where l=100cm,P=2KN/cm2,σ=2KN/cm2.Figure 12
ThreE −bar truss design problem.The result of RLTLBO is listed in Table13, compared to AO, SSA, AOA, MVO, and GOA [57]. It can be observed that RLTLBO outperforms other algorithms in the literature.Table 13
Comparison results for the threE −bar truss design problem.
AlgorithmOptimum variablesOptimum weightx1x2RLTLBO0.7884200000000000.408110000000000263.852300000000AO [15]0.7926000000000000.396600000000000263.868400000000SSA [12]0.7886654100000000.408275784000000263.895840000000AOA [9]0.7936900000000000.394260000000000263.915400000000MVO [52]0.7886027600000000.408453070000000263.895849900000GOA [57]0.7888975555789730.407619570115153263.895881496069


## 5.6. Car Crashworthiness Design Problem

The car crashworthiness design problem aims to minimize the weight by optimizing eleven influence variables [58], including the thickness of B-Pillar inner (x1), B-pillar reinforcement (x2), floor side inner (x3), cross members (x4), door beam (x5), door beltline reinforcement (x6) and roof rail (x7), materials of B-Pillar inner (x8) and floor side inner (x9), barrier height (x10), and barrier hitting position (x11). This problem can be formulated as follows.Minimize(17)fx⟶=weight,subject to(18)g1x⟶=Faload in abdomen≤1kN,g2x⟶=V×Cudummy upper chest≤0.32m/s,g3x⟶=V×Cmdummy middle chest≤0.32m/s,g4x⟶=V×Cldummy lowere chest≤0.32m/s,g5x⟶=Δurupper rib deflection≤32mm,g6x⟶=Δmrmiddle rib deflection≤32mm,g7x⟶=Δlrlower rib deflection≤32mm,g8x⟶=Fpublic forcep≤4kN,g9x⟶=VMBPvelocityofV−pillaratmiddlepoint≤9.9mm/ms,g10x⟶=VFDvelocityoffrontdooratV−pillar≤15.7mm/ms..Variable range(19)0.5≤x1−x7≤1.5,x8,x9∈0.192,0.345,−30≤x10,x11≤30.The RLTLBO and DE, GA, FA, CS [59], GOA, and EOBL-GOA [58] are applied to solve the car crashworthiness problem. As shown in Table 14, compared to other methods, the proposed RLTLBO achieves the best result than others.Table 14
Comparison results for the car crashworthiness design problem.
AlgorithmRLTLBODE [7]GA [6]FA [55]CS [59]GOA [57]EOBL-GOA [58]x10.500000.500000.500050.500000.500000.500000.50000x21.116211.116701.280171.360001.116431.116701.11643x30.500000.500000.500010.500000.500000.500000.50000x41.302151.302081.033021.202001.302081.302081.30208x50.500000.500000.500010.500000.500000.500000.50000x61.500001.500000.500001.120001.500001.500001.50000x70.500000.500000.500000.500000.500000.500000.50000x80.345000.345000.349940.345000.345000.345000.34500x90.3328140.1920000.1920000.1920000.1920000.1920000.192000x10−19.58840−19.5493510.311908.87307−19.54935−19.54935−19.54935x110.019066−0.0043100.001670−18.998080−0.004310−0.004310−0.004310Optimal weight22.8424022.8429822.8565322.8429822.8429422.8447422.84294


## 5.7. Tubular Column Design Problem

The main intention is to find a minimum cost for a uniform column, making the tubular section be able to carry a compressive loadP = 2,500 kgf. The column is made of a material with a yield stress (σy) of 500 kgf/cm2, a modulus of elasticity (E) of 0.85 × 106 kgf/cm2, and a density (ρ) equal to 0.0025 kgf/cm3. The length (L) of the column is 250 cm. The cost of the column consists of material and construction costs. This problem is shown in Figure 13, and the optimization model of the problem is listed as follows.Figure 13
Tubular column design problem [59].Minimizefd,t=9.8dt+2d subject to(20)g1=Pπdtσy−1≤0,g2=8PL2π3Edtd2+t2−1≤0,g3=2.0d−1≤0,g4=d14−1≤0,g5=0.2t−1≤0,g6=t0.8−1≤0..From the comparison results in Table15, we can see that RLTLBO can obtain superior optimal cost compared to mGWO, DSCA, HOA, AO, HHO, and CS.Table 15
Comparison results for the tubular column design problem.
AlgorithmOptimum variablesOptimum costdtRLTLBO5.451200.2919626.53130mGWO5.450800.2920126.53270DSCA5.502500.2921426.79030HOA5.262600.3548728.86470AO5.463000.2965626.83540HHO5.443800.2931326.55820CS [59]5.451390.2919626.53217


## 5.8. Frequency-Modulated Sound Waves Design Problem

This problem aims to optimize the frequency-modulated (FM) synthesizer parameter in six dimensions [60]. The following equation is given for optimization X=a1,ω1,a2ω2,a3,ω3 as a sound wave, where ai (i = 1, 2, 3) is the amplitude and ωi (i = 1, 2, 3) is the angular frequency. This problem has the lowest value fX⟶sol=0. The objective function is calculated based on the square errors between the target wave and the estimated wave. This problem is modeled as follows.Minimize(21)fX⟶=∑t=0100yt−y0t2,where(22)yt=a1⋅sinω1⋅t⋅θ+a2⋅sinω2⋅t⋅θ+a3⋅sinω3⋅t⋅θ,y0t=1.0⋅sin5.0⋅t⋅θ−1.5⋅sin4.8⋅t⋅θ+2.0⋅sin4.9⋅t⋅θ,θ=2π100.The RLTLBO is compared with GWO, MFO [61], PSO, TSA [62], and FFA [63] algorithms, and the comparison results are listed in Table 16. It is obvious that the proposed method found a much better solution than the comparative algorithms.Table 16
Comparison results for the frequency-modulated sound waves design problem.
AlgorithmOptimum variablesOptimum costa1ω1a2ω2a3ω3RLTLBO−0.97498−5.0327−1.5640−4.7840−2.00604.90550.21738GWO [13]−0.66540−0.16841.5173−0.1287−4.1335−4.89978.47250MFO [61]0.614100.0432−4.32514.79230.83390.127811.89690PSO [11]−0.588605.0145−3.2779−4.9324−0.8562−0.147613.18070TSA [62]0.341504.78811.43090.11580.09750.548025.10520FFA [63]−0.562700.0525−3.47974.89301.1491−4.834517.42910In general, the excellent performance in solving industrial engineering design problems suggests that RLTLBO can be widely used in real-world optimization problems.


## 6. Conclusion

This study presents an improved teaching-learning-based optimization algorithm (RLTLBO) by incorporating reinforcement learning (RL) and random opposition-based learning (ROBL) strategies. Because of the defect of the insufficient learning processes, a new learning model is proposed in the learner phase. The two different modes uniting the inherent learning mode are switched through the Q-learning mechanism in RL. This mechanism helps the individuals learn thoroughly, resulting in accelerating the convergence speed of the RLTLBO. To improve the ability of local optima avoidance, the ROBL strategy is appended after the teacher and learner phases. The proposed RLTLBO algorithm is tested using 23 standard and eight CEC2017 benchmark functions to analyze its search performance. Experimental results illustrate competitive results compared to other state-of-the-art meta-heuristic algorithms. To further verify the superiority of RLTLBO, eight industrial engineering design problems are solved. The results are also very competitive with other comparative algorithms.The code for RLTLBO is provided athttps://github.com/WangShuang92/RLTLBO and can be used for more practical problems. However, this algorithm still suffers with premature convergence on several benchmark functions, which can be studied in the future. Moreover, RLTLBO can only solve single objective problems. For future research, binary and multiobjective versions of RLTLBO can be considered. More applications of this algorithm in different fields are valuable works, including text clustering, scheduling problems, appliances management, parameter estimation, feature selection, test classification, image segmentation problems, network applications, sentiment analysis, etc.



---

*Source: 1535957-2022-03-24.xml*