Schedule synchronization for public transit networks (Q1111918)

From MaRDI portal
Revision as of 08:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Schedule synchronization for public transit networks
scientific article

    Statements

    Schedule synchronization for public transit networks (English)
    0 references
    0 references
    1989
    0 references
    The problem of minimizing waiting times of passengers who want to change communication routes at transfer stations is considered. The paper contains heuristics (regret-methods, improvement algorithms, simulated annealing) as well as a branch-and-bound algorithm and provides computational results, some of them gained with practical data.
    0 references
    waiting times of passengers
    0 references
    communication routes
    0 references
    transfer stations
    0 references
    heuristics
    0 references
    regret-methods
    0 references
    improvement algorithms
    0 references
    simulated annealing
    0 references
    branch-and-bound
    0 references
    0 references

    Identifiers