An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

Authors:
Duanbing Chen;Jingfa Liu;Yan Fu;Mingsheng Shang
Affiliations:
School of Computer Science, University of Electronic Science and Technology of China, Chengdu 610054, PR China;School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044, PR China;School of Computer Science, University of Electronic Science and Technology of China, Chengdu 610054, PR China;School of Computer Science, University of Electronic Science and Technology of China, Chengdu 610054, PR China
Venue:
Computers and Operations Research
Year:
2010

Citing 13
Cited 1

Module placement on BSG-structure and IC layout applications

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Developing a simulated annealing algorithm for the cutting stock problem

Computers and Industrial Engineering
Rectilinear block placement using sequence-pair

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Arbitrary rectilinear block packing based on sequence pair

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
A genetic algorithm for a 2D industrial packing problem

Computers and Industrial Engineering
Rectilinear block packing using O-tree representation

Proceedings of the 2001 international symposium on Physical design
Rectilinear block placement using B*-trees

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A fast algorithm for rectilinear block packing based on selected sequence-pair

Integration, the VLSI Journal
A new heuristic algorithm for rectangle packing

Computers and Operations Research
Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns

Computers and Operations Research
A recursive algorithm for constrained two-dimensional cutting problems

Computational Optimization and Applications
A meta-heuristic algorithm for the strip rectangular packing problem

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Two-dimensional equilibrium constraint layout using simulated annealing

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

Arbitrary shaped rectilinear block packing problem is a problem of packing a series of rectilinear blocks into a larger rectangular container, where arbitrary shaped rectilinear block is a polygonal block whose interior angle is either 90^o or 270^o. This problem involves many industrial applications, such as VLSI design, timber cutting, textile industry and layout of newspaper. Many algorithms based on different strategies have been presented to solve it. In this paper, we proposed an efficient heuristic algorithm which is based on principles of corner-occupying action and caving degree describing the quality of packing action. The proposed algorithm is tested on six instances from literatures and the results are rather satisfying. The computational results demonstrate that the proposed algorithm is rather efficient for solving the arbitrary shaped rectilinear block packing problem.