Search

A Virtual Power Plant (VPP) is a centralized energy system that manages, and coordinates distributed energy resources, integrating them into a unified entity. While the physical assets may be dispersed across various locations, the VPP integrates them into a virtual unified entity capable of responding to grid demands and market signals. This paper presents a tri-level hierarchical coordinated operational framework of VPP. Firstly, an Improved Pelican Optimization Algorithm (IPOA) is introduced to optimally schedule Distributed Energy Resources (DERs) within the VPP, resulting in a significant reduction in generation costs. Comparative analysis against conventional algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) demonstrates IPOA's superior performance, achieving an average reduction of 8.5% in generation costs across various case studies. The second stage focuses on securing the optimized generation data from rising cyber threats, employing the capabilities of machine learning, preferably, a convolutional autoencoder to learn the normal patterns of the optimized data to detect deviations from the optimized generation data to prevent suboptimal decisions. The model exhibits exceptional performance in detecting manipulated data, with a False Positive Rate (FPR) of 1.92% and a Detection Accuracy (DA) of 98.06%, outperforming traditional detection techniques. Lastly, the paper delves into the dynamic nature of the day ahead market that the VPP participates in. In responding to the grid by selling its optimized generated power via the day-ahead market, the VPP employs the Prophet model, another machine learning technique to forecast the spot market price for the day-ahead to mitigate the adverse effects of price volatility. By utilizing Prophet forecasts, the VPP achieves an average revenue increase of 15.3% compared to scenarios without price prediction, emphasizing the critical role of predictive analytics in optimizing economic gains. This tri-level coordinated approach adopted addresses key challenges in the energy sector, facilitating progress towards achieving universal access to clean and affordable energy. [ABSTRACT FROM AUTHOR]

With the development of science and technology, vehicles have gradually become smart network vehicles. However, applications on vehicles require great network and computing performance. It poses a great challenge to the existing Internet of Vehicles (IoV). Cloud computing can relieve the pressure of data processing, but the response time could take a long time. In the edge computing, edge server processing requests can effectively reduce response time. For example, during rush hour, in order to respond quickly, a large number of requests can be sent from the vehicles layer to the edge server. However, due to the limited bandwidth resources of edge servers, it is necessary to develop an effective bandwidth allocation model. The research in this paper consists of two main parts. First, this paper proposes a multi-objective bandwidth allocation optimization model for addressing this issue. The goal is to minimize average response time and maximize bandwidth utilization. Second, a multi-objective sparrow search algorithm (KMSSA) based on K-means algorithm is proposed to solve multi-objective bandwidth allocation. This paper compares KMSSA with particle swarm optimization (PSO) and sparrow search algorithm (SSA) on iFogSim platform. The results show that KMSSA has good optimization performance. The algorithm can be successfully applied to solve global multi-objective optimization problems. To compare with PSO algorithm, the performance of KMSSA is improved by 10%. To compare with SSA, the performance of KMSSA is improved by 5%. Also, KMSSA has superiority in solving practical problems. Its global optimal solution has superior performance in terms of average response time, bandwidth utilization, energy consumption, and cost. [ABSTRACT FROM AUTHOR]

Reservoir flood control scheduling is a challenging optimization task, particularly due to the complexity of various constraints. This paper proposes an innovative algorithm design approach to address this challenge. Combining the basic walrus optimization algorithm with the adaptive ε-constraint method and introducing the SPM chaotic mapping for population initialization, spiral search strategy, and local enhancement search strategy based on Cauchy mutation and reverse learning significantly enhances the algorithm's optimization performance. On this basis, innovate an adaptive approach ε A New Algorithm for Constraints and Multi Strategy Optimization Improvement (ε-IWOA). To validate the performance of the ε-IWOA algorithm, 24 constrained optimization test functions are used to test its optimization capabilities and effectiveness in solving constrained optimization problems. Experimental results demonstrate that the ε-IWOA algorithm exhibits excellent optimization ability and stable performance. Taking the Taolinkou Reservoir, Daheiting Reservoir, and Panjiakou Reservoir in the middle and lower reaches of the Luanhe River Basin as a case study, this paper applies the ε-IWOA algorithm to practical reservoir scheduling problems by constructing a three-reservoir flood control scheduling system with Luanxian as the control point. A comparative analysis is conducted with the ε-WOA, ε-DE and ε-PSO (particle swarm optimization) algorithms.The experimental results indicate that ε-IWOA algorithm performs the best in optimization, with the occupied flood control capacity of the three reservoirs reaching 89.32%, 90.02%, and 80.95%, respectively. The control points in Luan County can reduce the peak by 49%.This provides a practical and effective solution method for reservoir optimization scheduling models. This study offers new ideas and solutions for flood control optimization scheduling of reservoir groups, contributing to the optimization and development of reservoir scheduling work. [ABSTRACT FROM AUTHOR]

The problem of radio frequency identification network planning (RNP) is one of the biggest challenges in the field of RFID research. In order to improve the service quality of RFID systems, in addition to finding the optimal number and location of readers, the interference between readers and tag coverage should be considered. In order to solve the problem of RFID network planning, this paper proposes an improved multi-objective brainstorming optimization algorithm (IMBSO) based on decomposition: Employ the golden sine operator to improve the convergence speed of the algorithm, and the Cauchy mutation operator is introduced to enhance the ability of the algorithm to jump out of the local optimum. The improved algorithm achieves a balance between exploration and development. This paper also combines the decomposition-based method with the IMBSO algorithm to establish an optimization model to optimize the reader position: the multi-objective optimization problem is transformed into multiple sub-problems by means of decomposition, all objective functions are optimized at the same time, which improves the search efficiency. The method proposed in this paper was tested on the RFID model and data set. Under the same experimental conditions, it was compared with multi-objective particle swarm optimization algorithm, multi-objective firefly algorithm and multi-objective brainstorming algorithm. The experimental results show that the algorithm proposed in this paper can be successfully applied to the problem of radio frequency identification network planning by achieving smaller interference and fewer readers while ensuring greater coverage. [ABSTRACT FROM AUTHOR]

