Search

This paper proposes a self-adaptive teaching-learning-based optimization with reusing successful learning experience (RSTLBO) to accurately and reliably extract parameters of different photovoltaic (PV) models. The key novelties of RSTLBO are: 1) Learners adaptively choose teacher or learner phase based on a selection probability according to their performance, balancing exploration and exploitation; 2) Successful learner experiences are reused to enhance search capability. Experiments on single diode, double diode and PV panel models demonstrate that RSTLBO achieves higher accuracy and faster convergence than state-of-the-art methods like P-DE, TLBO, GOTLBO, etc. Specifically, RSTLBO obtains the minimum RMSE across all models, outperforms compared methods in statistical results, and exhibits fastest convergence in almost all cases. The self-adaptive probability selection and experience reuse make RSTLBO effective for PV parameter extraction.

When using point cloud technology to measure the dimension and geometric error of aircraft landing gear components, the point cloud data obtained after scanning may have certain differences because of the sophistication and diversity of the components that make up the landing gear. However, when using traditional point cloud registration algorithms, if the initial pose between point clouds is poor, it can lead to significant errors in the final registration results or even registration failure. Furthermore, the significant difference in registration results between point clouds can affect the final measurement results. Adopting Teaching-Learning-Based Optimization (TLBO) to solve some optimization problems has unique advantages such as high accuracy and good stability. This study integrates TLBO with point cloud registration. To increase the probability of using TLBO for point cloud registration to search for the global optimal solution, adaptive learning weights are first introduced during the learner phase of the basic TLBO. Secondly, an additional tutoring phase has been designed based on the symmetry and unimodality of the normal distribution to improve the accuracy of the solution results. In order to evaluate the performance of the proposed algorithm, it was first used to solve the CEC2017 test function. The comparison results with other metaheuristics showed that the improved TLBO has excellent comprehensive performance. Then, registration experiments were conducted using the open point cloud dataset and the landing gear point cloud dataset, respectively. The registration results showed that the point cloud registration method proposed in this paper has strong competitiveness. [ABSTRACT FROM AUTHOR]

This article introduces an innovative method for optimizing smart manufacturing system (SMS) by combining digital twin technology (DTT) with teaching–learning-based optimization (TBLO). It creates a simulated model of the physical manufacturing environment, enabling real-time monitoring, simulation and analysis. By leveraging the TLBO algorithm, the system enhances the decision-making process for complex manufacturing tasks, facilitating continuous improvement and adaptation to dynamic production demands. The proposed framework aims to minimize production costs, reduce downtime and improve overall efficiency by optimizing key parameters such as resource allocation, production scheduling and machine performance. Experimental results demonstrate that the DT-TLBO approach can reduce production costs by up to 20%, decrease downtime by 30% and improve overall system efficiency by 25%. This innovative combination of advanced technologies offers a promising solution for modern manufacturing challenges, paving the way for smarter, more responsive production environments.

Green Human Resource Management (GHRM) state a determination of the association using crossing points of employees to stimulate environment performance activity, increase the employee awareness and sustainable activities, consequently, increasing the employee awareness towards environmental challenges. The hotel industry is developing quickly in emerging nations owing to an upsurge in the tourism business; but, conversely, the hotel industry is mainly growing the problem of the environment. As a result, owing to the enormous amount of conservation problems that hotel business has faced, there is a growing potency to pay an accurate response to environmental problems and performing sustainable industry performance like the adoption of GHRM practice provides a win-win situation for its stakeholders and the organization. Accordingly, it indicates the requirement to scrutinize how GHRM performs will augment the environment in the hotel business. This manuscript models the design of GHRM using Pythagorean Neutrosophic Bonferroni Mean (GHRM-PNBM) approach. The presented GHRM-PNBM method objectives are to evaluate the limitation of hotel GRHM. Moreover, the presented technique constructs an expert system analysis technique for assessing the performance of hotel GHRM. Adaptive optimization of hotel GHRM assessment can be done using the PNBM technique, and the parameter selection method can be done using Quasi-Oppositional-Teaching-Learning-Based Optimization (QTLBO) method. The empirical analysis reports that the performance calculation of hotel GHRM has good confidence level and high accuracy. [ABSTRACT FROM AUTHOR]

