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

Authors

27.2K

  1. GL
    Gilbert Laporte

    HEC Montréal, Canada

    60 publications · 8.8K citations

    43

    h-index

  2. MG
    Michel Gendreau

    Université de Montréal, Canada

    49 publications · 12.5K citations

    42

    h-index

  3. SK
    Sven Koenig

    University of Southern California, United States

    76 publications · 5.3K citations

    39

    h-index

  4. EB
    Edmund Burke

    University of Nottingham, United Kingdom

    62 publications · 6.2K citations

    37

    h-index

  5. SM
    Seyedali Mirjalili

    Torrens University Australia, Australia

    46 publications · 14.7K citations

    34

    h-index

1–5 of 27.2K

Venues

  1. European Journal of Operational Research

    302 publications · 36K citations

    102

    h-index

  2. Computers & Operations Research

    283 publications · 23.6K citations

    85

    h-index

  3. Applied Soft Computing

    170 publications · 12.2K citations

    62

    h-index

  4. IEEE Access

    294 publications · 13.7K citations

    62

    h-index

  5. Expert Systems with Applications

    162 publications · 11.8K citations

    62

    h-index

1–5