Local Optimization Research Articles

Application of Time Series Analysis and Regression Algorithm in Assessing the Effectiveness of Monetary Policy in the Era of Digital Economy

Monetary policy is the series of actions to manage country's money supply and to attain economic growth. An objection to using interest rates in monetary policy is that the use of interest rates has the problem of time uncertainty. Therefore, this research introduces Conditional Autoregressive Value-at-Risk and Henry Gas Solubility Optimization (Caviar-HGSO) with Deep Long Short Term Memory (DeepLSTM) to monetary policy forecasting to demonstrate its effectiveness. Here, Caviar-HGSO is a hybrid of Caviar and HGSO used to tune DeepLSTM weights. The HGSO algorithm follows the wind state to balance exploration and exploitation in search space while avoiding local optimization. A Caviar model estimates the parameter over time by autoregressive process and determine a parameter by regression analysis. The advantages of these two optimization algorithms lead to better monetary policy forecasts. The experimental results show that Caviar-HGSO_DeepLSTM performs better regarding MAE, MSE, and RMSE, namely 0.438, 0.103, and 0.351.

Two-Line Element Outlier and Space Event Detection Method Based on Multi-Strategy Genetic Algorithm

The detection of two-line element (TLE) outliers and space events play a crucial role in enhancing spatial situational awareness. Therefore, this paper addresses the issue of TLE outlier detection methods that often overlook the mutual influence of multiple factors. Hence, a Multivariate Gaussian Mixture Model (MGMM) is introduced to consider the interdependencies among various indicators. Additionally, a Multi-strategy Genetic Algorithm (MGA) is employed to adjust the complexity of the MGMM, allowing it to accurately learn the actual distribution of TLE data. Initially, the proposed method applies probabilistic fits to the predicted error rate changes for both the TLE semi-major axis and the orbital inclination. Chaos initialization, a posterior probability penalty, and local optimization iterations are subsequently integrated into the genetic algorithm. These enhancements aim to estimate the MGMM parameters, addressing issues related to poor robustness and the susceptibility of the MGMM to converge to local optima. The algorithm’s effectiveness is validated using TLE data from typical space targets. The results demonstrate that the optimized algorithm can efficiently detect outliers and maneuver events within complex TLE data. Notably, the comprehensive detection performance index, measured, using the F1 score, improved by 15.9% compared to the Gaussian mixture model. This significant improvement underscores the importance of the proposed method in bolstering the security of complex space environments.

An adaptive differential evolution algorithm with multi-strategy for solving complex optimization problem

In this paper, an adaptive differential evolution algorithm with multi-strategy, namely ESADE is proposed to solve the premature convergence and high time complexity for complex optimization problem. In the ESADE, the population is divided into several sub-populations after the fitness value of each individual is sorted. Then different mutation strategies are proposed for different populations to balance the global exploration and local optimization. Next, a new self-adaptive strategy is designed adjust parameters to avoid falling into local optimum while the convergence accuracy has reached its maximum value. And a complex airport gate allocation multi-objective optimization model with the maximum flight allocation rate, the maximum near gate allocation rate, and the maximum passenger rate at near gate is constructed, which is divided into several single-objective optimization model. Finally, the ESADE is applied solve airport gate allocation optimization model. The experiment results show that the proposed ESADE algorithm can effectively solve the complex airport gate allocation problem and achieve ideal airport gate allocation results by comparing with the current common heuristic optimization algorithms.

Path Planning Analysis of Mobile Robot with Improved Ant Colony Algorithm

Aiming at the problems of poor convergence and local optimization in path planning using the basic ant colony algorithm, this paper studies an improved ant colony algorithm to enhance the effect of mobile robot path planning. Firstly, the state transition probability of the ant colony algorithm is modified, and the influence of the angle on node selection is increased by adding a new angle index heuristic function. Then, the sorting and elite ant colony algorithm strategies are fused to research a path length difference pheromone update method, improving the efficiency of the ant colony algorithm in planning the optimal path. Finally, through a comparison with the basic ant colony algorithm simulation on MATLAB, the feasibility and effectiveness of the improved ant colony algorithm are verified.

Modified crayfish optimization algorithm for solving multiple engineering application problems

