Heuristic algorithm for retrieving containers

Yongmin Kim, Taeho Kim, Hong Chul Lee

Research output: Contribution to journalArticle

4 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

Fingerprint

Heuristic algorithms
Containers
Cranes
Decision making
Industry

Keywords

  • Container retrieval
  • Container terminal
  • Heuristic

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Heuristic algorithm for retrieving containers. / Kim, Yongmin; Kim, Taeho; Lee, Hong Chul.

In: Computers and Industrial Engineering, Vol. 101, 01.11.2016, p. 352-360.

Research output: Contribution to journalArticle

Kim, Yongmin ; Kim, Taeho ; Lee, Hong Chul. / Heuristic algorithm for retrieving containers. In: Computers and Industrial Engineering. 2016 ; Vol. 101. pp. 352-360.
@article{a94b7bed5cab4300867e7901484b7364,
title = "Heuristic algorithm for retrieving containers",
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.",
keywords = "Container retrieval, Container terminal, Heuristic",
author = "Yongmin Kim and Taeho Kim and Lee, {Hong Chul}",
year = "2016",
month = "11",
day = "1",
doi = "10.1016/j.cie.2016.08.022",
language = "English",
volume = "101",
pages = "352--360",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Heuristic algorithm for retrieving containers

AU - Kim, Yongmin

AU - Kim, Taeho

AU - Lee, Hong Chul

PY - 2016/11/1

Y1 - 2016/11/1

N2 - 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.

AB - 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.

KW - Container retrieval

KW - Container terminal

KW - Heuristic

UR - http://www.scopus.com/inward/record.url?scp=84989829886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84989829886&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2016.08.022

DO - 10.1016/j.cie.2016.08.022

M3 - Article

AN - SCOPUS:84989829886

VL - 101

SP - 352

EP - 360

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -