Time-dependent Shortest Paths

Time-Dependent Shortest Paths is a shortest path problem variant in which the travel time along each edge of a graph varies as a function of the departure time, thereby requiring the determination of an optimal source-to-destination route that accounts for time-varying edge weights.

203

Publications

16.7K

Citations

495

Authors

239

Institutions

Publications per year

2017–2026

60

Variants

Time-dependent Shortest Path Problem

Authors

495

  1. TV
    Tom Van Woensel

    Eindhoven University of Technology, Netherlands

    8 publications · 1.1K citations

    8

    h-index

  2. HS
    Hani S. Mahmassani

    Northwestern University, United States

    7 publications · 485 citations

    7

    h-index

  3. XZ
    Xuesong Zhou

    Arizona State University, United States

    5 publications · 229 citations

    5

    h-index

  4. WH
    William H. K. Lam

    Hong Kong Polytechnic University, Hong Kong SAR China

    4 publications · 252 citations

    4

    h-index

  5. WH
    Wei Huang

    Tianjin University of Technology, China

    4 publications · 120 citations

    4

    h-index

1–5 of 495

Venues

  1. European Journal of Operational Research

    16 publications · 1.2K citations

    15

    h-index

  2. Computers & Operations Research

    11 publications · 1.1K citations

    11

    h-index

  3. Transportation Research Part B Methodological

    11 publications · 1.5K citations

    11

    h-index

  4. 9

    h-index

  5. 9

    h-index

1–5