Crayfish Optimization Algorithm (COA) is innovative and easy to implement, but the crayfish search efficiency decreases in the later stage of the algorithm, and the algorithm is easy to fall into local optimum. To solve these problems, this paper proposes an modified crayfish optimization algorithm (MCOA). Based on the survival habits of crayfish, MCOA proposes an environmental renewal mechanism that uses water quality factors to guide crayfish to seek a better environment. In addition, integrating a learning strategy based on ghost antagonism into MCOA enhances its ability to evade local optimality. To evaluate the performance of MCOA, tests were performed using the IEEE CEC2020 benchmark function and experiments were conducted using four constraint engineering problems and feature selection problems. For constrained engineering problems, MCOA is improved by 11.16%, 1.46%, 0.08% and 0.24%, respectively, compared with COA. For feature selection problems, the average fitness value and accuracy are improved by 55.23% and 10.85%, respectively. MCOA shows better optimization performance in solving complex spatial and practical application problems. The combination of the environment updating mechanism and the learning strategy based on ghost antagonism significantly improves the performance of MCOA. This discovery has important implications for the development of the field of optimization.Graphical

An optimization investigation of enhanced practicality for the OFH/PC scheme based PON monitoring system

We propose a discrete and average approach, focusing on the code set rather than individual codes, for the PON monitoring system based on the optical frequency hopping/periodic code scheme. The discrete and averaged codes are designed to support large-capacity network monitoring, particular for next-generation PONs, while preserving the original encoder structure of the PON monitoring system. The proposed approach discretizes and averages optical frequency hopping/periodic codes with small and large intervals, employing a modified greedy algorithm that mitigates falling into local optimality and an efficient backtracking algorithm, respectively. Our proposed algorithms demonstrate exceptional efficiency and performance, as exemplified by the modified greedy algorithm, which surpasses the exhaustive method by over 2 millionfold in terms of speed. This approach significantly reduces the more rigorously defined probability of multiple-customer interference and lowers the final recognition difficulty, enhancing the practicality of the PON monitoring system. Additionally, we develop a cost-effective model to analyze optimal system costs for discrete-averaged codes in the cost-sensitive PON market, facilitating the practical application of the PON monitoring system in engineering practice.

Quantifying regional variability of machine-learning-based snow water equivalent estimates across the Western United States

Seasonal snow-derived water is a critical component of the water supply in the mountains and downstream regions, and the accurate characterization of available water in the form of snow-water-equivalent (SWE), peak SWE, and snowmelt onset are essential inputs for water management efforts. Arising from recent advancements in artificial intelligence (AI) and machine learning (ML), we introduce a large-scale ML SWE model leveraging publicly available data sources and open-source software. The model demonstrates the application of a limited feature space in a relatively simple ML architecture without the need for process-based formulations to effectively estimate spatially continuous SWE at a daily temporal resolution. Beginning with in situ SWE measurements (i.e., SNOTEL), lidar-derived terrain features, and temporal variables, we employ localized feature engineering and optimization via gradient-boosting decision trees to identify regionally unique drivers of snowpack dynamics and use the optimal features to train regionally independent artificial neural networks to estimate regional SWE at a 1 km spatial resolution. The model results yield respectable skill in reconstructed 1 km gridded SWE magnitudes in a hindcast simulation of the 2019 water year that is independent of the training and testing data. Comparing model estimates to over 6200 observations, the model demonstrates a weighted RMSE of 15.4 cm, Kling-Gupta Efficiency metric of 0.86, and a percent bias of 0.71% across 23 snow-influenced regions in the western U.S. The model simulation produces peak SWE estimates within 10 cm for twenty of the twenty-three regions, demonstrating capability in effectively capturing regional snow accumulation processes. The demonstration of low-error ML workflows capable of providing near-real-time, spatially continuous SWE estimates at a high spatial resolution provides proof-of-concept and a foundation to effectively update snow state variables that drive water supply forecasts in snow-dominated regions.

Deep learning-based optimization of field geometry for total marrow irradiation delivered with volumetric modulated arc therapy.

