Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865)

From MaRDI portal
Revision as of 09:24, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving the vehicle routing problem with adaptive memory programming methodology
scientific article

    Statements

    title
    Solving the vehicle routing problem with adaptive memory programming methodology (English)
    0 references
    publication date
    21 April 2005
    0 references
    zbMATH Keywords
    Metaheuristics
    0 references
    Service operations management
    0 references
    Vehicle routing
    0 references
    describes a project that uses
    VRP
    0 references
    Tabu search
    0 references
    Scatter Search
    0 references
    HAS-QAP
    0 references
    BoneRoute
    0 references
    cites work
    Q4955264
    0 references
    Q4532228
    0 references
    Q4452897
    0 references
    Q2753185
    0 references
    Q3048611
    0 references
    Q4955265
    0 references
    Q4354785
    0 references
    Q4436879
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C59
    0 references
    90B06
    0 references
    90C27
    0 references
    zbMATH DE Number
    2160313
    0 references
    OpenAlex ID
    W2016283119
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1772865&oldid=34393903"
    Powered by MediaWiki