Traditional Simulated Annealing Research Articles

Application of CSA to loading pattern optimization problems for reload core in nuclear power plant

Reload loading pattern design is the key content to economy, safety and flexibility of the operation after reloading in nuclear power plant. Loading pattern optimization is a typical combinatorial optimization problem with multi-objective and multi-parameter. Furthermore, the reload loading pattern optimization design is a very short time requirement, which makes it difficult for traditional optimization algorithms. In this study, a combined simulated annealing algorithm (CSA algorithm) are proposed. CSA effectively utilizes the characteristic regularity in the optimization space. Additionally, the combined database created by CSA can significantly increase the diversity of the algorithm, and greatly improve the optimization ability. In comparison to the traditional simulated annealing method, the optimization results of CSA are noticeably better. By contrasting the CSA with the improved genetic algorithm (GA), it can be seen that CSA can exploit the characteristic regularity of the reload loading pattern optimization more effectively, and the optimization efficiency and optimization results of the method are noticeably superior to GA.

A Biased-Randomized Discrete Event Algorithm to Improve the Productivity of Automated Storage and Retrieval Systems in the Steel Industry

In automated storage and retrieval systems (AS/RSs), the utilization of intelligent algorithms can reduce the makespan required to complete a series of input/output operations. This paper introduces a simulation optimization algorithm designed to minimize the makespan in a realistic AS/RS commonly found in the steel sector. This system includes weight and quality constraints for the selected items. Our hybrid approach combines discrete event simulation with biased-randomized heuristics. This combination enables us to efficiently address the complex time dependencies inherent in such dynamic scenarios. Simultaneously, it allows for intelligent decision making, resulting in feasible and high-quality solutions within seconds. A series of computational experiments illustrates the potential of our approach, which surpasses an alternative method based on traditional simulated annealing.

Stable and efficient seismic impedance inversion using quantum annealing with L1 norm regularization

Abstract Seismic impedance inversion makes a significant contribution to locating hydrocarbons and interpreting seismic data. However, it suffers from non-unique solutions, and a direct linear inversion produces large errors. Global optimization methods, such as simulated annealing, have been applied in seismic impedance inversion and achieved promising inversion results. Over the last decades, there has been an increasing interest in quantum computing. Owing to its natural parallelism, quantum computing has a powerful computational capability and certain advantages in solving complex inverse problems. In this article, we present a stable and efficient impedance inversion using quantum annealing with L1 norm regularization, which significantly improves the inversion accuracy compared to the traditional simulated annealing method. Tests on a one-dimensional 10-layer model with noisy data demonstrate that the new method exhibits significantly improved accuracy and stability. Additionally, we perform seismic impedance inversion for synthetic data from the overthrust model and field data using two methods. These results demonstrate that the quantum annealing impedance inversion with L1 norm regularization dramatically enhances the accuracy and anti-noise ability.

Timing-Driven Simulated Annealing for FPGA Placement in Neural Network Realization

The simulated annealing algorithm is an extensively utilized heuristic method for heterogeneous FPGA placement. As the application of neural network models on FPGAs proliferates, new challenges emerge for the traditional simulated annealing algorithm in terms of timing. These challenges stem from large circuit sizes and high heterogeneity in the block proportions typical in neural networks. To address these challenges, this study introduces a timing-driven simulated annealing placement algorithm. This algorithm integrates cluster criticality identification during the cluster selection phase, which enhances the probability of high-criticality cluster selection. In the cluster movement phase, the proposed method employs an improved weighted center movement for high-criticality clusters and a random movement strategy for other clusters. Experimental evidence demonstrates that the proposed placement algorithm decreases the average wire length by 1.52% and the average critical path delay by 5.03%. This improvement in performance is achieved with a marginal increase of 5.01% in runtime, as compared to VTR8.0.

Analysis of the application of path finding system based on efficiency improvement in smart tourism

