An Improved Multi-Objective Hybrid Genetic-Simulated Annealing Algorithm for AGV Scheduling under Composite Operation Mode

This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aims to minimize the maximum completion time,the total distance covered by AGVs,and the distance traveled while empty-loaded.The improved hybrid algorithm combines the improved genetic algorithm(GA)and the simulated annealing algorithm(SA)to strengthen the local search ability of the algorithm and improve the stability of the calculation results.Based on the characteristics of the composite operation mode,the authors introduce the combined coding and parallel decoding mode and calculate the fitness function with the grey entropy parallel analysis method to solve the multi-objective problem.The grey entropy parallel analysis method is a combination of the grey correlation analysis method and the entropy weighting method to solve multi-objective solving problems.A task advance evaluation strategy is proposed in the process of crossover and mutation operator to guide the direction of crossover and mutation.The computational experiments results show that the improved hybrid algorithm is better than the GA and the genetic algorithm with task advance evaluation strategy(AEGA)in terms of convergence speed and solution results,and the effectiveness of the multi-objective solution is proved.All three objectives are optimized and the proposed algorithm has an optimization of 7.6%respectively compared with the GA and 3.4%compared with the AEGA in terms of the objective of maximum completion time.

Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem

The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given.

Simulated annealing algorithm for the optimal translation sequence of the jth agent in rough communication

In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.

Using genetic/simulated annealing algorithm to solve disassembly sequence planning

Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.

Simulated annealing algorithm for detecting graph isomorphism

Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.

Optimization of the seismic processing phase-shift plus finite-difference migration operator based on a hybrid genetic and simulated annealing algorithm

Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation.

Structural optimization and segregation behavior of quaternary alloy nanoparticles based on simulated annealing algorithm

Alloy nanoparticles exhibit higher catalytic activity than monometallic nanoparticles, and their stable structures are of importance to their applications. We employ the simulated annealing algorithm to systematically explore the stable structure and segregation behavior of tetrahexahedral Pt–Pd–Cu–Au quaternary alloy nanoparticles. Three alloy nanoparticles consisting of 443 atoms, 1417 atoms, and 3285 atoms are considered and compared. The preferred positions of atoms in the nanoparticles are analyzed. The simulation results reveal that Cu and Au atoms tend to occupy the surface, Pt atoms preferentially occupy the middle layers, and Pd atoms tend to segregate to the inner layers. Furthermore, Au atoms present stronger surface segregation than Cu ones. This study provides a fundamental understanding on the structural features and segregation phenomena of multi-metallic nanoparticles.

Application of simulated annealing algorithm to improve work roll wear model in plate mills

Employing Simulated Annealing Algorithm (SAA) and many measured data, acalculation model of work roll wear was built in the 2 800 mm 4-high mill of Wuhan Iron and Steel(Group) Co. (WISCO). The model was a semi-theory practical formula. Its pattern and magnitude werestill hardly defined with classical optimization methods. But the problem could be resolved by SAA.It was pretty high precision to predict the values for the wear profiles of work roll in a rollingunit. After one-year application, the results show that the model is feasible in engineering, and itcan be applied to predict the wear profiles of work roll in other mills.

A Gradient-Simulated Annealing Algorithm of Pre-location-Based Best Fitting of Blank to Complex Surfaces Machining

The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections of two objects on a plane perpendicular to the normal vector. The second step is optimizing an objective function by means of gradient-simulated annealing algorithm to get the best matching of a set of distributed points on the blank and destination surfaces. An example for machining hydroelectric turbine blades is given to verify the effectiveness of algorithm.

CNOP-P-based parameter sensitivity for double-gyre variation in ROMS with simulated annealing algorithm

Reducing the error of sensitive parameters by studying the parameters sensitivity can reduce the uncertainty of the model,while simulating double-gyre variation in Regional Ocean Modeling System(ROMS).Conditional Nonlinear Optimal Perturbation related to Parameter(CNOP-P)is an effective method of studying the parameters sensitivity,which represents a type of parameter error with maximum nonlinear development at the prediction time.Intelligent algorithms have been widely applied to solving Conditional Nonlinear Optimal Perturbation(CNOP).In the paper,we proposed an improved simulated annealing(SA)algorithm to solve CNOP-P to get the optimal parameters error,studied the sensitivity of the single parameter and the combination of multiple parameters and verified the effect of reducing the error of sensitive parameters on reducing the uncertainty of model simulation.Specifically,we firstly found the non-period oscillation of kinetic energy time series of double gyre variation,then extracted two transition periods,which are respectively from high energy to low energy and from low energy to high energy.For every transition period,three parameters,respectively wind amplitude(WD),viscosity coefficient(VC)and linear bottom drag coefficient(RDRG),were studied by CNOP-P solved with SA algorithm.Finally,for sensitive parameters,their effect on model simulation is verified.Experiments results showed that the sensitivity order is WD>VC>>RDRG,the effect of the combination of multiple sensitive parameters is greater than that of single parameter superposition and the reduction of error of sensitive parameters can effectively reduce model prediction error which confirmed the importance of sensitive parameters analysis.

Estimation of Mutual Coupling Coefficient of the Array by Simulated Annealing Algorithm

We propose a method for estimating the mutual coupling coefficient among antennas in this paper which is based on the principle of signal subspace and the simulated annealing （SA） algorithm. The computer simulation has been conducted to illustrate the＇ excellent performance of this method and to demonstrate that it is statistically efficient. The benefit of this new method is that calibration signals and unknown signals can be received simultaneously, during the course of calibration.

Coherent Doppler lidar wind retrieval for a typhoon based on the genetic simulated annealing algorithm

