Simulated Annealing Method Research Articles

Path selection algorithms for connecting wireless base stations to power centers in a mine

Relevance. Necessary condition for the systems of safety and process control functioning in a mine is to provide power supply to the relevant facilities. The paper deals with one of the tasks of designing a power supply network in a mine within the framework of a hierarchical approach to organizing the network structure. Within this approach, power controllers are connected to mine lighting breaker. To supply base stations to power controllers, a multi-core cable is used. The number of such cores, as well as the number of such cables emanating from a power controller, are the parameters of the problem. Aim. To consider the problem of choosing routes for connecting base stations of wireless communication in a mine to power centers. It is assumed that base stations and mine lighting breakers are already located in a mine, having the ability to connect a given number of power controllers to them. The connection scheme must be optimal in terms of cost, which is determined by the cost of the cable used. Methods. The authors have proposed several algorithms for solving the mathematical problem, including a greedy algorithm, based on the “go to the nearest point” strategy, and a simulated annealing method. Results. To solve the problem, several approximate methods were proposed and tested. The number of cores is parameter of the problem. The best of the considered algorithms is the annealing simulation algorithm. However, if power centers need to be placed as well, brute force enumeration in the algorithm also gives good results with an appropriate combination of the number of power controllers and the number of possible locations for their placement. Practical relevance. The mathematical problem stated and the mathematical methods make it possible to find minimum cost routes for connecting wireless base stations by multi-core cables to power sources.

Application of simulated annealing algorithm in multi-objective cooperative scheduling of load and storage of source network for load side of new power system

To improve the adaptability of grid load collaborative scheduling, a multi-objective collaborative scheduling method based on a simulated annealing algorithm for the load storage of grid loads on the load side of a new power system is proposed. Local bus transmission technology is adopted to collect the dynamic parameters of energy network load energy storage on the load side of the new power system. The collected load dynamic parameters are fused with energy distribution state parameters to extract the state characteristics of energy network load storage. The simulated annealing algorithm is adopted to realize the load characteristics fusion and adaptive scheduling processing of energy network on the load side of the power system, and the spectral characteristics of the load dynamic parameters are extracted. The dynamic scheduling method of simulated annealing is used to realize the multi-objective optimization of dynamic load of energy network. Based on the co-optimization results of simulated annealing, the optimization application of the simulated annealing algorithm in the multi-objective co-scheduling of loads and energy storage in a new power system is realized. The experimental results show that after 400 iterations, the control convergence accuracy of the proposed method reaches 0.980, which is significantly better than that of the comparison method, and performs well in terms of scheduling efficiency improvement, load scheduling stability, scheduling time and energy waste ratio, proving that the method has good multi-objective integration and strong optimization ability in the scheduling process, and improves the load balanced scheduling and adaptive control ability of the power system.

Determination of intrinsic scattering and absorption coefficients of light diffusing materials: application of a spectral projected gradient method

We explore a novel method to obtain scattering and absorption (S&A) coefficients of inhomogeneous materials from measurements of regular transmittance and specular reflectance. We use a Spectral Projected Gradient Method (SPGM) to invert experimental spectra. The SPGM method requires an initial approximation to the S&A coefficients, which is needed to ensure convergence to an optimized solution. We discuss problems associated with multiple solutions and conditions for the obtained optimal solution to be a good approximation to the physical one. We present results for TiO2/polyvinylpyrrolidone (PVP)-water, plasmonic Au/PVP-water and ferromagnetic Fe3O4/PVP-water materials. The obtained S&A coefficients indicate that these materials are dilute suspensions of dense particle clusters in the dependent scattering regime. We argue that the SPGM gives physically realistic solutions for this class of materials. The SPGM has the advantages that it is much less expensive in computational terms and easier to implement than previously used simulated annealing methods.

An Order-Picking Problem in a Medical Facility Using Genetic Algorithm

Storage operations, order-picking, and product-handling processes have become increasingly important in today’s industrial environment. These operations are a huge burden for businesses in terms of time and cost, but they often do not add direct value to products or services. Therefore, it has become essential to improve the storage operations to the highest quality, reduce the costs arising from storage, and increase customer satisfaction. This study compared genetic algorithm (GA) and simulated annealing (SA) methods with existing real results and operations in order to minimize the distance traveled by the picker in order-picking systems, optimize routes, and increase operational efficiency in the medical textile industry. In the analyses conducted on product-based, list-based, and order-based strategies, real data sets were used to examine the performance of both methods in detail. The study results revealed that GA reduced the total travel distance by 50% and reduced the total number of tours from 51 to 32. In addition, the SA method provided efficient results in certain scenarios, but GA showed superior performance in terms of minimizing the distance and number of tours. While the product-based strategy provided the best results regarding travel distance and number of tours, the list-based approach showed a balanced performance. The study offers significant improvement potential in logistics operations by reducing distances by up to 37% and increasing operational efficiency by up to 50% in order-picking processes.

