Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

C1-08
YAEM 2010
YÖNEYLEM ARAÞTIRMASI VE ENDÜSTRÝ MÜHENDÝSLÝGI 30. ULUSAL KONGRESÝ
Matematiksel Programlama 1: Theory and Algorithms
2 Temmuz 2010 / 08:30 - 09:45
Oturum Salonu: MDBF L058
Oturum Baþkaný: Sedat Þarman
1.5-Dimensional Rectangle Packing Problem and Applications
in the Semiconductor Industry
1 2 3
Bulent Basaran , Ali Ekici , Pinar Keskinocak
1 Magma Design Automation, San Jose, CA 95110
2 Department of Industrial Engineering, University of Houston,
Houston, TX 77204
3 H. Milton Stewart School of Industrial and Systems Engineering,
Georgia Institute of Technology, Atlanta, GA, 30332
In this paper, we study a rectangle packing/placement problem,
namely 1.5-Dimensional Rectangle Packing Problem (RPP), which has
applications in the semiconductor industry. Motivated by the chip
design problem, there are n rectangles, and their positions along the
x-axis are specified. Given their fixed horizontal positions, we need to
decide about the vertical positions of the rectangles to minimize the
total height of the resulting placement. We show that the problem is
strongly NP-hard, propose a method for finding a lower bound to the
optimal solution, discuss a special case which is polynomially solvable,
and propose two new heuristics. In addition, we develop an integer
programming formulation and propose ways to strengthen it.
Extensive numerical tests on randomly generated instances show that
the heuristics are both efficient and effective, finding near-optimal
solutions within a few seconds.
An Ensemble of Differential Evolution Algorithms for
Constrained Function Optimization
1 2 3
Mehmet Fatih Tasgetiren , P. N Suganthan , Quan Ke Pan , Rammohan
2 1
Mallipeddi , Sedat Sarman
1 Yasar University, Ýzmir, Turkey
2 Nanyang Technological University, Singapore
3 Liaocheng University, Liaocheng, China
281