The traveling salesman problem (TSP) is a classic combinatorial optimization problem. Although it can be easily formulated, it exhibits various interesting aspects of hard computational problems and has often served as a touchstone for novel approaches. Moreover, TSP has various applications, such as Vehicle Routing Problem (VRP), VLSI design, rearrangement clustering, and predicting protein functions, etc.