Search

In order to cope with the problems of energy shortage and environmental pollution, carbon emissions need to be reduced and so the structure of the power grid is constantly being optimized. Traditional centralized power networks are not as capable of controlling and distributing non-renewable energy as distributed power grids. Therefore, the optimal dispatch of microgrids faces increasing challenges. This paper proposes a multi-strategy fusion slime mould algorithm (MFSMA) to tackle the microgrid optimal dispatching problem. Traditional swarm intelligence algorithms suffer from slow convergence, low efficiency, and the risk of falling into local optima. The MFSMA employs reverse learning to enlarge the search space and avoid local optima to overcome these challenges. Furthermore, adaptive parameters ensure a thorough search during the algorithm iterations. The focus is on exploring the solution space in the early stages of the algorithm, while convergence is accelerated during the later stages to ensure efficiency and accuracy. The salp swarm algorithm's search mode is also incorporated to expedite convergence. MFSMA and other algorithms are compared on the benchmark functions, and the test showed that the effect of MFSMA is better. Simulation results demonstrate the superior performance of the MFSMA for function optimization, particularly in solving the 24 h microgrid optimal scheduling problem. This problem considers multiple energy sources such as wind turbines, photovoltaics, and energy storage. A microgrid model based on the MFSMA is established in this paper. Simulation of the proposed algorithm reveals its ability to enhance energy utilization efficiency, reduce total network costs, and minimize environmental pollution. The contributions of this paper are as follows: (1) A comprehensive microgrid dispatch model is proposed. (2) Environmental costs, operation and maintenance costs are taken into consideration. (3) Two modes of grid-tied operation and island operation are considered. (4) This paper uses a multi-strategy optimized slime mould algorithm to optimize scheduling, and the algorithm has excellent results. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of Chimp optimization algorithm (ChOA), which is easy to fall into local optimal value and imbalance between global exploration ability and local exploitation ability. To improve ChOA from the perspective of multi-strategy mixing, MSChimp was proposed, and the algorithm was applied to global optimization and minimum spanning tree problems. The main research work of this paper is as follows: (1) In the initialization stage of ChOA, an opposition-based learning strategy was introduced to improve the population diversity; Sine Cosine Algorithm (SCA) was introduced in the exploitation process to improve the convergence speed and accuracy of the algorithm in the later stage, so as to balance the exploration and exploitation capabilities of the algorithm. (2) The improved algorithm was compared with different types of meta-heuristic algorithms in 20 benchmark functions and CEC 2019 test sets, and was used to solve the minimum spanning tree. The experimental results show that the improved ChOA has significantly improved the ability to find the optimal value, which verifies the effectiveness and feasibility of MSChimp. Compared with other algorithms, the algorithm proposed in this paper has strong competitiveness. [ABSTRACT FROM AUTHOR]

This paper proposes a novel multi-hybrid algorithm named DHPN, using the best-known properties of dwarf mongoose algorithm (DMA), honey badger algorithm (HBA), prairie dog optimizer (PDO), cuckoo search (CS), grey wolf optimizer (GWO) and naked mole rat algorithm (NMRA). It follows an iterative division for extensive exploration and incorporates major parametric enhancements for improved exploitation operation. To counter the local optima problems, a stagnation phase using CS and GWO is added. Six new inertia weight operators have been analyzed to adapt algorithmic parameters, and the best combination of these parameters has been found. An analysis of the suitability of DHPN towards population variations and higher dimensions has been performed. For performance evaluation, the CEC 2005 and CEC 2019 benchmark data sets have been used. A comparison has been performed with differential evolution with active archive (JADE), self-adaptive DE (SaDE), success history based DE (SHADE), LSHADE-SPACMA, extended GWO (GWO-E), jDE100, and others. The DHPN algorithm is also used to solve the image fusion problem for four fusion quality metrics, namely, edge-based similarity index ( Q A B / F ), sum of correlation difference (SCD), structural similarity index measure (SSIM), and artifact measure ( N A B / F ). The average Q A B / F = 0.765508 , S C D = 1.63185 , S S I M = 0.726317 , and N A B / F = 0.006617 shows the best combination of results obtained by DHPN with respect to the existing algorithms such as DCH, CBF, GTF, JSR and others. Experimental and statistical Wilcoxon's and Friedman's tests show that the proposed DHPN algorithm performs significantly better in comparison to the other algorithms under test. [ABSTRACT FROM AUTHOR]