With the proposal and development of intelligent tourism destination, the problem of tourism route planning has become a hot topic in tourism research. This study proposes an intelligent tourism route planning model based on efficiency improvement for Guangxi tourism route planning. In order to improve the efficiency of the model, this paper combines ant colony algorithm with genetic algorithm and introduces smoothing factor and guiding factor, and obtains genetic algorithm (genetic algorithm-path smoothing ant colony optimization) with changing probability. Experimental results show that the convergence speed of the algorithm is fast, and it can converge in 78 iterations, and the operation efficiency is higher. The result error of the proposed algorithm is 1.39, which is smaller than that of other comparative algorithms. In the actual application effect evaluation, the average satisfaction of the planned route of the intelligent tourism route planning model based on efficiency improvement is 15.38, which is higher than that of the traditional genetic algorithm and simulated annealing algorithm. It shows that the model can not only efficiently plan the best travel route, but also comprehensively consider the whole trip of tourists, so that tourists can have a better travel experience. The research provides an intelligent route planning method that is more efficient and more in line with tourists' needs for tourism development.

Exploring the design of ecological and energy-saving residential buildings adapted to climate change based on a simulated annealing algorithm

Abstract In the context of the digital development of big data and information in recent years, performance-based residential building design and its optimization methods have gradually become a research hotspot of domestic and international attention. The simulated annealing algorithm is a major component of residential buildings’ optimal energy efficiency design. Although the crossover operator under the computational traditional simulated annealing algorithm incorporates the respective advantages of the genetic algorithm and simulated annealing algorithm, the purely optimal genetic simulated annealing algorithm is more effective for the evaluation of index analysis and better reflects the superiority of the algorithm. In the Energy Plus model, the three algorithms were used to analyze the design indexes of ecological energy-efficient residential buildings, and the SS values of the MOSA algorithm fluctuated between 10% and 24%, and the performance of the recommended genetic simulated annealing algorithm was significantly better than the other two algorithms. This study effectively solves the difficulties of low efficiency and high failure rate common in design practice when using this technique and is of historical importance to the development of energy-efficient residential buildings in China.

Multi-objective Logistics Distribution Path Optimization Based on Annealing Evolution Algorithm

Logistics distribution is a collection of interrelated organizations and facilities. There is a waste of cost and time in many links. Therefore, it is particularly important to use information technology to improve distribution efficiency. Under the constraints of delivery vehicle cost and time, this paper proposes an improved genetic simulated annealing algorithm (SAGA), which combines the global search ability of the genetic algorithm (GA) and the simulated annealing algorithm (SA) with strong local search ability to solve the vehicle routing problem with time windows (VRPTW). The perturbation factor is introduced to improve the local search, and the crossover method is optimized to obtain more efficient genetic operators by using population information. In this paper, combined with the actual application case, the simulation experiment is carried out in MATLAB. The experimental results show that, compared with the traditional genetic algorithm and simulated annealing algorithm, the total cost of the improved genetic simulated annealing algorithm is reduced by about 15%, which provides a more suitable vehicle route planning scheme.

A Modified Simulated Annealing (MSA) Algorithm to Solve the Supplier Selection and Order Quantity Allocation Problem with Non-Linear Freight Rates

Economic Order Quantity (EOQ) is an important optimization problem for inventory management with an impact on various industries; however, their mathematical models may be complex with non-convex, non-linear, and non-differentiable objective functions. Metaheuristic algorithms have emerged as powerful tools for solving complex optimization problems (including EOQ). They are iterative search techniques that can efficiently explore large solution spaces and obtain near-optimal solutions. Simulated Annealing (SA) is a widely used metaheuristic method able to avoid local suboptimal solutions. The traditional SA algorithm is based on a single agent, which may result in a low convergence rate for complex problems. This article proposes a modified multiple-agent (population-based) adaptive SA algorithm; the adaptive algorithm imposes a slight attraction of all agents to the current best solution. As a proof of concept, the proposed algorithm was tested on a particular EOQ problem (recently studied in the literature and interesting by itself) in which the objective function is non-linear, non-convex, and non-differentiable. With these new mechanisms, the algorithm allows for the exploration of different regions of the solution space and determines the global optimum in a faster manner. The analysis showed that the proposed algorithm performed well in finding good solutions in a reasonably short amount of time.

