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 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.
KeywordsContainer loading 3D packing Heuristics VNS
Unable to display preview. Download preview PDF.
- Davies, A.P., Bischoff, E.E.: Weight distribution considerations in container loading. Working Paper, European Business Management School, Statistics and OR Group, University of Wales, Swansea (1998) Google Scholar
- Gavranovic, H.: Local search and suffix tree for car-sequencing problem with colors. Eur. J. Oper. Res. (2008, in press) Google Scholar
- Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 211–238. Springer, Berlin (2005) Google Scholar
- Parreño, F., Alvarez-Valdes, R., Oliveira, J.F., Tamarit, J.M.: A maximal-space algorithm for the container loading problem. INFORMS J. Comput. (2008, in press) Google Scholar