The previous chapter presented a branch-and-bound algorithm for producing an exact solution to TSP. Like all known exact solutions, it is computationally intractable.
This chapter presents the powerful simulated annealing heuristic solution to the TSP.
In the next section, we introduce combinatorial optimization problems and set the stage for our presentation of heuristic algorithms for solving TSP.
19.1 Combinatorial Optimization
Combinatorial optimization problems are ...