Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case (Q4305483)

From MaRDI portal
Revision as of 17:48, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 638582
Language Label Description Also known as
English
Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case
scientific article; zbMATH DE number 638582

    Statements

    Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case (English)
    0 references
    0 references
    0 references
    13 September 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    exchange heuristics
    0 references
    vehicle routing
    0 references
    time window constraints
    0 references
    0 references
    0 references