This paper introduces a novel meta-heuristic algorithm named Rhinopithecus Swarm Optimization (RSO) to address optimization problems, particularly those involving high dimensions. The proposed algorithm is inspired by the social behaviors of different groups within the rhinopithecus swarm. RSO categorizes the swarm into mature, adolescent, and infancy individuals. Due to this division of labor, each category of individuals employs unique search methods, including vertical migration, concerted search, and mimicry. To evaluate the effectiveness of RSO, we conducted experiments using the CEC2017 test set and three constrained engineering problems. Each function in the test set was independently executed 36 times. Additionally, we used the Wilcoxon signed-rank test and the Friedman test to analyze the performance of RSO compared to eight well-known optimization algorithms: Dung Beetle Optimizer (DBO), Beluga Whale Optimization (BWO), Salp Swarm Algorithm (SSA), African Vultures Optimization Algorithm (AVOA), Whale Optimization Algorithm (WOA), Atomic Retrospective Learning Bare Bone Particle Swarm Optimization (ARBBPSO), Artificial Gorilla Troops Optimizer (GTO), and Harris Hawks Optimization (HHO). The results indicate that RSO exhibited outstanding performance on the CEC2017 test set for both 30 and 100 dimension. Moreover, RSO ranked first in both dimensions, surpassing the mean rank of the second-ranked algorithms by 7.69% and 42.85%, respectively. Across the three classical engineering design problems, RSO consistently achieves the best results. Overall, it can be concluded that RSO is particularly effective for solving high-dimensional optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the salp swarm optimization algorithm (SSOA)-based novel model reduction algorithm for simplifying commensurate and incommensurate fractional-order systems. In the case of commensurate fractional-order systems (CFOSs), the presented method converts it into a non-fractional-order system first. Then, we implement the SSOA with the stability equations to find a non-fractional-order approximant. Finally, the non-fractional-order approximant is transformed to determine the proposed reduced-order CFOS. It is also demonstrated using numerical examples that some existing methods fail to achieve the stability claim. On the other hand, the stability of the proposed fractional-order approximants is ascertained by incorporating stability equations along with SSOA. Further, the proposed method is extended for the model reduction in incommensurate and unstable fractional-order systems. In this case, the Oustaloup approximation is used along with the SSOA and stability equations to obtain the proposed non-fractional-order approximation. The simulation results corroborate the performance of the suggested method in both cases and establish its transcendency. The obtained results showcase the efficacy of optimization in simplification of fractional-order systems. The work also highlights the importance of order reduction in practical engineering and scientific applications of fractional-order systems. [ABSTRACT FROM AUTHOR]

The gazelle optimization algorithm (GOA) is an iterative optimization method inspired by the agile movements of gazelles, employing adaptive step sizes and velocity adjustments for rapid convergence in continuous search spaces. However, GOA tends to lack diversity, leading to issues like local minima trapping and premature convergence. This paper addresses these limitations by introducing dynamic opposition-based learning (OBL) and incorporating a balanced sine-control-logistic chaotic mapping system, resulting in the improved GOA (IGOA). Dynamic OBL accelerates the search process, improving learning and selecting superior candidate solutions, while chaotic mapping in chaotic local search widens ranges for exploration and local optima escape. Evaluating IGOA against seven algorithms, including GOA and others, across 31 general test functions, the results consistently showcase IGOA's superior efficiency in achieving solutions closest to optima, early convergence, and hit rate when compared to alternative algorithms. [ABSTRACT FROM AUTHOR]

Renewable energy sources (RES) are currently being substantially integrated into the power grid because of the recent liberalization of the energy market and associated benefits to both the environment and the economy. A significant amount of renewable energy sources are stochastic and weather dependent, being integrated into the power system that causes a mismatch between the generation of power and the load demand, which creates major issues like variations in frequency and power transmission between the regions. So it is necessary to maintain the frequency and tie-line power variations within a defined range. This is known as automatic generation control (AGC) or load frequency control (LFC). This paper uses brown bear optimization algorithm (BOA) to tune the PID and cascaded PI-PDN controllers for LFC of the renewable integrated two-area power system. The ITAE objective function is utilized to obtain optimal gains of the PID controller. The performance of LFC with BOA-tuned PID controller is compared with other optimization techniques named grey wolf optimization technique (GWO) and particle swarm optimization (PSO) on a RES integrated two-area power system under various scenarios. Further, the effectiveness of the BOA is verified by comparing performance of the PID and cascaded PI-PDN controllers. According to simulation results, BOA offers superior performance in comparison with the GWO and PSO technique. [ABSTRACT FROM AUTHOR]

Power system operators are faced with the problem of unit commitment belonging to mixed integer programming, which becomes very complicated, as units become large-scale and highly constrained. Because unit commitment problem is a binary problem with commitment and de-commitment, a discrete/binary optimization algorithm with superior performance is required. This paper proposes a novel hybrid binary bat algorithm for unit commitment problem, which consists of two process. To begin with, the proposed binary bat algorithm is applied to determining the commitment schedule of unit commitment problem. Specifically, an improved crossover operator based on exponential-logic-modulo map is proposed to enhance the convergence and maintain the diversity of populations. To prevent the algorithm from falling into a local optimum, a local mutation strategy performs local perturbation. Chaotic map is responsible for updating some parameters to increase the performance of the proposed algorithm. Furthermore, Lambda-iteration method is adopted to solve economic load dispatch in continuous space. Constraint handling is performed using the heuristic constraint produce. The effectiveness of the proposed algorithm is verified by benchmark functions and test systems. Additionally, the simulation results are compared with other well-established heuristic and binary approaches. [ABSTRACT FROM AUTHOR]

Taking a lot of time to solve optimization problems has become a challenge for metaheuristic algorithms. Due to independence of the metaheuristics components, parallel processing is a good option to reduce the computational time and to find high quality solutions that are close to the optimum with an acceptable cost. One of these metaheuristic algorithms is the Sailfish Optimizer (SFO) which is inspired by a group of hunting sailfish. The SFO algorithm uses a simple method to provide a dynamic balance between exploration and exploitation phases, creates a swarm diversity, avoids local optima, and guarantees high convergence speed. It has been shown that the SFO algorithm outperforms various state-of-art metaheuristic algorithms for multimodal and high dimensional benchmark functions and complicated real-world optimization problems in terms of accuracy and speed by CPU and GPU implementation. In this paper, to speedup this algorithm and increase its performance we propose a reconfigurable hardware version of SFO implemented on Field Programmable Gate Array (FPGA). The FPGA-based SFO can be a very good option in many applications with massive calculations. Due to the inherent parallelism and high computing capabilities of FPGA, the SFO algorithm gains optimum computational time despite the complexity of optimization problems. We have compared the performance of the proposed FPGA-based SFO with its CPU and GPU implementation and some other metaheuristic algorithms. The results show the FPGA implementation is considerably faster than the CPU and GPU implementation. Also, it outperforms other compared FPGA-based metaheuristic algorithms in terms of execution time and convergence speed. [ABSTRACT FROM AUTHOR]

Maintaining power balance between generation and demand, as well as frequency regulation, is more difficult in a microgrid (MG) power system, especially when the MG is operating in island mode with the integration of renewable energy (RE) sources and a varying load profile. In this instance, an optimized automatic load frequency control (ALFC) is more successful in lowering frequency deviations and enhancing the stability and resilience of the MG network. Hence, this paper proposes a modified sperm swarm optimization (MSSO) technique for ALFC of a bio and renewable energy (RE) integrated MG system. A chaotic search based on a one-dimensional (1D) chaotic map is adopted to intensify the exploitation and exploration characteristics of the sperm swarm optimization algorithm. The proposed MSSO technique is used to tune the gains of the proportional integral derivative (PID) controller to regulate the frequency of the MG system through the minimization of the integral time absolute error (ITAE) of frequency deviation. The effectiveness of the technique is evaluated in terms of steady-state and transient performance indices for the response of frequency deviation. According to the evaluated results of frequency deviation obtained under different dynamic conditions, the suggested MSSO-tuned PID controller significantly improved transient indices such as settling time, control error, and peak overshoot by a maximum of 39.8%, 11.7%, and 68.9%, respectively, over PID controllers tuned with other techniques (Salp swarm algorithm (SSA), particle swarm optimization (PSO), and sperm swarm optimization (SSO)). In addition, the steady-state indices such as IAE, ITAE, ISE, and ITSE were improved by a maximum of 86.6%, 93.9%, 96.2%, and 98.8%, respectively, using the suggested MSSO technique, as compared to other techniques. Additionally, a sensitivity analysis is performed under varying load conditions, changes in system parameters, and real-time variation in RE sources to validate the resilience. The proposed MSSO technique outperforms other techniques in terms of steady-state and transient indices for the response to frequency deviations, as determined by sensitivity analysis results. The real-time implementation of the proposed controller for the MG system is validated in hardware-in-loop analysis with its stability analysis in the frequency domain. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

