Heuristic Optimization Algorithm Research Articles

Machine learning-based clustering analysis of the banking green credit for the renewable energy industry

Credit policies for clean and renewable energy businesses play a crucial role in supporting carbon neutrality efforts to combat climate change. Clustering the credit capacity of these companies to prioritize lending is essential given the limited capital available. Support Vector Machine (SVM) and Artificial Neural Network (ANN) are two robust machine learning algorithms for addressing complex clustering problems. Additionally, hyperparameter selection within these models is effectively enhanced through the support of a robust heuristic optimization algorithm, Particle Swarm Optimization (PSO). To leverage the strength of these advanced machine learning techniques, this paper aims to develop SVM and ANN models, optimized with the PSO, for the clustering problem of green credit capacity in the renewable energy industry. The results show low Mean Square Error (MSE) values for both models, indicating high clustering accuracy. The credit capabilities of wind energy, clean fuel, and biomass pellet companies are illustrated in quadrant charts, providing stakeholders with a clear view to adjust their credit strategies. This helps ensure the efficient operation of banking green credit policies.

Visual localization of robotic end effector via fusion of 3D Gaussian Splatting and heuristic optimization algorithm

The visual localization of the robotic end effector holds significant importance and value in intelligent manufacturing. Regarding this issue, a pose estimation framework integrating the radiance field rendering and an improved differential evolution algorithm is proposed in this paper. Firstly, multi-view images of the object are collected by an industrial camera carried on the robotic arm. Then, a 3D Gaussian Splatting model is trained, and the observation trajectory of the virtual camera is designed based on the query image in Nerfstudio for visualization. The key frames and the corresponding pose matrices of the rendered videos along the trajectory are extracted. Subsequently, the improved differential evolution algorithm through double-layer optimization proposed in this paper is employed to conduct similarity matching between the query image and the extracted rendered images. The pose matrix corresponding to the most similar rendered image is the estimated pose of the query image. Through experiments, this paper explores the influence of the frame sampling rate on the pose estimation accuracy, and conducts comparative and ablation experiments with the commonly used methods at present. The experimental results demonstrate that the proposed method possesses good feasibility and outstanding performance.

Global Path Optimal Planning Method for Autonomous Vehicles Based on Image Feature Extraction

In order to solve the problem of autonomous vehicles driving safely on the road while searching for optimal paths to avoid traffic congestion and obstruction, this paper establishes an optimal path planning model based on image feature extraction. The model consists of four parts: the selection of key turning points, interpolation between turning points, definition of the evaluation function, and global optimal path search. First, based on the map information provided by the network, an image feature detection algorithm was proposed, and the key turning points of the map route were selected and stored in an open table. Then, based on mechanical analysis theory, the cubic interpolation between two key turning points of the optimal path was defined. This allows the car to drive along a continuous curve with a certain arc radius, enabling it to drive smoothly, effectively avoid obstacles, and ensure safety. Then, an evaluation function is defined as needed, and different evaluation functions are specified for different road sections to avoid excessive local deviations in planning and to reduce the impact of known obstacles on the path. Finally, the cost of the search path is calculated based on the evaluation function. According to the principle of minimum cost, a globally optimal heuristic search algorithm is proposed to find the globally optimal path. Experimental results show that the proposed global optimal path planning algorithm has excellent performance, with an average accuracy of 96.71% and a search speed of 2.78 ms. The model not only provides accurate path planning and fast path selection capabilities but also has strong robustness against interference.

Mission Planning Method for Dense Area Target Observation Based on Clustering Agile Satellites

To address the mission planning challenge for agile satellites in dense point target observation, a clustering strategy based on an ant colony algorithm and a heuristic simulated genetic annealing optimization algorithm are proposed. First, the imaging observation process of agile satellites is analyzed, and an improved ant colony algorithm is employed to optimize the clustering of observation tasks, enabling the satellites to complete more observation tasks efficiently with a more stable attitude. Second, to solve for the optimal group target observation sequence and achieve higher total observation benefits, a task planning model based on multi-target observation benefits and attitude maneuver energy consumption is established, considering the visible time windows of targets and the time constraints between adjacent targets. To overcome the drawbacks of traditional simulated annealing and genetic algorithms, which are prone to local optimal solution and a slow convergence speed, a novel Simulated Genetic Annealing Algorithm is designed while optimizing the sum of target observation weights and yaw angles while also accounting for factors such as target visibility windows and satellite attitude transition times between targets. Ultimately, the feasibility and efficiency of the proposed algorithm are substantiated by comparing its performance against traditional heuristic optimization algorithms using a dataset comprising large-scale dense ground targets.

