The Cost of Randomness in Evolutionary Algorithms: Crossover Can Save Random Bits.

Abstract excerpt

Evolutionary algorithms make countless random decisions during selection, mutation, and crossover operations. These random decisions require a steady stream of random numbers. We analyze the expected number of random bits used throughout a run of an evolutionary algorithm and refer to this as the cost of randomness. We give general bounds on the cost of randomness for mutation-based evolutionary algorithms using...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Computer Simulation
• Share to Algorithms
• Share to Biological Evolution