scholarly journals Topologically Rectangular Grids in the Parallel Simulation of Semiconductor Devices

VLSI Design ◽  
1998 ◽  
Vol 6 (1-4) ◽  
pp. 91-95 ◽  
Author(s):  
A. Asenov ◽  
A. R. Brown ◽  
S. Roy ◽  
J. R. Barker
Keyword(s):  
Simulated Annealing Algorithm ◽  
Semiconductor Device ◽  
Electronic Device ◽  
Device Simulation ◽  
Power Electronic ◽  
Two Dimensional ◽  
Solution Strategy ◽  
Rectangular Grids ◽  
Annealing Algorithm ◽  
2D And 3D

Topologically rectangular grids offer simplicity and efficiency in the design of parallel semiconductor device simulators tailored for mesh connected MIMD platforms. This paper presents several approaches to the generation of topologically rectangular 2D and 3D grids. The effects of the partitioning of such grids on different processor configurations are studied. A simulated annealing algorithm is used to optimise the partitioning of 2D and 3D grids on two dimensional arrays of processors. Problems related to the discretization, parallel matrix generation and solution strategy are discussed. The use of topologically rectangular grids is illustrated through the example of power electronic device simulation.

Computing Near Optimal Paths in C-Space Using Simulated Annealing

1996 ◽  
Author(s):  
Horacio Martínez-Alfaro ◽  
Antonio Ulloa-Pérez
Keyword(s):  
Simulated Annealing ◽  
Path Planning ◽  
Minimum Distance ◽  
Original Problem ◽  
Simulated Annealing Algorithm ◽  
Spline Curves ◽  
Path Representation ◽  
Planning Technique ◽  
Annealing Algorithm ◽  
2D And 3D

Abstract This article describes a minimum-distance collision-free path planning technique of an object among fixed obstacles. The workspace is represented in C-space which reduces the original problem to one of path planning for a point in an expanded-obstacle workspace. We use B-spline curves for path representation and they are synthesized with the Simulated Annealing algorithm. We also give representative 2D and 3D examples to validate our results.

Two-Dimensional Irregular Packing Algorithm for Strips Cutting Technology in Sheet Steel Industry

2011 ◽  
Vol 130-134 ◽  
pp. 1080-1084
Author(s):  
Miao Xin Pan
Keyword(s):  
Simulated Annealing Algorithm ◽  
Sheet Steel ◽  
Two Dimensional ◽  
Optimal Layout ◽  
Genetic Simulated Annealing Algorithm ◽  
Irregular Shapes ◽  
Packing Algorithm ◽  
Automatic Layout ◽  
Bottom Left ◽  
Annealing Algorithm

This paper proposes a new packing algorithm for strips cutting method in steel plate cutting technology. It remarks the shapes by many horizontal lines. It firstly searches the best sequence and each shape’s angle for packing all shapes by genetic simulated annealing algorithm, and then a new heuristic algorithm which satisfies the practical need of strips cutting technology based on the bottom-left algorithm is used to complete the automatic layout of two dimensional irregular shapes. In the end, satisfactory results of optimal layout are obtained.

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 Availability Optimization of Multicomponent Products with Economic Dependence under Two-Dimensional Warranty

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Enzhi Dong ◽  
Zhonghua Cheng ◽  
Rongcai Wang ◽  
Xiaona Zhang
Keyword(s):  
Simulated Annealing ◽  
Preventive Maintenance ◽  
Simulated Annealing Algorithm ◽  
Single Component ◽  
Two Dimensional ◽  
Economic Dependence ◽  
Warranty Period ◽  
Warranty Cost ◽  
Annealing Algorithm ◽  
Availability Model

For multicomponent products, the maintenance of every component separately will increase the downtime and reduce the availability of products during the warranty period. To solve this problem, the economic dependence between the components is considered in this paper. Firstly, a single-component two-dimensional (2D) preventive maintenance (PM) availability model is established, and the simulated annealing algorithm is adopted to calculate the optimal 2D PM interval to achieve the maximal availability of any single component. Then, to ensure that the warranty cost of each component does not exceed the budget, the PM benchmark interval is introduced, and the PM work is optimized following the method of grouping maintenance. Based on this, the 2D preventive grouping maintenance availability model of multicomponent products is established. Finally, an example is given to verify the proposed method, and the results indicate that the proposed method increases the availability of multicomponent products during the 2D warranty period.

Sign in / Sign up

Export Citation Format

Share Document