A CONSTRUCTIVE HEURISTIC FOR THE CONTAINER RELOCATION PROBLEM

Authors

  • Kun-Chih Wu Yuan Ze University
  • Ching-Jung Ting Yuan Ze University

DOI:

https://doi.org/10.23055/ijietap.2016.23.3.2865

Keywords:

container relocation problem, block relocation, unrestricted, constructive heuristic, container terminal

Abstract

Container terminal faces a challenge of handling the growing number of containers to adapt the expansion of globalized economy. Reducing container relocation is an important issue in port operational aspect, because the relocation is a non-value-added movement but a time consuming and wasteful activity. In this study, a container relocation problem (CRP) is considered to apply the minimum number of relocations to retrieve all containers stored at a bay. Specifically, the unrestricted-CRP is concerned in this paper, in which not limited to the containers above the target container can be relocated. We propose a novel constructive heuristic to quickly generate a good quality solution to the container relocation problem. Benchmark of total 12500 instances from the literature is tested and compared. The computational results show that, comparing to the existing construction heuristic, our heuristic can improve 3.55% in average number of relocations.

Author Biography

Ching-Jung Ting, Yuan Ze University

Professor, Department of Industrial Engineering and Management

Published

2016-12-19

How to Cite

Wu, K.-C., & Ting, C.-J. (2016). A CONSTRUCTIVE HEURISTIC FOR THE CONTAINER RELOCATION PROBLEM. International Journal of Industrial Engineering: Theory, Applications and Practice, 23(3). https://doi.org/10.23055/ijietap.2016.23.3.2865

Issue

Section

Special Issue: 2015 East Asia Workshop on Industrial Engineering