Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

Authors:
Ender ÖZcan;Zhang Kai;John H. Drake
Affiliations:
School of Computer Science, University of Nottingham Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK;School of Computer Science, University of Nottingham Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK;School of Computer Science, University of Nottingham Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK
Venue:
Expert Systems with Applications: An International Journal
Year:
2013

Citing 15
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
An Exact Approach to the Strip-Packing Problem

INFORMS Journal on Computing
Exhaustive approaches to 2D rectangular perfect packings

Information Processing Letters
Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
New heuristic and interactive approaches to 2D rectangular strip packing

Journal of Experimental Algorithmics (JEA)
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation

IEEE Transactions on Computers
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem

INFORMS Journal on Computing
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio

Computers and Operations Research
Arc-flow model for the two-dimensional guillotine cutting stock problem

Computers and Operations Research
A squeaky wheel optimisation methodology for two-dimensional strip packing

Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem

Operations Research
A simple randomized algorithm for two-dimensional strip packing

Computers and Operations Research

Quantified Score

Hi-index	12.05

Visualization

Abstract

The two dimensional orthogonal rectangular strip packing problem is a common NP-hard optimisation problem whereby a set of rectangular shapes must be placed on a fixed width stock sheet with infinite length in such a way that wastage is minimised and material utilisation is maximised. The bidirectional best-fit heuristic is a deterministic approach which has previously been shown to outperform existing heuristic methods as well as many metaheuristics from the literature. Here, we propose a modification to the original bidirectional best-fit heuristic whereby combinations of pairs of rectangles are considered generating improved results over standard benchmark sets.