Optimization of scheduling problems that involve single or multiple machines with a multimodal objective function and linear or non-linear constraints are generally NP-Hard. The Artificial Bee Colony (ABC) algorithm is a metaheuristic proposed about eighteen years ago and has gained popularity in the swarm intelligence-based evolutionary computation approaches. Various scheduling requirements in diverse domains viz. Electric Vehicle charging, Operating Room, Nurse, Automatic Guided Vehicle (AGV), production, manufacturing, hydrothermal, Printed Circuit Board (PCB), and call centre scheduling are studied. The NP-Hard nature of these scheduling problems render exact methods incompetent for large problem instances thus requiring meta-heuristics such as ABC to produce feasible solutions in a reasonable computation time. The adaptation of ABC in these domains and the outcomes and performance of ABC are highlighted. Based on the case studies, it is found that the requirements of scheduling problems that would benefit from ABC are those that have a planning horizon requiring a near-optimal solution in a reasonably fast time when run on minimal computing capacity. Future works that would merit the application and enhancement of existing ABC techniques are proposed. The case studies presented in this paper motivate R&D Engineers and young researchers to apply ABC techniques of optimization and scheduling in different research topics for achieving energy and cost efficiency. [ABSTRACT FROM AUTHOR]

Swarm intelligence optimization algorithm has been proved to perform well in the field of parameter optimization. In order to further improve the performance of intelligent optimization algorithm, this paper proposes an improved and adaptive tunicate swarm algorithm (IMATSA) based on tunicate swarm algorithm (TSA). IMATSA improves TSA in the following four aspects: population diversity, local search convergence speed, jumping out of local optimal position, and balancing global and local search. Firstly, IMATSA adopts Tent map and quadratic interpolation to initialize population and enhance the diversity. Secondly, IMATSA uses Golden-Sine algorithm to accelerate the convergence of local search. Thirdly, in the process of global development, IMATSA adopts Levy flight and the improved Gauss disturbance method to adaptively improves and coordinates the ability of global development and local search. Then, this paper verifies the performance of IMATSA based on 14 benchmark functions experiment, ablation experiment, parameter optimization experiments of Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT), Wilcoxon signed rank test and image multi-threshold segmentation experiment with the performance metrics are convergence speed, convergence value, significance level P-value, Peak Signal-to-Noise Ratio (PSNR) and Standard Deviation (STD). Experimental results show that IMATSA performs better in three kinds of benchmark functions; each component of IMATSA has a positive effect on the performance; IMATSA performs better in parameter optimization experiments of SVM experiment and GBDT; there is significant difference between IMATSA and other algorithms by Wilcoxon signed rank test; in image segmentation, the performance is directly proportional to the number of thresholds, and compared with other algorithms, IMATSA has better comprehensive performance. [ABSTRACT FROM AUTHOR]

We propose an adaptive fractional multi-scale optimization optical flow algorithm, which for the first time improves the over-smoothing of optical flow estimation under the total variation model from the perspective of global feature and local texture balance, and solves the problem that the convergence of fractional optical flow algorithms depends on the order parameter. Specifically, a fractional-order discrete L1-regularization Total Variational Optical Flow model is constructed. On this basis, the Ant Lion algorithm is innovatively used to realize the iterative calculation of the optical flow equation, and the fractional order is dynamically adjusted to obtain an adaptive optimization algorithm with strong search accuracy and high efficiency. In this paper, the flexibility of optical flow estimation in weak gradient texture scenes is increased, and the optical flow extraction rate of target features at multiple scales is greatly improved. We show excellent recognition performance and stability under the MPI_Sintel and Middlebury benchmarks. [ABSTRACT FROM AUTHOR]

