Dial-a-ride Problem

The Dial-A-Ride Problem is a combinatorial optimization problem in transportation logistics that involves designing minimum-cost routes and schedules for a fleet of vehicles to transport users between specified origins and destinations, subject to constraints such as time windows, vehicle capacity, and maximum ride time, thereby distinguishing it from general vehicle routing problems by incorporating both user convenience and service quality criteria.

199

Publications

16.6K

Citations

393

Authors

236

Institutions

Publications per year

2017–2026

60

Variants

Darp

Authors

393

  1. GL
    Gilbert Laporte

    HEC Montréal, Canada

    11 publications · 2.9K citations

    11

    h-index

  2. JC
    Jean‐François Cordeau

    HEC Montréal, Canada

    10 publications · 3.1K citations

    10

    h-index

  3. KB
    Kris Braekers

    Hasselt University, Belgium

    8 publications · 854 citations

    8

    h-index

  4. SN
    Sophie N. Parragh

    University of Vienna, Austria

    6 publications · 793 citations

    6

    h-index

  5. RF
    Richard F. Hartl

    University of Vienna, Austria

    6 publications · 761 citations

    6

    h-index

1–5 of 393

Venues

  1. Transportation Research Part B Methodological

    16 publications · 3.1K citations

    16

    h-index

  2. Computers & Operations Research

    13 publications · 1.2K citations

    14

    h-index

  3. Transportation Science

    13 publications · 2.1K citations

    13

    h-index

  4. European Journal of Operational Research

    11 publications · 927 citations

    11

    h-index

  5. 10

    h-index

1–5