Hybrid Simulated Annealing Research Articles

Dynamic load frequency control in Power systems using a hybrid simulated annealing based Quadratic Interpolation Optimizer

Ensuring the stability and reliability of modern power systems is increasingly challenging due to the growing integration of renewable energy sources and the dynamic nature of load demands. Traditional proportional-integral-derivative (PID) controllers, while widely used, often fall short in effectively managing these complexities. This paper introduces a novel approach to load frequency control (LFC) by proposing a filtered PID (PID-F) controller optimized through a hybrid simulated annealing based quadratic interpolation optimizer (hSA-QIO). The hSA-QIO uniquely combines the local search capabilities of simulated annealing (SA) with the global optimization strengths of the quadratic interpolation optimizer (QIO), providing a robust and efficient solution for LFC challenges. The key contributions of this study include the development and application of the hSA-QIO, which significantly enhances the performance of the PID-F controller. The proposed hSA-QIO was evaluated on unimodal, multimodal, and low-dimensional benchmark functions, to demonstrate its robustness and effectiveness across diverse optimization scenarios. The results showed significant improvements in solution quality compared to the original QIO, with lower objective function values and faster convergence. Applied to a two-area interconnected power system with hybrid photovoltaic-thermal power generation, the hSA-QIO-tuned controller achieved a substantial reduction in the integral of time-weighted absolute error by 23.4%, from 1.1396 to 0.87412. Additionally, the controller reduced the settling time for frequency deviations in Area 1 by 9.9%, from 1.0574 s to 0.96191 s, and decreased the overshoot by 8.8%. In Area 2, the settling time was improved to 0.89209 s, with a reduction in overshoot by 4.8%. The controller also demonstrated superior tie-line power regulation, achieving immediate response with minimal overshoot.

Hybrid simulated annealing–slime mould algorithm for the non-permutation flow-shop scheduling problem

The non-permutation flow-shop scheduling problem (NPFSP) is a more general type of flow-shop scheduling problem than the permutation flow-shop scheduling problem (PFSP). It features a large solution space and is highly complex. In this study, a novel metaheuristic algorithm is proposed for the NPFSP, where makespan is the scheduling objective. The specific implementation process is as follows. First, a mathematical model of the NPFSP is constructed. Secondly, the encoding and decoding rules are designed to establish the association between the solutions for PFSP and NPFSP. Subsequently, a metaheuristic hybrid simulated annealing–slime mould algorithm is proposed. Finally, a series of control experiments is conducted based on the Demirkol benchmark. The statistical results show the effectiveness of the proposed algorithm in solving the NPFSP.

A hybrid SATS algorithm based security constrained optimal power flow using FACTS devices

In the realm of power systems, achieving optimal operation while ensuring security remains a paramount challenge. The security constrained optimal power flow (SCOPF) problem deals with optimizing power system operations while taking into account security limitations. Flexible alternating current transmission system (FACTS) is a system consisting of static equipment used for transmitting electrical energy in the form of AC. The static synchronous series compensator (SSSC) is a specific form of series FACTS device. The unified power flow controller (UPFC) is a FACTS device that is connected in parallel and series with a transmission line. In this research, hybrid simulated annealing and tabu search (hybrid SATS) algorithm is designed to solve SCOPF problems that involve use of FACTS devices. The combination of simulated annealing and tabu search is intended to improve algorithm's pace of convergence and the quality of its solutions. Hybrid SATS with FACTS devices are used to investigate line flow limit violations during single line failures and ensure power flows remain within their security limitations. The efficacy of proposed algorithm is demonstrated through case studies utilizing IEEE 30 bus system. These case studies demonstrate algorithm's capabilities to achieve optimal and secure power system functioning to demonstrate its effectiveness.

Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and multi-start algorithms

