Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP)

Details Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP) Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP)

2012-04-11

arxiv.org/abs/1204.2352v1

Computer Science

Other Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716886