D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099)

From MaRDI portal
Revision as of 10:39, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
scientific article

    Statements

    title
    D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (English)
    0 references
    author
    Marc Reimann
    0 references
    Karl F. Doerner
    0 references
    Richard F. Hartl
    0 references
    publication date
    14 March 2004
    0 references
    zbMATH Keywords
    Meta-heuristics
    0 references
    Ant System
    0 references
    ACO
    0 references
    Decomposition
    0 references
    Vehicle Routing Problem
    0 references
    describes a project that uses
    VRP
    0 references
    Tabu search
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B20
    0 references
    49M27
    0 references
    90C59
    0 references
    zbMATH DE Number
    2055443
    0 references
    Wikidata QID
    Q59389804
    0 references
    OpenAlex ID
    W2029970827
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1427099&oldid=37319235"
    Powered by MediaWiki