Intelligent swarm optimization algorithms have become increasingly common due to their success in solving real-world problems. Dwarf Mongoose Optimization (DMO) algorithm is a newly proposed intelligent swarm optimization algorithm in recent years. It was developed for continuous optimization problem solutions in its original paper. But real-world problems are not always problems that take continuously variable values. Real-world problems are often problems with discrete variables. Therefore, heuristic algorithms proposed for continuous optimization problems need to be updated to solve discrete optimization problems. In this study, DMO has been updated for binary optimization problems and the Binary DMO (BinDMO) algorithm has been proposed. In binary optimization, the search space consists of binary variable values. Transfer functions are often used in the conversion of continuous variable values to binary variable values. In this study, twelve different transfer functions were used (four Z-shaped, four U-shaped, and four Taper-shaped). Thus, twelve different BinDMO variations were obtained (BinDMO1, BinDMO2, ..., BinDMO12). The achievements of BinDMO variations were tested on thirteen different unimodal and multimodal classical benchmark functions. The effectiveness of population sizes on the effectiveness of BinDMO was also investigated. When the results were examined, it was determined that the most successful BinDMO variation was BinDMO1 (with Z1-shaped transfer function). The most successful BinDMO variation was compared with three different binary heuristic algorithms selected from the literature (SO, PDO, and AFT) on CEC-2017 benchmark functions. According to the average results, BinDMO was the most successful binary heuristic algorithm. This has proven that BinDMO can be chosen as an alternative algorithm for binary optimization problems. [ABSTRACT FROM AUTHOR]

The average-derivative optimal method (ADM) is widely applied in frequency-domain forward modeling for its high accuracy and simplicity. Since tuning weighted coefficients can suppress the numerical dispersion, it is extremely important to adopt a suitable optimization algorithm to determine the ADM coefficients. To date, most schemes associated with the ADM have adopted the conventional local optimization algorithms, which are sensitive to the initial value and easy to converge on local optimum. The motivation of this paper is to derive new and more accurate ADM coefficients for 2D frequency-domain elastic-wave equation by the global optimization algorithms, which can escape from the local optimum with a certain probability. We adopt simulated annealing (SA) and particle swarm optimization (PSO) algorithms for global optimization and numerical modeling. Compared with the conventional local optimization algorithm, the global optimization algorithms have smaller phase errors, especially for S-wave phase velocity. Numerical examples demonstrate that the global optimization algorithms produce more accurate results than the local optimization algorithm. [ABSTRACT FROM AUTHOR]

With the transformation of transmission and distribution grids into smart grids that are more dominated by renewable energy, power electronics-based inverters that can improve power quality are becoming more visible. In order to maximize the output voltage quality and reduce the total harmonic distortion (THD), efficient operation of inverters is required. Therefore, in this paper, the problem of harmonic elimination in multilevel inverters is solved by using an adaptive grey wolf optimizer with local search. We have performed a grid search-based landscape analysis of the seven-level inverter to understand the behaviour of the proposed algorithm. For verification, the numerical results of the proposed adaptive grey wolf optimizer are compared with those of the original grey wolf optimization algorithm, a modified version of the grey wolf optimization algorithm, the particle swarm optimization algorithm, multi-verse optimization algorithm, and salp swarm algorithm. In the simulations, we solved the optimization model for three different structures of multilevel inverters (7, 11, and 15 levels) by changing the modulation indexes. It is found that the adaptive grey wolf optimization provides lower total harmonic distortion for different modulation indexes. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) currently have numerous applications, especially in tracking and observing non-human activities. Sensor nodes in WSNs are known to have limited lifespans due to continuous sensing, which causes the battery to drain quickly. Therefore, Energy consumption is a significant research issue in WSN-assisted applications. Energy conservation now places a high priority on exact clustering and the choice of the best route from the sensor nodes to the sink. This research paper proposes a fuzzy with adaptive sailfish optimizer (ASFO) for cluster head selection and improved elephant herd optimization approach to find the most efficient shortest path route to preserve energy efficiency in WSNs. The suggested hybrid approach was implemented in MATLAB and achieved results are compared to those of four widely-used techniques, such as improved artificial bee colony optimization-based clustering (IABC-C), genetic algorithms (GA), particle swarm optimization (PSO), and hierarchical clustering-based CH election (HCCHE) approach. The Fuzzy with ASFO technique improves the Quality of Service (QoS) of performance metrics such as energy usage, packet loss ratio, end-to-end delay, packet delivery ratio, network lifetime, and buffer occupancy. The results show that the suggested Fuzzy with SFO has a better packet delivery ratio (99.8%), packet latency (1.12 s), throughput (98 bps), energy usage (10.90 mJ), network lifetime (5400 cycles), and packet loss ratio (0.6%) than the existing methods (PSO, GA, IABC-C, and HCCHE algorithms). [ABSTRACT FROM AUTHOR]

The chimp optimization algorithm (ChOA) is a nature-inspired algorithm that imitates chimpanzees' individual intelligence and hunting behaviors. In this algorithm, the hunting process consists of four steps: driving, blocking, chasing, and attacking. Because of the novelty of ChOA, the steps of the hunting process have been modeled in the simplest possible way, leading to slow and premature convergence similar to other iterative algorithms. This paper proposes six spiral functions and introduces two novel hybrid spiral functions (SEB-ChOA) to rectify the abovementioned deficiencies. The SEB-ChOAs' performance is evaluated on 23 standard benchmarks, 20 benchmarks of IEEE CEC-2005, 10 cases of IEEE CEC06-2019 test-suite, and 12 constrained real-world engineering problems of IEEE CEC-2020. The SEB-ChOAs are compared with three groups of optimization algorithms, including Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) as the most well-known optimization algorithms, Slime Mould Algorithm (SMA), Marine Predators Algorithm (MPA), Ant Lion Optimization (ALO), Henry Gas Solubility Optimization (HGSO), as almost novel optimization algorithms, and jDE100 and DISHchain1e+12, as winners of IEEE CEC06-2019 competition, and also EBOwithCMAR and CIPDE as superior secondary optimization algorithms. The SEB-ChOAs reached the first rank among almost all benchmarks and demonstrated very competitive results compared to jDE100 and DISHchain1e+12 as the best-performing optimizers. Statistical evidence shows that the SEB-ChOA outperforms the PSO, GA, SMA, MPA, ALO, and HGSO optimizers while producing results comparable to those of the jDE100 and DISHchain1e+12 algorithms. [ABSTRACT FROM AUTHOR]