Research on the optimization of energy consumption for multi-priority tasks in mobile computing offloading

To solve the problem of insufficient energy consumption for multi-priority tasks in the computing and unloading environments of mobile devices, we designed evaluation methods to improve the traditional simulated annealing algorithm and obtain the optimal allocation scheme for these tasks under multiple computing resources. Firstly, we proposed the task model and discussed the classification and definition of task priority as well as the procedure of task processing in detail. Secondly, a calculation model for the energy consumption of mobile devices is provided. Thirdly, an evaluation mechanism is designed to evaluate the unloading distribution scheme of mobile devices effectively. Finally, the improved traditional simulated annealing algorithm was applied to find the optimal distribution scheme for this computing environment. All allocation schemes obtained in this study were compared and analyzed via simulation. The results showed that the proposed algorithm can reduce the energy consumption of mobile devices more significantly, shorten the system response time, and complete high-priority tasks based on time constraints.

Imaginary Coating Algorithm Approaching Dense Accumulation of Granular Material in Simulations with Discrete Element Method

The difficulty of obtaining a densely packed granular material as an initial condition is a very common problem in numerical simulations of granular materials. In this article, an Imaginary Coating Algorithm (ICA) is introduced. To avoid unreasonable particle deformation when using a longer time step and a lower Young’s modulus, the radii used in calculating the action forces in a binary collision are slightly larger than the real values. In other words, an imaginary coat is added to each particle or element. To validate this algorithm, simulations were carried out by using ÅDEM, and a A Discrete Element Method (DEM) software program was developed. Compared with traditional Simulated Annealing Algorithms (SAA), this technique can approach the densely packed state with less CPU/GPU time and is easy to operate.

A Two-Step Simulated Annealing Algorithm for Spectral Data Feature Extraction

To address the shortcomings in many traditional spectral feature extraction algorithms in practical application of low modeling accuracy and poor stability, this paper introduces the "Boruta algorithm-based local optimization process" based on the traditional simulated annealing algorithm and proposes the "two-step simulated annealing algorithm (TSSA)". This algorithm combines global optimization and local optimization. The Boruta algorithm ensures that the feature extraction results are all strongly correlated with the dependent variable, reducing data redundancy. The accuracy and stability of the algorithm model are significantly improved. The experimental results show that compared with the traditional feature extraction method, the accuracy indexes of the inversion model established by using the TSSA algorithm for feature extraction were significantly improved, with the determination coefficient R2 of 0.9654, the root mean square error (RMSE) of 3.6723 μg/L, and the mean absolute error (MAE) of 3.1461 μg/L.

A deep reinforcement learning assisted simulated annealing algorithm for a maintenance planning problem

AbstractMaintenance planning aims to improve the reliability of assets, prevent the occurrence of asset failures, and reduce maintenance costs associated with downtime of assets and maintenance resources (such as spare parts and workforce). Thus, effective maintenance planning is instrumental in ensuring high asset availability with the minimum cost. Nevertheless, to find such optimal planning is a nontrivial task due to the (i) complex and usually nonlinear inter-relationship between different planning decisions (e.g., inventory level and workforce capacity), and (ii) stochastic nature of the system (e.g., random failures of parts installed in assets). To alleviate these challenges, we study a joint maintenance planning problem by considering several decisions simultaneously, including workforce planning, workforce training, and spare parts inventory management. We develop a hybrid solution algorithm ($$\mathcal {DRLSA}$$ DRLSA ) that is a combination of Double Deep Q-Network based Deep Reinforcement Learning (DRL) and Simulated Annealing (SA) algorithms. In each episode of the proposed algorithm, the best solution found by DRL is delivered to SA to be used as an initial solution, and the best solution of SA is delivered to DRL to be used as the initial state. Different from the traditional SA algorithms where neighborhood structures are selected only randomly, the DRL part of $$\mathcal {DRLSA}$$ DRLSA learns to choose the best neighborhood structure to use based on experience gained from previous episodes. We compare the performance of the proposed solution algorithm with several well-known meta-heuristic algorithms, including Simulated Annealing, Genetic Algorithm (GA), and Variable Neighborhood Search (VNS). Further, we also develop a Machine Learning (ML) algorithm (i.e., K-Median) as another benchmark in which different properties of spare parts (e.g., failure rates, holding costs, and repair rates) are used as clustering features for the ML algorithm. Our study reveals that the $$\mathcal {DRLSA}$$ DRLSA finds the optimal solutions for relatively small-size instances, and it has the potential to outperform traditional meta-heuristic and ML algorithms.