A method of spectrum estimation based on the genetic simulated annealing(GSA)algorithm is proposed,which is applied to retrieve the three-dimensional wind field of typhoon Nangka observed by our research group.Compared to the genetic algorithm(GA),the GSA algorithm not only extends the detection range and guarantees the accuracy of retrieval results but also demonstrates a faster retrieval speed.Experimental results indicate that both the GA and GSA algorithms can enhance the detection range by 35%more than the least squares method.However,the convergence speed of the GSA algorithm is 17 times faster than that of the GA,which is more beneficial for real-time data processing.

Application of DSAPSO Algorithm in Distribution Network Reconfiguration with Distributed Generation

With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.

Integrated classification method of tight sandstone reservoir based on principal component analysise simulated annealing genetic algorithmefuzzy cluster means

In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.

Magnetic Coupler Robust Optimization Design for Electric Vehicle Wireless Charger Based on Improved Simulated Annealing Algorithm

Fleets of autonomous vehicles including shuttle buses,freight trucks,and road sweepers will be deployed in the Olympic Vil-lage during Beijing 2022 Winter Olympics.This requires intelligent charging infrastructure based on wireless power transfer technology to be equipped.To increase the misalignment tolerance of a high-power wireless charger,the robustness of the magnetic coupler should be optimized.This paper presents a new type of unipolar coupler,which is composed of three con-nected coils in series.The dimensional configuration of the coils is analyzed by the finite element method.The characteristic parameters of the coil are identified with their influence on the self-inductance and coupling coefficient.An expert model is built,whose feasibility can be verified in the aimed design domain.Combined with the expert model,an improved simulated annealing algorithm with a backtracking mechanism is proposed.The primary coil can reach the expected characteristics from any starting parameter combination through the proposed optimization algorithm.Under the same conditions in terms of external circuit parameters,ferrite usage,and aluminum shielding,the offset sensitivity of the magnetic coupler can be reduced from 58.79%to 18.89%.A prototype is established,validating the feasibility of the proposed coil structure with the optimized parameter algorithm.

Usage of Simulated Annealing Algorithm in Design of Optical Thin Film

Simulated annealing algorithm is a mathematic model,which imitates the physical process of annealing. And optical thin film is widely used in many industry.Its design is difficult and can be regarded as an optimization problem.In this paper,we use the simulated annealing algorithm to design an edge filter,which is composed of 20 dielectric thin film layers with TiO2 and SiO2.The simulated annealing algorithm is a very robust algorithm for optical thin film design.

MULTI-OBJECTIVE OPTIMIZATION DESIGN FOR TRANSONIC TURBINE CASCADES USING SIMULATED ANNEALING ALGORITHM

On the basis of computational of transonic viscid flow, the simulated annealing algorithm, used in statistical mechanics to study solid cooling process, is adaptedfor soving multi-objective cascades design problem. The simulated annealing algorithmdraws an analogy between the energy minimization in physical system and the objectivefunction in the real design problem, To model the multi-objective functions, a minimumdeviation method is used. In this paper, the loss and work are considered as the objectivefunctions. Simulated results indicate that this algorithm can be effectively applied to theimprovement of the design for transonic turbine cascades.

Multi-Objective Optimization for Structure Crashworthiness Based on Kriging Surrogate Model and Simulated Annealing Algorithm

Multi-objective optimization of crashworthiness in automobile front-end structure was performed,and finite element model(FEM)was validated by experimental results to ensure that FEM can predict the response value with sufficient accuracy.Seven design variables and four crashworthiness indicators were defined.Through orthogonal design method,18 FEMs were established,and the response values of crashworthiness indicators were extracted.By using the variable-response specimen matrix,Kriging surrogate model(KSM)was constructed to replace FEM to refect the function correlation between variables and responses.The accuracy of KSM was also validated.Finally,the simulated annealing optimization algorithm was implemented in KSM to seek optimal and reliable solutions.Based on the optimal results and comparison analysis,the 9096-th iteration point was the optimal solution.Although the intrusion of firewall and the mass of optimal structure increased slightly,the vehicle acceleration of the optimal solution decreased by 6.9%,which fectively reduced the risk of occupant injury.

Simulated annealing algorithm for ill-posed or ill-conditioning deconvolution problem

A simulated annealing deconvolution technique dealing with the ill-posed and ill-Conditioning problems is presented. Following a survey about direct and iterative deconvolution techniques, the simulated annealing approach for ill-posed and ill-conditioning decon volution is introduced. With comparison to some deconvolution techniques the new approach is described in details. A specific ill-posed and ill-Conditioning deconvolution example is consid ered and the deconvolution results using the simulated annealing approach and some conventional techniques such as clipped inverse filtering, reblurring, multiple-operator, constrained iteration, etc., are given. It has shown that the simulated annealing approach fights against the ill-posed and ill-conditioning successfully.

Ship Weather Routing Based on Hybrid Genetic Algorithm Under Complicated Sea Conditions

Considering the effects of increased economic globalization and global warming,developing methods for reducing shipping costs and greenhouse gas emissions in ocean transportation has become crucial.Owing to its key role in modern navigation technology,ship weather routing is the research focus of several scholars in this field.This study presents a hybrid genetic algorithm for the design of an optimal ship route for safe transoceanic navigation under complicated sea conditions.On the basis of the basic genetic algorithm,simulated annealing algorithm is introduced to enhance its local search ability and avoid premature convergence,with the ship’s voyage time and fuel consumption as optimization goals.Then,a mathematical model of ship weather routing is developed based on the grid system.A measure of fitness calibration is proposed,which can change the selection pressure of the algorithm as the population evolves.In addition,a hybrid crossover operator is proposed to enhance the ability to find the optimal solution and accelerate the convergence speed of the algorithm.Finally,a multi-population technique is applied to improve the robustness of the algorithm using different evolutionary strategies.