Swarm Intelligence-based Algorithms Research Articles

Just-in-time scheduling of unrelated parallel machines with family setups and soft time window constraints

ABSTRACT This study addresses an unrelated parallel machine scheduling problem with family setups and soft time windows, which includes considerations for machine eligibility. The objective is to minimize the total weighted tardiness and earliness, and to maximize the number of Just-in-Time jobs. Four different metaheuristic algorithms are compared to determine which type – single-point (simulated annealing), population-based evolutionary (artificial immune system, genetic algorithm), or swarm intelligence algorithms (ant colony optimization) – is more effective in solving this problem. Two strategies, namely penalty and repair, are proposed to handle precedence constraints. Experimental results demonstrate that ant colony optimization with local search which employs the repair strategy, as a swarm intelligence-based algorithm outperforms its rivals in terms of objective function values and robustness. The performance of this algorithm has shown an improvement in objective function values ranging from 2.12% to 8.52% on average, with a relative percentage deviation of 10.35.

Energy efficient clustering and sink mobility protocol using Improved Dingo and Boosted Beluga Whale Optimization Algorithm for extending network lifetime in WSNs

In Wireless Sensor Networks (WSNs), the potential design challenge of energy efficiency is determined to be handled through the strategies of clustering and routing. The approaches of clustering and routing in WSNs pertain to the problems of Non-deterministic Polynomial (NP)-hard optimization. In this context, swarm intelligence-based algorithms are identified to be suitable and ideal for determining near-optimal and optimal solutions in the search space. On the other hand, APTEEN routing protocol possesses the issues that are related to unnecessary energy drain, ineffective overall network coverage and premature death of certain nodes. To address these issues, an attempt to optimize the APTEEN routing protocol using Dingo Optimization Algorithm (DOA) and Beluga Whale Optimization Algorithm (BWOA) is made in this proposed clustering protocol. With this motivation, Improved Dingo and Boosted Beluga Whale Optimization Algorithm (IDBBWOA) is proposed for determining the optimal cluster head and perform energy-efficient routing to minimized the energy consumption and maximize the lifetime of the network. It specifically used Improved Dingo Optimization Algorithm (IDOA) for attaining cluster head (CH) selection and energy efficient routing through the adoption fitness parameters of Residual Energy, Distance within and between Clusters, Network coverage, Node Degree for maximizing the rate of reliable data dissemination. It also incorporated Boosted Beluga Whale Optimization Algorithm (BBWOA) for determining the optimal points over the sink node can be moved to prevent multi-hop between CHs and the sink nodes, since it is essential for addressing the issue of hot-spot and extends the network lifetime. The simulation results of the proposed IDBBWOA approach revealed its efficacy in improving the mean throughput by 18.92 %, sustaining alive nodes by 34.28 %, and maintaining residual energy by 29.34 %, compared to the benchmarked approaches used for evaluation.

A New Approach In Metaheuristic Clustering: Coot Clustering

As a result of technological advancements, the increase in vast amounts of data in today's world has made artificial intelligence and data mining significantly crucial. In this context, the clustering process, which aims to explore hidden patterns and meaningful relationships within complex datasets by grouping similar features to conduct more effective analyses, holds vital importance. As an alternative to classical clustering methods that face challenges such as large volumes of data and computational complexities, a metaheuristic clustering method utilizing Coot Optimization (COOT), a swarm intelligence-based algorithm, has been proposed. COOT, inspired by the hunting stages of eagles and recently introduced into the literature, is a metaheuristic method. Through the proposed COOT metaheuristic clustering method, the aim is to contribute to the literature by leveraging COOT's robust exploration and exploitation processes, utilizing its dynamic and flexible structure. Comprehensive experimental clustering studies were conducted to evaluate the consistency and effectiveness of the COOT-based algorithm using randomly generated synthetic data and the widely used Iris dataset in the literature. The same datasets underwent analysis using the traditional clustering algorithm K-Means, renowned for its simplicity and computational speed, for comparative purposes. The performance of the algorithms was assessed using cluster validity measures such as Silhouette Global, Davies-Bouldin, Krznowski-Lai, and Calinski-Harabasz indices, along with the Total Squared Error (SSE) objective function. Experimental results indicate that the proposed algorithm performs clustering at a competitive level with K-Means and shows potential, especially in multidimensional datasets and real-world problems. Despite not being previously used for clustering purposes, the impressive performance of COOT in some tests compared to the K-Means algorithm showcases its success and potential to pioneer different studies aimed at expanding its usage in the clustering domain.