Satellite constellation deployment is a cohesive mission where the trajectories of satellites must be planned concurrently. This paper presents an Integrated Program for Optimal Deployment of a Satellite Constellation (PODSC) consisting of m non-identical satellites in any desired arrangement in n orbital planes. The PODSC can optimize the scheduling of mission timelines, ensuring effective coordination with the trajectory of each satellite. This involves meticulous planning that considers temporal constraints and regards collision avoidance constraint. Additionally, the PODSC can select the most favorable deployment strategy, considering the trade-offs between time and fuel consumption across all possible deployment methods. The PODSC also utilizes an innovative Perturbed Multi-impulsive Inclined transfer trajectory Amalgamated with a modified Lambert targeting problem (PMIAL). The main idea of designing the mentioned maneuver is to eliminate the defects of the Lambert Targeting Problem (LTP). The LTP cannot account for space perturbations. Moreover, the LTP faces challenges when attempting to align the transfer trajectory tangentially with the final orbit in situations where there exists a substantial disparity in inclination and right ascension between the initial and final orbits. The PMIAL establishes three consecutive steps to fix the mentioned defects. Balancing the trade-off between time and achieving optimal fuel consumption will be possible by applying a hybrid IWO/PSO (The hybrid Invasive Weed Optimization/Particle Swarm Optimization) optimization algorithm in both PMIAL and PODSC. The case study will involve simulating two constellation deployment missions, with a particular focus on considering the Earth's oblateness as a notable perturbation; however, the proposed algorithms can consider any space perturbations. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

In this paper, a multilayer perceptron (MLP)-type artificial neural network model with a back-propagation training algorithm is utilized to model the bubble growth and bubble dynamics parameters in nucleate boiling with a non-uniform electric field. The influences of the electric field on different parameters that describe bubble's behaviors including bubble waiting time, bubble departure frequency, bubble growth time, and bubble departure diameter are considered. This study models single bubble dynamic behaviors of R113 created on a heater in an inconsistent electric field by utilizing a MLP neural network optimized by four different swarm-based optimization algorithms, namely: Salp Swarm Algorithm (SSA), Grey Wolf Optimizer (GWO), Artificial Bee Colony (ABC) algorithm, and Particle Swarm Optimization (PSO). For evaluating the model effectiveness, the MSE value (Mean-Square Error) of the artificial neural network model with various optimization algorithms is measured and compared. The results suggest that the optimal networks in the two-hidden layer and three-hidden layer models for the bubble departure diameter improve MSE by 33.85% and 35.27%, respectively, when compared with the best response in the one-hidden layer model. Additionally, for bubble growth time, the networks with two hidden layers and three hidden layers have the 44.51% and 45.85% reduction in error, when compared with the network with one hidden layer, respectively. For the departure frequency, the error reduction in the two-layer and three-layer networks is 46.85% and 62.32%, respectively. For bubble waiting time, the best networks in the two hidden-layer and three hidden-layer models improve MSE by 52.44% and 62.27% compared with the best 1HL model response, respectively. Also, the two algorithms of SSA and GWO are able to compete well (comparable MSE) with the PSO and ABC algorithms. [ABSTRACT FROM AUTHOR]

Using of ultra-wideband (UWB) technology in radio transceiver systems has increased in recent years due to high-speed data transmission, low power dissipation, low cost, and low complexity. In particular, distributed amplifier (DA) is a critical component of transceiver in UWB technology. However, designing an ultra-wideband DA with high performance becomes challenging. The DA design suffers from the tight trade-offs between the amplifier parameters such as gain, noise, linearity, input/output impedance matching, and power dissipation. In this paper, a new approach for multi-objective optimization of the DA is introduced. In the proposed approach, the meta-heuristic optimization techniques are applied over the entire bandwidth of the UWB, while the most recent optimization approaches for amplifiers are performed at the center frequency and they can't achieve the proper design specifications for wideband amplifiers. The simultaneous optimization of power gain (S21), noise figure (NF), input and output return loss (S11 and S22) are conducted over the wide bandwidth using three multi-objective optimization algorithms including Multi-Objective Inclined Planes System Optimization (MOIPO), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Multi-Objective Particle Swarm Optimization (MOPSO). The obtained results demonstrate the tapered matrix DA optimized by MOIPO exhibits better performance than others. The circuit simulations are performed in 0.18 µm TSMC RF-CMOS technology. Simulation results show that the optimized tapered matrix DA by MOIPO, compared to NSGA-II and MOPSO, exhibits a good performance over the frequency band of 0.1–28 GHz with maximum S21 of 12.9 dB, NF less than 5.9 dB, S11 and S22 below than − 10 dB over the whole frequency band. The DC power dissipation is 25 mW from a 1.5 V supply. [ABSTRACT FROM AUTHOR]

Locating and maintaining multiple Pareto optimal sets (PSs) in the decision space simultaneously is a challenging issue in solving multimodal multiobjective optimization problems (MMOPs). To deal with this challenge, this paper proposed a multipopulation particle swarm optimization based on divergent guidance and knowledge transfer (MPPSO-DGKT). First, a divergent guidance strategy is proposed to utilize the information of superior and inferior particles in the subpopulation. This strategy can alleviate the premature convergence due to the excessive influence of the global Pareto optimal solutions found so far. Second, a knowledge transfer strategy is developed to promote the knowledge transfer between different subpopulations, which can enhance the exploitation ability of the population. Finally, the update and selection strategy is used to keep more promising nondominated solutions, which can help the algorithm to obtain global and local PSs. To verify the effectiveness of the proposed algorithm, MPPSO-DGKT is compared with seven state-of-the-art multimodal multiobjective optimization algorithms on CEC2020 competition. Experimental results indicate that the proposed algorithm is more competitive than its competitors when solving MMOPs with both global and local PSs. [ABSTRACT FROM AUTHOR]

In this paper, we proposed a method for optimizing the pressure angle of the cam curve in a zoom system using Particle Swarm Optimization (PSO) algorithm. This method improved the design efficiency of the cam curve and effectively solved issues such as cam motion jamming caused by excessive pressure angles. Firstly, the cam structure was analyzed based on the mechanical theory. Secondly, in the phase of the pressure angle optimization, constraints were designed and a new fitness function was introduced as an indicator to obtain the optimal solution of the nonlinearly broaden parameter of the cam curve in a multidimensional space. Finally, the zoom curve of the designed 8x optical system was optimized using the proposed method. The results showed that the maximum pressure angle of the zoom group decreased from 72.7° to 44.8°, and the maximum pressure angle of the compensation group decreased from 52.6° to 44.2°. In conclusion, this method could effectively improve the performance and lifespan of cam zoom systems, providing positive guidance for the engineering application of continuous zoom systems. [ABSTRACT FROM AUTHOR]

Pelican optimization algorithm (POA) is a new heuristic algorithm that simulates the pelican's natural behavior in the hunting process. In order to improve the convergence speed and accuracy of the original algorithm and to solve the problem that the original algorithm is easy to fall into local optimization, an improved POA based on chaotic interference factor and elementary mathematical function is proposed. In this paper, ten different chaotic interference factors are introduced in the exploration stage of POA. After selecting an improved POA with the best performance, six different elementary mathematical functions are introduced in the exploitation stage of POA to improve its optimization performance. Then 30 benchmark functions in CEC-BC-2017 were used to test the performance of different improved algorithms. The experimental results showed that the performance of the improved algorithms have been improved effectively compared with the original POA, and the accuracy and optimization ability to balance exploration and exploitation were significantly improved. Compared with seven different algorithms, the feasibility of the improved POA proposed in this paper is proved. Finally, four engineering design problems are optimized, and the simulation results show that among four different engineering design problems, the improved POA proposed in this paper is obviously superior to the original POA, which proves that the improved POA based on chaotic interference factor and elementary function is competitive in optimization performance on function optimization and practical engineering applications. [ABSTRACT FROM AUTHOR]