In recent years, there is massive development of new metaheuristics as stochastic methods. Meanwhile, there is not any metaheuristics is powerful to handle all problems as stated in the no-free-lunch (NFL) theory. Based on this circumstance, this paper introduces a new swarm-based metaheuristics with the main strategy moving toward the resultant of better swarm members and avoiding the resultant of worse swarm members called group better-worse algorithm (GBWA). It consists of five searches: moving toward the best swarm member, moving toward the resultant of better swarm members, moving away from the resultant of worse swarm members, searching locally, and jumping to the opposite area. GBWA is then evaluated in three ways. The first evaluation is a comparative evaluation where GBWA is compared to five recent metaheuristics: coati optimization algorithm (COA), average and subtraction-based optimization (ASBO), clouded leopard optimization (CLO), total interaction algorithm (TIA), and osprey optimization algorithm (OOA). The second evaluation is the individual search evaluation. The third evaluation is hyperparameter test. The collection of 23 classic functions is chosen as the use case in all evaluations. The result of the first evaluation shows that GBWA is better than COA, ASBO, CLO, TIA, and OOA in 20, 21, 20, 21, and 21 functions consecutively. Meanwhile, the result of the second evaluation shows the equal contribution between the motion toward the best swarm member and the motion toward the resultant of better swarm members. [ABSTRACT FROM AUTHOR]

Polycyclic aromatic hydrocarbons (PAHs) are organic pollutants and manufactured substances conferring toxicity to human health. The present study investigated whether pyrene, a type of PAH, harms rats. Our research provides an effective feature selection strategy for the animal dataset from Wenzhou Medical University's Experimental Animal Center to thoroughly examine the impacts of PAH toxicity on rat features. Initially, we devised a high‐performance optimization method (SCBA) and added the Sobol sequence, vertical crossover and horizontal crossover mechanisms to the bat algorithm (BA). The SCBA‐KELM model, which combines SCBA with the kernel extreme learning machine model (KELM), has excellent accuracy and high stability for selecting features. Benchmark function tests are then used in this research to verify the overall optimization performance of SCBA. In this paper, the feature selection performance of SCBA‐KELM is verified using various comparative experiments. According to the results, the features of the genes PXR, CAR, CYP2B1/2 and CYP1A1/2 have the most impact on rats. The SCBA‐KELM model's classification performance for the gene dataset was 100%, and the model's precision value for the public dataset was around 96%, as determined by the classification index. In conclusion, the model utilized in this research is anticipated to be a reliable and valuable approach for toxicological classification and assessment. [ABSTRACT FROM AUTHOR]

A new swarm-based metaheuristic, namely the enriched coati osprey algorithm (ECOA), is proposed in this paper. As its name suggests, ECOA hybridizes two new metaheuristics, the coati optimization algorithm (COA) and the osprey optimization algorithm (OOA). ECOA is constructed by five searches performed sequentially by the swarm members. The first three are directed searches, while the last two are neighborhood searches. All three directed searches are adopted from COA and OOA. Meanwhile, the four-bordered neighborhood search is developed based on a new approach. During the assessment, ECOA was challenged to overcome the set of 23 functions and contended with five new metaheuristics: total interaction algorithm (TIA), golden search optimization (GSO), average and subtraction-based optimization (ASBO), COA, and OOA. The result shows that ECOA outperforms TIA, GSO, ASBO, COA, and OOA in 16, 23, 18, 21, and 21 functions. Meanwhile, the individual search test result shows that the directed searches perform better than the neighborhood searches. Moreover, the directed search toward the best member becomes the most dominant search. [ABSTRACT FROM AUTHOR]