Study on Compression Bearing Capacity of Tapered Concrete-Filled Double-Skin Steel Tubular Members Based on Heuristic-Algorithm-Optimized Backpropagation Neural Network Model

A tapered concrete-filled double-skin steel tubular (TCFDST) structure has been used as the main framework in transmission towers, offshore facility platforms, and turbine towers owing to its excellent mechanical properties. In order to solve the difficulties of calculating the axial compressive capacity of TCFDST members due to the variations in cross-section, this paper applied heuristic optimization algorithms such as Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), Simulated Annealing (SA), and Ant Colony Optimization (ACO) to enhance a Backpropagation Neural Network (BPNN) model. A predictive model incorporating both global and local optimization strategies for the axial compressive capacity of a TCFDST structure is proposed. A comprehensive axial database for TCFDST members, comprising 1327 sets of experimental and finite element analysis results, was established, with ten types of component dimensions and material parameters selected as input variables and compressive bearing capacity as the output variable. This study developed and assessed four BPNN models, each optimized by a different heuristic algorithm, against various machine learning algorithms and standards. The heuristic-algorithm-optimized BPNN models demonstrated superior accuracy in predicting the axial compressive capacity of TCFDST members. Through parametric analysis, this study identified the relationship between the model’s bearing capacity predictions and each input parameter, confirming the model’s broad applicability. The optimized BPNN model, refined with heuristic algorithms, provides a significant reference for addressing the computational challenges associated with the load-bearing capacity of TCFDST structures and facilitating their application.

Leveraging Classifier Performance Using Heuristic Optimization for Detecting Cardiovascular Disease from PPG Signals.

Photoplethysmography (PPG) signals, which measure blood volume changes through light absorption, are increasingly used for non-invasive cardiovascular disease (CVD) detection. Analyzing PPG signals can help identify irregular heart patterns and other indicators of CVD. This research involves a total of 41 subjects sourced from the CapnoBase database, consisting of 21 normal subjects and 20 CVD cases. In the initial stage, heuristic optimization algorithms, such as ABC-PSO, the Cuckoo Search algorithm (CSA), and the Dragonfly algorithm (DFA), were applied to reduce the dimension of the PPG data. Next, these Dimensionally Reduced (DR) PPG data are then fed into various classifiers such as Linear Regression (LR), Linear Regression with Bayesian Linear Discriminant Classifier (LR-BLDC), K-Nearest Neighbors (KNN), PCA-Firefly, Linear Discriminant Analysis (LDA), Kernel LDA (KLDA), Probabilistic LDA (ProbLDA), SVM-Linear, SVM-Polynomial, and SVM-RBF, to identify CVD. Classifier performance is evaluated using Accuracy, Kappa, MCC, F1 Score, Good Detection Rate (GDR), Error rate, and Jaccard Index (JI). The SVM-RBF classifier for ABC PSO dimensionality reduced values outperforms other classifiers, achieving the highest accuracy of 95.12% along with the minimum error rate of 4.88%. In addition to that, it provides an MCC and kappa value of 0.90, a GDR and F1 score of 95%, and a Jaccard Index of 90.48%. This study demonstrated that heuristic-based optimization and machine learning classification of PPG signals are highly effective for the non-invasive detection of cardiovascular disease.

Heuristic Optimization Algorithm of Black-Winged Kite Fused with Osprey and Its Engineering Application.

