The traveling salesman problem (TSP) is a constrained problem: a candidate solution must visit each city exactly once to be considered a valid tour. Crossover operators for the path representation of TSP individuals are discussed in Section 18.3.1. Which of these operators preserve the TSP constraint, and which ones do not?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here