The Honey Badger Algorithm (HBA) represents a novel swarm intelligence optimization algorithm introduced in recent years. However, its predominant constraints are linked to inadequate convergence accuracy and a vulnerability to entrapment in local optima. In an effort to mitigate these challenges, this paper introduces an Improved Honey Badger Algorithm Based on a Hybrid Strategy (OHBA). Firstly, during the population initialization phase, a method involving the utilization of a good point set is introduced to enhance the diversity and introduce more randomness into the population. Secondly, in the position update phase, the Beta distribution is employed as an alternative to the Uniform distribution, aiming to strike a balance between global exploration and local exploitation capabilities. Thirdly, an improved adaptive density factor strategy is incorporated into both global and local position updates to enhance the algorithm's convergence precision and speed. Lastly, within the global exploration stage, a Cauchy mutation strategy based on the Sine chaotic mapping is introduced to facilitate the algorithm in overcoming local optima and reinforcing its optimization capabilities. The improved algorithm's performance has been evaluated through a comprehensive set of assessments, including CEC-2017 functions, CEC-2022 functions, Wilcoxon rank-sum tests, and practical engineering optimization problems. These evaluations were undertaken to assess the algorithm in comparison to classical intelligent optimization algorithms. The experimental results show that OHBA possesses significant advantages in terms of convergence speed, optimization accuracy, robustness and its practical utility and effectiveness in addressing complex optimization challenges. This establishes OHBA as a highly competitive option in these critical aspects of optimization. [ABSTRACT FROM AUTHOR]

The slime mould algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime moulds during foraging. Numerous researchers have widely applied the SMA and its variants in various domains in the field and proved its value by conducting various literatures. In this paper, a comprehensive review of the SMA is introduced, which is based on 130 articles obtained from Google Scholar between 2022 and 2023. In this study, firstly, the SMA theory is described. Secondly, the improved SMA variants are provided and categorized according to the approach used to apply them. Finally, we also discuss the main applications domains of the SMA, such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, and image segmentation. This review presents some research suggestions for researchers interested in this algorithm, such as conducting additional research on multi-objective and discrete SMAs and extending this to neural networks and extreme learning machining. [ABSTRACT FROM AUTHOR]

Aiming at the problem that Ant Colony Optimization (ACO) is subject primarily to the parameters, we propose a hybrid algorithm SOA-ACO-2Opt to optimize the ACO parameter combination through Seagull Optimization Algorithm (SOA) to strengthen ACO's search capability. To obtain a uniform initial distribution of the ACO parameter combination, we incorporated the Kent Chaos Map (KCM) to randomly initialize the seagull's position, reducing the tendency of SOA to fall into the local optimum. To avoid slow calculation speed and premature convergence of ACO, we improved the adaptive multi-population mechanism to reduce repeated redundant calculations and used the ϵ − g r e e d y and default strategy, respectively, to update the ants' position. 2Opt is applied to find shorter paths in each iteration. In addition, when AUV navigates on the planned path, it may encounter obstacles. Therefore, this paper proposes an autonomous obstacle avoidance algorithm based on forward-looking sonar to ensure safety during tasks. SOA-ACO-2Opt is verified against twelve different problems extracted from TSPLIB and compared with some state-of-the-art algorithms. Furthermore, sea trials were carried out for several representative marine engineering applications of TSP and obstacle avoidance. Experimental results show that this work can significantly improve AUV's work efficiency and intelligence and protect the AUV's safety. [Display omitted] • A hybrid algorithm SOA-ACO-2Opt is proposed to solve TSP. • A multi-population mechanism is used to reduce redundant computation and avoid early convergence. • The desired-path-based avoidance strategy is efficient and of low complexity. • The proposed algorithm is practical and efficient for AUV engineering applications. [ABSTRACT FROM AUTHOR]

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 (d FDB) 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 d FDB selection method can explore the search space more successfully compared to other algorithms. This version was named the dynamic FDBARO (d FDBARO) algorithm. Moreover, the practicability of the proposed d FDBARO 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 d FDBARO is a competitive algorithm for solving global optimization and constrained OPF problems. The source code of the d FDBARO algorithm is available at https://www.mathworks.com/matlabcentral/fileexchange/154845-dfdbaro-an-enhanced-metaheuristic-algorithm. [ABSTRACT FROM AUTHOR]