Abstract This paper proposes a more realistic multi-period liner ship fleet planning problem for a liner container shipping company than has been studied in previous literature. The proposed problem is formulated as a scenario-based dynamic programming model consisting of a number of integer linear programming formulations for each single planning period, and the model can be solved efficiently by a shortest path algorithm on an acyclic network. A numerical example is carried out to illustrate the applicability of the proposed model and solution method. The numerical results show that chartering in ships may not always be a better policy for a long-term planning horizon though it is much cheaper than buying ships in the short-term. Purchasing ships seems to be a more profitable investment in the long run.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A scenario-based dynamic programming model for multi-period liner ship fleet planning


    Beteiligte:
    Meng, Qiang (Autor:in) / Wang, Tingsong (Autor:in)


    Erscheinungsdatum :

    2010-11-16


    Format / Umfang :

    13 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Multi-period liner ship fleet planning with dependent uncertain container shipment demand

    Meng, Qiang / Wang, Tingsong / Wang, Shuaian | Taylor & Francis Verlag | 2015



    A chance constrained programming model for short-term liner ship fleet planning problems

    Meng, Qiang / Wang, Tingsong | Taylor & Francis Verlag | 2010


    Liner ship fleet planning : models and algorithms

    Wang, Tingsong / Wang, Shuaian / Meng, Quiang | TIBKAT | 2017