Search

The optimal operation of reservoir groups is a strongly constrained, multi-stage, and high-dimensional optimization problem. In response to this issue, this article couples the standard Pelican optimization algorithm with adaptive ε constraint methods, and further improves the optimization performance of the algorithm by initializing the population with a good point set, reverse differential evolution, and optimal individual t-distribution perturbation strategy. Based on this, an improved Pelican algorithm coupled with adaptive ε constraint method is proposed (ε-IPOA). The performance of the algorithm was tested through 24 constraint testing functions to find the optimal ability and solve constraint optimization problems. The results showed that the algorithm has strong optimization ability and stable performance. In this paper, we select Sanmenxia and Xiaolangdi reservoirs as the research objects, establish the maximum peak-cutting model of terrace reservoirs, apply the ε-IPOA algorithm to solve the model, and compare it with the ε-POA (Pelican algorithm coupled with adaptive ε constraint method) and ε-DE (Differential Evolution Algorithm) algorithms, the results indicate that ε. The peak flow rate of the Huayuankou control point solved by the IPOA algorithm is 12,319 m3/s, which is much lower than the safe overflow flow rate of 22,000 m3/s at the Huayuankou control point, with a peak shaving rate of 44%, and other algorithms do not find effective solutions meeting the constraint conditions. This paper provides a new idea for solving the problem of flood control optimal operation of cascade reservoirs. [ABSTRACT FROM AUTHOR]

In practical engineering applications, factors like dust adhesion and environmental changes can cause photovoltaic arrays to exhibit multiple peaks in output power. An optimization algorithm with global optimization capability is needed to track its maximum power. In this regard, this paper proposes an improved marine predator algorithm (IMPA) to extract the maximum power point of photovoltaic system under complex solar irradiation conditions. To overcome the issues in the traditional marine predator algorithm (MPA), the opposition-based learning(OBL) strategy is introduced in IMPA, and the sine cosine algorithm (SCA) is integrated into the iteration stage to enhance the search ability of the algorithm. Furthermore, the low-order converter in the traditional MPPT control system is replaced by the Zeta converter, which increases the operating voltage range. Ultimately, simulation results demonstrate that the MPPT based on IMPA has higher tracking efficiency and shorter response time.The experimental results also indicate the practical feasibility of this method, as well as its high level of stability and robustness. [ABSTRACT FROM AUTHOR]

In this paper, an enhanced equilibrium optimization (EO) version named Levy-opposition-equilibrium optimization (LOEO) is proposed to select effective features in network intrusion detection systems (IDSs). The opposition-based learning (OBL) approach is applied by this algorithm to improve the diversity of the population. Also, the Levy flight method is utilized to escape local optima. Then, the binary rendition of the algorithm called BLOEO is employed to feature selection in IDSs. One of the main challenges in IDSs is the high-dimensional feature space, with many irrelevant or redundant features. The BLOEO algorithm is designed to intelligently select the most informative subset of features. The empirical findings on NSL-KDD, UNSW-NB15, and CIC-IDS2017 datasets demonstrate the effectiveness of the BLOEO algorithm. This algorithm has an acceptable ability to effectively reduce the number of data features, maintaining a high intrusion detection accuracy of over 95%. Specifically, on the UNSW-NB15 dataset, BLOEO selected only 10.8 features on average, achieving an accuracy of 97.6% and a precision of 100%. [ABSTRACT FROM AUTHOR]

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

