14 citations · 27 across the 4 of their papers we have counts for
Showing cs.NEShow all
3 papers · 1 filter
cs.NE2014★ 2 cited
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem
Jun He, Feidun He, Hongbin Dong
The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions with…
cs.NE2013★ 11 cited
Mixed Strategy May Outperform Pure Strategy: An Initial Study
Jun He, Wei Hou, Hongbin Dong +1
In pure strategy meta-heuristics, only one search strategy is applied for all time. In mixed strategy meta-heuristics, each time one search strategy is chosen from a strategy pool…
cs.NE2011★ 14 cited
Pure Strategy or Mixed Strategy?
Jun He, Feidun He, Hongbin Dong
Mixed strategy EAs aim to integrate several mutation operators into a single algorithm. However few theoretical analysis has been made to answer the question whether and when the p…