Trip-based path algorithms using the transit network hierarchy (Q298925)

From MaRDI portal
Revision as of 04:33, 12 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
Trip-based path algorithms using the transit network hierarchy
scientific article

    Statements

    Trip-based path algorithms using the transit network hierarchy (English)
    0 references
    0 references
    0 references
    21 June 2016
    0 references
    public transit modeling
    0 references
    network hierarchy
    0 references
    schedule-based transit network
    0 references
    shortest path
    0 references
    hyperpath
    0 references
    transit \(\mathrm A^*\)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references