A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals

Jiang Hang Chen; Der Horng Lee; Jin Xin Cao

doi:10.1016/j.tre.2011.06.004

A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals

Jiang Hang Chen, Der Horng Lee^*, Jin Xin Cao

^*Corresponding author for this work

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

47 Citations (Scopus)

Abstract

The quayside operation problem is one of the key components in the management system for a container terminal. In this paper, the integrated models proposed in the previous studies to address the quayside operation problem are examined and one of the potential frameworks is identified. A new method called combinatorial benders' cuts algorithm is developed to solve the berth-level model in the framework. The computational experiment conducted in this research shows that the proposed approach is more efficient than the branch and cut algorithm embedded in CPLEX.

Original language	English
Pages (from-to)	266-275
Number of pages	10
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	48
Issue number	1
DOIs	https://doi.org/10.1016/j.tre.2011.06.004
Publication status	Published - Jan 2012
Externally published	Yes

Keywords

Combinatorial benders' cuts
Container terminal
Quayside operation problem

Access to Document

10.1016/j.tre.2011.06.004

Cite this

@article{a3722df5aa104391989eaac051198f5d,

title = "A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals",

abstract = "The quayside operation problem is one of the key components in the management system for a container terminal. In this paper, the integrated models proposed in the previous studies to address the quayside operation problem are examined and one of the potential frameworks is identified. A new method called combinatorial benders' cuts algorithm is developed to solve the berth-level model in the framework. The computational experiment conducted in this research shows that the proposed approach is more efficient than the branch and cut algorithm embedded in CPLEX.",

keywords = "Combinatorial benders' cuts, Container terminal, Quayside operation problem",

author = "Chen, {Jiang Hang} and Lee, {Der Horng} and Cao, {Jin Xin}",

year = "2012",

month = jan,

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

language = "English",

volume = "48",

pages = "266--275",

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

issn = "1366-5545",

number = "1",

}

TY - JOUR

T1 - A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals

AU - Chen, Jiang Hang

AU - Lee, Der Horng

AU - Cao, Jin Xin

PY - 2012/1

Y1 - 2012/1

N2 - The quayside operation problem is one of the key components in the management system for a container terminal. In this paper, the integrated models proposed in the previous studies to address the quayside operation problem are examined and one of the potential frameworks is identified. A new method called combinatorial benders' cuts algorithm is developed to solve the berth-level model in the framework. The computational experiment conducted in this research shows that the proposed approach is more efficient than the branch and cut algorithm embedded in CPLEX.

AB - The quayside operation problem is one of the key components in the management system for a container terminal. In this paper, the integrated models proposed in the previous studies to address the quayside operation problem are examined and one of the potential frameworks is identified. A new method called combinatorial benders' cuts algorithm is developed to solve the berth-level model in the framework. The computational experiment conducted in this research shows that the proposed approach is more efficient than the branch and cut algorithm embedded in CPLEX.

KW - Combinatorial benders' cuts

KW - Container terminal

KW - Quayside operation problem

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

U2 - 10.1016/j.tre.2011.06.004

DO - 10.1016/j.tre.2011.06.004

M3 - Article

AN - SCOPUS:80054120246

SN - 1366-5545

VL - 48

SP - 266

EP - 275

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

IS - 1

ER -

A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this