Optimizing Chilli Crop Disease Classification Models through Hybrid Differential Evolution and Simulated Annealing

Crop diseases caused by chillies are a serious threat to food security and agricultural production. Timely intervention and mitigation efforts are contingent upon an accurate categorization of these disorders. Here, we provide a new method that combines the methods of Simulated Annealing (SA) and Differential Evolution (DE) to improve classification models for illnesses affecting chilli crops. Our hybrid strategy seeks to improve illness classification models' performance and efficiency by using the advantages of both optimization methods. We conducted experiments on a comprehensive dataset comprising diverse chilli crop disease instances. Results show that replacement of either optimization demonstrates greater accuracy and robustness of classification models than either method individually. Additionally, our approach is promising for applications in precision agriculture, giving farmers useful information for proactive disease management and crop protection in the real world. This research progresses the field of agricultural decision support systems by establishing a sound framework for optimizing chilli crop disease classification models with reliability, ensuring sustainable farming practices, and food security globally.

Hybrid Population-Based Hill Climbing Algorithm for Generating Highly Nonlinear S-boxes

This paper introduces the hybrid population-based hill-climbing (HPHC) algorithm, a novel approach for generating cryptographically strong S-boxes that combines the efficiency of hill climbing with the exploration capabilities of population-based methods. The algorithm achieves consistent generation of 8-bit S-boxes with a nonlinearity of 104, a critical threshold for cryptographic applications. Our approach demonstrates remarkable efficiency, requiring only 49,277 evaluations on average to generate such S-boxes, representing a 600-fold improvement over traditional simulated annealing methods and a 15-fold improvement over recent genetic algorithm variants. We present comprehensive experimental results from extensive parameter space exploration, revealing that minimal populations (often single-individual) combined with moderate mutation rates achieve optimal performance. This paper provides detailed analysis of algorithm behavior, parameter sensitivity, and performance characteristics, supported by rigorous statistical evaluation. We demonstrate that population size should approximate available thread count for optimal parallel execution despite smaller populations being theoretically more efficient. The HPHC algorithm maintains high reliability across diverse parameter settings while requiring minimal computational resources, making it particularly suitable for practical cryptographic applications.

Comparative study of deterministic and stochastic optimization algorithms applied to the absorption of CO2 by alkanolamine solution

Abstract A model based on simulated annealing approach is used with e-UNIQUAC model as well as two other algorithms to study the absorption of carbon dioxide by monoethanolamine solutions. In this work, we propose to compare the performance (through the knowledge of RMSD values) of two stochastic methods, namely the GA (genetic algorithm) and SA (simulated annealing) methods and a deterministic method that is the simplex method. These methods were applied to the absorption of carbon dioxide by an alkanolamine solution using a chemical equilibrium model and a thermodynamic equilibrium model. The latter is based on the use of the modified-UNIQUAC (UNIQUAC-electrolyte) model instead of e-NRTL model for the liquid phase and a fugacity model for the vapor phase. The chemical equilibrium in this work represents the absorption of CO2 by monoethanolamine solution at different temperatures. Solving the coupled system of material and charge balances gives us the carbon dioxide pressure while taking into account the non-ideality of the system. The three-optimization methods show good agreement with the experimental data with a better performance of the simulated annealing method..

Using data-driven models to simulate the performance of surfactants in reducing heavy oil viscosity

There is a substantial body of literature exploring the challenges associated with exploring and exploiting these underground resources. Unconventional resources, particularly heavy oil reservoirs, are critical for meeting ever-increasing global energy demand. By injecting surfactants into heavy oil, chemically enhanced oil recovery (EOR) may enable emulsification, which may reduce the viscosity of heavy oil and facilitate extraction and transportation. In this work, a large experimental dataset, containing 2020 data points, was extracted from the literature for modeling oil-in-water (O/W) emulsion viscosity using machine learning (ML) methods. The algorithms used pressure, temperature, salinity, surfactant concentration, type of surfactant, shear rate, and crude oil density as inputs. For this purpose, five ML algorithms were selected and optimized, including adaptive boosting (AB), convolutional neural network (CNN), ensemble learning (EL), artificial neural network (ANN), and decision tree (DT). A combined simulated annealing (CSA) method was utilized to optimize all algorithms. With AARE, R2, MAE, MSE, and RMSE values of 8.982, 0.996, 0.004, 0.0002, and 0.0132, respectively, the ANN predictor exhibited higher accuracy in predicting O/W emulsion viscosity for total data (train and test subsets combined). A Monte-Carlo sensitivity analysis was also performed to determine the impact of input features on the model output. By using the proposed ML predictor, expensive and time-consuming experiments can be eliminated and emulsion viscosity predictions can be expedited without the need for costly experiment.