Path planning is one of the most critical issues in many related fields including UAVs. Many researchers have addressed this problem according to different conditions and limitations, but modelling the 3-D space and routing with an evolutional algorithm in such spaces is an open issue. So, in this paper, we first, introduce a method to grids the environment using geometrical shapes. This can reduce the random states of cell decomposition and increases the computational speed. We then propose an effective routing algorithm based on the butterfly optimization algorithm (BOA). It can simultaneously optimize multiple path planning objectives. It uses an objective function to compute the shortest path, based on obstacle avoidance and the UAV's operational power minimization. A novel concept, the intelligent throwing agent, used in this algorithm prevents getting stuck in local optima and increases the network coverage in path planning. The throwing agent prevents the collision of the UAV with the obstacles using geometrical techniques and contour lines. The simulation results show that BOA has the least and second-least cost in best-case and worst-case scenarios in comparison with ant colony and particle swarm. Its run time and the optimal value of the fitting function are also better than the two other algorithms. [ABSTRACT FROM AUTHOR]

Large amounts of geographical and property rights information are contained in 3D cadastral property units, although the amount of cadastral information expressed from various perspectives varies. Therefore, it is crucial to choose a perspective that is compatible with human visual perception and conveys the most data as the perspective changes. This paper proposes an optimization method for generating the optimal view of 3D cadastral property units to address the above issues. The construction of candidate perspectives is the first step, followed by the calculation of feature values, including visibility of 3D boundary points under each candidate perspective, visible area ratio, and visual comfort. Then, an improved particle swarm optimization technique is used to determine the optimal view of 3D cadastral property units and the ideal viewpoint for the expected input model. The research results show that the selected optimal viewpoint fully considers human visual comfort, can accommodate a large amount of cadastral information, and can be used as a mapping drawing in social applications of 3D cadastral systems. This viewpoint can effectively supplement front views, side views, and axis side views, enabling more visual information to be transmitted in 3D religion maps and 3D property right maps and improving readability. [ABSTRACT FROM AUTHOR]

Water quality is an issue of global importance in environmental research. The productivity, safety, and distribution of fresh and pure water to the population are priorities for every nation worldwide. Currently, reverse osmosis (RO) desalination plants are one of the best methods accepted worldwide due to their simplicity and high performance. This paper focuses on the design of a PID controller for the Doha plant RO using the class topper optimization (CTO) algorithm. In addition, a reduced-order model is created using the same algorithm for ease of analysis. The plant RO is decoupled, and then the PID controller is designed for two non-conducting loops. The effectiveness of the proposed method is shown by comparing its response characteristics with other state-of-the-art optimization techniques, namely artificial bee colony, differential evolution, and particle swarm optimization. The simulation comparison shows the better performance of the CTO algorithm in tuning the PID controllers. [ABSTRACT FROM AUTHOR]

The salp swarm algorithm (SSA) is a well-known optimization algorithm that is increasingly being utilized to solve many sorts of optimization problems. However, SSA may converge to sub-optimal solutions when it is applied to discrete problems such as the feature selection (FS) problem. This paper presents the enhanced opposition-based learning salp swarm algorithm (EOSSA), which is an improved SSA algorithm for solving the FS problem in intrusion detection systems (IDS). EOSSA incorporates four improvements into the original SSA algorithm. Firstly, the opposition-based learning (OBL) method is used in the initialization step of SSA to boost its population diversity. Secondly, the Elite opposition-based learning (EOBL) is used in the improvement loop of SSA to improve its exploration ability. Third, a variable neighborhood search (VNS) method is used in the improvement loop of SSA to improve its exploration mechanism to improve the local search space. Lastly, the Sigmoid binary transform function is used to convert the continuous candidate solutions produced by SSA into discrete binary solutions. EOSSA was evaluated against eighteen popular optimization algorithms (e.g., improved salp swarm algorithm based on opposition-based learning (ISSA), SSA, particle swarm algorithm (PSO), cuckoo search (CS), bat algorithm (BA), and Harris Hawk Optimization (HHO)) using eleven popular intrusion detection datasets (CICIDS2017, CSE-CIC-IDS2018, CICDDOS2019, CIRA-CIC-DoH, Intrusion detection 2018, UNSW-NB15, NSL-KDD, Phishing Legitimate, Malmem2022, IoT, and LUFlow Network) to Detect IoT Botnet Attacks. Moreover, EOSSA was compared with four machine learning algorithms (Decision Tree (DT), logistic regression (LR), Naive Bayes (NB), and K-Nearest Neighborhood (KNN)). The overall simulation results suggested that the proposed method is superior to the other algorithms in terms of the accuracy and number of selected features. The statistical analysis of the simulation results using the Friedman and Wilcoxon signed-rank test confirms the superiority of the proposed method. [ABSTRACT FROM AUTHOR]

Automatic tooth arrangement and path planning play an essential role in computer-aided orthodontic treatment. However, state-of-the-art methods have some shortcomings: low efficiency, excessive cost of displacements or collisions and insufficient accuracy. To address these issues, this paper proposes an innovative orthodontic path planning method based on the improved gray wolf optimization algorithm, which is called OPP-IGWO. First, the tooth model is preprocessed to obtain initial pose in which each tooth is segmented and built up with an oriented bounding box. Next, the target pose of each tooth is determined through the ideal dental arch curve and the optimal jaw principle. Finally, the path from the initial pose to the target pose of each tooth is planned based on IGWO, which is improved mainly from three aspects: (1) The greedy idea is adopted to initialize the gray wolf population based on dental interpolation. (2) The linear convergence factor in the traditional gray wolf optimization algorithm (GWO) is replaced with a nonlinear convergence factor. (3) We propose a position update strategy based on a dynamic weighting approach, which introduces a learning rate for each gray wolf. The experimental results show that our OPP-IGWO method outperforms the state-of-the-art methods. Compared with improved genetic algorithm, multiparticle improved swarm optimization, normal simplified mean particle swarm optimization algorithm, improved artificial bee colony algorithm, chaotic gray wolf optimization algorithm, hybrid gray wolf optimization algorithm and differential evolution algorithm, random walk gray wolf Optimization algorithm and reinforcement learning gray wolf optimization algorithm, the OPP-IGWO has an improvement on performance by 15.46%, 2.24%, 7.18%, 15.99%, 7.67%, 1.01%, 1.42%, 10.23%, respectively. [ABSTRACT FROM AUTHOR]

