Neighborhood structures for the container loading problem: a VNS implementation

This paper presents a Variable Neighborhood Search (VNS) algorithm for the container loading problem. The algorithm combines a constructive procedure based on the concept of maximal-space, with five new movements defined directly on the physical layout of the packed boxes, which involve insertion an...

Full description

Saved in:
Bibliographic Details
Published in:Journal of heuristics 2010-02, Vol.16 (1), p.1-22
Main Authors: Parreño, F., Alvarez-Valdes, R., Oliveira, J. F., Tamarit, J. M.
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Boxes
Calculus of Variations and Optimal Control
Optimization
Load
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Operations Research/Decision Theory
Packing problem
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a Variable Neighborhood Search (VNS) algorithm for the container loading problem. The algorithm combines a constructive procedure based on the concept of maximal-space, with five new movements defined directly on the physical layout of the packed boxes, which involve insertion and deletion strategies. The new algorithm is tested on the complete set of Bischoff and Ratcliff problems, ranging from weakly to strongly heterogeneous instances, and outperforms all the reported algorithms which have used those test instances.
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-008-9081-3