A least wasted first heuristic algorithm for the rectangular packing problem

Authors:
Lijun Wei;Defu Zhang;Qingshan Chen
Affiliations:
Department of Computer Science, Xiamen University, Xiamen 361005, China;Department of Computer Science, Xiamen University, Xiamen 361005, China and Longtop Group Post-doctoral Research Center, Xiamen 361005, China;Department of Computer Science, Xiamen University, Xiamen 361005, China
Venue:
Computers and Operations Research
Year:
2009

Citing 9
Cited 9

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

A hybrid simulated annealing algorithm for container loading problem

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem

Computers and Operations Research
Two-dimensional equilibrium constraint layout using simulated annealing

Computers and Industrial Engineering
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
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
An efficient deterministic heuristic for two-dimensional rectangular packing

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

Computers and Operations Research
Smart energy case study

BuildSys '12 Proceedings of the Fourth ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Buildings

Quantified Score

Hi-index	0.01

Visualization

Abstract

The rectangular packing problem is to pack a number of rectangles into a single large rectangular sheet so as to maximize the total area covered by the rectangles packed. The paper first presents a least wasted first strategy which evaluates the positions used by the rectangles. Then a random local search is introduced to improve the results and a least wasted first heuristic algorithm (LWF) is further developed to find a desirable solution. Twenty-one rectangular-packing instances are tested by the algorithm developed, the experimental results show that the presented algorithm can achieve an optimal solution within reasonable time and is fairly efficient for dealing the rectangular packing problem. LWF still performs well when it is extended to solve zero-waste and non-zero-waste strip packing instances.