The complexity of equivalent circuit models of photovoltaic cells and modules poses a difficult task to the parameter extraction methods. Teaching-learning-based optimization (TLBO) is a potent metaheuristic-based parameter extraction method, but it suffers from insufficient precision and low dependability. This study presented a multi-source guided TLBO through improving its two optimization phases. A multi-source guided approach with one-to-one and step-by-step teaching strategies was designed to guide different learners in the teacher phase. Besides, different strategies based on multiple learners were introduced for learners with different knowledge reserves to strengthen information exchanging. With the improvements, it is advantageous to lessen the likelihood of hitting a local optimum and thereby the global convergence can be accelerated. The resultant method was verified on single diode model, double diode model, and three additional modules. The findings demonstrate that it obtained better solutions in precision and dependability, and stood out from the crowd of algorithms.

This paper presents a novel variant of the teaching–learning-based optimization algorithm, termed BLTLBO, which draws inspiration from the blended learning model, specifically designed to tackle high-dimensional multimodal complex optimization problems. Firstly, the perturbation conditions in the "teaching" and "learning" stages of the original TLBO algorithm are interpreted geometrically, based on which the search capability of the TLBO is enhanced by adjusting the range of values of random numbers. Second, a strategic restructuring has been ingeniously implemented, dividing the algorithm into three distinct phases: pre-course self-study, classroom blended learning, and post-course consolidation; this structural reorganization and the random crossover strategy in the self-learning phase effectively enhance the global optimization capability of TLBO. To evaluate its performance, the BLTLBO algorithm was tested alongside seven distinguished variants of the TLBO algorithm on thirteen multimodal functions from the CEC2014 suite. Furthermore, two excellent high-dimensional optimization algorithms were added to the comparison algorithm and tested in high-dimensional mode on five scalable multimodal functions from the CEC2008 suite. The empirical results illustrate the BLTLBO algorithm's superior efficacy in handling high-dimensional multimodal challenges. Finally, a high-dimensional portfolio optimization problem was successfully addressed using the BLTLBO algorithm, thereby validating the practicality and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Bottleneck stage and reentrance often exist in real-life manufacturing processes; however, the previous research rarely addresses these two processing conditions in a scheduling problem. In this study, a reentrant hybrid flow shop scheduling problem(RHFSP) with a bottleneck stage is considered, and an elite-class teaching-learning-based optimization (ETLBO) algorithm is proposed to minimize maximum completion time. To produce high-quality solutions, teachers are divided into formal ones and substitute ones, and multiple classes are formed. The teacher phase is composed of teacher competition and teacher teaching. The learner phase is replaced with a reinforcement search of the elite class. Adaptive adjustment on teachers and classes is established based on class quality, which is determined by the number of elite solutions in class. Numerous experimental results demonstrate the effectiveness of new strategies, and ETLBO has a significant advantage in solving the considered RHFSP. [ABSTRACT FROM AUTHOR]

Energy-efficient scheduling problems with additional resources are seldom studied in hybrid flow shops. In this study, an energy-efficient hybrid flow shop scheduling problem (EHFSP) with additional resources is studied in which there is asymmetry in the machine. An adaptive two-class teaching-learning-based optimization (ATLBO) which has multiple teachers is proposed to simultaneously minimize the makespan and the total energy consumption. After two classes are formed, a teacher phase is first executed, which consists of teacher self-learning and teacher training. Then, an adaptive learner phase is presented, in which the quality of two classes is used to adaptively decide the learner phase or the reinforcement search of the temporary solution set. An adaptive formation of classes is also given. Extensive experiments were conducted and the computational results show that the new strategies are effective and that ATLBO was able to provide better results than comparative algorithms reported in the literature in at least 54 of 68 instances. [ABSTRACT FROM AUTHOR]

Reconfiguring distribution networks involves modifying their topological structure by managing switch states. This process is crucial in smart grids, as it can isolate faults, minimize power loss, and enhance system stability. However, in existing research, the reconfiguration task is often treated as a problem of either single- or multi-objective optimization and frequently overlooks the issue's multimodality. As a result, the solutions derived may be inadequate or unfeasible when facing environmental changes. In this study, the objective function of minimizing power loss considers the case of faults in the distribution grid. Coordinating the initial population division of the Genetic Algorithm (GA) with the Particle Swarm Optimization (PSO) and the Teaching and Learning-Based Optimization (TLBO) algorithms accelerates the process of finding the optimal solution, resulting in faster and more reliable results. The proposed method was tested on the IEEE-33 bus test system and was compared with other methods, demonstrating reliable results and superior efficiency. [ABSTRACT FROM AUTHOR]

