Search Results (178)

To address the decline in measurement accuracy of magnetometers due to process errors and environmental interference, as well as the insufficient robustness of traditional calibration algorithms under strong interference conditions, this paper proposes an ellipsoid fitting algorithm based on Dynamic Adaptive Elite Particle Swarm Optimization (DAEPSO). The proposed algorithm integrates three enhancement mechanisms: dynamic stratified elite guidance, adaptive inertia weight adjustment, and inferior particle relearning via Lévy flight, aiming to improve convergence speed, solution accuracy, and noise resistance. First, a magnetometer calibration model is established. Second, the DAEPSO algorithm is employed to fit the ellipsoid parameters. Finally, error calibration is performed based on the optimized ellipsoid parameters. Our simulation experiments demonstrate that compared with the traditional Least Squares Method (LSM) the proposed method reduces the standard deviation of the total magnetic field intensity by 54.73%, effectively improving calibration precision in the presence of outliers. Furthermore, when compared to PSO, TSLPSO, MPSO, and AWPSO, the sum of the absolute distances from the simulation data to the fitted ellipsoidal surface decreases by 53.60%, 41.96%, 53.01%, and 27.40%, respectively. The results from 60 independent experiments show that DAEPSO achieves lower median errors and smaller interquartile ranges than comparative algorithms. In summary, the DAEPSO-based ellipsoid fitting algorithm exhibits high fitting accuracy and strong robustness in environments with intense interference noise, providing reliable theoretical support for practical engineering applications. Full article

Effective energy management is vital for enhancing reliability, reducing operational costs, and supporting the increasing penetration of electric vehicles (EVs) and renewable energy sources (RESs) in distribution networks. This study presents a dynamic reconfiguration strategy for distribution feeders that integrates EV charging stations (EVCSs), RESs, and capacitors. The goal is to minimize both Energy Not Supplied (ENS) and operational costs, particularly under varying demand conditions caused by EV charging in grid-to-vehicle (G2V) and vehicle-to-grid (V2G) modes. To improve optimization accuracy and avoid local optima, an improved Whale Optimization Algorithm (IWOA) is employed, featuring a mutation mechanism based on Lévy flight. The model also incorporates uncertainties in electricity prices and consumer demand, as well as a demand response (DR) program, to enhance practical applicability. Simulation studies on a 95-bus test system show that the proposed approach reduces ENS by 16% and 20% in the absence and presence of distributed generation (DG) and EVCSs, respectively. Additionally, the operational cost is significantly reduced compared to existing methods. Overall, the proposed framework offers a scalable and intelligent solution for smart grid integration and distribution network modernization. Full article

As a classical statistical method, multiple regression is widely used for forecasting tasks in power, medicine, finance, and other fields. The rise of machine learning has led to the adoption of neural networks, particularly Long Short-Term Memory (LSTM) models, for handling complex forecasting problems, owing to their strong ability to capture temporal dependencies in sequential data. Nevertheless, the performance of LSTM models is highly sensitive to hyperparameter configuration. Traditional manual tuning methods suffer from inefficiency, excessive reliance on expert experience, and poor generalization. Aiming to address the challenges of complex hyperparameter spaces and the limitations of manual adjustment, an enhanced sparrow search algorithm (ISSA) with adaptive parameter configuration was developed for LSTM-based multivariate regression frameworks, where systematic optimization of hidden layer dimensionality, learning rate scheduling, and iterative training thresholds enhances its model generalization capability. In terms of SSA improvement, first, the population is initialized by the reverse learning strategy to increase the diversity of the population. Second, the mechanism for updating the positions of producer sparrows is improved, and different update formulas are selected based on the sizes of random numbers to avoid convergence to the origin and improve search flexibility. Then, the step factor is dynamically adjusted to improve the accuracy of the solution. To improve the algorithm’s global search capability and escape local optima, the sparrow search algorithm’s position update mechanism integrates Lévy flight for detection and early warning. Experimental evaluations using benchmark functions from the CEC2005 test set demonstrated that the ISSA outperforms PSO, the SSA, and other algorithms in optimization performance. Further validation with power load and real estate datasets revealed that the ISSA-LSTM model achieves superior prediction accuracy compared to existing approaches, achieving an RMSE of 83.102 and an $R^2$ of 0.550 during electric load forecasting and an RMSE of 18.822 and an $R^2$ of 0.522 during real estate price prediction. Future research will explore the integration of the ISSA with alternative neural architectures such as GRUs and Transformers to assess its flexibility and effectiveness across different sequence modeling paradigms. Full article