Total marrow (lymphoid) irradiation (TMI/TMLI) is a radiotherapy treatment used to selectively target the bone marrow and lymph nodes in conditioning regimens for allogeneic hematopoietic stem cell transplantation. A complex field geometry is needed to cover the large planning target volume (PTV) of TMI/TMLI with volumetric modulated arc therapy (VMAT). Five isocenters and ten overlapping fields are needed for the upper body, while, for patients with large anatomical conformation, two specific isocenters are placed on the arms. The creation of a field geometry is clinically challenging and is performed by a medical physicist (MP) specialized in TMI/TMLI. To develop convolutional neural networks (CNNs) for automatically generating the field geometry of TMI/TMLI. The dataset comprised 117 patients treated with TMI/TMLI between 2011 and 2023 at our Institute. The CNN input image consisted of three channels, obtained by projecting along the sagittal plane: (1) average CT pixel intensity within the PTV; (2) PTV mask; (3) brain, lungs, liver, bowel, and bladder masks. This "averaged" frontal view combined the information analyzed by the MP when setting the field geometry in the treatment planning system (TPS). Two CNNs were trained to predict the isocenters coordinates and jaws apertures for patients with (CNN-1) and without (CNN-2) isocenters on the arms. Local optimization methods were used to refine the models output based on the anatomy of the patient. Model evaluation was performed on a test set of 15 patients in two ways: (1) by computing the root mean squared error (RMSE) between the CNN output and ground truth; (2) with a qualitative assessment of manual and generated field geometries-scale: 1=not adequate, 4=adequate-carried out in blind mode by three MPs with different expertise in TMI/TMLI. The Wilcoxon signed-rank test was used to evaluate the independence of the given scores between manual and generated configurations (p<0.05 significant). The average and standard deviation values of RMSE for CNN-1 and CNN-2 before/after local optimization were 15±2/13±3mm and 16±2/18±4mm, respectively. The CNNs were integrated into a planning automation software for TMI/TMLI such that the MPs could analyze in detail the proposed field geometries directly in the TPS. The selection of the CNN model to create the field geometry was based on the PTV width to approximate the decision process of an experienced MP and provide a single option of field configuration. We found no significant differences between the manual and generated field geometries for any MP, with median values of 4versus 4 (p=0.92), 3versus 3 (p=0.78), 4versus 3 (p=0.48), respectively. Starting from October 2023, the generated field geometry has been introduced in our clinical practice for prospective patients. The generated field geometries were clinically acceptable and adequate, even for an MP with high level of expertise in TMI/TMLI. Incorporating the knowledge of the MPs into the development cycle was crucial for optimizing the models, especially in this scenario with limited data.

Sand cat swarm optimization algorithm and its application integrating elite decentralization and crossbar strategy.

Sand cat swarm optimization algorithm is a meta-heuristic algorithm created to replicate the hunting behavior observed by sand cats. The presented sand cat swarm optimization method (CWXSCSO) addresses the issues of low convergence precision and local optimality in the standard sand cat swarm optimization algorithm. It accomplished this through the utilization of elite decentralization and a crossbar approach. To begin with, a novel dynamic exponential factor is introduced. Furthermore, throughout the developmental phase, the approach of elite decentralization is incorporated to augment the capacity to transcend the confines of the local optimal. Ultimately, the crossover technique is employed to produce novel solutions and augment the algorithm's capacity to emerge from local space. The techniques were evaluated by performing a comparison with 15 benchmark functions. The CWXSCSO algorithm was compared with six advanced upgraded algorithms using CEC2019 and CEC2021. Statistical analysis, convergence analysis, and complexity analysis use statistics for assessing it. The CWXSCSO is employed to verify its efficacy in solving engineering difficulties by handling six traditional engineering optimization problems. The results demonstrate that the upgraded sand cat swarm optimization algorithm exhibits higher global optimization capability and demonstrates proficiency in dealing with real-world optimization applications.

Route planning of mobile robot based on improved RRT star and TEB algorithm

