Terminal and yard allocation problem for a container transshipment hub with multiple terminals

Der Horng Lee; Jian Gang Jin; Jiang Hang Chen

doi:10.1016/j.tre.2011.09.004

Terminal and yard allocation problem for a container transshipment hub with multiple terminals

Der Horng Lee^*, Jian Gang Jin, Jiang Hang Chen

^*Corresponding author for this work

National University of Singapore

Research output: Contribution to journal › Article › peer-review

69 Citations (Scopus)

Abstract

This paper presents an integer programming model for the terminal and yard allocation problem in a large container transshipment hub with multiple terminals. The model integrates two decisions: terminal allocation for vessels and yard allocation for transshipment container movements within a terminal as well as between terminals. The objective function aims to minimize the total inter-terminal and intra-terminal handling costs generated by transshipment flows. To solve the problem, we develop a 2-level heuristic algorithm to obtain high quality solutions in an efficient way. Computational experiments show the effectiveness of the proposed approach.

Original language	English
Pages (from-to)	516-528
Number of pages	13
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	48
Issue number	2
DOIs	https://doi.org/10.1016/j.tre.2011.09.004
Publication status	Published - Mar 2012
Externally published	Yes

Keywords

Container ports
Terminal allocation
Transshipment
Yard allocation

Access to Document

10.1016/j.tre.2011.09.004

Cite this

@article{2fad307748a8474e960199d0b19ae91b,

title = "Terminal and yard allocation problem for a container transshipment hub with multiple terminals",

abstract = "This paper presents an integer programming model for the terminal and yard allocation problem in a large container transshipment hub with multiple terminals. The model integrates two decisions: terminal allocation for vessels and yard allocation for transshipment container movements within a terminal as well as between terminals. The objective function aims to minimize the total inter-terminal and intra-terminal handling costs generated by transshipment flows. To solve the problem, we develop a 2-level heuristic algorithm to obtain high quality solutions in an efficient way. Computational experiments show the effectiveness of the proposed approach.",

keywords = "Container ports, Terminal allocation, Transshipment, Yard allocation",

author = "Lee, {Der Horng} and Jin, {Jian Gang} and Chen, {Jiang Hang}",

year = "2012",

month = mar,

doi = "10.1016/j.tre.2011.09.004",

language = "English",

volume = "48",

pages = "516--528",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

number = "2",

}

TY - JOUR

T1 - Terminal and yard allocation problem for a container transshipment hub with multiple terminals

AU - Lee, Der Horng

AU - Jin, Jian Gang

AU - Chen, Jiang Hang

PY - 2012/3

Y1 - 2012/3

N2 - This paper presents an integer programming model for the terminal and yard allocation problem in a large container transshipment hub with multiple terminals. The model integrates two decisions: terminal allocation for vessels and yard allocation for transshipment container movements within a terminal as well as between terminals. The objective function aims to minimize the total inter-terminal and intra-terminal handling costs generated by transshipment flows. To solve the problem, we develop a 2-level heuristic algorithm to obtain high quality solutions in an efficient way. Computational experiments show the effectiveness of the proposed approach.

AB - This paper presents an integer programming model for the terminal and yard allocation problem in a large container transshipment hub with multiple terminals. The model integrates two decisions: terminal allocation for vessels and yard allocation for transshipment container movements within a terminal as well as between terminals. The objective function aims to minimize the total inter-terminal and intra-terminal handling costs generated by transshipment flows. To solve the problem, we develop a 2-level heuristic algorithm to obtain high quality solutions in an efficient way. Computational experiments show the effectiveness of the proposed approach.

KW - Container ports

KW - Terminal allocation

KW - Transshipment

KW - Yard allocation

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

U2 - 10.1016/j.tre.2011.09.004

DO - 10.1016/j.tre.2011.09.004

M3 - Article

AN - SCOPUS:83555178496

SN - 1366-5545

VL - 48

SP - 516

EP - 528

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

IS - 2

ER -

Terminal and yard allocation problem for a container transshipment hub with multiple terminals

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this