Heuristic algorithm for retrieving containers

Yongmin Kim, Taeho Kim, Hong Chul Lee

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

This study proposes a heuristic algorithm to achieve efficient container retrieval given a specified order, by minimizing the number of container movements and the working time of the crane. We evaluated our proposed algorithm by solving 70 sample problems. The results confirmed the validity and efficiency of the algorithm compared to methods used in previous research. Our algorithm succeeds in reducing the number of container movements and the working time of the crane. Furthermore, the heuristic algorithm is computationally efficient and greatly reduces the amount of time required to obtain a solution. Therefore, we expect our heuristic to be useful in the real-world industry where rapid decision-making is required.

Original languageEnglish
Pages (from-to)352-360
Number of pages9
JournalComputers and Industrial Engineering
Volume101
DOIs
Publication statusPublished - 2016 Nov 1

Bibliographical note

Publisher Copyright:
© 2016

Keywords

  • Container retrieval
  • Container terminal
  • Heuristic

ASJC Scopus subject areas

  • General Computer Science
  • General Engineering

Fingerprint

Dive into the research topics of 'Heuristic algorithm for retrieving containers'. Together they form a unique fingerprint.

Cite this