Production scheduling is a critical factor to enhancing productivity in manufacturing engineering and combinatorial optimization research. The complexity and dynamic nature of production systems necessitates innovative solutions. The Job Shop Flexible Programming Problem (FJSP) provides a realistic environment for production, where processing times are variable and uncertain, and multiple objectives need optimization. To solve the Multi-Objective Flexible Fuzzy Job Shop problem with partial flexibility (P-MOFfJSP), this paper proposes a hybrid metaheuristic approach that combines the Teaching–Learning-based Optimization (TLBO) algorithm with a Genetic Algorithm. The proposed algorithm of Adaptive TLBO (TLBO-A) uses two genetic operators (mutation and crossover) with an adaptive population reconfiguration strategy, ensuring solution space exploration and preventing premature convergence. We have evaluated the TLBO-A algorithm's performance on benchmark instances commonly used in programming problems with fuzzy variables. The experimental analysis indicates significant results, demonstrating that the adaptive strategy improves the search for suitable solutions. The proposed algorithm (TLBO-A) exhibits low variations (around 11%) compared to the best mono-objective heuristic for the fuzzy makespan problem, indicating its robustness. Moreover, compared with other heuristics like traditional TLBO, the variations decrease to around 1%. However, TLBO-A stands out as it aims to solve a multi-objective problem, improving the fuzzy makespan, and identifying good results on the Pareto frontier for the fuzzy average flow time, all within this low variation margin. Our contribution addresses the challenges of production scheduling in fuzzy time environments and proposes a practical hybrid metaheuristic approach. The TLBO-A algorithm shows promising results in solving the P-MOFfJSP, highlighting the potential of our proposed methodology for solving real-world production scheduling problems. [ABSTRACT FROM AUTHOR]

As we enter the new age of the Internet of Things (IoT) and wearable gadgets, sensors, and embedded devices are extensively used for data aggregation and its transmission. The extent of the data processed by IoT networks makes it vulnerable to outside attacks. Therefore, it is important to design an intrusion detection system (IDS) that ensures the security, integrity, and confidentiality of IoT networks and their data. State-of-the-art IDSs have poor detection capabilities and incur high communication and device overhead, which is not ideal for IoT applications requiring secured and real-time processing. This research presents a teaching-learning-based optimization enabled intrusion detection system (TLBO-IDS) which effectively protects IoT networks from intrusion attacks and also ensures low overhead at the same time. The proposed TLBO-IDS can detect analysis attacks, fuzzing attacks, shellcode attacks, worms, denial of service (Dos) attacks, exploits, and backdoor intrusion attacks. TLBO-IDS is extensively tested and its performance is compared with state-of-the-art algorithms. In particular, TLBO-IDS outperforms the bat algorithm and genetic algorithm (GA) by 22.2% and 40% respectively. [ABSTRACT FROM AUTHOR]

This research paper develops a novel hybrid approach, called hybrid particle swarm optimization–teaching–learning-based optimization (hPSO-TLBO), by combining two metaheuristic algorithms to solve optimization problems. The main idea in hPSO-TLBO design is to integrate the exploitation ability of PSO with the exploration ability of TLBO. The meaning of "exploitation capabilities of PSO" is the ability of PSO to manage local search with the aim of obtaining possible better solutions near the obtained solutions and promising areas of the problem-solving space. Also, "exploration abilities of TLBO" means the ability of TLBO to manage the global search with the aim of preventing the algorithm from getting stuck in inappropriate local optima. hPSO-TLBO design methodology is such that in the first step, the teacher phase in TLBO is combined with the speed equation in PSO. Then, in the second step, the learning phase of TLBO is improved based on each student learning from a selected better student that has a better value for the objective function against the corresponding student. The algorithm is presented in detail, accompanied by a comprehensive mathematical model. A group of benchmarks is used to evaluate the effectiveness of hPSO-TLBO, covering various types such as unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. In addition, CEC 2017 benchmark problems are also utilized for evaluation purposes. The optimization results clearly demonstrate that hPSO-TLBO performs remarkably well in addressing the benchmark functions. It exhibits a remarkable ability to explore and exploit the search space while maintaining a balanced approach throughout the optimization process. Furthermore, a comparative analysis is conducted to evaluate the performance of hPSO-TLBO against twelve widely recognized metaheuristic algorithms. The evaluation of the experimental findings illustrates that hPSO-TLBO consistently outperforms the competing algorithms across various benchmark functions, showcasing its superior performance. The successful deployment of hPSO-TLBO in addressing four engineering challenges highlights its effectiveness in tackling real-world applications. [ABSTRACT FROM AUTHOR]