Swarm intelligence optimization methods have steadily gained popularity as a solution to multi-objective optimization issues in recent years. Their study has garnered a lot of attention since multi-objective optimization problems have a hard high-dimensional goal space. The black-winged kite optimization algorithm still suffers from the imbalance between global search and local development capabilities, and it is prone to local optimization even though it combines Cauchy mutation to enhance the algorithm's optimization ability. The heuristic optimization algorithm of the black-winged kite fused with osprey (OCBKA), which initializes the population by logistic chaotic mapping and fuses the osprey optimization algorithm to improve the search performance of the algorithm, is proposed as a means of enhancing the search ability of the black-winged kite algorithm (BKA). By using numerical comparisons between the CEC2005 and CEC2021 benchmark functions, along with other swarm intelligence optimization methods and the solutions to three engineering optimization problems, the upgraded strategy's efficacy is confirmed. Based on numerical experiment findings, the revised OCBKA is very competitive because it can handle complicated engineering optimization problems with a high convergence accuracy and quick convergence time when compared to other comparable algorithms.

Optimal robust configuration in cloud environment based on heuristic optimization algorithm

To analyze performance in cloud computing, some unpredictable perturbations that may lead to performance degradation are essential factors that should not be neglected. To prevent performance degradation in cloud computing systems, it is reasonable to measure the impact of the perturbations and propose a robust configuration strategy to maintain the performance of the system at an acceptable level. In this article, unlike previous research focusing on profit maximization and waiting time minimization, our study starts with the bottom line of expected performance degradation due to perturbation. The bottom line is quantified as the minimum acceptable profit and the maximum acceptable waiting time, and then the corresponding feasible region is defined. By comparing between the system’s actual working performance and the bottom line, the concept of robustness is invoked as a guiding basis for configuring server size and speed in feasible regions, so that the performance of the cloud computing system can be maintained at an acceptable level when perturbed. Subsequently, to improve the robustness of the system as much as possible, discuss the robustness measurement method. A heuristic optimization algorithm is proposed and compared with other heuristic optimization algorithms to verify the performance of the algorithm. Experimental results show that the magnitude error of the solution of our algorithm compared with the most advanced benchmark scheme is on the order of 10−6, indicating the accuracy of our solution.

Particle swarm optimization based on data driven for EV charging station siting

Charging stations are an important support facility for electric vehicles (EVs). Nowadays, the EV industry is developing rapidly, however, the imperfect construction of charging stations or the unreasonable choice of location has seriously reduced the desire of people to buy EVs and led to the problem of difficult charging of EVs in many areas. At present, the research field of EV charging station siting suffers from the inability to quickly and accurately calculate the optimal solution for charging station siting. In this regard, a particle swarm optimization based on deep neural networks modified boundaries (DNNMBPSO) is proposed for solving the problem. DNNMBPSO reduces the convergence value of the objective function by applying deep learning to modify the boundary of the particle swarm optimization. DNNMBPSO is an algorithm that combines heuristic and data driven. In this study, DNNMBPSO is applied for siting study in a system having 50 alternative points, 500 alternative points, and 1000 alternative points and a case of siting of electric vehicle charging stations in Nanning, Guangxi, China. The convergence value of the DNNMBPSO-based objective function is found to be at least 5.5 %, 1.7 %, 8.23 % and 14.7 %, lower compared to genetic algorithms, African vulture optimization algorithm, particle swarm optimization, and grey wolf optimization algorithms, respectively. Traditional heuristic optimization algorithms cannot find optimal solutions in large-scale systems, while DNNMBPSO shows feasibility in large-scale systems.

Efficient Pump Scheduling for Large‐Scale Multiproduct Pipelines Using Deep Reinforcement Learning

ABSTRACTOptimizing pump scheduling in multiproduct pipelines can significantly reduce energy consumption and carbon emissions. For pump scheduling in multiproduct pipelines, to describe hydraulic losses more accurately, the model needs to adopt shorter discrete time intervals, which will lead to longer decision‐making time. It combined with the large solution space of large‐scale pipelines, will lead to low solution efficiency with dynamic programming methods and poor solution quality with heuristic optimization algorithms. Given that, this article develops a multiproduct refined oil transmission simulation system and employs the enhanced Proximal Policy Optimization (PPO) algorithm with action space shaping trick to optimize pump scheduling for large‐scale multiproduct pipelines. The method of converting discrete action space to multi‐discrete action space through action shaping can address PPO's low convergence efficiency issue resulting from the large discrete action space challenge common in large‐scale multiproduct pipelines. The experimental results indicate that the proposed method, that is, PPO algorithm with multidiscrete action space exhibits significant advantages in terms of efficiency and robustness in large‐scale pipelines compared to mainstream methods for pump scheduling such as dynamic programming (DP), genetic algorithms (GA), and ant colony optimization (ACO). Furthermore, we demonstrate the effectiveness of action space shaping in large‐scale pipelines from the perspectives of exploration and exploitation.