Fatigue oblique cracks are the most common type of surface damage on steel rails, although they are microscopic and difficult to detect. Rail crack can occur as the crack length increases. This paper presents a method for detecting laser ultrasonic surface waves that is fully non-contact and unaffected by complicated surfaces. To solve the difficulties of low photoacoustic conversion efficiency and poor imaging impact of laser ultrasound, a solution combining particle swarm optimization (PSO) based VMD parameter optimization algorithm with Sobel image edge processing algorithm is presented. This enhances the signal-to-noise ratio (SNR) and image accuracy while also allowing for the quantitative identification of oblique fissures of varying lengths. The highest quantitative error is less than 4%, and the smallest quantitative error is 1.4%. [ABSTRACT FROM AUTHOR]

Solar power generation (SPG) is uncertain and less efficient under unequal shading conditions. It has a highly nonlinear power versus voltage (P–V) curve that has multiple peaks which are categorized as a global maximum power point (GMPP) and local maximum power point (LMPP). It requires a better tracking method that continuously tracks the GMPP instead of the LMPP. Many conventional methods are unable to track the GMPP. The meta-heuristic methods are the better solutions for this problem. However, still there is a need to improve the performance in terms of tracking speed, tracking efficiency and better exploration and exploitation phases, which are the essential parameters in intelligent optimization. This paper proposed a new hybrid meta-heuristic technique, arithmetic-based grey wolf optimization (AGWO), a combination of arithmetic optimization algorithm (AOA) and grey wolf optimization (GWO). The first one is mainly for the exploration phase, and the other is for the exploitation phase; together, the combination enhances the search behaviour of the algorithm. The proposed AGWO was executed in MATLAB/Simulink and evaluated with a real-time simulator to validate its performance. This is compared with other relevant methods like AOA, GWO, particle swarm optimization (PSO) and perturb and observe (P&O) methods. The results indicated that the suggested AGWO technique shows better improvement in tracking efficiency of about 16.41% more than P&O during pattern 1. Also, it shows an excellent tracking speed as compared with PSO is 60.42% raise during pattern 3. [ABSTRACT FROM AUTHOR]

Hyper-parameter optimization is a crucial task for designing kernel-based machine learning models. Their values can be set by using various optimization algorithms. But a data-dependent objective function makes hyper-parameter's configuration changes over time in a dynamic environment. A dynamic environment is an environment where training data keep getting added continuously over time. To find the optimum values for the hyper-parameters in such an environment, one needs to run the optimization algorithm repeatedly over time. But due to the dependency of the objective function on data, the average time complexity of the optimization process increases. This paper work proposes a novel knowledge-based approach that uses particle swarm optimization (PSO) as the base optimization algorithm to optimize the hyper-parameters of support vector machine. We have introduced two major modules for designing this framework—a knowledge transfer module and a drift detection module. The knowledge transfer module in our proposed framework generates knowledge by running PSO and transfers this knowledge to the consequent time instances. On the other hand, the drift detection module is responsible for detecting changes in the objective function when new data get added to the existing data. This drift detection module helps to utilize the transferred knowledge at a particular time instance to reduce the execution time of the overall optimization process. The proposed framework has been evaluated using various standard datasets such as Adult, DNA, Nist-Digits, Segment, Splice, Mushroom and Usps for five consecutive time instances and found the average execution time as 30.72 s, which is better than the execution time 36.89 s recorded using general PSO. We have also found that our proposed framework performs the optimization of hyper-parameters much faster than the other existing approaches such as grid search, chained-PSO, dynamic model selection and quantized dynamic multi-PSO. [ABSTRACT FROM AUTHOR]

In this paper, we study numerical solution of ruin probability of continuous time model. We develop an effective optimal adaptive particle swarm optimization-triangular neural network (PSO-TNN), which consists of three parts: particle swarm optimization algorithm (PSO) improved trigonometric function, extreme learning machine algorithm with initial conditions (IELM) and improved reduction algorithm. The results obtained that PSO-TNN is superior to triangular neural network (TNN) and physics-informed neural networks (PINNs), and PSO is superior to Aquila Optimizer (AO), Smell Agent Optimization (SAO), African vultures optimization algorithm (AVOA), Arithmetic optimization algorithm (AOA) in the optimization of neural network. Because the relationship between the number of neural networks and the mean square error is uncertain, we propose the adaptive reduction algorithm (AR). Through the comparison of numerical solutions with the analytical solutions and traditional numerical solutions, the PSO-TNN algorithm clearly reduced the mean square error and relative error. The PSO-TNN algorithm shows a clear improvement in terms of accuracy and overall efficiency. [ABSTRACT FROM AUTHOR]

The performance of conceptual catchment runoff models may highly depend on the specific choice of calibration methods made by the user. Particle Swarm Optimization (PSO) and Differential Evolution (DE) are two well-known families of Evolutionary Algorithms that are widely used for calibration of hydrological and environmental models. In the present paper, five DE and five PSO optimization algorithms are compared regarding calibration of two conceptual models, namely the Swedish HBV model (Hydrologiska Byrans Vattenavdelning model) and the French GR4J model (modèle du Génie Rural à 4 paramètres Journalier) of the Kamienna catchment runoff. This catchment is located in the middle part of Poland. The main goal of the study was to find out whether DE or PSO algorithms would be better suited for calibration of conceptual rainfall-runoff models. In general, four out of five DE algorithms perform better than four out of five PSO methods, at least for the calibration data. However, one DE algorithm constantly performs very poorly, while one PSO algorithm is among the best optimizers. Large differences are observed between results obtained for calibration and validation data sets. Differences between optimization algorithms are lower for the GR4J than for the HBV model, probably because GR4J has fewer parameters to optimize than HBV. [ABSTRACT FROM AUTHOR]

Design, tuning and implementation of various control structures, such as one-degree of freedom (DOF) and two-DOF structures of both integer-order and fractional-order proportional integral derivative controller to stabilize the magnetic levitation plant, is proposed in this paper. The two-DOF structure has been formulated by incorporating a separate control loop in the existing one-DOF control structure. The parameters of all the controller structures have been tuned using evolutionary algorithms, namely, particle swarm optimization (PSO), teaching learning-based optimization (TLBO), genetic algorithm (GA) and black widow optimization (BWO). The performance of the algorithms has been compared on the basis of Wilcoxon signed-rank test and Friedman test. The controller structures have also been tested for disturbance rejection, by applying a periodic pulse distribution at the output of the closed loop. It is found that the system achieves iso-damping characteristic, exhibiting flat phase-plot at the vicinity of the gain cross-over frequency. It is also observed that the two-DOF FOPID controller structure exhibits an improvement of 45.02%, 7.6% and 7.81% in peak overshoot (OS), settling time (Ts) and rise time (Tr), respectively, over two-DOF IOPID, in case of GA. In comparison with GA, the improvement of 73.02%, 4.31% and 5.7% is witnessed for OS, Ts and Tr in case of PSO and 20.029%, 11.03% and 10.60% improvement is observed for OS, Ts, Tr in the case of TLBO algorithm. In contrast, the BWO-tuned two-DOF FOPID controller exhibits superior time-domain response as it generates an improvement of nearly 100%, 29.28% and 14.76% for OS, Ts and Tr. The proposed controller achieves superior disturbance rejection ability measured in terms of sensitivity and complementary sensitivity compared to other state-of-art algorithms. [ABSTRACT FROM AUTHOR]

