Title: A least wasted first heuristic algorithm for the rectangular packing problem
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.
Publication Year: 2009
Publication Date: 2009-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 90
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot