Highlights ► We solved a large-scale VRPTW based on spatiotemporal clustering on customers. ► We proposed a metric for characterizing spatiotemporal distance between customers. ► The method proposed has the potential to handle large-scale VRTPW.

    Abstract For VRP with time windows (VRPTW) solved by conventional cluster-first and route-second approach, temporal information is usually considered with vehicle routing but ignored in the process of clustering. We propose an alternative approach based on spatiotemporal partitioning to solving a large-scale VRPTW, considering jointly the temporal and spatial information for vehicle routing. A spatiotemporal representation for the VRPTW is presented that measures the spatiotemporal distance between two customers. The resulting formulation is then solved by a genetic algorithm developed for k-medoid clustering of large-scale customers based on the spatiotemporal distance. The proposed approach showed promise in handling large scale networks.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows


    Beteiligte:
    Qi, Mingyao (Autor:in) / Lin, Wei-Hua (Autor:in) / Li, Nan (Autor:in) / Miao, Lixin (Autor:in)


    Erscheinungsdatum :

    2011-05-15


    Format / Umfang :

    10 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Self-imposed time windows in vehicle routing problems

    JABALI, OLA / Leus, Roel / van Woensel, Tom et al. | BASE | 2015

    Freier Zugriff

    Hierarchical reinforcement learning for vehicle routing problems with time windows

    Wang, Yunli / Sun, Sun / Li, Wei | BASE | 2021

    Freier Zugriff