AbstractThis paper considers the mixed pickup–delivery shortest path problem with specified nodes and stowage planning (mixed-PDSPSNSP), which combines path finding and three-dimensional stowage planning. The mixed-PDSPSNSP appears in many operational problems in various industries. However, to the best of our knowledge, there is no study in the literature for such a problem. The mixed-PDSPSNSP is NP-hard. Our proposed solution algorithm is shown to be effective and efficient when applied to a real-life mixed-PDSPSNSP.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Path finding with stowage planning consideration in a mixed pickup–delivery and specified-node network


    Beteiligte:


    Erscheinungsdatum :

    2007-10-16


    Format / Umfang :

    16 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    Ship stowage planning method, stowage planning system, and ship

    HIRASAWA HIROAKI / HIRAKAWA SHINICHI / MIYASHITA TETSUJI et al. | Europäisches Patentamt | 2022

    Freier Zugriff

    STOWAGE PLANNING METHOD OF SHIP, STOWAGE PLANNING SYSTEM AND SHIP

    HIRASAWA HIROAKI / HIRAKAWA SHINICHI / MIYASHITA TETSUJI et al. | Europäisches Patentamt | 2021

    Freier Zugriff

    METHOD FOR PLANNING STOWAGE OF SHIP, STOWAGE PLANNING SYSTEM, AND SHIP

    HIRASAWA HIROAKI / HIRAKAWA SHINICHI / MIYASHITA TETSUJI et al. | Europäisches Patentamt | 2021

    Freier Zugriff