Heuristic Search
Heuristic Search is a problem-solving strategy in artificial intelligence and path planning that belongs to the class of search algorithms which use domain-specific knowledge to guide the search process, distinguished by its employment of a heuristic function to estimate the cost to reach the goal, thereby prioritizing paths that are likely to lead to an optimal or near-optimal solution more efficiently than uninformed methods.
14.3K
Publications
954K
Citations
27.2K
Authors
4.6K
Institutions
Publications per year
2017–2026
5K
14.3K
D. E. Goldberg · Medical Entomology and Zoology · 1989 · 10.1K citations
A New Heuristic Optimization Algorithm: Harmony Search
Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan · SIMULATION · 2001 · 6.2K citations
1–5 of 14.3K
27.2K
43
h-index
42
h-index
39
h-index
37
h-index
34
h-index
1–5 of 27.2K
4.6K
Carnegie Mellon University
Pittsburgh, United States
63 h-index
342 publications
32.7K citations
Université de Montréal
Montreal, Canada
59 h-index
144 publications
31.4K citations

Centre National de la Recherche Scientifique
Paris, France
53 h-index
326 publications
25.5K citations
HEC Montréal
Montreal, Canada
51 h-index
109 publications
17.7K citations

University of Nottingham
Nottingham, United Kingdom
51 h-index
292 publications
23.4K citations
Nanyang Technological University
Singapore, Singapore
46 h-index
213 publications
14.4K citations
Massachusetts Institute of Technology
Cambridge, United States
44 h-index
160 publications
23.7K citations
Tsinghua University
Beijing, China
43 h-index
209 publications
13.1K citations
1–8 of 4.6K
302 publications · 36K citations
102
h-index
283 publications · 23.6K citations
85
h-index
170 publications · 12.2K citations
62
h-index
294 publications · 13.7K citations
62
h-index
162 publications · 11.8K citations
62
h-index
1–5