High precision is a very important index in target tracking. In order to improve the prediction accuracy of target tracking, an optimized Kalman filter approach based on improved Gray Wolf algorithm (IGWO-OKF) is proposed in this paper. Since the convergence speed of traditional Gray Wolf algorithm is slow, meanwhile, the number of gray wolves and the choice of the maximum number of iterations has a great influence on the algorithm, a nonlinear control parameter combination adjustment strategy is proposed. An improved Grey Wolf Optimization algorithm (IGWO) is formed by determining the best combination of adjustment parameters through the fastest iteration speed of the algorithm. The improved Grey Wolf Optimization algorithm (IGWO) is formed, and the process noise covariance matrix and observation noise covariance matrix in Kalman filter are optimized by IGWO. The proposed approach is applied into. The experiment results show that the proposed IGWO-OKF approach has low error, high accuracy and good prediction effect. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy of concrete dynamic principal identification, a concrete dynamic principal identification model based on Improved Dung Beetle Algorithm (IDBO) optimized Long Short-Term Memory (LSTM) network is proposed. Firstly, the apparent stress–strain curves of concrete containing damage evolution were measured by Split Hopkinson Pressure Bar (SHPB) test to decouple and separate the damage and rheology, and this system was modeled by using LSTM network. Secondly, for the problem of low convergence accuracy and easy to fall into local optimum of Dung Beetle Algorithm (DBO), the greedy lens imaging reverse learning initialization population strategy, the embedded curve adaptive weighting factor and the PID control optimal solution perturbation strategy are introduced, and the superiority of IDBO algorithm is proved through the comparison of optimization test with DBO, Harris Hawk Optimization Algorithm, Gray Wolf Algorithm, and Fruit Fly Algorithm and the combination of LSTM is built to construct the IDBO-LSTM dynamic homeostasis identification model. The final results show that the IDBO-LSTM model can recognize the concrete material damage without considering the damage; in the case of considering the damage, the IDBO-LSTM prediction curves basically match the SHPB test curves, which proves the feasibility and excellence of the proposed method. [ABSTRACT FROM AUTHOR]

Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm to solve combinatorial optimization problems in the era of noisy intermediate-scale quantum computers. Recently it has been revealed that warm-start approaches can improve the performance of QAOA, where approximate solutions are obtained by classical algorithms in advance and incorporated into the initial state and/or unitary ansatz. In this work, we study in detail how the accuracy of approximate solutions affects the performance of the warm-start QAOA (WS-QAOA). We numerically find that in typical MAX-CUT problems, WS-QAOA achieves higher fidelity (probability that exact solutions are observed) and approximation ratio than QAOA as the Hamming distance of approximate solutions to the exact ones becomes smaller. We reveal that this could be quantitatively attributed to the initial state of the ansatz. We also solve MAX-CUT problems by WS-QAOA with approximate solutions obtained via QAOA, having higher fidelity and approximation ratio than QAOA especially when the circuit is relatively shallow. We believe that our study may deepen understanding of the performance of WS-QAOA and also provide a guide as to the necessary quality of approximate solutions. [ABSTRACT FROM AUTHOR]

The primary objective of this study is to delve into the application and validation of the Resistance Capacitance Optimization Algorithm (RCOA)—a new, physics-inspired metaheuristic optimization algorithm. The RCOA, intriguingly inspired by the time response of a resistance–capacitance circuit to a sudden voltage fluctuation, has been earmarked for solving complex numerical and engineering design optimization problems. Uniquely, the RCOA operates without any control/tunable parameters. In the first phase of this study, we evaluated the RCOA's credibility and functionality by deploying it on a set of 23 benchmark test functions. This was followed by thoroughly examining its application in eight distinct constrained engineering design optimization scenarios. This methodical approach was undertaken to dissect and understand the algorithm's exploration and exploitation phases, leveraging standard benchmark functions as the yardstick. The principal findings underline the significant effectiveness of the RCOA, especially when contrasted against various state-of-the-art algorithms in the field. Beyond its apparent superiority, the RCOA was put through rigorous statistical non-parametric testing, further endorsing its reliability as an innovative tool for handling complex engineering design problems. The conclusion of this research underscores the RCOA's strong performance in terms of reliability and precision, particularly in tackling constrained engineering design optimization challenges. This statement, derived from the systematic study, strengthens RCOA's position as a potentially transformative tool in the mathematical optimization landscape. It also paves the way for further exploration and adaptation of physics-inspired algorithms in the broader realm of optimization problems. [ABSTRACT FROM AUTHOR]

This study proposes a novel hybrid approach, called Adaptive/Elevator Kinematics Optimization algorithm based on dual response algorithm (A/EKO-DRA), to enhance the robust parameters estimation and design of the plaster milling process. The A/EKO-DRA method reduces variability while maintaining the desired output target, thereby minimizing the impact of variance on the expected stucco combined water. The performance of the A/EKO-DRA is compared with conventional processes through numerical examples and simulations. The results show that the A/EKO-DRA method has the lowest mean absolute errors among other methods in terms of parameter estimation, and it achieves the response mean of 5.927 percent, which meets the target value of 5.9 percent for industrial enclosures, with much reduction in the response variance. Overall, the A/EKO-DRA method is a promising approach for optimizing the plaster milling process parameters. [ABSTRACT FROM AUTHOR]