Simulated annealing applied to two-dimensional low-beta reduced magnetohydrodynamics

2015 ◽  
Vol 22 (2) ◽  
pp. 022511 ◽  
Author(s):  
Y. Chikasue ◽  
M. Furukawa
Keyword(s):  
Simulated Annealing ◽  
Two Dimensional

A Simulated Annealing-Based Approach to Three Dimensional Component Packing

1994 ◽  
Author(s):  
Simon Szykman ◽  
Jonathan Cagan
Keyword(s):  
Simulated Annealing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Computational Approach ◽  
Vlsi Circuits ◽  
Two Dimensional ◽  
Optimal Solutions ◽  
Layout Problem ◽  
Component Layout ◽  
General Component

Abstract This paper introduces a computational approach to three dimensional component layout that employs simulated annealing to generate optimal solutions. Simulated annealing has been used extensively for two dimensional layout of VLSI circuits; this research extends techniques developed for two dimensional layout optimization to three dimensional problems which are more representative of mechanical engineering applications. In many of these applications, miniaturization trends increase the need to achieve higher packing density and fit components into smaller containers. This research addresses the three dimensional packing problem, which is a subset of the general component layout problem, as a framework in which to solve general layout problems.

scholarly journals Two-dimensional Placement Using Tabu Search

VLSI Design ◽  
2001 ◽  
Vol 12 (1) ◽  
pp. 13-23
Author(s):  
John M. Emmert ◽  
Dinesh K. Bhatia
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Optimization Technique ◽  
Vlsi Design ◽  
Two Dimensional ◽  
Search Technique ◽  
Quality Of Results ◽  
Circuit Performance ◽  
Speed Up

Search based placement of modules is an important problem in VLSI design. It is always desired that the search should converge quickly to a high quality solution. This paper presents a tabu search based optimization technique to place modules on a regular two-dimensional array. The goal of the technique is to speed up the placement process. The technique is based on a two-step placement strategy. The first step is targeted toward improving circuit routability and the second step addresses circuit performance. The technique is demonstrated through placement of several benchmark circuits on academic as well as commercial FPGAs. Results are compared to placements generated by commercial CAE tools and published simulated annealing based techniques. The tabu search technique compares favorably to published simulated annealing based techniques, and it demonstrates an average execution time speedup of 20 with no impact on quality of results when compared to commercial tools.

Two-Stage Approach for Nesting in Two-Dimensional Cutting Problems Using Neural Network and Simulated Annealing

1996 ◽  
Vol 210 (6) ◽  
pp. 509-519 ◽  
Author(s):  
G-C Han ◽  
S-J Na
Keyword(s):  
Neural Network ◽  
Simulated Annealing ◽  
The Self ◽  
Die Design ◽  
Self Organization ◽  
Two Dimensional ◽  
Two Stage ◽  
Two Stages ◽  
Cutting Problems ◽  
Initial Layout

Nesting of two-dimensional patterns on a given raw sheet has applications in a number of industries. It is a common problem often faced by designers in the shipbuilding, garment making, blanking die design, glass and wood industries. This paper presents a new two-stage layout approach for nesting two-dimensional patterns by using the self-organization assisted layout and simulated annealing. The proposed nesting approach consists of two stages: initial layout stage and layout improvement stage. This heuristic algorithm generates a ‘good’ initial layout by using the self-organization assisted layout (SOAL) algorithm and then improves the layout by using the simulated annealing (SA) algorithm. Some examples are treated for showing the effectiveness of this approach in nesting the two-dimensional irregular patterns with and without holes.

Sign in / Sign up

Export Citation Format

Share Document