The sandwich plates in consideration are structures composed of a number of Lévy plate components laminated with viscoelastic layers, and they are seen in broad engineering applications. In vibration analysis of a sandwich plate, conventional analytical methods are limited due to the complexity of the geometric and material properties of the structure, and consequently, numerical methods are commonly used. In this paper, an innovative analytical method is proposed for vibration analysis of sandwich Lévy plates having different configurations of viscoelastic layers and using various models of viscoelastic materials. The focus of the investigation is on the determination of closed-form frequency response at any given frequencies. In the development, an s-domain state-space formulation is established by the Distributed Transfer Function Method (DTFM). With this formulation, closed-form analytical solutions of the frequency response problem of sandwich plates are obtained, without the need for spatial discretization. As one unique feature, the DTFM-based approach has consistent formulas and unified solution procedures by which analytical solutions at both low and high frequencies are obtained. The accuracy, efficiency, and versatility of the proposed analytical method are demonstrated in three numerical examples, where the DTFM-based analysis is compared with the finite element method and certain existing analytical solutions. Full article

In some problems, partial differential equations are reduced to ordinary differential equations. In special cases, when incorporating randomness, equations can be reduced to systems of stochastic differential Equations (SDEs). Stochastic averaging for a class of stochastic differential equations with fractional Brownian motion and non-Gaussian Lévy noise is considered. Stability criteria for systems of stochastic differential equations with fractional Brownian motion and non-Gaussian Lévy noise do not currently exist. Usually, studies on determining the sensitivity of solutions to the accuracy of setting the initial conditions are being conducted to explain the phenomenon of deterministic chaos. These studies show both convergence in mean square and convergence in probability to averaged systems of stochastic differential equations driven by fractional Brownian motion and Lévy process. The solutions to systems can be approximated by solutions to averaged stochastic differential equations by using the stochastic averaging. Full article

We present a review of recent developments in cosmological models based on Finsler geometry, as well as geometric extensions of general relativity formulated within this framework. Finsler geometry generalizes Riemannian geometry by allowing the metric tensor to depend not only on position but also on an additional internal degree of freedom, typically represented by a vector field at each point of the spacetime manifold. We examine in detail the possibility that Finsler-type geometries can describe the physical properties of the gravitational interaction, as well as the cosmological dynamics. In particular, we present and review the implications of a particular implementation of Finsler geometry, based on the Barthel connection, and of the $(\alpha ,\beta )$ geometries, where $\alpha$ is a Riemannian metric, and $\beta$ is a one-form. For a specific construction of the deviation part $\beta$, in these classes of geometries, the Barthel connection coincides with the Levi–Civita connection of the associated Riemann metric. We review the properties of the gravitational field, and of the cosmological evolution in three types of geometries: the Barthel–Randers geometry, in which the Finsler metric function F is given by $F=\alpha +\beta$, in the Barthel–Kropina geometry, with $F={\alpha }^2/\beta$, and in the conformally transformed Barthel–Kropina geometry, respectively. After a brief presentation of the mathematical foundations of the Finslerian-type modified gravity theories, the generalized Friedmann equations in these geometries are written down by considering that the background Riemannian metric in the Randers and Kropina line elements is of Friedmann–Lemaitre–Robertson–Walker type. The matter energy balance equations are also presented, and they are interpreted from the point of view of the thermodynamics of irreversible processes in the presence of particle creation. We investigate the cosmological properties of the Barthel–Randers and Barthel–Kropina cosmological models in detail. In these scenarios, the additional geometric terms arising from the Finslerian structure can be interpreted as an effective geometric dark energy component, capable of generating an effective cosmological constant. Several cosmological solutions—both analytical and numerical—are obtained and compared against observational datasets, including Cosmic Chronometers, Type Ia Supernovae, and Baryon Acoustic Oscillations, using a Markov Chain Monte Carlo (MCMC) analysis. A direct comparison with the standard $\Lambda$CDM model is also carried out. The results indicate that Finslerian cosmological models provide a satisfactory fit to the observational data, suggesting they represent a viable alternative to the standard cosmological model based on general relativity. Full article

