Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2011.06.004
Title: A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals
Authors: Chen, J.H.
Lee, D.-H. 
Cao, J.X.
Keywords: Combinatorial benders' cuts
Container terminal
Quayside operation problem
Issue Date: Jan-2012
Citation: Chen, J.H., Lee, D.-H., Cao, J.X. (2012-01). A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals. Transportation Research Part E: Logistics and Transportation Review 48 (1) : 266-275. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2011.06.004
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. © 2011 Elsevier Ltd.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/53953
ISSN: 13665545
DOI: 10.1016/j.tre.2011.06.004
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

26
checked on Oct 8, 2018

WEB OF SCIENCETM
Citations

17
checked on Oct 1, 2018

Page view(s)

60
checked on Oct 6, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.