In a discrete balanced graph partitioning problem (DBGPP), a simple undirected weighted graph in that both vertices and edges are weighted is given. The task is dividing vertices into two disjoint subsets such that the sum of the weights of cut edges is minimized and the sum of the weights of vertices in each subset must equal or be as close as possible to each other. Here in order to solve the DBGPP, we first transform the problem into continuous quadratic programming and then show that the new problem has a binary solution, which is the optimal solution for the DBGPP. We also give necessary and sufficient conditions of continuous quadratic programming to identify stationary and local optimal solutions. In addition, we propose a local search to find a binary solution of the continuous quadratic programming. An approximated solution of the DBGPP is obtained using a hybrid simulated annealing algorithm. In our proposed algorithm, the structure of the objective function in a continues problem is considered as the evaluator function. Due to the Dolan–Moré performance profiles and the non-parametric statistical one-sided Wilcoxon signed rank test, we demonstrate the efficiency of our proposed approach in comparison with other available methods.

Metaheuristic algorithms for capacitated controller placement in software defined networks considering failure resilience

SummarySoftware‐defined networking (SDN) has revolutionized network architectures by decoupling the control plane from the data plane. An intriguing challenge within this paradigm is the strategic placement of controllers and the allocation of switches to optimize network performance and resilience. In the event of a controller failure, the switches are disconnected from the controller until they are reassigned to other active controllers possessing sufficient spare capacity. The reassignment could lead to a significant rise in propagation latency. This correspondence presents a mathematical model for capacitated controller placement, strategically designed to anticipate failures and prevent a substantial increase in worst‐case latency and disconnections. The aim is to minimize the worst‐case latency between switches and their backup controllers and among the controllers. Four metaheuristic algorithms are proposed including, an enhanced genetic algorithm (CCPCFR‐EGA), particle swarm optimization (CCPCFR‐PSO), a hybrid particle swarm optimization and simulated annealing algorithm (CCPCFR‐HPSOSA), and a grey wolf optimization algorithm (CCPCFR‐GWO). These algorithms are compared with a simulated annealing method and an optimal method. Evaluation conducted on four network datasets demonstrates that the proposed metaheuristic methods are faster than the optimal method. The experimental outcome indicates that CCPCFR‐HPSOSA and CCPCFR‐GWO outperform the other methods, consistently providing near‐optimal solutions. However, CCPCFR‐GWO is preferred over CCPCFR‐HPSOSA due to its faster execution time. Specifically, CCPCFR‐GWO achieves an average speed‐up of 3.9 over the optimal for smaller networks and an average speed‐up of 31.78 for larger networks, while still producing near‐optimal solutions.

Electrified fleet and infrastructure aware energy efficient routing

This paper presents an optimization framework to improve the energy efficiency and cost-effectiveness of fleets of commercial trucks operating pickups and deliveries in urban areas. As the electrification of transportation is moving from passenger cars to medium- and heavy-duty vehicles, the proposed analysis considers a fleet of pickup and delivery trucks that includes conventional internal combustion engine vehicles (ICEV), as well as battery electric vehicles (BEV), and plug-in hybrid electric vehicles (PHEV). Given a set of pickups and deliveries, and a fleet including different types of vehicles, the goal is twofold: assign the best vehicle to each task, and solve the vehicle routing problem, i.e., find the optimal route to navigate the vehicle from the origin to the destination(s). To estimate the energy consumption of the different vehicles, vehicle dynamics are considered, together with actual charging infrastructure and road data, including speed limits, road grade, and stop signs. Moreover, the total cost of ownership (TCO) is evaluated to estimate the cost-effectiveness of different fleet compositions and operations. To solve this problem, a hybrid simulated annealing (HSA) heuristic algorithm is proposed. The algorithm is validated against a benchmark exact solver based on mixed integer linear programming (MILP). The proposed methodology achieves optimal results with a 1.2% optimality gap compared to the benchmark, surpassing MILP in computational efficiency. The research findings highlight how fleet composition and operational strategies can vary significantly based on whether the focus is on energy efficiency, total cost of ownership, or a combination of the two, also depending on the number of years of operation. Simulation case studies in the Columbus, OH area demonstrate that integrating fleet and recharging infrastructure information alongside energy savings in vehicle routing problem solutions can achieve 20% to 50% savings in fleet operation costs compared to solely optimizing for minimum energy consumption.