As cyber–physical systems are applied not only to crucial infrastructure but also to day-to-day technologies, from industrial control systems through to smart grids and medical devices, they have become very significant. Cyber–physical systems are a target for various security attacks, too; their growing complexity and digital networking necessitate robust cybersecurity solutions. Recent research indicates that deep learning can improve CPS security through intelligent threat detection and response. We still foresee limitations to scalability, data privacy, and handling the dynamic nature of CPS environments in existing approaches. We developed the CPS ShieldNet Fusion model as a comprehensive security framework for protecting CPS from ever-evolving cyber threats. We will present a model that integrates state-of-the-art methodologies in both federated learning and optimization paradigms through the combination of the Federated Residual Convolutional Network (FedRCNet) and the EEL-Levy Fusion Optimization (ELFO) methods. This involves the incorporation of the Federated Residual Convolutional Network into an optimization method called EEL-Levy Fusion Optimization. This preserves data privacy through decentralized model training and improves complex security threat detection. We report the results of a rigorous evaluation of CICIoT-2023, Edge-IIoTset-2023, and UNSW-NB datasets containing the CPS ShieldNet Fusion model at the forefront in terms of accuracy and effectiveness against several threats in different CPS environments. Therefore, these results underline the potential of the proposed framework to improve CPS security by providing a robust and scalable solution to current problems and future threats. Full article

In this paper, we introduce the Levy Flight-enhanced Whale Optimization Algorithm with Tabu Search elements (LWOATS), an innovative hybrid optimization approach that enhances the standard Whale Optimization Algorithm (WOA) with advanced local search techniques and elite solution management to improve performance on global optimization problems. Techniques from the Tabu Search algorithm are adopted to balance the exploration and exploitation phases, while an elite reintroduction strategy is implemented to retain and refine the best solutions. The efficient optimization of LWOATS is further aided by the utilization of Levy flights and local search based on the Nelder–Mead simplex method. An Orthogonal Experimental Design (OED) analysis was employed to fine-tune the algorithm’s parameters. LWOATS was tested against three different algorithm sets: fundamental algorithms, advanced Differential Evolution (DE) variants, and improved WOA variants. Wilcoxon tests demonstrate the promising performance of LWOATS, showing improvements in convergence speed, accuracy, and robustness compared to traditional WOA and other metaheuristic algorithms. After extensive testing against a challenging set of benchmark functions and engineering optimization problems, we conclude that our proposed method is well suited for tackling high-dimensional optimization tasks and constrained optimization problems, providing substantial computational efficiency gains and improved overall solution quality. Full article

In order to overcome the inherent drawbacks of the baseline Zebra Optimization Algorithm (ZOA) approach, such as its propensity for premature convergence and local optima trapping, this work creates a Multi-Strategy Enhanced Zebra Optimization Algorithm (MZOA). Three strategic changes are incorporated into the improved framework: triangular walk operators to balance localized exploitation and global exploration across optimization phases; Levy flight mechanisms to strengthen solution space traversal capabilities; and lens imaging inversion learning to improve population diversity and avoid local convergence stagnation. The enhanced solution accuracy of the MZOA over modern metaheuristics is empirically validated using the CEC2005 and CEC2017 benchmark suites. The proposed MZOA’s performance improved by 15.8% compared to the basic ZOA The algorithm’s practical effectiveness across a range of environmental difficulties is confirmed by extensive assessment in engineering optimization and robotic route planning scenarios. It routinely achieves optimal solutions in both simple and complicated setups. In robot path planning, the proposed MZOA reduces the movement path by 8.7% compared to the basic ZOA. These comprehensive evaluations establish the MZOA as a robust computational algorithm for complex optimization challenges, demonstrating enhanced convergence characteristics and operational reliability in synthetic and real-world applications. Full article