An important index to evaluate the rock drilling ability in mines, tunnel drilling and underground drilling is the drilling rate index (DRI). Due to the complexity and nonlinearity of mechanical and physical properties of rocks, there are many uncertainties in DRI evaluation. For this reason, teaching–learning-based optimization (TLBO) and gray wolf optimization (GWO) have been used to consider uncertainties and establish a precise nonlinear relationship in the estimation of the DRI. In this study, 32 different rock types included metamorphic, igneous and sedimentary rocks were investigated in the laboratory to investigate the relationships between the DRI and input parameters. The modeling results show that the relationships determined for estimating the DRI by TLBO and GWO algorithms are accurate and close to the real value. It can also be concluded that the use of optimization algorithms to predict the DRI is very efficient. [ABSTRACT FROM AUTHOR]

This article introduces an innovative method for optimizing smart manufacturing system (SMS) by combining digital twin technology (DTT) with teaching–learning-based optimization (TBLO). It creates a simulated model of the physical manufacturing environment, enabling real-time monitoring, simulation and analysis. By leveraging the TLBO algorithm, the system enhances the decision-making process for complex manufacturing tasks, facilitating continuous improvement and adaptation to dynamic production demands. The proposed framework aims to minimize production costs, reduce downtime and improve overall efficiency by optimizing key parameters such as resource allocation, production scheduling and machine performance. Experimental results demonstrate that the DT-TLBO approach can reduce production costs by up to 20%, decrease downtime by 30% and improve overall system efficiency by 25%. This innovative combination of advanced technologies offers a promising solution for modern manufacturing challenges, paving the way for smarter, more responsive production environments. [ABSTRACT FROM AUTHOR]

The basic salp swarm algorithm (SSA) is a novel nature-inspired swarm intelligence optimization algorithm based on the foraging behavior of salp individuals in the deep sea. Since its development, the salp swarm algorithm has attracted widespread interest from scholars both at home and abroad for solving complex real-world practical problems. With continuous research, the SSA algorithm has revealed some shortcomings such as slow convergence speed and low accuracy. To enhance the optimization capability of the algorithm, in this paper, we propose an improved hybrid algorithm called TLSSA based on two phases of the teaching–learning-based optimization method: the teaching phase and the learner phase. In the teaching phase, students' ability is improved by updating the difference between the teacher and the class average level, which helps to improve the overall learning ability of the salp population, resulting in higher quality solutions. In the learning phase, by simulating the discussion, statement, and communication between students, the average level of the individual is improved, and the global search speed of the algorithm is accelerated. To verify the effectiveness and competitiveness of the proposed method, it is first tested on 30 IEEE CEC 2017 benchmark functions. The test results demonstrate that the proposed TLSSA method obtains better overall performance compared to 8 mainstream meta-heuristics and 8 advanced algorithms. After that, we applied the proposed method to solve two classical real-world engineering design problems and feature selection. Again, the experimental results show that our method has significant advantages over the traditional methods in solving these practical problems. The remarkable performance of our proposed improved TLSSA algorithm in solving theoretical and practical complex optimization problems also provides potential possibilities for applying more intelligent optimization algorithms to solve complex optimization problems in real-life situations in the future. [ABSTRACT FROM AUTHOR]

Solving nonlinear equation systems (NESs) requires locating different roots in one run. To effectively deal with NESs, a multi-population cooperative teaching–learning-based optimization, named MCTLBO, is presented. The innovations of MCTLBO are as follows: (i) two niching technique (crowding and improved speciation) are integrated into the algorithm to enhance population diversity; (ii) an adaptive selection scheme is proposed to select the learning rules in the teaching phase; (iii) the new learning rules based on experience learning are developed to promote the search efficiency in the teaching and learning phases. MCTLBO was tested on 30 classical problems and the experimental results show that MCTLBO has better root finding performance than other algorithms. In addition, MCTLBO achieves competitive results in eighteen new test sets. [ABSTRACT FROM AUTHOR]

Based on the no-free-lunch theorem, researchers have been proposing optimization algorithms for solving complex engineering problems. This paper analyzes the performance of five metaheuristics: Equilibrium Optimizer (EO), Particle Swarm Optimization (PSO), Teaching-Learning-Based Optimization (TLBO), Differential Evolution (DE), and Genetic Algorithm (GA) in fine-tuning the gains of a Proportional-Integral-Derivative (PID) to control the speed of a DC motor. The selected metaheuristics, in addition to being from distinct classes, are well established in their respective groups. The methods and findings of this study can be summarized in three phases. First, the mathematical model of the DC motor is deduced. Second, detailed descriptions of the aforementioned algorithms are presented. Furthermore, the structures of the applied controllers are discussed. Third, comparisons based on statistical indicators and analyses in the time and frequency domains, in addition to robustness and load disturbance tests, are performed. The results revealed that if a sufficient number of runs is given for each metaheuristic, despite being in different runs, all algorithms are able to propose the same optimal gain values. TLBO presented the highest speed, while GA and DE were the slowest in finding optimal values. Additionally, the results were compared with the Opposition-Based Learning Henry Gas Solubility Optimization (OBL/HBO)-based PID, reported to have better results than some previously published works on this topic, and a Fuzzy Logic Controller (FLC). The five optimized controllers obtained approximately the same results and outperformed the OBL/HGO-based PID, but the FLC was superior compared to the metaheuristic-based PIDs.

