scholarly journals A Knowledge-Based Simulated Annealing Algorithm to Multiple Satellites Mission Planning Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Da-Wei Jin ◽  
Li-Ning Xing
Keyword(s):  
Simulated Annealing ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Mission Planning ◽  
Knowledge Based ◽  
Combination Optimization ◽  
Annealing Algorithm ◽  
The Given ◽  
Planning Problems ◽  
Annealing Method

The multiple satellites mission planning is a complex combination optimization problem. A knowledge-based simulated annealing algorithm is proposed to the multiple satellites mission planning problems. The experimental results suggest that the proposed algorithm is effective to the given problem. The knowledge-based simulated annealing method will provide a useful reference for the improvement of existing optimization approaches.

The Analysis and Improvement of Inverse Problem Simulated Annealing Algorithm about Concrete Temperature Field

2013 ◽  
Vol 275-277 ◽  
pp. 2611-2615
Author(s):  
Lun Yan Wang ◽  
Lei Guo ◽  
Hui Min Yuan
Keyword(s):  
Inverse Problem ◽  
Temperature Field ◽  
Simulated Annealing ◽  
Temperature Control ◽  
Simulated Annealing Algorithm ◽  
Simulated Annealing Method ◽  
Factors Affecting ◽  
Concrete Temperature ◽  
Annealing Algorithm ◽  
Annealing Method

The thermodynamic parameters and boundary conditions is one of the important factors affecting the simulation precision of concrete temperature control, and through the test way obtaining these parameters demands high cost, and often works with practical mismatch. This paper introduces the simulated annealing method, analyse and improve the simulated annealing method . The results show that, the improved of simulated annealing algorithm can be used for the study of concrete temperature field inverse.

Optimal Tolerance Allocation Over Multiple Manufacturing Alternatives

1992 ◽  
Author(s):  
Jonathan Cagan ◽  
Thomas R. Kurfess
Keyword(s):  
Simulated Annealing ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Minimum Cost ◽  
Tolerance Allocation ◽  
Hyperbolic Function ◽  
Manufacturing Processes ◽  
Worst Case ◽  
Annealing Algorithm ◽  
Manufacturing Alternatives

Abstract We introduce a methodology for concurrent design that considers the allocation of tolerances and manufacturing processes for minimum cost. Cost is approximated as a hyperbolic function over tolerance, and worst-case stack-up tolerance is assumed. Two simulated annealing techniques are introduced to solve the optimization problem. The first assumes independent, unordered, manufacturing processes and uses a Monte-Carlo simulation; the second assumes well known individual process cost functions which can be manipulated to create a single continuous function of cost versus tolerance with discontinuous derivatives solved with a continuous simulated annealing algorithm. An example utilizing a system of friction wheels over the manufacturing processes of turning, grinding, and saw cutting bar stock demonstrates excellent results.

Three Dimensional Offline Packing Optimization Problem Based on Genetic Simulated Annealing Algorithm

2015 ◽  
Vol 744-746 ◽  
pp. 1919-1923
Author(s):  
Zhan Zhong Wang ◽  
Jing Fu ◽  
Lan Fang Liu ◽  
Rui Rui Liu
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Three Dimensional ◽  
Packing Problem ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm ◽  
Final Optimization ◽  
Packing Optimization

In this paper, we try to solve 3D offline packing optimization problem by combining two methods-genetic algorithm’ global performance and simulated annealing algorithm’ local performance. Given Heuristic rules in loading conditions, we use the optimal preservation strategy and the roulette wheel method to choose selection operator, integrating simulated annealing algorithm into genetic algorithm , and achieving code programming and algorithms by Matlab.This paper carries out an actual loading in a vehicle company in Changchun City, then makes a contrast between the final optimization results and each suppliers’ current packing data.The experimental results show that the algorithm has a certain validity and practicability in multiple container packing problem.

Protein Folding Simulation Based on Improved Simulated Annealing Algorithm

2012 ◽  
Vol 424-425 ◽  
pp. 246-249
Author(s):  
Jing Fa Liu ◽  
Zi Ling Zhou ◽  
Ze Xu Gao ◽  
Guo Jian Zhang
Keyword(s):  
Protein Folding ◽  
Simulated Annealing ◽  
Ground State ◽  
Lower Energy ◽  
Simulated Annealing Algorithm ◽  
Two Dimensional ◽  
Folding Simulation ◽  
Simulation Based ◽  
Annealing Algorithm ◽  
Annealing Method

