A new heuristic algorithm for rectangle packing

Authors:
Wenqi Huang;Duanbing Chen;Ruchu Xu
Affiliations:
College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074, China;College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074, China;College of Computer Science, Huazhong University of Science and Technology, Wuhan 430074, China
Venue:
Computers and Operations Research
Year:
2007

Citing 14
Cited 9

Module placement on BSG-structure and IC layout applications

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
An enhanced perturbing algorithm for floorplan design using the O-tree representation

ISPD '00 Proceedings of the 2000 international symposium on Physical design
B*-Trees: a new representation for non-slicing floorplans

Proceedings of the 37th Annual Design Automation Conference
A genetic algorithm for a 2D industrial packing problem

Computers and Industrial Engineering
FAST-SP: a fast algorithm for block placement based on sequence pair

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
TCG: a transitive closure graph-based representation for non-slicing floorplans

Proceedings of the 38th annual Design Automation Conference
TCG-S: orthogonal coupling of P*-admissible representations for general floorplans

Proceedings of the 39th annual Design Automation Conference
Corner block list: an effective and efficient topological representation of non-slicing floorplan

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Stairway Compaction using Corner Block List and Its Applications with Rectilinear Blocks

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Corner sequence: a P-admissible floorplan representation with a worst case linear-time packing scheme

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Operations Research
VLSI module placement based on rectangle-packing by the sequence-pair

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The two-dimensional bin packing problem with variable bin sizes and costs

Discrete Optimization

A new heuristic algorithm for cuboids packing with no orientation constraints

Computers and Operations Research
A least wasted first heuristic algorithm for the rectangular packing problem

Computers and Operations Research
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

Computers and Operations Research
Hybrid algorithm for floorplanning using B*-tree representation

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

Computers and Operations Research
A fast layer-based heuristic for non-guillotine strip packing

Expert Systems with Applications: An International Journal
The six elements to block-building approaches for the single container loading problem

Applied Intelligence
A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

INFORMS Journal on Computing
Artificial fish swarm algorithm for two-dimensional non-guillotine cutting stock problem

ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

The rectangle packing problem often appears in encasement and cutting as well as very large-scale integration design. To solve this problem, many algorithms such as genetic algorithm, simulated annealing and other heuristic algorithms have been proposed. In this paper, a new heuristic algorithm is recommended based on two important concepts, namely, the corner-occupying action and caving degree. Twenty-one rectangle-packing instances are tested by the algorithm developed, 16 of which having achieved optimum solutions within reasonable runtime. Experimental results demonstrate that the algorithm developed is fairly efficient for solving the rectangle packing problem.