A hybrid heuristic algorithm for the rectangular packing problem

Authors:
Defu Zhang;Ansheng Deng;Yan Kang
Affiliations:
Department of Computer Science, Xiamen University, China;Department of Computer Science, Xiamen University, China;School of Software, Yunnan University, Kunming, China
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Year:
2005

Citing 5
Cited 1

Packing squares into a square

Journal of Parallel and Distributed Computing
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Introduction to Algorithms

Introduction to Algorithms
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on divide-and-conquer and greedy strategies. The computational results on a class of benchmark problems have shown that the performance of the heuristic algorithm can outperform that of quasi-human heuristics.