As a common data-driven method, artificial neural networks have been widely used in electricity spot price forecasting. To improve the accuracy of short-term forecasts, this paper proposes an optimized artificial neural network model for monthly electricity spot prices forecasting. A genetic algorithm is applied to regulate the weights and biases parameters of the artificial neural network structure. This study uses various historical dataset at monthly periods selected from Nordic electricity spot prices. For efficiency comparison, one-step ahead forecast method based on Schwartz-Smith stochastic model and two other prediction models, artificial neural network trained by Levenberg–Marquardt and particle swarm optimization algorithms are also presented. The comparison results show that the prediction model based on the genetic optimization algorithm is more accurate than the other prediction models. The proposed forecasting model can be considered as an alternative technique for the electricity spot price forecasting in the Nordic regions. [ABSTRACT FROM AUTHOR]

In this paper, the medical image watermarking technique is performed by using lifting wavelet transform, singular value decomposition, and Hessenberg decomposition. Multimedia security is one of the most significant concerns in the current digital era even though it is effortless to reproduce, disseminate, and modify multimedia data. Digital watermarking is a technique for shielding critical information to protect it from illegitimate duplication and distribution. The performance of the proposed scheme is checked with several wavelets. For this purpose, various wavelets such as Haar, Daubechies, Symlet, biorthogonal, and reverse biorthogonal are applied. The scaling factor plays a significant role in watermarking. So, to get the optimized scaling factor, particle swarm optimization and JAYA optimization algorithms are used. The authentication process is done by using advanced encryption standards. The performance of the proposed algorithm is checked by applying different types of attacks such as salt and pepper noise, Gaussian noise, filtering, geometrical, and compression attacks. Peak signal-to-noise ratio, normalized correlation coefficient, mean square error, and structural similarity index measurement are calculated to evaluate the resilience and indistinguishability of the proposed watermarking algorithm. The results of the proposed technique show the significant improvement in the performance and can be used to protect the critical medical data. [ABSTRACT FROM AUTHOR]

A novel optimization algorithm called musical chairs algorithm (MCA) is introduced in this paper for a shorter convergence time and lower failure rate compared to other optimization algorithms. This idea is implemented by using several search agents at the beginning of optimization steps and reduces this number gradually by removing the worst solutions. This idea is inspired by the musical chairs game in which the players and chairs are reduced by one in each round of the game. The proposed methodology has been compared with 10 other optimization algorithms for 10 benchmark functions. The results obtained from this comparison study showed superior performance of the MCA compared to the other optimization algorithms for all benchmark functions and different numbers of search agents. The convergence time varied between 3.8% and 18.2% compared to the average convergence time for all optimization algorithms applied with all benchmark functions. At the same time, the failure rate of the MCA is 0% for all the benchmark functions, but other optimization algorithms give a percentage of the failure rate. Moreover, the MCA is applied to feature selection of load forecasting as a real-world application which is vital for smart grid applications. The MCA is modified from continuous to binary MCA (BMCA). The BMCA is compared to several optimization algorithms, where it outperforms other optimization algorithms to select the best set of features to quickly and correctly learn the forecasting model. The accuracy of the obtained results from BMCA is increased to 96.7% compared to 70% of other algorithms, and the convergence time is reduced to 0.096 s compared to 18 s for other optimization algorithms. The outstanding results of MCA compared to the other optimization algorithms prove its superiority for all types of applications even with very complex benchmark functions. [ABSTRACT FROM AUTHOR]

The Grey Wolf Optimizer (GWO) is a novel population-based optimization algorithm. It has become quite popular among researchers in the robotic domain recently. Target searching is an application of robotics. This paper proposes an exploration enhanced robotic grey wolf optimizer (E2RGWO) algorithm based on Robotic Grey Wolf Optimizer for swarm-based target searching in an unknown environment. The position update equation is discussed using a random individual from the population, which guides the search to enhance the exploration of the grey wolf. It also uses nonlinear control of parameter a → to balance the exploration and exploitation, making it suitable for multi-target search applications. It also uses an adaptive inertia weight coefficient depending on the aggregation degree and evolutionary speed to enhance exploration and improves diversity. The comparison with the existing methodology for target search shows that the E2RGWO algorithm significantly improves the detection rate and search latency. [ABSTRACT FROM AUTHOR]

The goal of the multi-objective optimization algorithm is to quickly and accurately find a set of trade-off solutions. This paper develops a clustering-based competitive multi-objective particle swarm optimizer using the enhanced grid for solving multi-objective optimization problems, named EGC-CMOPSO. The enhanced grid mechanism involved in EGC-CMOPSO is designed to locate superior Pareto optimal solutions. Subsequently, a hierarchical-based clustering is established on the grid for improving the accuracy rate of the grid selection. Due to the adaptive division of clustering centers, EGC-CMOPSO is applicable for solving MOPs with various Pareto front (PF) shapes. Particularly, the inferior solutions are discarded and the leading particles are identified by the comprehensive ranking of particles in each cluster. Finally, the selected leading particles compete against each other, and the winner guides the update of the current particle. The proposed EGC-CMOPSO and the eight latest multi-objective optimization algorithms are performed on 21 test problems. The experimental results validate that the proposed EGC-CMOPSO is capable of handling multi-objective optimization problems (MOPs) and obtaining superior performance on both convergence and diversity. [ABSTRACT FROM AUTHOR]

The application of three different categories such as swarm-based, physics-based, and evolutionary-based techniques to various optimization problems related to different fields gained importance due to accuracy, speed and least chance to fall in local minima. Although there are number of physics based optimization techniques available to solve the optimization problems, however, they suffer from their complexity and may require multiple runs to achieve the optimum value. This paper focuses on a simple physics based problem which outperforms few of the existing algorithms. This work investigates the physics-based Lens formula integration using a population-based approach. The contender for a population-level solution to picture obstructions created by a convex, concave, or combination of the two lenses is the item with multiple dimensional locations. The object's location is updated using the image position. The fundamental goals of population-based optimization algorithms are highlighted by the concave, convex, or combination of both lenses, which enhances the speed of exploration, exploitation, and local optimum avoidance of the search space. The focal length equation, controls how the object's picture is produced, may be altered by specifying a number of random and adaptive factors to highlight the exploitation and exploration of the search space. The capacity of the proposed algorithm for exploitation, exploration, utilisation of the search space, avoidance of local minima, and attainment of global maxima is validated using unimodal, multimodal, and composite benchmark functions. In addition, a variety of real-world engineering issues taken into account to verify the performance of the proposed algorithm. The observations compared with few fundamental optimization techniques of the same category and found the proposed solution better performing in some context than the existing ones. [ABSTRACT FROM AUTHOR]

The evolutionary game theory aims to simulate different decision strategies in populations of individuals and to determine how the population evolves. Compared to strategies between two agents, such as cooperation or noncooperation, strategies on multiple agents are rather challenging and difficult to be simulated via traditional methods. Particularly, in a knowledge spillover problem (KSP), cooperation strategies among more than hundreds of individuals need to be simulated. At the same time, the brain storm optimization (BSO) algorithm, which is a data-driven and model-driven hybrid paradigm, has the potential to simulate the complex behaviors in a group of simple individuals. In this paper, a modified BSO algorithm has been used to solve KSP from the perspective of evolutionary game theory. Knowledge spillover (KS) is the sharing or exchanging of knowledge resources among individuals. Firstly, the KS and evolutionary game theory were introduced. Then, the KS model and KS optimization problems were built from the evolutionary game perspective. Lastly, the modified BSO algorithms were utilized to solve KS optimization problems. Based on the applications of BSO algorithms for KSP, the properties of different swarm optimization algorithms can be understood better. More efficient algorithms could be designed to solve different real-world evolutionary game problems. [ABSTRACT FROM AUTHOR]

