Vehicle Routing Problems
Vehicle Routing Problems is a combinatorial optimization problem that involves determining optimal routes for a fleet of vehicles to serve a set of customers with known demands and locations, subject to constraints such as vehicle capacity and time windows, in order to minimize total transportation costs within a network.
4.1K
Publications
315.3K
Citations
7K
Authors
2K
Institutions
Publications per year
2017–2026
1.7K
Variants
Vrp
4.1K
1–5 of 4.1K
7K
55
h-index
50
h-index
35
h-index
Athens University of Economics and Business, Greece
36 publications · 2.8K citations
31
h-index
31
h-index
1–5 of 7K
2K
HEC Montréal
Montreal, Canada
70 h-index
142 publications
25.6K citations
Université de Montréal
Montreal, Canada
67 h-index
172 publications
38.1K citations

Polytechnique Montréal
Montreal, Canada
53 h-index
158 publications
15K citations

University of Bologna
Bologna, Italy
49 h-index
117 publications
18.2K citations

Centre National de la Recherche Scientifique
Paris, France
47 h-index
188 publications
15.2K citations
Université du Québec à Montréal
Montreal, Canada
44 h-index
78 publications
10.1K citations
University of Maryland, College Park
College Park, United States
44 h-index
107 publications
15.4K citations
Group for Research in Decision Analysis
Montreal, Canada
40 h-index
107 publications
12.9K citations
1–8 of 2K
242 publications · 31.1K citations
101
h-index
272 publications · 32.8K citations
100
h-index
201 publications · 30.2K citations
89
h-index
128 publications · 9.1K citations
58
h-index
104 publications · 8.6K citations
54
h-index
1–5