Search Results for author:
Found 4 papers, 0 papers with code
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem
On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly.
A Unified Markov Chain Approach to Analysing Randomised Search Heuristics
The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics.
Mixed Strategy May Outperform Pure Strategy: An Initial Study
In mixed strategy meta-heuristics, each time one search strategy is chosen from a strategy pool with a probability and then is applied.
Pure Strategy or Mixed Strategy?
Mixed strategy EAs aim to integrate several mutation operators into a single algorithm.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
