Neighborhood structures for the container loading problem: a VNS implementation |
| |
| Authors: | F Parreño R Alvarez-Valdes J F Oliveira J M Tamarit |
| |
| Institution: | 1.Department of Statistics and Operations Research,University of Valencia,Valencia,Spain;2.Faculty of Engineering,University of Porto,Porto,Portugal;3.INESC Porto—Instituto de Engenharia de Sistemas e Computadores do Porto,Porto,Portugal;4.Department of Computer Science,University of Castilla-La Mancha,Albacete,Spain |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
