One of the most basic problems in logistics is the problem of route rationalization. Route rationalization may be based on different criterions, but at its core it always can be reduced to classic mathematical problems, such as travelling salesman problem (TSP). This study discusses methods, used to find approximate solutions for TSP and proposes authors modification of classic genetic algorithm (GA) for solving vessel’s route rationalization problem. Test results and strategies for vessel’s route rationalization are discussed. A number of conclusions on best strategies for route rationalization is carried out.


    Access

    Download


    Export, share and cite



    Rationalization of cargo spaces

    Chico Garate, J.J. | Engineering Index Backfile | 1967


    CARGO VESSEL

    KOMURA ATSUSHI / INOUE YUKIYA / OHASHI TETSUYA et al. | European Patent Office | 2022

    Free access

    CARGO VESSEL

    ARAKI MANABU / ARAKI TORU | European Patent Office | 2019

    Free access

    An integrated vessel schedule and aggregated cargo route recovery model

    Siekaniec, Grzegorz / Koza, David Franz / Pisinger, David et al. | BASE | 2019

    Free access

    Cargo transfer vessel

    SYVERTSEN KARE / SMEDAL ARNE | European Patent Office | 2020

    Free access