A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain (Q1637720)

From MaRDI portal
Revision as of 00:12, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
scientific article

    Statements

    A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2018
    0 references
    vehicle routing problem with hard time windows
    0 references
    \(K\)-means clustering algorithm
    0 references
    \(K\)-medoids clustering algorithm
    0 references
    DBSCAN clustering algorithm
    0 references
    cluster first route second approach
    0 references
    0 references
    0 references

    Identifiers