Research Article
Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages
Algorithm 8
Generational GA pseudocodes.
1 while (some conditions are satisfied) | 2 { | 3 for (i = 0; i < gen-size; i++) | 4 { | 5 Get father and mother from population; | 6 Child(s) <- crossover(father, mother); | 7 LS may be apply on child tour(s); | 8 Add child to population; | 9 } | 10 Normalized population size by removing some solutions; | 11 } |
|