AbstractBerth scheduling aims to optimally schedule vessels to berthing areas along a quay and is a complex optimization problem. In this paper we propose a lamda-optimal based heuristic as a resolution approach for the discrete space berth scheduling problem. The proposed heuristic can also be applied to validate optimality, in the case where other (meta)heuristics are applied as resolution approaches. A second internal Genetic Algorithms based heuristic is also proposed to reduce the computational time required for medium to large scale instances. Numerical experiments performed show that the proposed heuristic is adequate to produce near-optimal results within acceptable computational times.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A lamda-optimal based heuristic for the berth scheduling problem


    Beteiligte:


    Erscheinungsdatum :

    2009-07-16


    Format / Umfang :

    13 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    A lamda-optimal based heuristic for the berth scheduling problem

    Golias, Mihalis M. | Online Contents | 2010


    Discrete Berth-Scheduling Problem

    Golias, M. M. / Boile, M. / Theofanis, S. | Transportation Research Record | 2010


    The Berth-Scheduling Problem

    Golias, Mihalis / Boile, Maria / Theofanis, Sotiris et al. | Transportation Research Record | 2010


    A Berth Scheduling Problem under Sailing Schedule Disruption

    Yang, C. / Wang, N. / Zhao, B. et al. | British Library Conference Proceedings | 2010


    A Berth Scheduling Problem under Sailing Schedule Disruption

    Yang, Chunxia / Wang, Nuo / Zhao, Bing | ASCE | 2010