Information-decision searching algorithm: Theory and applications for solving engineering optimization problems

IA-DTPSO: A Multi-Strategy Integrated Particle Swarm Optimization for Predicting the Total Urban Water Resources in China

In order to overcome the drawbacks of low search efficiency and susceptibility to local optimal traps in PSO, this study proposes a multi-strategy particle swarm optimization (PSO) with information acquisition, referred to as IA-DTPSO. Firstly, Sobol sequence initialization on particles to achieve a more uniform initial population distribution is performed. Secondly, an update scheme based on information acquisition is established, which adopts different information processing methods according to the evaluation status of particles at different stages to improve the accuracy of information shared between particles. Then, the Spearman's correlation coefficient (SCC) is introduced to determine the dimensions that require reverse solution position updates, and the tangent flight strategy is used to improve the inherent single update method of PSO. Finally, a dimension learning strategy is introduced to strengthen individual particles' activity, thereby ameliorating the entire particle population's diversity. In order to conduct a comprehensive analysis of IA-DTPSO, its excellent exploration and exploitation (ENE) capability is firstly validated on CEC2022. Subsequently, the performance of IA-DTPSO and other algorithms on different dimensions of CEC2022 is validated, and the results show that IA-DTPSO wins 58.33% and 41.67% of the functions on 10 and 20 dimensions of CEC2022, respectively. Finally, IA-DTPSO is employed to optimize parameters of the time-dependent gray model (1,1,r,ξ,Csz) (TDGM (1,1,r,ξ,Csz)) and applied to simulate and predict total urban water resources (TUWRs) in China. By using four error evaluation indicators, this method is compared with other algorithms and existing models. The results show that the total MAPE (%) value obtained by simulation after IA-DTPSO optimization is 5.9439, which has the smallest error among all comparison methods and models, verifying the effectiveness of this method for predicting TUWRs in China.

Adaptive dynamic crayfish algorithm with multi-enhanced strategy for global high-dimensional optimization and real-engineering problems

The Crayfish Optimization Algorithm (COA) is a recent powerful algorithm that is sometimes plagued by poor convergence speed and a tendency to rapidly converge to the local optimum. This study introduces a variation of the COA called Adaptive Dynamic COA with a Locally enhanced escape operator (AD-COA-L) to tackle these issues. Firstly, the algorithm utilizes the Bernoulli map initialization strategy to quickly establish a high-quality population that is evenly distributed. This helps the algorithm to promptly reach the proper search area. Additionally, in order to mitigate the likelihood of getting trapped in local optima and improve the quality of the obtained solution, an Adaptive Lens Opposition-Based Learning (ALOBL) mechanism is applied. Moreover, the local escape operator (LEO) is utilized to aggressively discourage the adoption of isolated solutions and encourage the sharing of information within the search area. Finally, a new inertia weight is suggested to improve the search capability of COA and prevent it from being stuck in local optima by enhancing the exploitation capability of COA. AD-COA-L is evaluated against eight advanced state-of-the-art variations and ten classical and recent metaheuristic algorithms on 29 benchmark functions from CEC2017 of varying dimensions (50 and 100). AD-COA-L demonstrates superior accuracy, balanced exploration-exploitation and convergence speed, compared to other algorithms across most benchmark functions. Furthermore, we evaluated the proficiency of AD-COA-L in tackling seven demanding real-world and restricted engineering optimization challenges. The experimental findings clearly illustrate the competitiveness and advantages of the proposed AD-COA-L algorithm.

GOHBA: Improved Honey Badger Algorithm for Global Optimization

Aiming at the problem that the honey badger algorithm easily falls into local convergence, insufficient global search ability, and low convergence speed, this paper proposes a global optimization honey badger algorithm (Global Optimization HBA) (GOHBA), which improves the search ability of the population, with better ability to jump out of the local optimum, faster convergence speed, and better stability. The introduction of Tent chaotic mapping initialization enhances the population diversity and initializes the population quality of the HBA. Replacing the density factor enhances the search range of the algorithm in the entire solution space and avoids premature convergence to a local optimum. The addition of the golden sine strategy enhances the global search capability of the HBA and accelerates the convergence speed. Compared with seven algorithms, the GOHBA achieves the optimal mean value on 14 of the 23 tested functions. On two real-world engineering design problems, the GOHBA was optimal. On three path planning problems, the GOHBA had higher accuracy and faster convergence. The above experimental results show that the performance of the GOHBA is indeed excellent.

