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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Cargo Vessel Route Rationalization with Chimerical Genetic Algorithm


    Beteiligte:
    Alexander Kuznetsov (Autor:in) / G.B. Popov (Autor:in)


    Erscheinungsdatum :

    2020




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Rationalization of cargo spaces

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


    CARGO VESSEL

    KOMURA ATSUSHI / INOUE YUKIYA / OHASHI TETSUYA et al. | Europäisches Patentamt | 2022

    Freier Zugriff

    CARGO VESSEL

    ARAKI MANABU / ARAKI TORU | Europäisches Patentamt | 2019

    Freier Zugriff

    An integrated vessel schedule and aggregated cargo route recovery model

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

    Freier Zugriff

    CARGO TRANSPORTING VESSEL

    PARK EO JIN / LEE CHANG WOO | Europäisches Patentamt | 2018

    Freier Zugriff