Joint-optimized coverage path planning framework for USV-assisted offshore bathymetric mapping: From theory to practice

Designing effective coverage routes for unmanned surface vehicles (USVs) is crucial to improve the efficiency of offshore bathymetric surveys. However, existing coverage planning methods for practical use are limited, primarily due to the large-scale surveying areas and intricate region geometries caused by coastal features. This study aims to address these challenges by introducing a coverage path planning framework for USV-assisted bathymetric mapping, specifically aimed at the joint optimization of paths to cover numerous complex regions. Initially, we conceptualize the large-scale bathymetric survey mission as an integer programming model. The model uses four distinct decision variables to meticulously formulate length calculations, inter-regional connections, entry and exit point selections, and line sweep direction. Then, a novel hierarchical algorithm is devised to solve the problem. The method first incorporates a bisection-based convex decomposition method to achieve optimal partitioning of complex regions. Additionally, a hierarchical heuristic optimization algorithm that seamlessly integrates the optimization of all influencing factors is designed, which includes order generation, candidate pattern finding, tour finding, and final optimization. The reliability of the framework is validated through semi-physical simulations and lake trials using a real USV. Through comparative studies, our model demonstrates clear advantages in computational efficiency and optimization capability compared to state-of-the-arts, with its superiority becoming more pronounced as the problem scale increases. The results from lake trials further affirm the efficient and reliable performance of our model in practical bathymetric survey tasks.

The Use of Heuristic Optimization Techniques on RV Cycloid Reducer Design: A Comparative Study

In this study, heuristic optimization algorithms such as particle swarm optimization (PSO) and quantum particle swarm optimization (QPSO) have been used to optimize the weight of the cycloid reducer based on the values of some parameters. The algorithms were applied separately to the design problem, and their performances were compared. Initially, a basic design was performed using conventional approaches. Constraint conditions have been defined based on geometric features and the essential component of the reducer, the cycloidal gear, and then the existing basic design has been optimized in terms of size and weight. Finally, finite element analysis was conducted to validate the obtained parameter values and control the stresses in the contact areas of the cycloid gear profile. It has been determined that PSO reduced the weight of the basic design by 33.3 %, whereas QPSO reduced it by 33.8 %. Moreover, the results of the finite element analysis showed that the design obtained according to both optimization methods was safe in terms of the resulting stresses. Consequently, it has been demonstrated that the selected design parameters and constraint equations have been sufficient and that the basic designs could be enhanced using intuitive optimization methods.

ADVANCED TECHNIQUES IN MULTI-LABEL TEXT CLASSIFICATION: INTEGRATION OF BETA ANT COLONY AND DEEP LEARNING APPROACHES

The rapid growth of unstructured textual data in various domains has necessitated the development of sophisticated techniques for multi-label text classification. Traditional methods often struggle with handling the complexity and interdependence of multiple labels, leading to suboptimal performance. This paper presents an advanced approach that integrates the Beta Ant Colony Optimization (BACO) algorithm with deep learning techniques for multi-label text classification. The BACO algorithm effectively explores the feature space and selects relevant features by leveraging pheromone trails, while the deep learning model captures intricate patterns and relationships within the textual data. The integration of these two methodologies aims to enhance the efficiency and accuracy of multi-label classification tasks, particularly in domains where label dependency is prominent. Empirical evaluations on benchmark datasets demonstrate that the proposed hybrid approach outperforms existing state-of-the-art techniques in terms of precision, recall, F1-score, and computational efficiency. The findings suggest that combining heuristic optimization algorithms with deep learning can significantly improve multi-label text classification performance, providing a robust solution for real-world applications.

A Local Search Algorithm with Vertex Weighting Strategy and Two-Level Configuration Checking for the Minimum Connected Dominating Set Problem.