This paper presents a fusion algorithm based on the enhanced RRT* TEB algorithm. The enhanced RRT* algorithm is utilized for generating an optimal global path. Firstly, proposing an adaptive sampling function and extending node bias to accelerate global path generation and mitigate local optimality. Secondly, eliminating path redundancy to minimize path length. Thirdly, imposing constraints on the turning angle of the path to enhance path smoothness. Conducting kinematic modeling of the mobile robot and optimizing the TEB algorithm to align the trajectory with the mobile robot's kinematics. The integration of these two algorithms culminates in the development of a fusion algorithm. Simulation and experimental results demonstrate that, in contrast to the traditional RRT* algorithm, the enhanced RRT* algorithm achieves a 5.8% reduction in path length and a 62.5% decrease in the number of turning points. Utilizing the fusion algorithm for path planning, the mobile robot generates a superior, seamlessly smooth global path, adept at circumventing obstacles. Furthermore, the local trajectory meticulously conforms to the kinematic constraints of the mobile robot.

A Local Line Optimization Model for Urban Rail Considering Passenger Flow Allocation

It is important to strengthen the research on urban rail transit (URT) existing line renovation strategies. In this paper, we investigate the optimization of bottlenecks that are less attractive but have strong travel demand in existing URT networks. A URT local line optimization model is constructed. The maximum passenger flow and minimum project cost are chosen as the optimization objective for the benefit of both passengers and operators, and several actual constraints are considered in the proposed model, such as the station interval. In order to obtain higher computational efficiency and accuracy, a passenger flow allocation method is embedded in a genetic algorithm with elitist preservation. Taking the local network of the Beijing URT as a case study, the calculation results show that the designed algorithm can quickly and effectively obtain the optimal solution, and the generated local line scheme is able not only to meet the regional travel demand, but also to optimize the connection relationship of the existing URT network. This study can provide a reference method for increasing the attraction of URT and optimization of existing URT networks.

Omnidirectional AGV Path Planning Based on Improved Genetic Algorithm

To address the issues with traditional genetic algorithm (GA) path planning, which often results in redundant path nodes and local optima, we propose an Improved Genetic Algorithm that incorporates an ant colony algorithm (ACO). Firstly, a new population initialization method is proposed. This method adopts a higher-quality random point generation strategy to generate random points centrally near the start and end of connecting lines. It combines the improved ACO algorithm to connect these random points quickly, thus greatly improving the quality of the initial population. Secondly, path smoothness constraints are proposed in the adaptive function. These constraints reduce the large-angle turns and non-essential turns, improving the smoothness of the generated path. The algorithm integrates the roulette and tournament methods in the selection stage to enhance the searching ability and prevent premature convergence. Additionally, the crossover stage introduces the edit distance and a two-layer crossover operation based on it to avoid ineffective crossover and improve convergence speed. In the mutation stage, we propose a new mutation method and introduce a three-stage mutation operation based on the idea of simulated annealing. This makes the mutation operation more effective and efficient. The three-stage mutation operation ensures that the mutated paths also have high weights, increases the diversity of the population, and avoids local optimality. Additionally, we added a deletion operation to eliminate redundant nodes in the paths and shorten them. The simulation software and experimental platform of ROS (Robot Operating System) demonstrate that the improved algorithm has better path search quality and faster convergence speed. This effectively prevents the algorithm from maturing prematurely and proves its effectiveness in solving the path planning problem of AGV (automated guided vehicle).

Improved Crab Algorithm Based on Chaos Theory and Its Application in Parameter Identification of Fresnel Refractive Index

The Crab Algorithm is an evolutionary algorithm inspired by the behavior of crabs, which balances global search and local optimization by simulating the behavioral strategies of crabs. This paper introduces chaos theory and proposes a chaos disturbance strategy. Chaos variables are introduced into the iteration process of the Crab Algorithm to perturb the position and velocity of individuals, thereby escaping local optima and achieving global optimization. Several test functions are used to compare the new algorithm with the original one, yielding better results. In the application of parameter identification of Fresnel refractive index, an optimization model is constructed, and the improved Crab Algorithm is applied to solve the model. The experimental results show that compared with the traditional Crab Algorithm, the improved algorithm proposed in this paper has significantly improved identification accuracy and convergence speed. In addition, by comparing with other optimization algorithms, the superiority of this paper's algorithm is verified.