An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem

• A mathematical model of a blocking hybrid flow shop scheduling problem with energy consumption criteria is proposed. • A simple global perturbation based on a half-swap operator is proposed to further search for the potentially best solution. • A local perturbation strategy based on a swap operator is designed to ensure the convergence of the algorithm. • The proposed algorithm is applied to 140 test instances with different scales and compared with state-of-the-art algorithms and can obtain the best solution to the BHFSP. With the continuous development of national economies, problems of various energy consumption levels and pollution emissions in manufacturing have attracted attention from researchers. Most existing research has focused on reducing economic costs and energy consumption. However, the Hybrid Flow Shop Scheduling Problem with energy-efficient criteria has not yet been well studied, especially with blocking constraints. This paper is the first to present a mathematical model of the blocking hybrid flow shop problem with an energy-efficient criterion and a modified Iterative Greedy algorithm based on a swap strategy designed to optimize the constructed model. In the proposed algorithm, first, a heuristic is adopted to generate the initial solution. Second, a local perturbation strategy based on a swap operator is designed to ensure the convergence of the algorithm. Third, a simple global perturbation strategy based on a half-swap operator is proposed as a means to further search for the potentially best solution with the traditional simulated annealing criterion. The proposed algorithm is applied to 150 test instances at different scales and compared to state-of-the-art algorithms. The experimental results demonstrate that the proposed algorithm outperforms the compared algorithms and can obtain a better solution.

An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling.

Aviation ordnance handling is critical to the firepower projection of the time-critical cyclic flight operation on aircraft carriers. The complexity of the problem depends on the supply and demand features of ordnance. This paper examines the scheduling of aviation ordnance handling of an operational aircraft carrier under the framework of hybrid flow shop scheduling (HFS) and derives a method based on the simulated annealing (SA) algorithm to get the HFS problem's solution. The proposed method achieves the minimum possible flow time by optimizing the ordnance assignment through different stages. The traditional SA algorithm depends heavily on the heuristic scheme and consumes too much time to compute the optimal solution. To solve the problem, this paper improves the SA by embedding a task-based encoding method and a matrix perturbation method. The improved SA remains independent of the heuristic scheme and effectively propagates the local search process. Since the performance of SA is also influenced by its embedded parameters, orthogonal tests were carried out to carefully compare and select these parameters. Finally, different ordnance loading plans were simulated to reveal the advantage of the improved SA. The simulation results show that the improved SA (ISA) can generate better and faster solution than the traditional SA. This research provides a practical solution to stochastic HFS problems.

Variational neural annealing