Protein folding problem is one of the most important problems in bioinformatics. By combining simulated annealing method with pull moves which is a local move set and conformation update mechanism, we put forward an improved simulated annealing (ISA) algorithm for the two-dimensional hydrophobic- polar (2D HP) protein folding problem. Numerical results show that the ISA algorithm can find the known lowest-energy ground state more rapidly and efficiently than the genetic algorithm (GA) for the several given HP sequences. For the sequence with length 20, we obtain the lower-energy conformation than GA. The performance of the algorithm show ISA is an effective method for protein folding simulation

scholarly journals Research on Fish Slicing Method Based on Simulated Annealing Algorithm

2021 ◽  
Vol 11 (14) ◽  
pp. 6503
Author(s):  
Shuo Liu ◽  
Hao Wang ◽  
Yong Cai
Keyword(s):  
Simulated Annealing ◽  
Multiobjective Optimization ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Collaborative Optimization ◽  
Sequential Algorithm ◽  
Multiobjective Optimization Problem ◽  
Skilled Workers ◽  
Mutation Strategy ◽  
Annealing Algorithm

Multiobjective optimization is a common problem in the field of industrial cutting. In actual production settings, it is necessary to rely on the experience of skilled workers to achieve multiobjective collaborative optimization. The process of industrial intelligence is to perceive the parameters of a cut object through sensors and use machines instead of manual decision making. However, the traditional sequential algorithm cannot satisfy multiobjective optimization problems. This paper studies the multiobjective optimization problem of irregular objects in the field of aquatic product processing and uses the information guidance strategy to develop a simulated annealing algorithm to solve the problem according to the characteristics of the object itself. By optimizing the mutation strategy, the ability of the simulated annealing algorithm to jump out of the local optimal solution is improved. The project team developed an experimental prototype to verify the algorithm. The experimental results show that compared with the traditional sequential algorithm method, the simulated degradation algorithm designed in this paper effectively improves the quality of the target solution and greatly enhances the economic value of the product by addressing the multiobjective optimization problem of squid cutting. At the end of the article, the cutting error is analyzed.

scholarly journals Simulated Annealing Algorithm for Wind Farm Layout Optimization: A Benchmark Study

Energies ◽  
2019 ◽  
Vol 12 (23) ◽  
pp. 4403 ◽  
Author(s):  
Yang ◽  
Cho
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Wind Turbines ◽  
Wind Farm ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Layout Optimization ◽  
Wind Farm Layout ◽  
Wind Farm Layout Optimization ◽  
Annealing Algorithm

The optimal layout of wind turbines is an important factor in the wind farm design process, and various attempts have been made to derive optimal deployment results. For this purpose, many approaches to optimize the layout of turbines using various optimization algorithms have been developed and applied across various studies. Among these methods, the most widely used optimization approach is the genetic algorithm, but the genetic algorithm handles many independent variables and requires a large amount of computation time. A simulated annealing algorithm is also a representative optimization algorithm, and the simulation process is similar to the wind turbine layout process. However, despite its usefulness, it has not been widely applied to the wind farm layout optimization problem. In this study, a wind farm layout optimization method was developed based on simulated annealing, and the performance of the algorithm was evaluated by comparing it to those of previous studies under three wind scenarios; likewise, the applicability was examined. A regular layout and optimal number of wind turbines, never before observed in previous studies, were obtained and they demonstrated the best fitness values for all the three considered scenarios. The results indicate that the simulated annealing (SA) algorithm can be successfully applied to the wind farm layout optimization problem.

scholarly journals Simulated annealing method for equilibrium placement problem

2021 ◽  
pp. 152-158
Author(s):  
Igor Kozin ◽  
Natalia Maksyshko ◽  
Yaroslav Tereshko
Keyword(s):  
Simulated Annealing ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Optimal Solution ◽  
Placement Problem ◽  
Fragmentary Structure ◽  
Simulating Annealing ◽  
Set Of Permutations ◽  
Annealing Algorithm ◽  
The Traveling Salesman Problem

The paper proposes a modification of the simulated annealing algorithm as applied to problems that have a fragmented structure. An algorithm for simulating annealing for the traveling salesman problem is considered and its applicability to the optimization problem on a set of permutations is shown. It is proved that the problem of equilibrium placement of point objects on a plane has a fragmentary structure and, therefore, reduces to an optimization problem on a set of permutations. The results of numerical experiments for various types of algorithms for finding the optimal solution in the equilibrium placement problem are presented.

Sign in / Sign up

Export Citation Format

Share Document