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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2007-10-16


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Ship stowage planning method, stowage planning system, and ship

    HIRASAWA HIROAKI / HIRAKAWA SHINICHI / MIYASHITA TETSUJI et al. | European Patent Office | 2022

    Free access

    STOWAGE PLANNING METHOD OF SHIP, STOWAGE PLANNING SYSTEM AND SHIP

    HIRASAWA HIROAKI / HIRAKAWA SHINICHI / MIYASHITA TETSUJI et al. | European Patent Office | 2021

    Free access

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

    HIRASAWA HIROAKI / HIRAKAWA SHINICHI / MIYASHITA TETSUJI et al. | European Patent Office | 2021

    Free access