The integrated yard truck and yard crane scheduling problem: Benders' decomposition-based methods
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.
Volume (Year): 46 (2010)
Issue (Month): 3 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:3:p:344-353. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.