The minimum connected dominating set problem is a combinatorial optimization problem with a wide range of applications in many fields. We propose an efficient local search algorithm to solve this problem. In this work, first, we adopt a new initial solution construction method based on three simplification rules. This method can reduce the size of the original graph and thus obtain a high-quality initial solution. Second, we propose an approach based on a two-level configuration checking strategy and a tabu strategy to reduce the cycling problem. Third, we introduce a perturbation strategy and a vertex weighting strategy to help the algorithm be able to jump out of the local optimum effectively. Fourth, we combine the scoring functions Cscore and Mscore with the aforementioned strategies to propose effective methods for selecting vertices. These methods assist the algorithm in selecting vertices that are suitable for addition to or removal from the current candidate solution. Finally, we verify the performance advantages of the local search algorithm by comparing it with existing optimal heuristic algorithms on two sets of instances. The experimental results show that the algorithm exhibits better performance on two sets of classical instances.

Deterministic Multi-Objective Optimization of Analog Circuits

Stochastic optimization approaches benefit from random variance to produce a solution in a reasonable time frame that is good enough for solving the problem. Compared with them, deterministic optimization methods feature faster convergence rates and better reproducibility but may get stuck at a local optimum that is insufficient to solve the problem. In this paper, we propose a group-based deterministic optimization method, which can efficiently achieve comparable performance to heuristic optimization algorithms, such as particle swarm optimization. Moreover, the weighted sum method (WSM) is employed to further improve our deterministic optimization method to be multi-objective optimization, making it able to seek a balance among multiple conflicting circuit performance metrics. With a case study of three common analog circuits tested for our optimization methodology, the experimental results demonstrate that our proposed method can more efficiently reach a better estimation of the Pareto front compared to NSGA-II, a well-known multi-objective optimization approach.

Multi-objective design optimization of hermetically sealed core-type distribution transformer considering current harmonics of power grid using NSGA III

In this paper, the design optimization of hermetically sealed oil-immersed distribution transformers is studied. For the first time in the design of this type of transformer, harmonics of the power grid affecting the transformer design, along with all design variables, are included, and their boundaries suitable for the production line are determined. The design probability (search space) for a total of 21 design variables is 1.32×1025. The Brute Force method is not a time-efficient approach to finding the optimal result in this search space. Due to the mixed integer nonlinear programming (MINLP) nature of the transformer design problem, heuristic optimization algorithms are selected because of their shorter solution time and near-optimal results. Considering the principle of the “No Free Lunch” theorem, extensive evaluations were conducted on various heuristic algorithms to identify the most effective ones for addressing the transformer design problem. The most successful algorithms for solving the problem were identified after thorough evaluation, considering three distinct scenarios within a multi-objective optimization framework. These algorithms are namely MOEA/D, MOGWO, MOWOA, and NSGA III. In this study, an optimization tool is developed for the design optimization of hermetically sealed distribution transformers, covering a range from 50 kVA to 3150 kVA and encompassing all design variables. The developed optimization program is fully compatible with the production line and can be easily adjusted to meet all national and international standards, such as IEC and IEEE, as well as customer specifications.

Non-dominated sorting artificial rabbit multi-objective sizing optimization for a conceptual powertrain of a 6 × 4 battery electric tractor truck