This study introduces ETLBOCBL-CNN, an automated approach for optimizing convolutional neural network (CNN) architectures to address classification tasks of varying complexities. ETLBOCBL-CNN employs an effective encoding scheme to optimize network and learning hyperparameters, enabling the discovery of innovative CNN structures. To enhance the search process, it incorporates a competency-based learning concept inspired by mixed-ability classrooms during the teacher phase. This categorizes learners into competency-based groups, guiding each learner's search process by utilizing the knowledge of the predominant peers, the teacher solution, and the population mean. This approach fosters diversity within the population and promotes the discovery of innovative network architectures. During the learner phase, ETLBOCBL-CNN integrates a stochastic peer interaction scheme that encourages collaborative learning among learners, enhancing the optimization of CNN architectures. To preserve valuable network information and promote long-term population quality improvement, ETLBOCBL-CNN introduces a tri-criterion selection scheme that considers fitness, diversity, and learners' improvement rates. The performance of ETLBOCBL-CNN is evaluated on nine different image datasets and compared to state-of-the-art methods. Notably, ELTLBOCBL-CNN achieves outstanding accuracies on various datasets, including MNIST (99.72%), MNIST-RD (96.67%), MNIST-RB (98.28%), MNIST-BI (97.22%), MNST-RD + BI (83.45%), Rectangles (99.99%), Rectangles-I (97.41%), Convex (98.35%), and MNIST-Fashion (93.70%). These results highlight the remarkable classification accuracy of ETLBOCBL-CNN, underscoring its potential for advancing smart device infrastructure development. [ABSTRACT FROM AUTHOR]

Particle swarm optimization is a popular meta-heuristic with highly explorative features; however, in its standard form it suffers from a poor convergence rate and weak search refinement on multi-dimensional problems. The present work improves the conventional particle swarm optimizer in three ways: adding a greedy selection for better intensification; embedding an extra movement borrowed from teacher–learner-based optimization; and utilizing a neighborhood strategy by averaging over a random half of the swarm. The performance of the proposed method is subsequently evaluated on three sets of problems. The first set includes uni-modal, multi-model, separable and non-separable test functions. The proposed method is compared with a standard particle swarm optimizer and its variants as well as other meta-heuristic algorithms. Engineering benchmark problems including the optimal design of a tubular column, a coiled spring, a pressure vessel and a cantilever beam constitute the second set. The third set includes constrained sizing design of a 120-bar dome truss and the optimal shape design of the Morrow Point double-arch concrete dam as a practical case study. Numerical results reveal considerable enhancement of the standard particle swarm via the proposed method to exhibit competitive performance with the other studied meta-heuristics. In the optimal design of Morrow Point Dam, the proposed method resulted in a material consumption 21 times smaller than the best of the initial population and 26% better than a recommended practical design. [ABSTRACT FROM AUTHOR]

Convolutional neural networks (CNNs) have excelled in artificial intelligence, particularly in image-related tasks such as classification and object recognition. However, manually designing CNN architectures demands significant domain expertise and involves time-consuming trial-and-error processes, along with substantial computational resources. To overcome this challenge, an automated network design method known as Modified Teaching-Learning-Based Optimization with Refined Knowledge Sharing (MTLBORKS-CNN) is introduced. It autonomously searches for optimal CNN architectures, achieving high classification performance on specific datasets without human intervention. MTLBORKS-CNN incorporates four key features. It employs an effective encoding scheme for various network hyperparameters, facilitating the search for innovative and valid network architectures. During the modified teacher phase, it leverages a social learning concept to calculate unique exemplars that effectively guide learners while preserving diversity. In the modified learner phase, self-learning and adaptive peer learning are incorporated to enhance knowledge acquisition of learners during CNN architecture optimization. Finally, MTLBORKS-CNN employs a dual-criterion selection scheme, considering both fitness and diversity, to determine the survival of learners in subsequent generations. MTLBORKS-CNN is rigorously evaluated across nine image datasets and compared with state-of-the-art methods. The results consistently demonstrate MTLBORKS-CNN's superiority in terms of classification accuracy and network complexity, suggesting its potential for infrastructural development of smart devices. [ABSTRACT FROM AUTHOR]