Cruise construction involves a lengthy logistical cycle, complex processes, and large volumes of diverse materials, inevitably generating reverse flows. To mitigate risks such as stock congestion, production disruption, and occupational hazards, this study proposes a novel reverse logistics network optimization model that integrates cost, efficiency, and Health, Safety, Environment (HSE) risk factors. Realistic factors including vehicle load, transport cost, loading time, and risk weight were considered to improve model applicability. Fuzzy time windows quantify worker risk exposure and operational efficiency, adding decision-making complexity. A three-phase Levy mutation discrete crow search algorithm (DCSA) was developed, introducing the Levy flight strategy to replace random search and enhance the discretization and solution diversity. The comparative analysis shows that DCSA performs as well as NSGA-II, while outperforming DGWO, demonstrating both stability and efficiency. Comparative analysis with a cost-only scenario revealed that although short-term economic gains may be achieved under cost minimization, such approaches often overlook risks with potential long-term impacts. This highlights the necessity of integrating safety concerns into reverse logistics planning, and confirms the model’s robustness and practical value, thus supporting decision makers in aligning reverse logistics planning in shipyards with sustainability and operational efficiency goals. Full article

In order to solve problems with the original crayfish optimization algorithm (COA), such as reduced diversity, local optimization, and insufficient convergence accuracy, a multi-strategy optimization algorithm for crayfish based on differential evolution, named the ICOA, is proposed. First, the elite chaotic difference strategy is used for population initialization to generate a more uniform crayfish population and increase the quality and diversity of the population. Secondly, the differential evolution strategy and the dimensional variation strategy are introduced to improve the quality of the crayfish population before its iteration and to improve the accuracy of the optimal solution and the local search ability for crayfish at the same time. To enhance the updating approach to crayfish exploration, the Levy flight strategy is adopted. This strategy aims to improve the algorithm’s search range and local search capability, prevent premature convergence, and enhance population stability. Finally, the adaptive parameter strategy is introduced to improve the development stage of crayfish, so as to better balance the global search and local mining ability of the algorithm, and to further enhance the optimization ability of the algorithm, and the ability to jump out of the local optimal. In addition, a comparison with the original COA and two sets of optimization algorithms on the CEC2019, CEC2020, and CEC2022 test sets was verified by Wilcoxon rank sum test. The results show that the proposed ICOA has strong competition. At the same time, the performance of ICOA is tested against different high-performance algorithms on 6 engineering optimization examples, 30 high–low-dimension constraint problems and 2 large-scale NP problems. Numerical experiments results show that ICOA has superior performance on a range of engineering problems and exhibits excellent performance in solving complex optimization problems. Full article

Optimization algorithms serve as a powerful instrument for tackling optimization issues and are highly valuable in the context of engineering design. The coati optimization algorithm (COA) is a novel meta-heuristic algorithm known for its robust search capabilities and rapid convergence rate. However, the effectiveness of the COA is compromised by the homogeneity of its initial population and its reliance on random strategies for prey hunting. To address these issues, a multi-strategy adaptive coati optimization algorithm (MACOA) is presented in this paper. Firstly, Lévy flights are incorporated into the initialization phase to produce high-quality initial solutions. Subsequently, a nonlinear inertia weight factor is integrated into the exploration phase to bolster the algorithm’s global search capabilities and accelerate convergence. Finally, the coati vigilante mechanism is introduced in the exploitation phase to improve the algorithm’s capacity to escape local optima. Comparative experiments with many existing algorithms are conducted using the CEC2017 test functions, and the proposed algorithm is applied to seven representative engineering design problems. MACOA’s average rankings in the three dimensions (30, 50, and 100) were 2.172, 1.897, and 1.759, respectively. The results show improved optimization speed and better performance. Full article

