A set covering approach for multi-depot train driver scheduling (Q2343986)

From MaRDI portal
Revision as of 02:21, 10 July 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
A set covering approach for multi-depot train driver scheduling
scientific article

    Statements

    title
    A set covering approach for multi-depot train driver scheduling (English)
    0 references
    author
    Masoud Yaghini
    0 references
    Mohammad Karimi
    0 references
    Mohadeseh Rahbar
    0 references
    publication date
    11 May 2015
    0 references
    zbMATH Keywords
    set covering problem
    0 references
    LP-based neighborhoods
    0 references
    matheuristic
    0 references
    tabu search
    0 references
    design of experiment
    0 references
    train drive scheduling
    0 references
    Iranian railways
    0 references
    cites work
    Q3500142
    0 references
    Local branching
    0 references
    Q4198056
    0 references
    Tabu Search—Part I
    0 references
    Tabu Search—Part II
    0 references
    Q4354785
    0 references
    Q4247468
    0 references
    Q2731676
    0 references
    Q2759914
    0 references
    Q4889096
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C59
    0 references
    90B35
    0 references
    zbMATH DE Number
    6435134
    0 references
    OpenAlex ID
    W2075750279
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2343986&oldid=35454170"
    Powered by MediaWiki