no code implementations • 3 Apr 2014 • Jun He, Feidun He, Hongbin Dong
On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly.
no code implementations • 9 Dec 2013 • Jun He, Feidun He, Xin Yao
The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics.
no code implementations • 13 Mar 2013 • Jun He, Wei Hou, Hongbin Dong, Feidun He
In mixed strategy meta-heuristics, each time one search strategy is chosen from a strategy pool with a probability and then is applied.
no code implementations • 7 Dec 2011 • Jun He, Feidun He, Hongbin Dong
Mixed strategy EAs aim to integrate several mutation operators into a single algorithm.