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

Authors:
Defu Zhang;Lijun Wei;Stephen C. H. Leung;Qingshan Chen
Affiliations:
Department of Computer Science, Xiamen University, Xiamen, 361005, China;Department of Management Sciences, City University of Hong Kong, Kowloon, Hong Kong;Department of Management Sciences, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, Xiamen University, Xiamen, 361005, China
Venue:
INFORMS Journal on Computing
Year:
2013

Citing 11
Cited 1

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

INFORMS Journal on Computing
The Three-Dimensional Bin Packing Problem

Operations Research
An Exact Approach to the Strip-Packing Problem

INFORMS Journal on Computing
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research
A new heuristic algorithm for rectangle packing

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

Operations Research
Reactive GRASP for the strip-packing problem

Computers and Operations Research
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem

Computers and 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
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

Hybrid approach for 2d strip packing problem using genetic algorithm

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a binary search heuristic algorithm for the rectangular strip-packing problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision problem. A least-waste-first strategy and a minimal-inflexion-first strategy are proposed to solve the related decision problem. Lastly, we develop a binary search heuristic algorithm based on randomized local search to solve the original optimization problem. The computational results on six classes of benchmark problems have shown that the presented algorithm can find better solutions within a reasonable time than the published best heuristic algorithms for most zero-waste instances. In particular, the presented algorithm is proved to be the dominant algorithm for large zero-waste instances.