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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods


    Contributors:


    Publication date :

    2009-08-18


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English