Traveling Salesman Problem
摘要
A problem is the frame into which the solutions fall. The design of a search system to solve an optimization problem and study of the related search behavior are based on how the problem is defined. This chapter defines the TSP and describes different solution representations. The role of the edge matrix E in solving the TSP is explained in detail. Computational complexity of the TSP is reviewed from a different perspective, and the concept of search space reduction is raised.