An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.


    Access

    Download


    Export, share and cite



    Title :

    AN ALGORITHM FOR GARBAGE TRUCK ROUTING IN CITIES WITH A FIXATION ON CONTAINER FILLING LEVEL


    Contributors:


    Publication date :

    2023




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    GARBAGE TRUCK

    NAKAKURA AKIO / YAMAUCHI MASATERU / MAEKAWA WATARU | European Patent Office | 2021

    Free access

    GARBAGE TRUCK

    FUKUHARA KENTARO | European Patent Office | 2022

    Free access

    GARBAGE TRUCK

    TOKUYAMA NOBUYUKI / HIROTSU TOMOHITO / MAKIHATA KOICHI et al. | European Patent Office | 2023

    Free access

    ELECTRIC GARBAGE TRUCK

    TSUKADA SHINYA / ONISHI RYOHEI / SEKI SHUJI | European Patent Office | 2016

    Free access