The wind power generation system plays a significant role in the power sector as it is an environment-friendly green power system, increasing power demand, and technological development in wind power systems. Wind turbine systems are exposed to the harsh environment with continuous variation of wind speed with gusts causing damage and failure in system components along with the fluctuation of generated power. The hydrostatic transmission system has become one of the promising solutions over the gear transmission system for transmitting power from the turbine rotor to the generator. Further to reduce power generation costs in wind power systems, a suitable control system with parametric uncertainty and system fault plays a significant role. In this study, the 5 MW wind turbine model has been developed with the combination of blade element momentum theory and the electrohydraulic transmission system model. Moreover, the wind turbine system model has been imposed fault in the pump of electrohydraulic transmission system. The proposed wind turbine system model has been validated with the existing result. The blade element momentum theory has been used to estimate the optimum pump turbine couple rotational speed for maximum power tracking. Double loop controller has been used for wind turbine power transmission system control. The first controller loop has been used for pump and wind turbine system speed control for maximum power tracking, as a passive fault tolerance controller and the second control loop for motor and generator system speed control to regulate the frequency of the generated power. Interval type 2-fuzzy proportional–integral–derivative controller are suitable for high degree of uncertain system like wind power system due to their footprint of uncertainties. Proper choice of footprint of uncertainty provides robust performance against uncertainties and dynamic performance. Hence, the primary and secondary controller has been developed as interval type 2-fuzzy proportional–integral–derivative with inertial weight local search–based teaching–learning-based optimization controller. The inertial weight local search–based teaching–learning-based optimization interval type 2-fuzzy proportional–integral–derivative controller performance has been studied with benchmark sinusoidal test signals. The proposed inertial weight local search–based teaching–learning-based optimization interval type 2-fuzzy proportional–integral–derivative controller performance has been also compared with conventional proportional–integral–derivative and interval type 2-fuzzy proportional–integral–derivative controller. The proposed system performance has been compared with contemporary reported digital hydrostatic transmission wind turbine system and recently reported controller with consideration of fault in the pump. The proposed inertial weight local search–based teaching–learning-based optimization interval type 2-fuzzy proportional–integral–derivative controller performance has been compared through integral absolute error with interval type 2-fuzzy proportional–integral–derivative controller and recently reported proportional–integral–derivative sliding mode controller obtained as 0.0016, 0.0029, and 0.0031, respectively. [ABSTRACT FROM AUTHOR]

Temperature rise of the hub motor in distributed drive electric vehicles (DDEVs) under long-time and overload operating conditions brings parameter drift and degrades the performance of the motor. A novel online parameter identification method based on improved teaching-learning-based optimization (ITLBO) is proposed to estimate the stator resistance, ��-axis inductance, ��-axis inductance, and flux linkage of the hub motor with respect to temperature rise. The effect of temperature rise on the stator resistance, ��-axis inductance, ��-axis inductance, and magnetic flux linkage is analysed. The hub motor parameters are identified offline. The proposed ITLBO algorithm is introduced to estimate the parameters online. The Gaussian perturbation function is employed to optimize the TLBO algorithm and improve the identification speed and accuracy. The mechanisms of group learning and low-ranking elimination are established. After that, the proposed ITLBO algorithm for parameter identification is employed to identify the hub motor parameters online on the test bench. Compared with other parameter identification algorithms, both simulation and experimental results show the proposed ITLBO algorithm has rapid convergence and a higher convergence precision, by which the robustness of the algorithm is effectively verified. Keywords: parameters identification, teaching–learning-based optimization, hub motor, temperature rise.

Abstract Solving nonlinear equation systems (NESs) requires locating different roots in one run. To effectively deal with NESs, a multi-population cooperative teaching–learning-based optimization, named MCTLBO, is presented. The innovations of MCTLBO are as follows: (i) two niching technique (crowding and improved speciation) are integrated into the algorithm to enhance population diversity; (ii) an adaptive selection scheme is proposed to select the learning rules in the teaching phase; (iii) the new learning rules based on experience learning are developed to promote the search efficiency in the teaching and learning phases. MCTLBO was tested on 30 classical problems and the experimental results show that MCTLBO has better root finding performance than other algorithms. In addition, MCTLBO achieves competitive results in eighteen new test sets.