In the past few decades, meta-heuristic algorithms have become a research hotspot in the field of evolutionary computing. The electric fish optimization algorithm (EFO) is a new meta-heuristic algorithm. Because of its simplicity and easy implementation, it has attracted the attention of researchers. However, it still faces premature convergence and poor balance between exploration and exploitation. To address this problems, an orthogonal electric fish optimization algorithm with quantization (QOXEFO) is proposed in this paper. In QOXEFO, orthogonal cross-design and quantification technique are employed to enhance the diversity of population and convergence precision of EFO. Secondly, the dynamic boundary mechanism is adopted to improve the convergence speed of EFO. At the same time, a sine-based update strategy of active electrolocation is used to change the direction of movement of individuals, thereby helping them jump out of the local optimum. Finally, the CEC2017 benchmark function and Speed reducer design problem are used to verify the performance of the proposed QOXEFO. Experimental results and statistical analysis show that compared with 9 famous evolutionary algorithms, QOXEFO is competitive in solution accuracy and convergence speed. [ABSTRACT FROM AUTHOR]

This paper proposes the multi-objective variant of the recently-introduced fitness dependent optimizer (FDO). The algorithm is called a multi-objective fitness dependent optimizer (MOFDO) and is equipped with all five types of knowledge (situational, normative, topographical, domain, and historical knowledge) as in FDO. MOFDO is tested on two standard benchmarks for the performance-proof purpose: classical ZDT test functions, which is a widespread test suite that takes its name from its authors Zitzler, Deb, and Thiele, and on IEEE Congress of Evolutionary Computation benchmark (CEC-2019) multi-modal multi-objective functions. MOFDO results are compared to the latest variant of multi-objective particle swarm optimization, non-dominated sorting genetic algorithm third improvement (NSGA-III), and multi-objective dragonfly algorithm. The comparative study shows the superiority of MOFDO in most cases and comparative results in other cases. Moreover, MOFDO is used for optimizing real-world engineering problems (e.g., welded beam design problems). It is observed that the proposed algorithm successfully provides a wide variety of well-distributed feasible solutions, which enable the decision-makers to have more applicable-comfort choices to consider. [ABSTRACT FROM AUTHOR]

In PV power generation systems, flexible power point tracking control needs to be introduced to regulate the output power on the PV side for meeting the grid connection requirements. However, traditional FPPT control methods tend to cause certain oscillations in the system. This paper proposes an FPPT method based on the adaptive lion swarm optimization algorithm (ALSO). First, an ALSO algorithm is proposed, which adds adaptive scaling parameters to the lion swarm optimization algorithm, so that the number of adult lions can be adjusted adaptively with increasing iterations to coordinate the local exploitation and global search abilities of the algorithm. Then the ALSO is used to selectively optimize the operation of different intervals so as to achieve the FPPT control on the left or right side of the maximum power point. The test experiments for the ALSO algorithm show that the ALSO algorithm has strong local exploitation and global search abilities, which is better than the compared algorithms. Through the simulations on the PV grid-connected system, the validity and superiority of the ALSO-based method over the traditional FPPT algorithm in terms of dynamic and steady-state performance are verified under different operating conditions. [ABSTRACT FROM AUTHOR]

This paper suggests an optimal maximum power point tracking (MPPT) control scheme for a grid-connected photovoltaic (PV) system using the arithmetic optimization algorithm (AOA). The parameters of the proportional-integral (PI) controller-based incremental conductance (IC) MPPT are optimally selected using AOA. To accomplish this study, a 100-kW benchmark PV system connected to a medium distribution utility is constructed and analyzed employing MATLAB/SIMULINK. The optimization framework seeks to minimize four standard benchmark performance indices, then select the best of the best among them. To verify the efficacy of the recommended methodology, a comprehensive comparison is conducted between AOA-based PI-IC-MPPT, modified incremental conductance MPPT (MIC), grey wolf optimization (GWO), genetic algorithm (GA), and particle swarm optimization (PSO)-based MPPT. The proposed control approach has achieved a reduction of 61, 3, 4.5, and 26.9% in the rise time and a decrease of 94, 84.7, 86.6, and 79.3% in the settling time compared with MIC, GWO, GA, and PSO in extracting MPPT of the proposed system, respectively. [ABSTRACT FROM AUTHOR]

Highly dynamic induction motor drives require converter-driven low-inertia induction machines, which are continuously operated with high torque dynamics to accelerate and brake linear or rotating masses in a highly dynamic manner. However, every rapid change in the torque requires a correspondingly rapid change in the rotor current, which leads to the excitation of the transient skin effect in the massive rotor bars of squirrel cage motors. The additional eddy current losses resulting from the transient skin effect can cause overheating problems, especially in the case of deep rotor bars with fast load cycles. This paper is intended to show the reader how the additional rotor losses caused by the transient skin effect can be reduced through the design optimization procedure. At the same time, the other operating characteristics of the induction motor drive are not impaired. In addition, the moment of inertia of the drive motor can also be reduced as another optimization target by the multi-objective optimization process. As the underlying optimization algorithm, the differential evolution and the particle swarm optimization are implemented and compared with each other in order to verify the correctness of the optimization results. During the whole optimization work, great importance is attached to the interdisciplinary calculation method so that the interaction between the electromagnetic, thermal, fluid mechanical and control engineering processes can be taken into account through the coupled calculation. In the end, the theoretical and simulative findings are verified with two test benches. [ABSTRACT FROM AUTHOR]

This paper proposes an enhanced version of Moth Flame Optimization (MFO) algorithm, called Enhanced Chaotic Lévy Opposition-based MFO (ECLO-MFO) for solving the mesh router nodes placement problem in wireless mesh network (WMN-MRNP). The proposed ECLO-MFO incorporates three strategies including the chaotic map concept, the Lévy flight strategy, and the Opposition-Based Learning (OBL) technique to enhance the optimization performance of MFO. Firstly, chaotic maps are used to increase the chaotic stochastic behavior of the MFO algorithm. Lévy flight distribution is adopted to increase the population diversity of MFO. Finally, OBL is introduced to improve the convergence speed of MFO and to explore the search space effectively. The effectiveness of the proposed ECLO-MFO is tested based on various scenarios under different settings, considering network connectivity and client coverage metrics. The results of simulation obtained using MATLAB 2020a demonstrate the accuracy and superiority of ECLO-MFO in determining the optimal positions of mesh routers when compared with the original MFO and ten other optimization algorithms such as Genetic Algorithm (GA), Simulated Annealing (SA), Harmony Search (HS), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Cuckoo Search Algorithm (CS), Bat Algorithm (BA), Firefly optimization (FA), Grey Wolf Optimizer (GWO), and Whale Optimization Algorithm (WOA). [ABSTRACT FROM AUTHOR]