An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841)

From MaRDI portal
Revision as of 09:12, 10 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
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
scientific article

    Statements

    title
    An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (English)
    0 references
    author
    Toshihide Ibaraki
    0 references
    Shinji Imahori
    0 references
    Koji Nonobe
    0 references
    Kensuke Sobue
    0 references
    Takeaki Uno
    0 references
    Mutsunori Yagiura
    0 references
    publication date
    10 September 2008
    0 references
    zbMATH Keywords
    vehicle routing problem with time windows
    0 references
    metaheuristics
    0 references
    dynamic programming
    0 references
    cites work
    Q4198056
    0 references
    Q4354785
    0 references
    Q4038710
    0 references
    Q4365133
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B40
    0 references
    90B06
    0 references
    90B20
    0 references
    zbMATH DE Number
    5324123
    0 references
    OpenAlex ID
    W2020270411
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q943841&oldid=38544458"
    Powered by MediaWiki