A framework for automated reconstruction of communication towers from terrestrial laser scanning point clouds

ABSTRACT Communication towers provide reliable wireless communication services and play a vital role in modern society. This paper presents an automatic 3D reconstruction framework for communication towers based on point clouds. The antenna is reconstructed by a model-driven method, which constructs an energy function including the data and smoothing terms to evaluate the model accuracy. The parameters of the antenna model are obtained by minimizing energy function with hybrid Genetic Algorithm (GA) and Simulated Annealing (SA). And the predefined model is transformed using these parameters to achieve antenna 3D reconstruction. For tower body reconstruction, the point cloud of the tower body is finely extracted with the region growing followed by piecewise fitting to obtain the model. The performance of the proposed method is evaluated on point clouds from six scenes. The average root-mean-square error (RMSE) of antenna reconstruction is 1.3 cm. The average precision, recall, and F1-score values of the tower body point extraction are 99.9%, 93.5%, and 96.6%, respectively. The average RMSE of tower body reconstruction is 1.2 cm. The experimental results indicate that the method can effectively reconstruct the antenna and tower body with point clouds, providing a feasible framework for the 3D reconstruction of communication towers.

Hybrid Aquila optimizer for efficient classification with probabilistic neural networks

The model of a probabilistic neural network (PNN) is commonly utilized for classification and pattern recognition issues in data mining. An approach frequently used to enhance its effectiveness is the adjustment of PNN classifier parameters through the outcomes of metaheuristic optimization strategies. Since PNN employs a limited set of instructions, metaheuristic algorithms provide an efficient way to modify its parameters. In this study, we have employed the Aquila optimizer algorithm (AO), a contemporary algorithm, to modify PNN parameters. We have proposed two methods: Aquila optimizer based probabilistic neural network (AO-PNN), which uses both local and global search capabilities of AO, and hybrid Aquila optimizer and simulated annealing based probabilistic neural network (AOS-PNN), which integrates the global search abilities of AO with the local search mechanism of simulated annealing (SA). Our experimental results indicate that both AO-PNN and AOS-PNN perform better than the PNN model in terms of accuracy across all datasets. This suggests that they have the potential to generate more precise results when utilized to improve PNN parameters. Moreover, our hybridization technique, AOS-PNN, is more effective than AO-PNN, as evidenced by classification experiments accuracy, data distribution, convergence speed, and significance. We have also compared our suggested approaches with three different methodologies, namely Coronavirus herd immunity optimizer based probabilistic neural network (CHIO-PNN), African buffalo algorithm based probabilistic neural network (ABO-PNN), and β-hill climbing. We have found that AO-PNN and AOS-PNN have achieved significantly higher classification accuracy rates of 90.68 and 93.95, respectively.

An Efficient Double Deep Q Learning Network-Based Soft Faults Detection and Localization in Analog Circuits

To identify whether the circuit under test is fault-free or faulty, fault diagnosis is conducted in an analog circuit. However, in the case of fault detection (FD) techniques, the size of FD is the main challenge in testing, especially for complex analog circuits. Hence to reduce the size of FD, specific test nodes are chosen to perform fault diagnosis from the available accessible test nodes. Specific test nodes are selected based on the faults classification efficiency of fault diagnosis. Therefore, this paper proposes an approach for single and multiple soft fault diagnosis using minimum test nodes in analog electronic circuits. The proposed double deep Q-learning-based hybrid Simulated annealing–Tabu search (DDQN-Hybrid SATS) technique determines minimum test nodes with the utilization of distance metric for fault classification. The DDQN-Hybrid SATS technique is used to identify minimum nodes for testing. In this, the double deep Q learning network (DDQN) ensures better reliability and faster convergence in learning but suffers from catastrophic forgetting issues. To prevent such issues, the DDQN approach is optimized using a hybrid SATS algorithm. The hybrid optimization of simulated annealing (SA) and Tabu search (TS) coalesce the advantages of individual optimization procedures to provide the optimum solution in a fast and effective way. The results for a fourth-order low pass filter are presented (i.e., first CUT) and an eight-bit digital to analog converter (i.e., second CUT). Moreover, the simulation experiment reveals that the proposed DDQN-Hybrid SATS technique achieves greater overall fault classification accuracy of about 96.25% than other compared techniques with minimum computation time.