Many important challenges in science and technology can be cast as optimization problems. When viewed in a statistical physics framework, these can be tackled by simulated annealing, where a gradual cooling procedure helps search for ground-state solutions of a target Hamiltonian. Although powerful, simulated annealing is known to have prohibitively slow sampling dynamics when the optimization landscape is rough or glassy. Here we show that, by generalizing the target distribution with a parameterized model, an analogous annealing framework based on the variational principle can be used to search for ground-state solutions. Modern autoregressive models such as recurrent neural networks provide ideal parameterizations because they can be sampled exactly without slow dynamics, even when the model encodes a rough landscape. We implement this procedure in the classical and quantum settings on several prototypical spin glass Hamiltonians and find that, on average, it substantially outperforms traditional simulated annealing in the asymptotic limit, illustrating the potential power of this yet unexplored route to optimization. Optimization problems can be described in terms of a statistical physics framework. This offers the possibility to make use of ‘simulated annealing’, which is a procedure to search for a target solution similar to the gradual cooling of a condensed matter system to its ground state. The approach can now be sped up significantly by implementing a model of recurrent neural networks, in a new strategy called variational neural annealing.

Adaptive neighborhood simulated annealing for sustainability-oriented single machine scheduling with deterioration effect

This research considers the realistic phenomenon of cutting tool deterioration in the scheduling of jobs and tool replacement activities to ensure sustainable machining operations. Typically, each job has a basic processing time (independent of tool deterioration) and a tool age-dependent prolongation function. Nevertheless, such a strategy may replace the cutting tools before its useful lifespan to avoid longer processing time as it leads to higher energy consumption and likelihood of tardy jobs. Given the reduced tool operating duration, the prospect of exploiting its capability to limit the processing time prolongation is not considered by prior works. In this research, a single-machine scheduling approach that determines the job processing time based on tool age and operating duration (utilization) is studied. The problem is formulated as a mixed-integer linear program (MILP) with the objective of minimizing the weighted costs of energy consumption, tooling, and job tardiness. Due to its computational complexity, a new variant of simulated annealing (SA) algorithm is proposed to solve large instances, where an adaptive strategy is utilized to determine the neighborhood size for enhanced exploration and exploitation. Computational results for an exhaustive set of instances indicate the proposed scheduling strategy to always outperform the existing method, yielding up to a 43% reduction in total cost. Besides, the proposed variant of SA effectively solves the scheduling problem and consistently dominates the traditional SA method.

A black hole particle swarm optimization method for the source parameters inversion: application to the 2015 Calbuco eruption, Chile

The traditional genetic algorithm and simulated annealing methods have been widely used in geophysical modeling. However, these nonlinear inversion methods require a lot of calculations, many control parameters and are unstable. In this paper, a particle swarm optimization algorithm combined with black hole strategy (BH-PSO) is proposed to solve these problems. The comprehensive experiments show that the BH-PSO method consumes less time than the simulated annealing (SA) method and has a higher accuracy than the genetic algorithm (GA). It is more applicable to the inversion of parameters of volcanic magma chamber, and easier to be generalized to other kinematic source parameters inversion. Based on BH-PSO method, Sentinel-1 data, composite dislocation model (CDM), Yang model and Mogi model, the magma chamber parameters of Calbuco eruption in 2015 were retrieved. The results show that the RMSE of CDM model is 1.1 cm, which can better fit the surface deformation than the Mogi model and Yang model. The final results show that the magma chamber is located about 0.8 km northeast of the crater, about 9 km below the surface, and the total volume of the erupted volcanic material obtained with the CDM Model is of 0.209 km3, without considering dense rock equivalent.

Analysis of the material distribution system of wise information technology of 120 under deep learning