Short-term Electricity Load Forecasting Based on Improved Seagull Algorithm Optimized Gated Recurrent Unit Neural Network

INTRODUCTION: The complexity of the power network, changes in weather conditions, diverse geographical locations, and holiday activities comprehensively affect the normal operation of power loads. Power load changes have characteristics such as non stationarity, randomness, seasonality, and high volatility. Therefore, how to construct accurate short-term power load forecasting models has become the key to the normal operation and maintenance of power.OBJECTIVES: Accurate short-term power load forecasting helps to arrange power consumption planning, optimize power usage and largely reduce power system losses and operating costs.METHODS: A hybrid decomposition-optimization-integration load forecasting method is proposed to address the problems of low accuracy of current short-term power load forecasting methods.RESULTS: The original power load time series is decomposed using the complete ensemble empirical modal decomposition method, while the correlation of power load influencing factors is analysed using Pearson correlation coefficients. The seagull optimisation algorithm is overcome to fall into local optimality by using the random adaptive non-linear adjustment strategy of manipulated variables and the differential variational Levy flight strategy, which improves the search efficiency of the algorithm. Then, the The gated cyclic unit hidden layer parameters are optimised by the improved seagull optimisation algorithm to construct a short-term electricity load forecasting model.The effectiveness of the proposed method is verified by simulation experimental analysis. The results show that the proposed method has improved the accuracy of the forecasting model.CONCLUSION: The CEEMD method is used to decompose the original load time series, which improves the accuracy of the measurement model. The GRU prediction model based on improved SOA optimization not only has better prediction accuracy than other prediction models, but also consumes the least amount of time compared to other prediction models.

Hybrid Strategy Improved Beetle Antennae Search Algorithm and Application

The multi-dimensional optimization of mechanisms is a typical optimization problem encountered in mechanical design. Herein, the Hybrid strategy improved Beetle Antennae Search (HSBAS) algorithm is proposed to solve the multi-dimensional optimization problems encountered in structural design. To solve the problems of local optimization and low accuracy of the high-dimensional solution of the Beetle Antennae Search (BAS) algorithm, the algorithm adopts the adaptive step strategy, multi-directional exploration strategy, and Lens Opposition-Based Learning strategy, significantly reducing the probability of the algorithm falling into the local optimum and improving its global search capability. Comparative experiments of the improved algorithm are carried out by selecting eleven benchmark test functions. HSBAS can reach 1 × 10−22 accuracy from the optimal value when dealing with low-dimensional functions. It can also obtain 1 × 10−2 accuracy when dealing with high-dimensional functions, significantly improving the algorithm’s capability. According to Friedman’s ranking test result, HSBAS ranks first, which proves that HSBAS is superior to the other three algorithms. The HSBAS algorithm is further used to optimize the design of the altitude compensation module of the gravity compensation device for solar wings, controlling the fluctuation of bearing capacity within 0.25%, which shows that the algorithm can be used as an effective tool for engineering structural optimization problems.

Application of Big Data Analysis and Intelligent Algorithm in Power System Operation Optimization

The power communication system provides powerful technical support for realizing the intelligent operation and information management of the power grid and improving the operation efficiency and power supply quality of the power grid. Quantum key distribution (QKD) is considered one of the most promising technologies for commercialization. QKD uses a single photon to encrypt data to produce a more secure and reliable password. This paper intends to study the hierarchical, centralized control architecture of power dispatching based on quantum essential supply (QKD). The performance indexes of MDI-QKD under symmetric and asymmetric conditions were studied by local optimization. The optimal key formation rate of the algorithm is analyzed. From the perspective of quantum critical utilization, a quantum key utilization scheme for grid backbone dispatching service is proposed. The dynamic adjustment test of multi-node time slot and service key update rate is carried out. Experiments show that the MDI scheme can effectively improve the effectiveness of a multi-node QKD system. Thus, the security of data transmission of the core business of power dispatching data networks can be ensured to the greatest extent. AMDI can effectively reduce the transmission timeout of low-priority data streams because the delay of high-priority data streams reaches the proportion. It can be an excellent solution to the power system and the password requirements.

Optimisation-based strategies to identification of material parameters of hygro-thermo-mechanical problems