A hybrid metaheuristic algorithm for scheduling iron ore reclaiming in ports

ABSTRACT This work deals with a scheduling problem of reclaimers. This problem involves a set of ships to be loaded with predefined stockpiles. These stockpiles are unloaded into ship holds, and each hold must store a predefined product and quantity of iron ore. Stockpiles are stored in storage yards, which have reclaimers to reclaim iron ore from stockpiles and send it to berthed ships. The objective is to schedule the operations of reclaimers to minimize the sum of ships' berthing times. A hybrid algorithm, combining the multi-start, GRASP and variable neighbourhood descent procedures, is proposed to treat instances of any scale of the problem. It was tested in real instances, and its results were compared with the hybrid simulated annealing algorithm from the literature and a fast simulation algorithm that emulates operators' decision-making. The proposed algorithm was the best in all instances, and statistical tests proved its superiority

Hybridization of simulated annealing and D-numbers as a stochastic generator

Hybridization of simulated annealing and D-numbers as a stochastic generator

Economic optimization of fresh logistics pick-up routing problems with time windows based on gray prediction

The rapid development of modern cold chain logistics technology has greatly expanded the sales market of agricultural products in rural areas. However, due to the uncertainty of agricultural product harvesting, relying on the experience values provided by farmers for vehicle scheduling can easily lead to low utilization of vehicle capacity during the pickup process and generate more transportation cost. Therefore, this article adopts a non-linear improved grey prediction method based on data transformation to estimate the pickup demand of fresh agricultural products, and then establishes a mathematical model that considers the fixed vehicle usage cost, the damage cost caused by non-linear fresh fruit and vegetable transportation damage and decay rate, the cooling cost generated by refrigerated transportation, and the time window penalty cost. In order to solve the model, a hybrid simulated annealing algorithm integrating genetic operators was designed to solve this problem. This hybrid algorithm combines local search strategies such as the selection operator without repeated strings and the crossover operator that preserves the best substring to improve the algorithm’s solving performance. Numerical experiments were conducted through a set of benchmark examples, and the results showed that the proposed algorithm can adapt to problem instances of different scales. In 50 customer examples, the difference between the algorithm and the standard value in this paper is 2.30%, which is 7.29% higher than C&S. Finally, the effectiveness of the grey prediction freight path optimization model was verified through a practical case simulation analysis, achieving a logistics cost savings of 9.73%.

Resource allocation and route planning under the collection price uncertainty for the biomass supply chain

The escalating severity of global warming has drawn worldwide attention to ecological problems. Nevertheless, with the introduction of environmental policies, biomass resources have been effectively developed as a renewable energy source. This paper investigates an advanced biomass supply chain design wherein biomass resources are initially converted into bio-oil through widely distributed fast pyrolysis facilities, and are subsequently transported to a centralised biorefinery for further refining into biofuels. This novel biomass supply chain addressed three key issues: (1) The number of fast pyrolysis facilities, (2) The allocation of resources, and (3) The routes of resources transport. In respect of these problems, a two-stage stochastic mixed integer programming model is established to minimise the total cost of the biomass supply chain considering the uncertainty collection price of fast pyrolysis facilities. A hybrid simulated annealing algorithm which incorporates the sample average approximation method is proposed to solve the stochastic model and is effectiveness for large-scale examples. Finally, a sensitivity analysis is performed using the proposed algorithm and the results show that the proposed stochastic model outperforms the deterministic model under uncertain collection price. The model allows optimising the biomass supply chain economic performances and minimise financial risk on investment by determining the fast pyrolysis facility locations, reasonable resource allocation and optimal transport routes under uncertain collection price.

