A synergetic approach to genetic algorithms for solving traveling salesman problem
This paper looks upon the standard genetic algorithm (GA) as an artificial self-organizing process. The authors study in detail some typical self-organizing behaviors exhibited in GAs for solving a traveling salesman problem (TSP). These behaviors include the exponential relationship, entropy jumping phenomenon, assimilation and entropy synchronization. Finally, the authors propose to use doping as the measure to prevent the premature convergence in design of the GAs.
genetic algorithms traveling salesman problem self-organization optimization