A meta-heuristic algorithm for the strip rectangular packing problem

Authors:
Defu Zhang;Yanjuan Liu;Shengda Chen;Xiaogang Xie
Affiliations:
Department of Computer Science, Xiamen University, China;Department of Computer Science, Xiamen University, China;Department of Computer Science, Xiamen University, China;Department of Computer Science, Xiamen University, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 7
Cited 6

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)
Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research
A hybrid heuristic algorithm for the rectangular packing problem

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
On the two-dimensional Knapsack Problem

Operations Research Letters

Heuristic algorithm for a cutting stock problem in the steel bridge construction

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

Computers and Operations Research
A Tabu Search Algorithm with Direct Representation for Strip Packing

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem

Computers and Operations Research
Tabu search with consistent neighbourhood for strip packing

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new meta-heuristic algorithm to find the minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter time.