The coronavirus (COVID-19) expanded rapidly and affected almost the whole world since December 2019. COVID-19 has an unusual ability to spread quickly through airborne viruses and substances. Taking into account the disease’s natural progression, this study considers that viral spread is unpredictable rather than deterministic. The continuous time Markov chain (CTMC) stochastic model technique has been used to anticipate upcoming states using random variables. The suggested study focuses on a model with five distinct compartments. The first class contains Lévy noise-based infection rates (termed as vulnerable people), while the second class refers to the infectious compartment having similar perturbation incidence as the others. We demonstrate the existence and uniqueness of the positive solution of the model. Subsequently, we define a stochastic threshold as a requisite condition for the extinction and durability of the disease’s mean. By assuming that the threshold value ${\mathbf{R}}_{\mathbf{0}}^{\mathbf{D}}$ is smaller than one, it is demonstrated that the solution trajectories oscillate around the disease-free state (DFS) of the corresponding deterministic model. The solution curves of the SDE model fluctuate in the neighborhood of the endemic state of the base ODE system, when ${\mathbf{R}}_{\mathbf{0}}^{\mathbf{P}}>1$ elucidates the definitive persistence theory of the suggested model. Ultimately, numerical simulations are provided to confirm our theoretical findings. Moreover, the results indicate that stochastic environmental disturbances might influence the propagation of infectious diseases. Significantly, increased noise levels could hinder the transmission of epidemics within the community. Full article

The Quantum Snowflake Algorithm (QSA) is a novel metaheuristic for both continuous and discrete optimization problems, combining collision-based diversity, quantum-inspired tunneling, superposition-based partial solution sharing, and local refinement steps. The QSA embeds candidate solutions in a continuous auxiliary space, where collision operators ensure that agents—snowflakes—reject each other and remain diverse. This approach is inspired by snowflakes which prevent collisions while retaining unique crystalline patterns. Large leaps to escape deep local minima are simultaneously provided by quantum tunneling, which is particularly useful in highly multimodal environments. Tests on challenging functions like Lévy and HyperSphere showed that the QSA can more reliably obtain very low objective values in continuous domains than conventional swarm or evolutionary approaches. A 200-city Traveling Salesman Problem (TSP) confirmed the excellent tour quality of the QSA for discrete optimization. It drastically reduces the route length compared to Artificial Bee Colony (ABC), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Quantum Particle Swarm Optimization (QPSO), and Cuckoo Search (CS). These results show that quantum tunneling accelerates escape from local traps, superposition and local search increase exploitation, and collision-based repulsion maintains population diversity. Together, these elements provide a well-rounded search method that is easy to adapt to different problem areas. In order to establish the QSA as a versatile solution framework for a range of large-scale optimization challenges, future research could investigate multi-objective extensions, adaptive parameter control, and more domain-specific hybridisations. Full article

In this paper, an Improved Manta Ray Foraging Optimization (IMRFO) algorithm is proposed to address the challenge of parameter tuning in traditional PID controllers for artillery stabilization systems. The proposed algorithm introduces chaotic mapping to optimize the initial population, enhancing the global search capability; additionally, a sigmoid function and Lévy flight-based dynamic adjustment strategy regulate the selection factor and step size, improving both convergence speed and optimization accuracy. Comparative experiments using five benchmark test functions demonstrate that the IMRFO algorithm outperforms five commonly used heuristic algorithms in four cases. The proposed algorithm is validated through co-simulation and physical platform experiments. Experimental results show that the proposed approach significantly improves control accuracy and response speed, offering an effective solution for optimizing complex nonlinear control systems. By introducing heuristic optimization algorithms for self-tuning artillery stabilization system parameters, this work provides a new approach to enhancing the intelligence and adaptability of modern artillery control. Full article