PMSOMA: optical microscope algorithm based on piecewise linear chaotic mapping and sparse adaptive exploration

The optical microscope algorithm (OMA) is a metaheuristic algorithm that draws inspiration from the magnifying functionality of optical microscopes. This study introduces an enhanced variant of OMA, termed PMSOMA, designed to mitigate the original version's limitations, notably its slow convergence rates and vulnerability to local optima. PMSOMA integrates a piecewise linear chaotic map to refine population initialization and augment diversity, alongside a sparse adaptive exploration mechanism to bolster search efficacy. The performance of PMSOMA was rigorously tested using a suite of 50 benchmark functions, the CEC2017 test suite, feature selection datasets, and three classical engineering challenges. The empirical findings confirm that PMSOMA surpasses both the original OMA and competing algorithms by delivering superior solutions, accelerating convergence, and demonstrating enhanced robustness in convergence.

Enhancing grasshopper optimization algorithm (GOA) with levy flight for engineering applications

The grasshopper optimization algorithm (GOA) is a meta-heuristic algorithm proposed in 2017 mimics the biological behavior of grasshopper swarms seeking food sources in nature for solving optimization problems. Nonetheless, some shortcomings exist in the origin GOA, and GOA global search ability is more or less insufficient and precision also needs to be further improved. Although there are many different GOA variants in the literature, the problem of inefficient and rough precision has still emerged in GOA variants. Aiming at these deficiencies, this paper develops an improved version of GOA with Levy Flight mechanism called LFGOA to alleviate the shortcomings of the origin GOA. The LFGOA algorithm achieved a more suitable balance between exploitation and exploration during searching for the most promising region. The performance of LFGOA is tested using 23 mathematical benchmark functions in comparison with the eight well-known meta-heuristic algorithms and seven real-world engineering problems. The statistical analysis and experimental results show the efficiency of LFGOA. According to obtained results, it is possible to say that the LFGOA algorithm can be a potential alternative in the solution of meta-heuristic optimization problems as it has high exploration and exploitation capabilities.

Fault Detection and Classification in Transmission Lines Connected to Inverter-Based Generators Using Machine Learning

Integrating inverter-based generators in power systems introduces several challenges to conventional protection relays. The fault characteristics of these generators depend on the inverters’ control strategy, which matters in the detection and classification of the fault. This paper presents a comprehensive machine-learning-based approach for detecting and classifying faults in transmission lines connected to inverter-based generators. A two-layer classification approach was considered: fault detection and fault type classification. The faults were comprised of different types at several line locations and variable fault impedance. The features from instantaneous three-phase current and voltages and calculated swing-center voltage (SCV) were extracted in time, frequency, and time–frequency domains. A photovoltaic (PV) and a Doubly-Fed Induction Generator (DFIG) wind farm plant were the considered renewable resources. The unbalanced data problem was investigated and mitigated using the synthetic minority class oversampling technique (SMOTE). The hyperparameters of the evaluated classifiers, namely decision trees (DT), Support Vector Machines (SVM), k-Nearest Neighbors (k-NN), and Ensemble trees, were optimized using the Bayesian optimization algorithm. The extracted features were reduced using several methods. The classification performance was evaluated in terms of the accuracy, specificity, sensitivity, and precision metrics. The results show that the data balancing improved the specificity of DT, SVM, and k-NN classifiers (DT: from 99.86% for unbalanced data to 100% for balanced data; SVM: from 99.28% for unbalanced data to 99.93% for balanced data; k-NN: from 99.64% for unbalanced data to 99.74% for balanced data). The forward feature selection combined with the Bag ensemble classifier achieved 100% accuracy, sensitivity, specificity, and precision for fault detection (binary classification), while the Adaboost ensemble classifier had the highest accuracy (99.4%), compared to the other classifiers when using the complete set of features. The classification models with the highest performance were further tested using a new dataset test case. They showed high detection and classification capabilities. The proposed approach was compared with the previous methodologies from the literature.