Energy-Efficient 5G Heterogeneous Cloud Radio Access Networks (RRH to BBU) Using a Hybrid OGASCDASA-SAGMDEBROA Scheduling Algorithm

In fifth-generation (5G) networks, the deployment of heterogeneous networks (HetNets) with macrocells layered over tiny cells is considered to be a practical solution to handle the growing demand for mobile traffic. The deployment of a significant count of small cell base stations (BSs) results in a notable rise in energy consumption. In this manuscript, Energy-Efficient (EE) 5G Heterogeneous Cloud Radio Access Networks (RRH to BBU), using Hybrid online green algorithm-based sleep scheduling and cost-efficient deadline-aware Scheduling Algorithm (OGASCDASA), are proposed. Here, the energy efficiency optimization issue is in the downlink of two-tier Heterogeneous Cloud Radio Access Networks (H-CRAN) by lowering micro and pico cells. Hybrid OGASCDASA is proposed for reducing remote radio side energy use when maintaining coverage and Quality of service (QoS) of H-CRAN. At the cloud side Baseband Units (BBU), hybrid Simulated Annealing with the Gaussian Mutation and Distortion Equalization algorithm with Battle Royale optimization is proposed to reduce the energy consumption of BBU by decreasing the count of BBU servers. The proposed EE-HCRAN-Hybrid OGASCDASA-SAGMDEBROA method attains 20.48%, 27.34%, and 32.24% higher throughput and 28.30%, 17.30%, and 32.94% lower delay compared to the existing models, such as heterogeneous computational resource allocation for NOMA (HCRA-NOMA-GMECS), energy-efficient hierarchical resource sharing in uplink-downlink decoupled NOMA heterogeneous networks (EE-HRA-NOMA-HetNet), energy-aware hierarchical resource management with backhaul traffic optimization in heterogeneous cellular networks (EA-HRM-BTO-HCN), respectively.

Hybrid genetic algorithm-simulated annealing based electric vehicle charging station placement for optimizing distribution network resilience

Rapid placement of electric vehicle charging stations (EVCSs) is essential for the transportation industry in response to the growing electric vehicle (EV) fleet. The widespread usage of EVs is an essential strategy for reducing greenhouse gas emissions from traditional vehicles. The focus of this study is the challenge of smoothly integrating Plug-in EV Charging Stations (PEVCS) into distribution networks, especially when distributed photovoltaic (PV) systems are involved. A hybrid Genetic Algorithm and Simulated Annealing method (GA-SAA) are used in the research to strategically find the optimal locations for PEVCS in order to overcome this integration difficulty. This paper investigates PV system situations, presenting the problem as a multicriteria task with two primary objectives: reducing power losses and maintaining acceptable voltage levels. By optimizing the placement of EVCS and balancing their integration with distributed generation, this approach enhances the sustainability and reliability of distribution networks.

Continuous Space Wireless Communication Tower Placement by Hybrid Simulated Annealing

Wireless communication tower placement arises in many real-world applications. This paper investigates a new emerging wireless communication tower placement problem, namely, continuous space wireless communication tower placement. Unlike existing wireless communication tower placement problems, which are discrete computational problems, this new wireless communication tower placement problem is a continuous space computational problem. In this paper, we formulate the new wireless communication tower placement problem and propose a hybrid simulated annealing algorithm that can take advantage of the powerful exploration capacity of simulated annealing and the strong exploitation capacity of a local optimization procedure. We also demonstrate through experiments the effectiveness of this hybridization technique and the good performance and scalability of the hybrid simulated annulling in this paper.

NC process information mining based optimization method of roughing tool sequence selection for pocket features

