Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

2003 ◽  
Vol 145 (3) ◽  
pp. 530-542 ◽  
Author(s):  
T.W Leung ◽  
Chi Kin Chan ◽  
Marvin D Troutt
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Packing Problem ◽  
Two Dimensional ◽  
Simulated Annealing Genetic Algorithm ◽  
Orthogonal Packing Problem

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.

Sign in / Sign up

Export Citation Format

Share Document