Please use this identifier to cite or link to this item:
|Title:||The integrated yard truck and yard crane scheduling problem: Benders' decomposition-based methods||Authors:||Cao, J.X.
Container terminal operations
|Issue Date:||May-2010||Citation:||Cao, J.X., Lee, D.-H., Chen, J.H., Shi, Q. (2010-05). The integrated yard truck and yard crane scheduling problem: Benders' decomposition-based methods. Transportation Research Part E: Logistics and Transportation Review 46 (3) : 344-353. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2009.08.012||Abstract:||This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders' decomposition, are developed for problem solution; namely, the general Benders' cut-based method and the combinatorial Benders' cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods. © 2009 Elsevier Ltd. All rights reserved.||Source Title:||Transportation Research Part E: Logistics and Transportation Review||URI:||http://scholarbank.nus.edu.sg/handle/10635/66291||ISSN:||13665545||DOI:||10.1016/j.tre.2009.08.012|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.