Journal of Algorithms
The vehicle routing problem
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems
Artificial Intelligence Review
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
Reactive GRASP for the strip-packing problem
Computers and Operations Research
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Networks - Special Issue In Memory of Stefano Pallottino
Ant colony optimization for the two-dimensional loading vehicle routing problem
Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
Transportation Science
Strip packing with precedence constraints and strip packing with release times
Theoretical Computer Science
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A squeaky wheel optimisation methodology for two-dimensional strip packing
Computers and Operations Research
Two-dimensional strip packing with unloading constraints
Discrete Applied Mathematics
Hi-index | 0.01 |
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.