Decomposition and Growth Pathways for Ammonium Nitrate Clusters and Nanoparticles.

Understanding the formation and decomposition mechanisms of aerosolized ammonium nitrate species will lead to improvements in modeling the thermodynamics and kinetics of aerosol haze formation. Studying the sputtered mass spectra of cation and anion ammonium nitrate clusters can provide insights as to which growth and evaporation pathways are favored in the earliest stages of nucleation and thereby guide the development and use of accurate models for intermolecular forces for these systems. Simulated annealing Monte Carlo optimization followed by density functional theory optimizations can be used reliably to predict minimum-energy structures and interaction energies for the cation and anion clusters observed in mass spectra as well as for neutral nanoparticles. A combination of translational and rotational mag-walking and sawtooth simulated annealing methods was used to find optimum structures of the various heterogeneous clusters identifiable in the mass spectra. Following these optimizations with ωB97X-D3 density functional theory calculations made it possible to rationalize the pattern of peaks in the mass spectra through computation of the binding energies of clusters involved in various growth and dissociation pathways. Testing these calculations against CCSD(T) and MP2 predictions of the structures and binding energies for small clusters demonstrates the accuracy of the chosen model chemistry. For the first time, the peaks corresponding with all detectable species in both the positive and negative ion mass spectra of ammonium nitrate are identified with their corresponding structures. Thermodynamic control of particle growth and decomposition of ions due to loss of ammonia or nitric acid molecules is indicated. Structures and interaction energies for larger (NH4NO3)n nanoparticles are also presented, including the prediction of new particle morphologies with trigonal pyramidal character.

Model and Energy Bounds for a Two-Dimensional System of Electrons Localized in Concentric Rings.

We study a two-dimensional system of interacting electrons confined in equidistant planar circular rings. The electrons are considered spinless and each of them is localized in one ring. While confined to such ring orbits, each electron interacts with the remaining ones by means of a standard Coulomb interaction potential. The classical version of this two-dimensional quantum model can be viewed as representing a system of electrons orbiting planar equidistant concentric rings where the kinetic energy may be discarded when one is searching for the lowest possible energy. Within this framework, the lowest possible energy of the system is the one that minimizes the total Coulomb interaction energy. This is the equilibrium energy that is numerically determined with high accuracy by using the simulated annealing method. This process allows us to obtain both the equilibrium energy and position configuration for different system sizes. The adopted semi-classical approach allows us to provide reliable approximations for the quantum ground state energy of the corresponding quantum system. The model considered in this work represents an interesting problem for studies of low-dimensional systems, with echoes that resonate with developments in nanoscience and nanomaterials.

Improved Sparse Mean Reverting Portfolio Selection Using Simulated Annealing and Extreme Learning Machine

We study the problem of selecting a sparse, mean reverting portfolio from a universe of assets using simulated annealing (SA). Assuming that assets follow a first order vector autoregressive process (VAR(1)), we make a number of improvements in existing methods. First, we extend the underlying asset dynamics to include a time-independent additive term, thereby enriching the model’s applicability. Second, we introduce Extreme Learning Machine (ELM) to decide whether to apply SA or settle for the much faster greedy solution. Finally, we improve the SA method by better calibration of the initial temperature and by determining the exact value of the weights within a selected dimension using the Rayleigh quotient. On real data, these changes result in more than 90% improvement in run time on average and 4.78% improvement in optimized mean reversion in our simulations. We also test the trading performance of our method on both simulated and real data and managed to achieve positive mean trading results in both cases.

High-Resolution Dipole Remote Detection Logging Based on Optimal Nonlinear Frequency Modulation Excitation.

In order to improve the detection range and imaging resolution of dipole remote detection logging, an optimal nonlinear frequency modulation (ONLFM) excitation method is proposed in this paper. In this method, the optimal waveform model of the sound source is designed with objective functions of SNR and resolution to obtain the highest resolution under the condition of the required SNR. This optimal model is a multi-constraint optimization problem, and the simulated annealing method has been used to solve it. Solving the optimal model can obtain the optimal spectrum, and the ONLFM waveform can be designed by using the stationary phase principle. Compared with the electric pulse sound source used in traditional technology, this ONLFM sound source can improve the energy and extend the frequency band range of the reflected wave, which can provide the higher resolution and SNR. The simulation results show that the ONLFM sound source can effectively improve the SNR and resolution of the reflected wave, and the detection range and imaging resolution of dipole shear wave remote detection will be improved.

