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
Parents
199
1–5 of 199
393
11
h-index
10
h-index
8
h-index
6
h-index
6
h-index
1–5 of 393
236
HEC Montréal
Montreal, Canada
15 h-index
31 publications
7.8K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
33 publications
1.7K citations
University of Vienna
Vienna, Austria
9 h-index
19 publications
2.5K citations
Research Foundation - Flanders
Brussels, Belgium
8 h-index
14 publications
1.3K citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
14 publications
3.3K citations

Hasselt University
Hasselt, Belgium
8 h-index
19 publications
2.1K citations
Vienna University of Economics and Business
Vienna, Austria
6 h-index
13 publications
1.7K citations
University of Maryland, College Park
College Park, United States
6 h-index
13 publications
454 citations
1–8 of 236
16 publications · 3.1K citations
16
h-index
13 publications · 1.2K citations
14
h-index
13 publications · 2.1K citations
13
h-index
11 publications · 927 citations
11
h-index
9 publications · 734 citations
10
h-index
1–5