Accepted:
----
| |
/vol02/sr_hash/ | © Copyright 1995 | |||
| Volume 02 | Received: Accepted: |
---- ---- |
|||
|
Preventing Diversity Loss in a Routing Genetic Algorithm with Hash Tagging
Simon Ronald |
|
| Abstract | |
| A new technique called hash tagging is presented, which helps preserve genetic diversity in routing-type genetic algorithms (GAs). For each new child generated in a population, a hash tag is calculated by applying a hash algorithm to each gene value in the genotype during a GA run. We do not allow a genotype to be added to a population if its hash tag clashes with an existing hash tag in use by another population genotype. This technique prevents duplicate population genotypes and enhances the performance of the GA in the later stages of evolution. We show that the technique introduces a powerful local-searching mechanism in the later parts of an evolution run. We present simulation results showing that hash tagging is effective for our chosen test problem (a 30-town Travelling Salesperson Problem). | |
| Full Text |
|
|
Multimedia Links (none) Reference Links (none) Citation Reference |
Get viewers for PS & PDF   |
