14 citations · 27 across the 4 of their papers we have counts for
4 papers
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…
A Unified Markov Chain Approach to Analysing Randomised Search Heuristics
Jun He, Feidun He, Xin Yao
The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics. This paper presents a unified Markov chain appro…
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…
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…