The reptile search algorithm (RSA) is a bionic algorithm proposed by Abualigah. et al. in 2020. RSA simulates the whole process of crocodiles encircling and catching prey. Specifically, the encircling stage includes high walking and belly walking, and the hunting stage includes hunting coordination and cooperation. However, in the middle and later stages of the iteration, most search agents will move towards the optimal solution. However, if the optimal solution falls into local optimum, the population will fall into stagnation. Therefore, RSA cannot converge when solving complex problems. To enable RSA to solve more problems, this paper proposes a multi-hunting coordination strategy by combining Lagrange interpolation and teaching-learning-based optimization (TLBO) algorithm's student stage. Multi-hunting cooperation strategy will make multiple search agents coordinate with each other. Compared with the hunting cooperation strategy in the original RSA, the multi-hunting cooperation strategy has been greatly improved RSA's global capability. Moreover, considering RSA's weak ability to jump out of the local optimum in the middle and later stages, this paper adds the Lens pposition-based learning (LOBL) and restart strategy. Based on the above strategy, a modified reptile search algorithm with a multi-hunting coordination strategy (MRSA) is proposed. To verify the above strategies' effectiveness for RSA, 23 benchmark and CEC2020 functions were used to test MRSA's performance. In addition, MRSA's solutions to six engineering problems reflected MRSA's engineering applicability. It can be seen from the experiment that MRSA has better performance in solving test functions and engineering problems.

Marine Predators Algorithm (MPA) is a newly nature-inspired meta-heuristic algorithm, which is proposed based on the Lévy flight and Brownian motion of ocean predators. Since the MPA was proposed, it has been successfully applied in many fields. However, it includes several shortcomings, such as falling into local optimum easily and precocious convergence. To balance the exploitation and exploration ability of MPA, a modified marine predators algorithm hybridized with teaching-learning mechanism is proposed in this paper, namely MTLMPA. Compared with MPA, the proposed MTLMPA has two highlights. Firstly, a kind of teaching mechanism is introduced in the first phase of MPA to improve the global searching ability. Secondly, a novel learning mechanism is introduced in the third phase of MPA to enhance the chance encounter rate between predator and prey and to avoid premature convergence. MTLMPA is verified by 23 benchmark numerical testing functions and 29 CEC-2017 testing functions. Experimental results reveal that the MTLMPA is more competitive compared with several state-of-the-art heuristic optimization algorithms.

At present, workflow scheduling in cloud computing environment is still a challenging optimization topic due to its NP-complete characteristics. In order to obtain better scheduling results, researchers are constantly coming up with new methods. In this study, we offer a hybrid metaheuristic for solving workflow scheduling in cloud to minimize the makespan of the workflow considering the heterogeneity of virtual resources. This hybrid approach combines the excellent optimization properties of Heterogeneous Earliest Finish Time (HEFT), Teaching–Learning-Based Optimization (TLBO), Opposition-Based Learning (OBL), and genetic manipulations, which is named Hybrid TLBO (HTLBO). Firstly, a HEFT-based method is proposed to produce the high-quality diverse initial population. Secondly, a Mixed OBL (MOBL) model is designed, in which the boundary search information and the population historical search information are systematically taken into account. Finally, an enhanced learner stage using genetic operations are added to effectively help the algorithm to jump out of the local optima. Rigorous experiments over various scientific workflows are conducted to validate HTLBO’s performance. The obtained results are compared to HEFT and some state-of-the-art hybrid metaheuristics in terms of average makespan, running time and non-parametric statistics. A significant improvement in schedule quality demonstrates that HTLBO can increase population diversity and achieve a good balance between scheduling effectiveness and efficiency.

The JAYA is classified as the state-of-the-art population-oriented algorithm for the optimization of diverse problems, both discrete and continuous. The concept behind this algorithm is to present a solution by means of the best and worst individuals in the population. On the other hand, teaching–learning-based optimization algorithm cooperation of a teacher on students' learning process. Due to each one having some benefits and drawbacks, combining those leads to better exploring the problem. Consequently, this investigation exploits the hybridization of both mentioned algorithms, and a novel algorithm is made named H-JTLBO (hybridization of JAYA and teaching learning-based optimization). The proposed approach is then evaluated using different test functions used frequently in the literate. Finally, the results of such functions are compared with other optimization algorithms which have recently been introduced in the literature, such as Sine Cosine Algorithm (SCA), Grasshopper Optimization Algorithm (GOA), Moth-flame optimization (MFO), and JAYA algorithm. In addition, the statistical test is used to evaluate the proposed method. Through the results, H-JTLBO outperforms all mentioned algorithms in terms of convergence and solution quality. [ABSTRACT FROM AUTHOR]

