A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082)

From MaRDI portal
Revision as of 23:49, 24 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57185891, #quickstatements; #temporary_batch_1719269348057)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
scientific article

    Statements

    title
    A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (English)
    0 references
    author
    Zhihai Xiang
    0 references
    Chengbin Chu
    0 references
    Haoxun Chen
    0 references
    publication date
    13 September 2006
    0 references
    zbMATH Keywords
    transportation
    0 references
    vehicle routing problem
    0 references
    dial-a-ride problem
    0 references
    heuristics
    0 references
    describes a project that uses
    VRP
    0 references
    Tabu search
    0 references
    cites work
    Q4532231
    0 references
    Q4354785
    0 references
    Q4079017
    0 references
    Q4365135
    0 references
    Q2751577
    0 references

    Identifiers

    zbMATH DE Number
    5053933
    0 references
    OpenAlex ID
    W2031102078
    0 references
    Wikidata QID
    Q57185891
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2503082&oldid=34896687"
    Powered by MediaWiki