Local Search
Local search is an iterative optimization algorithm that belongs to the class of heuristic methods, distinguished by its strategy of improving a candidate solution through localized modifications by exploring its neighborhood in the solution space.
6.2K
Publications
346.2K
Citations
13.4K
Authors
3.2K
Institutions
Publications per year
2017–2026
2K
6.2K
Evolutionary programming made faster
Xin Yao, Yong Liu, Guangming Lin · IEEE Transactions on Evolutionary Computation · 1999 · 3.9K citations
1–5 of 6.2K
13.4K
27
h-index
26
h-index
25
h-index
24
h-index
Nanyang Technological University, Singapore
25 publications · 2.8K citations
23
h-index
1–5 of 13.4K
3.2K
Tsinghua University
Beijing, China
38 h-index
174 publications
11.1K citations
Nanyang Technological University
Singapore, Singapore
37 h-index
154 publications
13.8K citations

Huazhong University of Science and Technology
Wuhan, China
37 h-index
216 publications
9.5K citations

Centre National de la Recherche Scientifique
Paris, France
33 h-index
163 publications
6.1K citations

University of Nottingham
Nottingham, United Kingdom
32 h-index
111 publications
6.9K citations

Xidian University
Xi'an, China
30 h-index
232 publications
9K citations
Liaocheng University
Liaocheng, China
30 h-index
95 publications
6.1K citations

Northeastern University
Shenyang, China
29 h-index
139 publications
7.3K citations
1–8 of 3.2K
107 publications · 10.7K citations
52
h-index
84 publications · 26.6K citations
51
h-index
121 publications · 5.5K citations
45
h-index
141 publications · 5.5K citations
44
h-index
98 publications · 5.2K citations
40
h-index
1–5