Heuristic Routing Algorithms is a class of approximate problem-solving methods in route planning that employ practical strategies to efficiently find near-optimal paths without guaranteeing optimality, distinguishing it from exact algorithms by prioritizing computational efficiency over exhaustive search.
1.3K
Publications
78K
Citations
2.9K
Authors
1.1K
Institutions
Publications per year
2017–2026
382
Parents
Publications
1.3K
1–5 of 1.3K
Authors
2.9K
- GL
23
h-index
- ÁA
17
h-index
- MG
15
h-index
- YM
13
h-index
- BG
12
h-index
1–5 of 2.9K
Institutions
1.1K
HEC Montréal
Montreal, Canada
28 h-index
42 publications
5.8K citations
Université de Montréal
Montreal, Canada
24 h-index
52 publications
14K citations
Centre National de la Recherche Scientifique
Paris, France
20 h-index
62 publications
4.6K citations
University of Maryland, College Park
College Park, United States
19 h-index
41 publications
2.4K citations
Polytechnique Montréal
Montreal, Canada
17 h-index
33 publications
2.1K citations
Universitat Oberta de Catalunya
Barcelona, Spain
16 h-index
48 publications
1.7K citations
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
27 publications
2.7K citations
University of Bologna
Bologna, Italy
15 h-index
23 publications
2.9K citations
1–8 of 1.1K
Venues
- Computers & Operations Research
63 publications · 8.1K citations
43
h-index
- European Journal of Operational Research
56 publications · 6.1K citations
40
h-index
- Transportation Science
41 publications · 8.1K citations
32
h-index
- Journal of the Operational Research Society
OR · 35 publications · 2.9K citations
26
h-index
- Networks
28 publications · 3.1K citations
20
h-index
1–5