TSP genetic algorithm
Well for those who know what is that i got a question.
The algorithm is used for solving the traveling salesmen problem, by picking 2 parents routes and crossover it to create a child. My question is how they pick the parents routes because they say pick two BETTER routes, without using the brute force method how do they know which route is consider BETTER?
The algorithm is used for solving the traveling salesmen problem, by picking 2 parents routes and crossover it to create a child. My question is how they pick the parents routes because they say pick two BETTER routes, without using the brute force method how do they know which route is consider BETTER?
Are you talking about this?
http://www.lalena.com/AI/Tsp/?
I suppose brute force here. As he limited the initial amount of routes to 100 random ones, brute forcing the shortest ones isn't really a problem. Though he also said better, not best, so he might be talking about selecting a few random ones and taking the shortest of those... Though I gotta admit I didn't look into genetic algorithms here. I think the point here is just to somehow pick ones that are considered better, I don't think the algorithm relies on picking specific routes.
http://www.lalena.com/AI/Tsp/?
I suppose brute force here. As he limited the initial amount of routes to 100 random ones, brute forcing the shortest ones isn't really a problem. Though he also said better, not best, so he might be talking about selecting a few random ones and taking the shortest of those... Though I gotta admit I didn't look into genetic algorithms here. I think the point here is just to somehow pick ones that are considered better, I don't think the algorithm relies on picking specific routes.
Topic archived. No new replies allowed.