A self-adaptive attraction and repulsion-based naked mole-rat algorithm for energy-efficient mobile wireless sensor networks

Naked mole-rat algorithm (NMRA) is a swarm intelligence-based algorithm that draws inspiration from the mating behaviour of mole rats (workers and breeders). This approach, which is based on the ability of breeders to reproduce with the queen, has been utilized to tackle optimization problems. The algorithm, however, suffers from local optima stagnation problem and a slower rate of convergence in order to provide gobal optimal solution. This study suggests attraction and repulsion strategy based NMRA (ARNMRA) along with self-adaptive properties to avoid trapping of solution in local optima. This strategy is utilized to create new breeder rat solutions and mating factor (λ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$(\\lambda )$$\\end{document} is made self-adaptive using simulated annealing (sa) based mutation operator. ARNMRA is evaluated on CEC 2005 numerical benchmark problems and found to be superior to other algorithms, including well-known ones like selective operation based GWO (SOGWO), opposition based laplacian equilibrium optimizer (OB-L-EO), improved whale optimization algorithm (IWOA), success-history based adaptive DE (SHADE) and original NMRA. Further, according to experimental results, the performance of ARNMRA is likewise superior to the NMRA for the CEC 2019 and CEC 2020 numerical problems. Convergence profiles and statistical tests (rank-sum test and Friedman test) are employed further to validate the experimental results. Moreover, this article extends the application of ARNMRA to address the data gathering aspect in mobile wireless sensor networks (MWSNs) with the goal of prolonging network lifetime and enhancing energy efficiency. In this MWSN-based protocol, a sensor node is elected as a cluster head based on factors like mobility, residual energy, and connection time. The protocol aims to maximize the system lifetime by efficiently collecting data from all sensors and transmitting it to the base station. The study emphasizes the significance of considering dynamic node densities and speed when designing effective data-gathering protocols for MWSNs.

DEVELOPMENT OF HEALTH INSURANCE CLAIM PREDICTION METHOD BASED ON SUPPORT VECTOR MACHINE AND BAT ALGORITHM

Health insurance industry is very much needed by the community in handling the financial risks in the health sector. The number of claims greatly affects the achievement of profits and the sustainability of the health insurance industry. Therefore, filing claims by insurance users from year to year is important to be predicted in insurance firm. The Machine Learning (ML) method promises to be a good solution for predicting health insurance claims compared to conventional data analytics methods. Support Vector Machine (SVM) is one of the superior ML approaches. Nonetheless, SVM performance is controlled by the suitable selection of SVM parameters. The SVM parameters is typically selected by trial and error, sometimes resulting in not optimal performance and taking a long time to complete. Swarm intelligence-based algorithms can be used to select the best parameters from SVM. This method is capable of locating the global best solution, is simple to implemented, and doesn't involve derivatives. One of the best swarm intelligence algorithms is the Bat Algorithm (BA). BA has a faster convergence rate than other algorithms, for example Particle Swarm Optimization (PSO). Based on this situation, this paper offers the new classification model for predicting health insurance claim based on SVM and BA. The metrics utilized for evaluation are accuracy, recall, precision, f1-score, and computing time. The experimental outcomes show that the proposed approach is superior to the conventional SVM and the hybrid of SVM and PSO in forecasting health insurance claims. In addition, the proposed method has a substantially shorter computing time than the hybrid of SVM and PSO. The outcomes of the experiments also indicate that the new classification model for predicting health insurance claim based on the SVM and BA can avoid over-fitting condition.

Dynamic fitness-distance balance-based artificial rabbits optimization algorithm to solve optimal power flow problem

Artificial rabbits optimization (ARO) is a swarm intelligence-based algorithm inspired by the survival strategies of rabbits. Although ARO has a good convergence rate, it is prone to get stuck in the local optima and converge prematurely. To overcome this, the present paper redesigns the exploration operator of the ARO algorithm with the roulette fitness-distance balance (RFDB) and dynamic fitness-distance balance (dFDB) strategies. In this context, three different versions of the fitness-distance balance-based artificial rabbits optimization (FDBARO) algorithm are developed. The performance of the original ARO and FDBARO versions (FDBARO-1, FDBARO-2, and FDBARO-3) are evaluated on CEC 2017 and CEC 2020 benchmark functions. The obtained results are analyzed with the Wilcoxon and Friedman statistical tests. Statistical and convergence analysis results showed that the FDBARO-3 algorithm designed with the dFDB selection method can explore the search space more successfully compared to other algorithms. This version was named the dynamic FDBARO (dFDBARO) algorithm. Moreover, the practicability of the proposed dFDBARO is highlighted by the solution of the optimal power flow (OPF) problem formulated with renewable energy sources (RESs) and flexible alternating current transmission system (FACTS) devices considering fixed and uncertain load demands. Experimental results showed that the proposed dFDBARO is a competitive algorithm for solving global optimization and constrained OPF problems. The source code of the dFDBARO algorithm is available at https://www.mathworks.com/matlabcentral/fileexchange/154845-dfdbaro-an-enhanced-metaheuristic-algorithm.

Structural health monitoring of beam model based on swarm intelligence-based algorithms and neural networks employing FRF

In recent decades, swarm optimization methods have been employed to address various optimization problems in structural health monitoring (SHM). One of the widely recognized swarm-based algorithms, particle swarm optimization (PSO), has gained significant popularity and found extensive applications across diverse fields. However, it presents some limitations, such as the low convergence rate in the iterative process. The butterfly optimization algorithm (BOA) is a recently developed algorithm that has demonstrated its performance in solving a variety of optimization problems. In this research, a novel hybrid swarm optimization algorithm is introduced, integrating PSO and BOA, with the aim of enhancing its effectiveness. To overcome the limitations of the traditional Artificial Neural Network (ANN) technique and enhance its training performance, this new hybrid algorithm is integrated with ANN. The study offers valuable insights into the creation of a predictive model, known as PSO-BOA-ANN, for detecting structural damage. Input parameters for the model include natural frequencies, while the output parameter is the severity of the damage. To test the efficiency of the proposed technique, data were collected from a finite element model using a simulation tool, and from frequency response function (FRF) after experimental modal analysis for single and double cracked aluminum beams considering different crack depths. A comparative analysis was conducted between the results obtained from PSO, BOA, GA, and their respective combinations with ANN. The findings indicate that the novel PSO-BOA-ANN approach outperforms the other approaches in terms of accuracy when it comes to damage prediction.

An Efficient Maritime Route Planning Method Based on an Improved A* with an Adaptive Heuristic Function and Parallel Computing Structure

Maritime route planning under minimal-risk conditions plays an important part in the development and utilization of marine resources. High-resolution weather forecasting data places higher demands on the algorithms’ ability to optimize and compute, and existing algorithms are significantly deficient in these aspects. Therefore, we propose a parallel computing-based planning method, segment parallel A* (SPA*), which splits the path into small segments and runs A* separately on CPU cores through a control algorithm. In segment planning, we propose an adaptive heuristic function on A*. It automatically balances the order of magnitude difference between the risk assessment value and the estimated distance, thus significantly reducing the A* expansion useless grid to improve the performance and running speed of the algorithm. Finally, the complete route is obtained by splicing the above segments. In the static planning experiments, the time of SPA* is reduced by about 5~12,425 times compared with 6 traditional and swarm intelligence-based algorithms, i.e., Dijkstra, A*, bidirectional A* (BA*), ant colony optimization (ACO), Harris hawks optimization (HHO), and sparrow search algorithm (SSA). And the abilities to control the risk caused by wind and waves and the comprehensive risk are improved by 7.68%~25.14% and 8.44%~14.38%, respectively; in the dynamic planning experiments, the above results are 4.8~1262.9 times, 3.87%~9.47% and 7.21%~10.36%, respectively. By setting the recommended range of the number of segments for each case, SPA* shows stable performance in terms of the calculation and risk control. SPA* demonstrates a unique structure for using parallel computing in route planning, which is representative and general in both reducing time and improving efficiency.

Power-Aware Fog Supported IoT Network for Healthcare Infrastructure Using Swarm Intelligence-Based Algorithms

Healthcare services become increasingly technology dependent every passing day such as the Internet of Things (IoT), Fog Computing, 5th generation (5G) and beyond communications, etc. They enable the processing and exchange of huge volumes of healthcare data whose integrity and real-time delivery are critical for healthcare services. Optimal power consumption in such essential healthcare infrastructure is critical for the well-being of patients and crucial to reduce the operational cost of healthcare facilities. In this paper, a Fog node has been introduced in an IoT healthcare infrastructure with power consumption as a key deciding factor. This work proposed a mathematical formulation to decide the deployment of two heterogeneous gateways in the healthcare infrastructure. The target of optimization is to minimize transmission power and infrastructure costs. Two swarm intelligence-based algorithms have been used to solve the computationally challenging optimization problem. These evolutionary algorithms are a discrete fireworks algorithm and a discrete artificial bee colony algorithm with an ensemble of local search methods. Their performance is compared against the genetic algorithm. The simulation results demonstrate a saving of up to 33 percent in power consumption in the proposed healthcare infrastructure that can significantly improve healthcare data communications and its operational costs.

Optimum weight design of steel truss roof systems considering corrosion effect

In this paper, the ideal weight for steel truss roof systems is determined while corrosion is considered. Because one of the most crucial problems that steel truss roof systems may experience during their service life is the effect of corrosion. If a corroded structure is designed without considering this effect during the design phase, significant damages and even collapses may occur before it reaches its service life. For this reason, the aim of this study is to make weight optimizations by considering the corrosion effect of steel truss roof systems. Thus, it has been revealed how corrosion that may develop on the truss members' surfaces affects the structure's overall optimum weight. Swarm intelligence-based algorithm approaches, Ant Colony Optimization (ACO), and Butterfly Optimization Algorithm (BOA) are used for this purpose to determine the optimal weight design of five different steel truss roof systems that were previously researched. The main program, which includes structural analysis (FEA) and optimization algorithms, is coded in the MATLAB programming language. The compression and tension bars selected as the limiting functions of the optimization problems are obtained from the stress, displacement, and slenderness conditions specified in the American Institute of Steel Construction-Allowable Strength Design (AISC-ASD, 1989) standard. It is seen that the optimum weight results obtained from all optimization methods for each structure in the non-corrosive condition are relatively similar. This result proves the correctness of the algorithms proposed in this paper. Then, under the influence of corrosion, the optimal weight designs of the structures are carried out. When the findings for the two cases are examined, it can be seen that the optimum weight values for all structures have slightly increased. This is because larger profiles are required due to overcapacity brought on by section loss. The weight of the structure increases in lockstep with the severity of corrosion. All the results like this are presented in detail with the help of tables and graphs in the relevant sections.

BN-GEPSO: Learning Bayesian Network Structure Using Generalized Particle Swarm Optimization

At present Bayesian Networks (BN) are being used widely for demonstrating uncertain knowledge in many disciplines, including biology, computer science, risk analysis, service quality analysis, and business. But they suffer from the problem that when the nodes and edges increase, the structure learning difficulty increases and algorithms become inefficient. To solve this problem, heuristic optimization algorithms are used, which tend to find a near-optimal answer rather than an exact one, with particle swarm optimization (PSO) being one of them. PSO is a swarm intelligence-based algorithm having basic inspiration from flocks of birds (how they search for food). PSO is employed widely because it is easier to code, converges quickly, and can be parallelized easily. We use a recently proposed version of PSO called generalized particle swarm optimization (GEPSO) to learn bayesian network structure. We construct an initial directed acyclic graph (DAG) by using the max-min parent’s children (MMPC) algorithm and cross relative average entropy. This DAG is used to create a population for the GEPSO optimization procedure. Moreover, we propose a velocity update procedure to increase the efficiency of the algorithmic search process. Results of the experiments show that as the complexity of the dataset increases, our algorithm Bayesian network generalized particle swarm optimization (BN-GEPSO) outperforms the PSO algorithm in terms of the Bayesian information criterion (BIC) score.

Generative Service Provisioning for IoT Devices Using Line Graph Structure

A service subgraph helps Internet-of-Things devices access resources in a dynamic Internet-of-Things device network. We propose a service subgraph generation method for Internet-of-Things device networks. Service subgraph generation aims to find more capable neighboring Internet-of-Things devices for service provisioning. We apply a line graph structure for an adequate representation of device resources. The line graph structure effectively represents the resources in the generated service subgraph. A general node classification problem constituting the generated service subgraph identifies the appropriate resource binding for service provisioning. A node in the service subgraph corresponds to a unique relationship between devices. Service provisioning is guaranteed by reinforcement learning based on the resource binding identified by node classification. The proposed line graph structure and resource binding significantly enhance the traditional intelligent resource allocation method. In addition, the proposed scheme can effectively attain service subgraphs with very low computational complexity. The proposed generative service provisioning generally has a significantly lower occupation probability than the swarm intelligence-based algorithm. The average value of the occupation probability is 0.49 with the proposed method. It is 0.12 lower than that of swarm intelligence-based algorithm.

Parameter Optimisation-Based Hybrid Reference Evapotranspiration Prediction Models: A Systematic Review of Current Implementations and Future Research Directions

A hybrid machine learning (ML) model is becoming a common trend in predicting reference evapotranspiration (ETo) research. This study aims to systematically review ML models that are integrated with meta-heuristic algorithms (i.e., parameter optimisation-based hybrid models, OBH) for predicting ETo data. Over five years, from 2018–2022, the articles published in three reliable databases, including Web of Science, ScienceDirect, and IEEE Xplore, were considered. According to the protocol search, 1485 papers were selected. After three filters were applied, the final set contained 33 papers related to the nominated topic. The final set of papers was categorised into five groups. The first group, swarm intelligence-based algorithms, had the highest proportion of papers, (23/33) and was superior to all other algorithms. The second group (evolution computation-based algorithms), third group (physics-based algorithms), fourth group (hybrid-based algorithms), and fifth group (reviews and surveys) had (4/33), (1/33), (2/33), and (3/33), respectively. However, researchers have not treated OBH models in much detail, and there is still room for improvement by investigating both newly single and hybrid meta-heuristic algorithms. Finally, this study hopes to assist researchers in understanding the options and gaps in this line of research.

Artificial Bee Colony for Logic Mining in Credit Scoring

During the SARS-CoV-2 (Covid-19) pandemic, credit applications skyrocketed unimaginably. Thus, creditors or financial entities were burdened with information overload to ensure they provided the proper credit to the right person. The existing methods employed by financial entities were prone to overfitting and did not provide any information regarding the behavior of the creditor. However, the outcome did not consider the attribute of the creditor that led to the default outcome. In this paper, a swarm intelligence-based algorithm named Artificial Bee Colony has been implemented to optimize the learning phase of the Hopfield Neural Network with 2 Satisfiability-based Reverse Analysis Methods. The proposed hybrid model will be used to extract logical information in the credit data with more than 80% accuracy compared to the existing method. The effectiveness of the proposed hybrid model was evaluated and showed superior results compared to other models.

Prediction and optimization of heating and cooling loads for low energy buildings in Morocco: An application of hybrid machine learning methods

In this paper, a metamodel-based approach involving simulation data collection and data-driven techniques was used to forecast and optimize heating and cooling loads in three different climates in Morocco. The metamodel method is gaining popularity as it offers a better balance between accuracy and calculation time. In addition, a wrapper method was used as a feature selection approach to find the best feature subsets in order to reduce models’ complexity. Therefore, the performances of eleven state-of-the-art algorithms including evolutionary-based algorithms, swarm intelligence-based algorithms and human-based algorithms, coupled with a learner such as Artificial Neural Networks (ANNs) and Support vector machine (SVM), were assessed. Hybrid model based on League championship algorithm (LCA), Discrete symbiotic organisms search (DSOS) algorithm, Particle swarm optimization (PSO) algorithm showed better results in terms of accuracy and reduction of feature input parameters. Indeed, the best desired performances were obtained with LCA-SVM for cooling load, DSOS-SVM for heating load, PSO-ANN for both heating and cooling loads. On the other hand, to optimize the annual thermal load, the NSGA-II algorithm was used. Results showed a reduction of 68% of the total annual load compared to the base case in Meknes city, 73% in Ifrane and 67% in Marrakech. The solution that reflects a compromise between the two objective functions (i.e., cooling load and heating load) gives better results in terms of CO2 emissions reduction in all climates evaluated, except in the cold climate.

Synthesis of Concentric Circular Antenna Array Using Whale Optimization Algorithm

Through the ages the importance of the swarm intelligence-based algorithm has gained popularity in the field of optimization. The Whale Optimization Algorithm (WOA) is one such popular meta-heuristics nature inspired swarm intelligence-based algorithm which is well accepted for solving optimization problems, as it is simple and capable to obtain optimal results efficiently. In this paper, few benchmark functions along with radiation patterns of concentric circular antenna array are presented and their performance is optimized using WOA. Simulation results are shown by taking various benchmark functions, namely: Three hump & Six hump camel function, Ackley, Egg Crate Function, and Egg Holder Function. The capability of the WOA algorithm is also tested through pattern synthesis with respect to the thinned array as well as non-uniformly excited array for four diverse sets of CCAA geometries. When comparison is being done with respect to renowned and most popular optimization approaches like PSO, the WOA technique proves to be excellent in terms of maximum SLL suppression. Optimization results show the better capability of WOA in the field of optimization.

Comparative Study on the Synthesis of Path-Generating Four-Bar Linkages Using Metaheuristic Optimization Algorithms

Four-bar linkages are one of the most widely used mechanisms in industries. This paper presents a comparative study on the accuracy and efficiency of the optimum synthesis of path-generating four-bar linkages using five metaheuristic optimization algorithms. The utilized metaheuristic methods included two swarm intelligence-based algorithms, i.e., particle swarm optimization and hybrid particle swarm optimization, and three evolutionary-based algorithms, i.e., differential evolution, ensemble of parameters and mutation strategies in differential evolution, and linearly ensemble of parameters and mutation strategies in differential evolution. The objective function to be minimized is the sum of squares of the distance between the generated points and the precision points of a coupler point. The optimal design of four-bar linkages must meet the Grashof’s criteria and exhibit sequential constraints that can prevent the occurrence of order defect. This study investigated five representative cases of the dimensional synthesis of four-bar path generators with and without prescribed timing and compared the optimal solutions of the utilized five metaheuristic methods to those of previously reported algorithms in literature. The improved metaheuristic methods exhibited superior optimal solution and enhanced reliability compared to the original methods. Moreover, three improved metaheuristic methods were not only easy implemented, but also more efficient for solving the optimal synthesis problems, particularly for high dimensional problems.

Optimum design of combined footings using swarm intelligence-based algorithms

This study considers the optimum design of reinforced concrete combined footings. Analysis and design procedures are developed based on the American Concrete Institute (ACI 318-05) regulations and several geotechnical considerations for providing stability to the structure. Low-cost designs are generated using five swarm intelligence algorithms [i.e., particle swarm optimization (PSO), accelerated particle swarm optimization (APSO), whale optimization algorithm (WOA), ant lion optimizer (ALO), and moth flame optimization (MFO)]. The performance of these algorithms is examined through two numerical simulations. First, a combined footing design from the literature is optimized using the five swarm intelligence algorithms. The impacts of concrete compressive strength (fc) on the final cost are studied through a sensitivity analysis. Second, rectangular and trapezoidal combined footings are optimized using the best algorithm in the first example (i.e., PSO) to explore the effect of shape on the final design. Also, a sensitivity analysis is performed on the effects of the design parameters on the cost.

LFA: A Lévy Walk and Firefly-Based Search Algorithm: Application to Multi-Target Search and Multi-Robot Foraging

In the literature, several exploration algorithms have been proposed so far. Among these, Lévy walk is commonly used since it is proved to be more efficient than the simple random-walk exploration. It is beneficial when targets are sparsely distributed in the search space. However, due to its super-diffusive behavior, some tuning is needed to improve its performance, specifically when targets are clustered. Firefly algorithm is a swarm intelligence-based algorithm useful for intensive search, but its exploration rate is very limited. An efficient and reliable search could be attained by combining the two algorithms since the first one allows exploration space, and the second one encourages its exploitation. In this paper, we propose a swarm intelligence-based search algorithm called Lévy walk and Firefly-based Algorithm (LFA), which is a hybridization of the two aforementioned algorithms. The algorithm is applied to Multi-Target Search and Multi-Robot Foraging. Numerical experiments to test the performances are conducted on the robotic simulator ARGoS. A comparison with the original firefly algorithm proves the goodness of our contribution.

Parameter Tuning of Sliding Mode Speed Controller of Induction Motor Drive Using Teaching-Learning Based Optimization Algorithm

The optimal settings of the Sliding Mode Controller for three-phase Induction Motor speed regulation are proposed in this paper using a Teaching-Learning Based Optimization Algorithm. It is a straightforward metaheuristic algorithm that simulates the teaching-learning processes in a classroom. Indirect Field Oriented Control is used in this induction motor drive, which allows the motor torque and the flux to be separated, similar to a DC motor. The inner loop uses proportional-integral current controllers, whereas the outside loop uses a sliding mode speed controller. In this paper, the sliding mode controller uses a tanh function as a switching function. Integral Time Absolute Error and Zwe-Lee Gaing's parameters are used as objective functions for tuning sliding mode controller settings. Performances of the proposed scheme in terms of the transient response analysis are compared with the swarm intelligence-based algorithms, namely the modified Particle Swarm Optimization and Grey Wolf Optimization. MATLAB/ SIMULINK software is used to build the three algorithms and sliding mode controller-based induction motor drive models, which are then analysed using simulation experiments. In comparison to the modified Particle Swarm Optimization and the Grey Wolf Optimization algorithms, Teaching-Learning Based Optimization yields the lowest value of the objective function Zwe-Lee Gaing's parameter and it converges quickly.