A genetic solution for the traveling salesman problem by means of a thermodynamical selection rule

For successful applications of the genetic algorithm, there are two important points to be considered. The first point is the design of the fitness landscape introduced by the representation of the solution as a gene and searching operations such as crossover and mutation. The second is control of the convergence brought about by the selection operation. In the conventional implementation of GA, these two points are mutually dependent, i.e., a suitable selection pressure varies largely depending on, e.g., the crossover operator. Hence, it requires much trial-and-error effort to find a nice configuration of GA. The authors apply a novel selection rule, the Thermodynamical Genetic Algorithm (TDGA) proposed by N. Mori et al. (1995) to the traveling salesman problem (TSP), and propose an adaptive annealing schedule of the temperature in TDGA. Computer simulation with several crossover operators for TSP shows that TDGA reduces the mutual dependency between the fitness landscape and the convergence process