In order to tackle the increasingly severe energy crisis, improving the efficiency of the powertrain system in battery electric vehicles has become an effective approach. Based on a 6 × 4 battery electric tractor truck (BETT), the paper focuses on enhancing the dynamic and economic performance of vehicles through advancements in configuration, control strategies, and parameter design. Firstly, a novel multi-motor torque coupling powertrain system based on the parallel-axle transmission is proposed and modeled. Then, an instantaneous minimum energy consumption control strategy for the economic performance simulation and an instantaneous maximum acceleration control strategy for the dynamic performance simulation are designed. Furthermore, a conventional heuristic single-objective optimization algorithm, artificial rabbit optimization (ARO), is improved into a multi-objectives version, non-dominated sorting artificial rabbit multi-objective optimization (NSARMO), by combining the fast non-dominated sorting (FNS) and modifying the calculation method of the energy factor. Finally, an optimization framework consisting of a control layer, model layer, and optimization layer is established and applied to the parameter optimization of the proposed powertrain system. Simulation results demonstrate that the optimization results of the proposed method are superior to those optimized by commonly used non-dominated sorting genetic algorithm-II (NSGA-II) and NSARMO without the modified energy factor, achieving a better balance between dynamic performance and economic performance. Moreover, the proposed method exhibits demonstrates 40.67% and 24.67% improvement in its ability to search for optimal Pareto solutions compared to NSARMO (-)(- means the calculation method of energy factor is not modified) and NSGA-II. At last, a hardware-in-the-loop (HIL) experiment bench is established, and the experiment results indicate that a scheme optimized by the proposed NSARMO exhibits only an approximate performance in energy consumption in the HIL environment compared to the simulation environment, which signifies the effectiveness of control strategy equipped with the optimization results optimized by the proposed method.

Introduct Risk Prediction Protection Study Based on GA-BP and K-means Clustering

This paper mainly focuses on the risk management problems caused by frequent extreme weather events. Firstly, a grey bp neural network model is used as a heuristic optimization algorithm to construct an IWM model, which is used to decide whether insurance company provides insurance under extreme weather conditions. Secondly, based on the Comprehensive evaluation method (RSR), a DDI evaluation model was constructed to analyze the data of 100 buildings in 10 provinces in China to help developers evaluate the rationality of decisions. Finally, a PM evaluation model is constructed based on AHP and EWM-CRITIC, and K-means clustering is used to conduct comprehensive rating and grading evaluation of 30 low-insurance landmarks, and corresponding protection strategies are designed. The comprehensive application of these models provides useful suggestions and decision support for insurance company underwriting, real estate bidding, community building protection and so on.

An improved golden jackal optimization algorithm for combined economic emission dispatch problems

In this research paper, a new improved golden jackal optimization (IGJO) algorithm is applied to address the combined economic emission dispatch (CEED) problem, along with various thermal generator constraints such as valve point loading (VPL) effect, generator limits (GL) in power system. The hunting behavior of the golden jackals is mimicked in the golden jackal optimization (GJO) algorithm. The main aim of the CEED problem is to find the best optimal generation scheduling while minimizing both fuel cost and emission besides meeting the different power system constraints. The original GJO algorithm faces challenges when dealing with high-dimensional optimization problems, as it tends to get trapped in local optima. To address this issue the opposition-based learning (OBL) method was adopted in this GJO algorithm to obtain the global optimal solution and ensure enhanced performance in finding the solution for the CEED problems. To assess the competitiveness of the IGJO algorithm, it is used for various CEED test problems available in the literature, and results are contrasted with other recent heuristic optimization algorithms. Simulation results show that the proposed IGJO performs more effectively than the other compared algorithms in terms of solution quality, and robustness.

Research on Portable Intelligent Terminal and APP Application Analysis and Intelligent Monitoring Method of College Students' Health Status

As a carrier of college students' health status monitoring, portable intelligent terminal APP, the study of its APP application analysis not only provides a new way for college students' extracurricular physical exercise, guides college students to actively participate in extracurricular physical activities using intelligent terminal APP software, but also promotes college students' physical health monitoring and enhancement in various aspects. Aiming at the current portable terminal APP college students' health monitoring application analysis method research exists low precision, real-time poor and other problems, through the analysis of the basic functional framework and functional characteristics of the portable intelligent terminal APP, the establishment of the portable intelligent terminal APP analysis index system applied to college students' health monitoring, combined with the heuristic optimisation algorithm and the improvement of deep learning algorithms, the construction of the marine predator based heuristic optimisation algorithm and the attention mechanism to improve the gating control loop. Combining the heuristic optimisation algorithm and the improved deep learning algorithm, we construct the portable intelligent terminal APP application analysis method for college students' health monitoring based on the marine predator heuristic optimisation algorithm and the attention mechanism improved gated recurrent unit neural network. Through simulation analysis, the results show that the proposed method meets the real-time requirements while improving the prediction accuracy of the portable smart terminal APP application analysis method, and significantly improves the efficiency of portable smart terminal APP analysis.