Horizon picking algorithm using global optimization and coherence measurement in poststacked seismic data

Accurate horizon recognition within poststack seismic sections is important in seismic interpretation. Horizon picking techniques influence diverse seismic structural analyses and inversion methodologies. Despite encountering challenges such as computational demands and time constraints, the past few years have witnessed the development of numerous 2D and 3D methods. With the progress of modern computing, more robust and efficient techniques, harnessing artificial intelligence, have come to the fore. In this context, we develop an innovative cost-effective algorithm grounded in a global optimization framework. This algorithm combines the very fast simulated annealing method with a set of stability parameters and coherence measurements between neighboring seismic traces, which is used as the objective function. The search is executed on continuous and sequential clusters of seismic traces, with a focus on maximizing coherence amidst the presented events. We evaluate the algorithm’s efficacy by applying it to two distinct input data sets — enveloped and nonenveloped seismic traces. The initial application is to the time-migrated Marmousi data set, a synthetic marine data set originated from a complex geologic sedimentary basin situated in Angola, Africa. Subsequently, we apply the algorithm to depth-migrated land data extracted from a past survey conducted in the Tacutu Basin in northern Brazil. Outcomes arising from the application to 2D synthetic and field data sets underscore the method’s viability as a compelling alternative for seismic horizon picking within the time or depth domain.

Structural elucidation of the dichloridodioxido-[(4,7-dimethyl)-1,10-phenanthroline]molybdenum(VI) (C14H12Cl2MoN2O2)

In this work, the synthesis, characterization, and X-ray powder diffraction data for dichloridodioxido-[(4,7-dimethyl)-1,10-phenanthroline]molybdenum(VI) are reported. The crystal structure of this compound was solved from powder diffraction data using the simulated annealing method with a subsequent refinement using the Rietveld method. The dioxo-molybdenum (VI) complex C14H12Cl2MoN2O2 crystallizes in a monoclinic system with space group C2/c (N° 15) with refined unit-cell parameters a = 12.9495 (5) Å, b = 9.7752 (4) Å,c = 12.0069 (6) Å, β = 101.702 (3) °, unit-cell volume V = 1488.27 (11) Å3, and values of Z′ = 0.5 and Z = 4. The molecules are organized into chains diagonally along the a and c axis. Parallel polyhedra are observed along these axes formed by the interactions of Mo, Cl, O, and N atoms present in the coordination sphere. The crystalline packing of this dioxo-molybdenum (VI) complex is dominated by five intermolecular hydrogen bonds, two intramolecular hydrogen bonds, and the four interactions between the centroids (CgI⋯CgJ) of the aromatic rings. An analysis of the Hirshfeld surface revealed that the greatest contributions of the attractive forces are given by H⋯Cl/Cl⋯H, H⋯C/C⋯H, H⋯O/O⋯H, and H⋯H interactions.

Optimization by linear kinetic equations and mean-field Langevin dynamics

One of the most striking examples of the close connections between global optimization processes and statistical physics is the simulated annealing method, inspired by the famous Monte Carlo algorithm devised by Metropolis et al. in the middle of last century. In this paper, we show how the tools of linear kinetic theory allow the description of this gradient-free algorithm from the perspective of statistical physics and how convergence to the global minimum can be related to classical entropy inequalities. This analysis highlights the strong link between linear Boltzmann equations and stochastic optimization methods governed by Markov processes. Thanks to this formalism, we can establish the connections between the simulated annealing process and the corresponding mean-field Langevin dynamics characterized by a stochastic gradient descent approach. Generalizations to other selection strategies in simulated annealing that avoid the acceptance–rejection dynamic are also provided.

A comparison of meta-heuristic and hyper-heuristic algorithms in solving an urban transit routing problems

<p class="p1">Public transport is a serious problem that is difficult to solve in many countries. Public transport routing optimization problem also known as urban transit routing problem (UTRP) is time-consuming process, therefore effective approches are urgently needed. UTRP aims to minimize cost passenger and operator from a combination of route set. UTRP can be optimize with heuristics, meta-heuristics, and hyper-heuristics methods. In several previous studies, UTRP can be optimized with any meta-heuristics and hyper-heuristics methods. In this study we compare the performance of meta-heuristic methods, i.e. ill-climbing, simulated annealing, and hyper-heuristics method based on modified particle swarm optimization algorithm. The experimental results showed that the proposed methods could solve UTRP effectively. Regarding their performance, the results show that despite the generality of hyper-heuristics, their performance are competitive. More specifically, hyper-heuristics method is the best method compared to the other two methods in each dataset. In addition, compared to prior studies results, he proposed hyper-heuristics could outperform them in term of cost passenger of small dataset Mandl. The main contribution of this paper is that to best of our knowledge, it is the first study comparing the performance of meta-heuristics and hyper-heuristics approaches over UTRP.</p>

