Heuristics for the strip packing problem with unloading constraints

This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the well-known two-dimensional Strip Packing problem, we have to pack all items minimizing the used...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 40; no. 4; pp. 991 - 1003
Main Authors da Silveira, Jefferson L.M., Miyazawa, Flávio K., Xavier, Eduardo C.
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Ltd 01.04.2013
Elsevier
Pergamon Press Inc
Subjects
Algorithms
Applied sciences
Approximation
Approximation algorithms
Blocking
Exact sciences and technology
Flows in networks. Combinatorial problems
GRASP
Heuristic
Logistics
Mathematical analysis
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Packing problem
Route optimization
Route selection
Strip
Strip Packing
Studies
Two dimensional
Vehicles
Strip Packing
Approximation algorithms
GRASP
Fleet
Vehicle routing problem
Heuristic method
Unloading
Bin packing problem
Routing
Capacity constraint
Height
Approximation algorithm
Online AccessGet full text

Cover

More Information
Summary:This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the well-known two-dimensional Strip Packing problem, we have to pack all items minimizing the used height, but now we have the additional constraint that items of higher classes cannot block the way out of lower classes items. This problem appears as a sub-problem in the Two-Dimensional Loading Capacitated Vehicle Routing Problem (2L-CVRP), where one has to optimize the delivery of goods, demanded by a set of clients, that are transported by a fleet of vehicles of limited capacity based at a central depot. We propose two approximation algorithms and a GRASP heuristic for the SPU problem and provide an extensive computational experiment with these algorithms using well know instances for the 2L-CVRP problem as well as new instances adapted from the Strip Packing problem.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2012.11.003