Heuristic Algorithms
Heuristic Algorithms is a problem-solving methodology in combinatorial optimization that employs practical, experience-based techniques to generate sufficiently good solutions to computationally complex scheduling problems, such as those in open shop environments, where exact optimal solutions are intractable to obtain within feasible time.
10.7K
Publications
649.3K
Citations
22.5K
Authors
4.2K
Institutions
Publications per year
2017–2026
3.4K
Variants
Heuristic Algorithm
Parents
10.7K
A New Heuristic Optimization Algorithm: Harmony Search
Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan · SIMULATION · 2001 · 6.2K citations
Fred Glover · INFORMS Journal on Computing · 1989 · 5K citations
1–5 of 10.7K
22.5K
36
h-index
32
h-index
31
h-index
27
h-index
26
h-index
1–5 of 22.5K
4.2K
Tsinghua University
Beijing, China
58 h-index
402 publications
24.6K citations

Huazhong University of Science and Technology
Wuhan, China
55 h-index
379 publications
24K citations
Liaocheng University
Liaocheng, China
47 h-index
143 publications
12.5K citations

Centre National de la Recherche Scientifique
Paris, France
46 h-index
284 publications
13K citations
Nanyang Technological University
Singapore, Singapore
44 h-index
169 publications
10.7K citations

University of Nottingham
Nottingham, United Kingdom
41 h-index
182 publications
11.7K citations

University of Bologna
Bologna, Italy
39 h-index
135 publications
15.6K citations

University of Tehran
Tehran, Iran
38 h-index
156 publications
7.2K citations
1–8 of 4.2K
281 publications · 33.2K citations
97
h-index
265 publications · 20.6K citations
79
h-index
391 publications · 19.7K citations
74
h-index
169 publications · 10.7K citations
58
h-index
85 publications · 20.7K citations
53
h-index
1–5