HighlightsWe study the quay crane scheduling problem with draft and trim constraints.We present a MIP formulation which incorporates the draft and trim constraints in a novel and effective way.We propose a branch and bound method and a hybrid genetic algorithm to solve the problem with different sizes.Computational experiments show that our solution methods are effective and efficient.

    AbstractThis paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. We propose a linear mixed integer programming model with the objective to minimize the total handling time for the considered problem. A branch and bound method and a hybrid genetic algorithm are developed to solve the studied problem with different sizes. Computational experiments are conducted to examine the proposed model and solution algorithms. The computational results show that the solution methods are effective and efficient in solving the QCSPDT.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Quay crane scheduling with draft and trim constraints


    Beteiligte:
    Wu, Lingxiao (Autor:in) / Ma, Weimin (Autor:in)


    Erscheinungsdatum :

    2016-10-24


    Format / Umfang :

    31 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Quay crane scheduling with draft and trim constraints

    Wu, Lingxiao | Online Contents | 2017


    Next-generation quay crane scheduling

    Abou Kasm, Omar / Diabat, Ali | Elsevier | 2020


    Quay crane diving platform and quay crane

    TENG XUCHUN / LEI QUANWEN / WENG WUWEI et al. | Europäisches Patentamt | 2023

    Freier Zugriff


    Quay crane scheduling with non-interference constraints in port container terminals

    Lee, Der-Horng / Wang, Hui Qiu / Miao, Lixin | Elsevier | 2006