Chaotic Clonal Genetic Algorithm for Routing Optimization

摘要: Clonal operator which can reserve the elites is introduced in selection step of traditional genetic algorithm (GA) to accelerate local convergence speed. Chaotic search randomness and ergodicity applied crossover mutation operators avoid stopping at a extreme value. The above hybrid GA called chaotic clonal (CCGA) overcome instability optimizing processes results by certainty trajectory. CCGA solve problem load balance routing differentiated service networks. optimization model created objective small path length. simulation show that has fast speed high stability. It meet requirements important business routings.