2014
HMS 2014 Proceeding
Variable neighborhood search for the block relocation problem
Authors: Shunji Tanaka
Abstract
In container yards, containers are stacked in several tiers due to space limitation. In order to retrieve a container from a container yard, it is necessary to relocate containers stacked on it. The aim of the block relocation problem, which is also known as the container relocation problem, is to minimize the number of relocations required for retrieving containers according to a specified order. This study will propose a variable neighborhood search algorithm for the problem and its effectiveness will be examined by numerical experiments.
I3M Scientific Sponsors
I3M Industrial Sponsors
I3M Media Sponsors