Optimization of Weibull Distribution Parameters with Application to Short-Term Risk Assessment and Strategic Investment Decision-Making

Accurate parameter estimation is fundamental in financial modeling, especially in investment analysis, where the Modified Internal Rate of Return (MIRR) plays a key role in evaluating investment performance. This study aims to enhance risk and return predictions in Sharia-compliant property investments by exploring the efficacy of various optimization techniques for estimating Weibull distribution parameters within the MIRR framework. To achieve this, we employed a comparative analysis of optimization methods, including Simulated Annealing (SA), Differential Evolution (DE), Genetic Algorithm (GA), and traditional Numerical Methods (NM). Performance was assessed through metrics such as Root Mean Squared Error (RMSE), Akaike Information Criterion (AIC), R-squared (R2) values, and Kolmogorov-Smirnov (KS) statistics. The results reveal that metaheuristic algorithms (SA, DE, GA) significantly outperform traditional numerical methods in terms of parameter estimation accuracy. Specifically, SA achieved the lowest RMSE of 0.042, with a Weibull shape parameter estimate of 1.254 and variance of 0.004, followed closely by DE with an RMSE of 0.048, and GA with 0.046. In contrast, NM exhibited a higher RMSE of 0.067, with a shape parameter estimate of 1.310 and a variance of 0.006. The AIC values for metaheuristic methods ranged from 14.25 to 14.68, compared to 15.12 for NM, and R2 values for metaheuristic methods ranged from 0.932 to 0.945, compared to 0.910 for NM. KS statistics further underscored the superior model fit of metaheuristics, with SA showing the lowest KS value of 0.045. The study underscores the critical role of metaheuristic optimization in improving the accuracy of parameter estimation based on MIRR models. This enhancement provides more reliable risk assessments and returns predictions, offering valuable insights for informed investment decision-making and contributing to optimized financial outcomes in the property sector.

The imprint of conservation laws on correlated particle production

The study of event-by-event fluctuations of net-baryon number in a subspace of full phase space is a promising direction for deciphering the structure of strongly interacting matter created in collisions of relativistic heavy nuclei. Such fluctuations are generally suppressed by exact baryon number conservation. Moreover, the suppression is stronger if baryon number is conserved locally. In this report we present a conceptually new approach to quantify correlations in rapidity space between baryon-antibaryon, baryon-baryon, and antibaryon-antibaryon pairs and demonstrate their impact on net-baryon number fluctuations. For the special case of Gaussian rapidity distributions, we use the Cholesky factorization of the covariance matrix, while the general case is introduced by exploiting the well-known Metropolis and Simulated Annealing methods. The approach is based on the use of the canonical ensemble of statistical mechanics for baryon number and can be applied to study correlations between baryons as well as strange and/or charm hadrons. It can also be applied to describe relativistic nuclear collisions leading to the production of multi-particle final states. One application of our method is the search for formation of proton clusters at low collision energies emerging as a harbinger of the anticipated first-order chiral phase transition. In a first step, the results obtained are compared to the recent measurements from the CERN ALICE collaboration. Such investigations are key to explore the phase diagram of strongly interacting matter and baryon production mechanisms at energy scales from several GeV to several TeV.

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.

Modeling and simulation of optical system error transmission in the laser tracker

The optical system of the laser tracker utilizes plane mirrors to construct a reflective path, reducing its size and weight. However, maintaining the alignment of the laser with the ideal optical axis during its propagation in the optical system poses significant challenges in the design, fabrication, and assembly of the optical system. This paper explores the principle of error propagation during the assembly process of the optical system and improves the accuracy of the output laser through a numerical simulation and optimization methods. A general error model for the optical system is established to understand the principle of error propagation. A Monte Carlo numerical simulation and sensitivity analysis are used to study the influence of various errors on the accuracy of the output laser. The machining errors are optimized using a simulated annealing method to balance the manufacturing difficulty and system accuracy. The assembly process is also optimized to reduce the degrees of freedom and the number of optical parts required, and verified by experiments. The experimental results indicate that the average position error of the output laser is 15.743 µm, and the average angle error is 1.427′′. This study provides what we believe is a novel approach and methodology for the design and alignment of optical systems.