The appropriate and intelligent selection of roughing tool sequence for pocket features is essential to improve the efficiency of NC machining. However, there exist few researches exploring how to discover and utilize the valuable NC process information imbedded in 3D CAD models. In this paper, a NC process information mining based optimization method of roughing tool sequence selection for pocket features is presented. Firstly, the medial axis transform (MAT) is introduced to represent the tool paths of a pocket feature, and corresponding parameters of MAT are calculated. Secondly, considering the restrictions of tool movements during machining, the mapping mechanism between geometry and NC process is elaborated based on MAT to reveal the association of 3D CAD models and NC machining. The deeper information for NC process planning is mined to reflect the machining procedure feasibly. Then, the multi-objective optimization model is constructed by considering material removal amount and cutting consistency synthetically. Moreover, the precedence and distances between roughing tools are formulated in a Candidate Tools Graph (CTG). Finally, a hybrid ant colony algorithm (ACA) and simulated annealing (SA) approach based on CTG is proposed to generate the global optimal roughing tool sequence. In the experiment, various pocket features are conducted to illustrate the application effectiveness of the proposed method. The experimental results show that our method can achieve highly satisfactory results and outperforms other approaches.

Accurate solution of the Index Tracking problem with a hybrid simulated annealing algorithm

An actively managed portfolio almost never beats the market in the long term. Thus, many investors often resort to passively managed portfolios whose aim is to follow a certain financial index. The task of building such passive portfolios aiming also to minimize the transaction costs is called Index Tracking (IT), where the goal is to track the index by holding only a small subset of assets in the index. As such, it is an NP-hard problem and becomes unfeasible to solve exactly for indices with more than 100 assets. In this work, we present a novel hybrid simulated annealing method that can efficiently solve the IT problem for large indices and is flexible enough to adapt to financially relevant constraints. By tracking the S&P-500 index between the years 2011 and 2018 we show that our algorithm is capable of finding optimal solutions in the in-sample period of past returns and can be tuned to provide optimal returns in the out-of-sample period of future returns. Finally, we focus on the task of holding an IT portfolio during one year and rebalancing the portfolio every month. Here, our hybrid simulated annealing algorithm is capable of producing financially optimal portfolios already for small subsets of assets and using reasonable computational resources, making it an appropriate tool for financial managers.

Optimal allocation of enterprise marketing resources based on hybrid parallel genetic algorithm and simulated annealing algorithm

Abstract Aiming at minimizing the use of marketing resources, this article establishes the mathematical model of marketing resources allocation, designs the algorithm of marketing resources allocation, and compares the examples. An improved heuristic algorithm considering tilt angle matching is proposed and used as a local search algorithm for enterprise marketing resources. We design an innovative optimization strategy that incorporates the concept of tilt angle matching to enhance the local search efficiency of enterprise marketing resource allocation. In addition, we have introduced a novel parallel grouping genetic algorithm (PGGA), which utilizes grouping coding and exon crossover to further enhance the search and optimization efficiency of the solution. PGGA is improved by using adaptive parameters to form IPGGA, which improves the efficiency and convergence speed of enterprise marketing resource allocation. The annealing function of the simulated annealing algorithm is improved, and a model is constructed to solve the problem of enterprise marketing resource allocation. Simulated annealing algorithm is introduced to solve the problem of marketing resource allocation, and the framework of simulated annealing algorithm is analyzed. To solve the problem of fast decay rate of simulated annealing algorithm, Doppler effect function is used to optimize the algorithm. This article mainly uses qualitative and quantitative analysis methods to conduct in-depth research on enterprise marketing resource allocation. It focuses on the planning and allocation of enterprise marketing resources. Through IPGGA-ISAA research and analysis of all kinds of data of enterprise marketing resources, the present situation, efficiency, and main problems of enterprise marketing resources allocation are discussed and analyzed more deeply. Compared with other algorithms, IPGGA-ISAA can better analyze the causes of problems and provide better marketing resource allocation schemes for enterprises.

Minimizing Virtual Machine Live Migration Latency for Proactive Fault Tolerance Using an ILP Model With Hybrid Genetic and Simulated Annealing Algorithms

Minimizing Virtual Machine Live Migration Latency for Proactive Fault Tolerance Using an ILP Model With Hybrid Genetic and Simulated Annealing Algorithms