Applications involving hygro-thermo-mechanical models are found in engineering fields as diverse as electronic packaging, concrete structures, composite materials and wood structures. Within the framework of wood processing, hygro-thermo-mechanical problems account for the cross-dependence of moisture content, temperature and dimensional changes of wooden components. Numerical simulation plays an important role in predicting the behaviour of wooden structures and, therefore, use of appropriate process and material parameters is essential for a successful prediction. The present work is inserted in this context and addresses application of optimisation techniques to identification of heat transfer, moisture diffusion and moisture-dependent swelling/shrinkage parameters. The direct problem is formulated based on a fully coupled transient solution of the energy, moisture and momentum transfer conservation laws. A global–local hybrid optimisation technique is proposed combining swarm intelligence and deterministic approaches, respectively based on particle swarm optimisation and the Nelder–Mead (NM) technique. The first stage aims at reducing the search space, so that the NM algorithm is able to determine the global minimum with acceptable accuracy. The strategy is both robust and efficient, being able to avoid local minima with reduced number of fitness computations. An illustrative example featuring a moisture-gaining process is also discussed, in which special attention is placed on the elastic and material swelling coupled effects caused by moisture transfer.

A Resampling Ant Colony Optimization with Elite Exploration and Convergence Mechanism for Multithreshold Segmentation of Breast Cancer Images

Previous studies have emphasized the potential of threshold image segmentation for early breast cancer detection. However, traditional methods encounter challenges regarding low segmentation efficiency and accuracy. Addressing this, the ant colony optimization algorithm for continuous optimization (ACOR) shows promise. Yet, existing ACOR variants still grapple with poor initial population quality, affecting convergence speed and avoiding local optimization. These issues impact segmentation efficiency and accuracy. To tackle them, this study introduces RESACO, an enhanced ACOR version integrating three novel optimization strategies: resampling initialization (RIS), elite exploration (EES), and strengthened convergence mechanism (SCM). RIS enhances initial population quality by resampling regions with individuals demonstrating superior fitness and segmentation efficiency. EES promotes exploration across the search space, preventing local optima entrapment and enhancing model stability. SCM expediting convergence, segmentation efficiency, and precision. RESACO's performance is assessed through extensive experiments using IEEE CEC 2014 and IEEE CEC 2022 benchmark functions, including ablation experiments and comparisons with basic and improved algorithms and ACOR variants. Subsequently, the threshold image segmentation model based on RESACO is compared with other models using metaheuristic algorithms for segmenting realistic breast cancer medical images. Results demonstrate the proposed model's faster convergence and higher segmentation accuracy, preserving more lesion tissue details.

Certifying Optimality of Bell Inequality Violations: Noncommutative Polynomial Optimization through Semidefinite Programming and Local Optimization

Certifying Optimality of Bell Inequality Violations: Noncommutative Polynomial Optimization through Semidefinite Programming and Local Optimization

Local and global optimization methods for optical line control based on quality of transmission

The ever-increasing demand for data traffic in recent decades has pushed network operators to give importance to the aspect of infrastructure control to facilitate its scalability and maximize its capacity. A generic lightpath (LP) is deployed starting from a traffic request between a given pair of nodes in a network. LPs are operated in the network based on an estimate of the quality of transmission (QoT), which is derived from the physical layer characteristics of a selected route. Regardless of the model used to estimate QoT, it is necessary to calibrate the model to maximize its accuracy and define minimum design margins. The model calibration process depends significantly on the type of data that can be collected in the field (i.e., type of metric, resolution) and therefore on the available monitoring devices. In this work, a systematic evaluation of the QoT estimation is carried out on a multi-span erbium-doped-fiber-amplified optical line system (OLS) using in the first case only total power monitors and in the second experimentally emulating optical channel monitors (OCMs). Given the type of monitoring devices available, three different physical models are calibrated, and six optimization methods are used to define the optimal configuration of the target gain and tilt parameters of the optical amplifiers, jointly optimizing the working point of all amplifiers (global approach) or proceeding span by span (local approach). Subsequently, the OLS was set in each configuration obtained, and the generalized signal-to-noise ratio (GSNR) profile was measured at the end.