2012/04/11 by Sing Liew, Liew, Sing
Computer Science · #FOS: Computer and information sciences #Other Computer Science (cs.OH) #cs.OH
paper · pdf · doi:10.48550/arxiv.1204.2352
arxiv created 2012/04/11 · arxiv updated 2012/04/12
In this paper, the author proposes optimal tree as a "gauge" for the generation of the initial population at random in the Genetic Algorithms (GA) to benchmark against the good and the bad parent tours. Thus, without having the so-called bad parent tours in the initiate population, it will speed up the GA. The characteristics of the gauge (algorithm, complexity time, trade-off, etc.) will be discussed in this paper as well.