In this paper, a new method based on the combination of the Teaching-learning-based-optimization (TLBO) and Black-hole (BH) algorithm has been proposed for the reconfiguration of distribution networks in order to reduce active power losses and improve voltage profile in the presence of distributed generation sources. The proposed method is applied to the IEEE 33-bus radial distribution system. The results show that the proposed method can be a very promising potential method for solving the reconfiguration problem in distribution systems and has a significant effect on loss reduction and voltage profile improvement. [ABSTRACT FROM AUTHOR]

Abstract In the cloud manufacturing process, service composition can combine a single service into a complex service to meet the task requirements. An efficient service composition strategy is crucial, as it affects the efficiency of resource and capacity sharing in the cloud manufacturing system. However, in the face of a large-scale environment, the existing methods have the problems of slow convergence and instability. To solve the problems above, we propose an improved optimization method, named improved-TC. Specifically, we are inspired by the horizontal crossover of CSO in the hybrid-TC teaching phase, the Hybrid-TC is proposed in our previous work, which is a hybrid of the teaching-learning-based optimization algorithm (TLBO) and the crisscross optimization algorithm (CSO). Improved-TC is an improvement on the learning phase of hybrid-TC algorithm, we change the search method of hybrid-TC in the learning phase to a one-dimensional search, thereby some dimensions in the population that are trapped in the local optimum have the chance to jump out of the iteration. Experiments show that our proposed method has a faster convergence speed and more stability in the face of service composition in large-scale environments.

This paper is concerned with the economic generation dispatch problem. It is a well-known fact that practical aspects of power plant equipment, as well as the objectives to be met, may result in a nonconvex, nondifferentiable model that poses difficulties to conventional mathematical programming methods. This paper proposes the use of metaheuristic Teaching-Learning-Based Optimization to overcome such difficulties. This metaheuristic is well known for requiring a few parameters and, most importantly, it does not require the tuning of problem-dependent parameters. The algorithm proposed in this work is parameter-free; that is, the few parameters required by the Teaching-Learning-Based Optimization method are set automatically based on the power system’s data. In addition, the handling of constraints, such as generators’ prohibited zones and the generator-load-loss power balance, is performed in a very efficient way. Simulation results are shown for power systems containing 3 to 40 generation units, and the results provided by the proposed method are shown and discussed based on comparisons with other metaheuristics and a mathematical programming technique.

Marine predators algorithm (MPA) has solved many challenging optimization problems since proposed. However, corresponding to specific optimization tasks (e.g., visual tracking), it is usually hard to select correct multiple parameters in MPA, which will greatly limit the exploitation and exploration performance. As a result, MPA could be misled to a local minima or even did not converge. To solve this issue, we advise an enhanced version of MPA based on teaching-learning-based optimization (MMPA-TLBO) which can concurrently improve the solution accuracy and the convergence speed. Specifically, first, we propose a modified MPA (MMPA) that leverages chaotic map and opposition-based learning strategy in the initialization stage to generate high-quality individuals. Second, we introduce a parameter-free teaching-learning-based optimization method with strong exploitation operator into MPA, called MMPA-TLBO, which effectively trade-off between the exploitation and exploration procedures. Finally, extensive experiments over 23 benchmark functions, CEC2017 benchmark problems and two engineering design problems show that MMPA-TLBO is better than other algorithms. Furthermore, we perform a thought-provoking case study of MMPA-TLBO on visual tracking. The experimental results show that the MMPA-TLBO tracker can outperform other trackers with a satisfied margin, especially for abrupt motion tracking. [ABSTRACT FROM AUTHOR]

This article introduces an efficient surrogate-assisted bi-swarm evolutionary algorithm (SABEA) with hybrid and ensemble strategies for computationally expensive optimization problems. In SABEA, the evolutionary swarm is randomly partitioned into two sub-swarms to maintain diversity of the population. One sub-swarm evolves using the differential evolution (DE) and the other one evolves using teaching-learning-based optimization (TLBO). The proposed SABEA has strong exploration and exploitation capabilities by taking advantages of these two powerful algorithms. Besides, both the global and the local surrogate models cooperate effectively in the proposed SABEA for estimating the fitness value. The global model is established with all samples in the database for global search, and the local model is created with training samples around the current swarm for local search. In addition, a restart mechanism and two model management schemes, namely the individual-based and generation-based, are effectively integrated in the proposed algorithm to make SABEA more strong. Twenty benchmark functions and the tension/compression spring design problem are employed to assess the proposed SABEA. Comprehensive experimental results demonstrate that our proposed SABEA has superior performance comparing with several state-of-the-art competing algorithms on most of the test problems with low, medium and high dimensions. [ABSTRACT FROM AUTHOR]