We show that the Differential Evolution algorithm lacks sufficient selective pressure when appointing parent and donor vectors to have satisfactory exploitative power on non-separable functions.Expand

We show that a simple genetic algorithm called the compact genetic algorithm can overcome the shortsightedness of mutation-only heuristics to scale gracefully with noise.Expand

Population-based methods are often considered superior on multimodal functions because they tend to explore more of the fitness landscape before they converge.Expand

We show that given a k-bounded pseudo-Boolean function f, one can always compute the cth moment of f over regions of arbitrary radius in Hamming space in polynomial time using algebraic information from the adjacency structure (where k and c are constants).Expand

In this paper efficient methods areintroduced to locate improving moves in the r-ball neighborhood for problems that can be written as a sum of a linear number of subfunctions depending on a bounded number of variables.Expand

The autocorrelation function and related correlation length are statistical quantities that capture the ruggedness of the fitness landscape: a measure that is directly related to the hardness of a problem for certain heuristic search algorithms.Expand

We present a methodology for quantifying the robustness of resource allocations in a dynamic environment where task execution times are stochastic.Expand

Particle Swarm Optimization is a population-based optimization method in which search points employ a cooperative strategy to move toward one another.Expand