Developing a Hybrid Stack Mode for Dynamic Yard Allocation Strategy of Export Containers

Abstract

In this paper, a dynamic yard allocation strategy of export containers is proposed based on a hybrid stack mode. Firstly, a 0-1 programming model is developed for the problem. Accordingly, the model’s objective function is subject to the minimization of the total re-shuffle containers which are buried beneath other containers but heavier. To resolve the NP-hard problem regarding the dynamic yard allocation model, a hybrid algorithm, which applies heuristic rules and genetic algorithm, is then employed. Subsequently, a case study is used for system illustration. Consequently, it could be found from computational results that this approach paves a venue for resolving the dynamic yard allocation problem of export containers.