A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077)

From MaRDI portal
Revision as of 09:00, 17 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 memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
scientific article

    Statements

    title
    A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (English)
    0 references
    author
    José Brandão
    0 references
    publication date
    7 May 2020
    0 references
    zbMATH Keywords
    transportation
    0 references
    iterated local search
    0 references
    memory
    0 references
    multi-depot
    0 references
    vehicle routing
    0 references
    describes a project that uses
    Tabu search
    0 references
    VRP
    0 references
    cites work
    Q3048611
    0 references
    Q4354785
    0 references
    Q4955265
    0 references
    Q4452900
    0 references
    Q3693257
    0 references

    Identifiers

    zbMATH DE Number
    7197913
    0 references
    OpenAlex ID
    W2999840680
    0 references
    Wikidata QID
    Q126360670
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2178077&oldid=38925253"
    Powered by MediaWiki