The Hamming metric in genetic algorithms and its application to two network problems
William G. Frederick, Robert L. Sedlmeyer, Curt M. White · 1993
Lkng the Hamming metric to compute distances between chromosomes values as bits, we introduce two real-valued measures in genetic algorithms.These measurq gestetk drift and chtstering, give insight into the behavioral effects of mutation convergence and mating (using simple crossover) during generation cycles.The genetic driti and cltsstsring messttres will then be appfied to two cmtmton computes network problems: the optimaf placement of a multi-station access unit (Steiner Point variation problem) ad path loss (edge integrity of a graph).hstroduction and Definitions