In order to explore the feasibility of using deep learning in the Wise Information Technology of 120 (WIT120) material distribution system under deep learning, in the study, first, the Hopfield neural network and simulated annealing (SA) algorithm are used to study the path optimization in the WIT120 material distribution system. Aiming at the poor optimization and robustness of the traditional Hopfield neural network and the low optimization efficiency of SA algorithm, in this study, a memory device is added to the SA algorithm, the distribution starting points of the two algorithms are fixed, and an improved hybrid algorithm is designed by combining Hopfield neural network and SA algorithm. Then, the improved hybrid algorithm of the traditional Hopfield neural network and SA algorithm is used in the actual medical material distribution system, and comparative analysis of the distribution route, cost, and scheduling time before and after using the proposed algorithm is performed. Besides, the difference between the proposed algorithm and other algorithms in path optimization and path planning efficiency is compared and analyzed. The results show that the improved hybrid algorithm proposed in this research reduces the total mileage of distribution by 46.9%, costs by 33.9%, and the time required for scheduling by 99% after applied in the medical material distribution system. It is also better than traditional analog algorithms and neural networks in distribution path optimization. The path optimization results show that the shortest path produced by the improved hybrid algorithm in this study is 27.85, which is superior to the traditional SA algorithm, Hopfield neural network, and genetic algorithm (the shortest paths obtained are 41.21, 44.63 and 36.48, respectively). Compared with other optimization algorithms, the path planning efficiency of the hybrid algorithm is the highest (the amount of distribution tasks completed in unit time is 22). In conclusion, the improved hybrid algorithm proposed in this study can effectively reduce distribution costs, shorten transportation routes, and improve optimization efficiency, indicating that the hybrid algorithm proposed in this study is effective and practical when applied in the medical material distribution system, which can provide reference value for medical material distribution and provide data support for the management of medical material distribution.

The Mathematical Model and an Genetic Algorithm for the Two-Echelon Electric Vehicle Routing Problem

In order to cope with the challenges of high cargo load and high timeliness distribution in logistics industry, as well as to alleviate the current situation of oil resource depletion and air pollution, this study established a mathematical model of two-echelon electric vehicle routing problem (2E-EVRP) and design a heuristic algorithm. The 2E-EVRP can be divided into the multiple depot vehicle routing problem (MDEVRP) and the split delivery vehicle routing problem (SDVRP). The proposed genetic algorithm is used to solve the MDEVRP, and the actual case of a logistics company in Beijing is taken as the calculation experiment, so as to verify the feasibility of the proposed algorithm and provide decision-making reference for the development of logistics enterprises. The results show that the total path length obtained by the proposed algorithm is optimized by 20.82 kilometers compared with the traditional simulated annealing algorithm.

Distribution reconstruction of non-uniform combustion field based on improved simulated annealing algorithm

In this paper, a method of selecting the optimal transition lines’ combination is analyzed to measure the absorption spectrum of the non-uniform combustion flow field, which is used to solve the basic two-region distribution, and an improved simulated annealing algorithm (ISA) is proposed for reconstructing the field distribution of the combustion flow field, in order to solve the problems of slow convergence speed and low efficiency of the traditional simulated annealing algorithm. By modifying the model perturbation mode and annealing strategy, the efficiency of the algorithm and the chance to jump out of the local optimal space are further improved. According to the numerical simulation results, more transitions are helpful in improving the accuracy of combustion field reconstruction and making the reconstruction less sensitive to noise. It is worth noting that the optimal transitions’ combination is better than the non-optimal transitions’ combination with more transitions included. In this paper, three different combustion models are constructed to verify the effectiveness of the improved algorithm. A comparison between the reconstruction results of the traditional simulated annealing algorithm and the improved simulated annealing algorithm shows that both algorithms have the same precision but the latter algorithm has a higher operating efficiency, and a faster running time (nearly 40 times faster than the former algorithm). At the same time, the simulation results also show that the reconstruction accuracy will decrease slightly with the complication of combustion flow field. By building the TDLAS-HT measurement system in the laboratory and using 8 × 8 orthogonal optical path arrangement, the two different combustion states formed before and after placing the steel rod in the flat flame furnace are reconstructed, the results show that the reconstruction distribution is basically consistent with the original distribution, and the reconstructed distribution well shows the combustion characteristics of the original distribution of the flame field. The effectiveness of the proposed method is verified by numerical simulation and verification tests. Under the condition of the same reconstruction accuracy as the reconstruction accuracy of the traditional simulated annealing algorithm, the higher operating efficiency is helpful in reconstructing the rapidly changing turbulent field, which has some guiding significance for the hyperspectral reconstruction of temperature and concentration distribution in the combustion flow field.