AbstractThis 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.
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
2009-08-18
10 pages
Article (Journal)
Electronic Resource
English
The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods
Online Contents | 2010
|Integrated Bay Allocation and Yard Crane Scheduling Problem for Transshipment Containers
Transportation Research Record | 2011
|Integrated Bay Allocation and Yard Crane Scheduling Problem for Transshipment Containers
Online Contents | 2011
|