A new heuristic method, algorithm of changes (AOC), is proposed in this thesis for solving the traveling salesman problem (TSP). It is based on the transformation operators of hexagrams in I Ching - one of the chinese classic text. Six symmetric TSP problems from TSPLIB are used to test the AOC. The results are then compared with genetic algorithm (GA) in chapter 6 with the same parameters setting and same initial population. The results show that the AOC works more efficiently than GA in solving TSP.