Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages

Algorithm 9

Steady-state GA pseudocodes.

1 for (i = 0; i < gen-size; i++)

2 {

3  Get father and mother from population;

4  Child(s)  <-  crossover(father,mother);

5  LS may be apply on child tour(s);

6  index  <-  get_inddex();

7  population[index]  <-  child;

9 }