Skip to Main Content
A new heuristic method, yin-yang algorithm (YYA), is developed in this paper for solving the traveling salesman problem (TSP). It is based on the transformation operators of hexagrams in I Ching, one of the Chinese classic texts. Six symmetric TSP problems from TSPLIB are used to test the YYA. The results are then compared with that of genetic algorithm (GA) in section IV with the same parameters setting and same initial population. The results show that the YYA works more efficient than the GA in solving TSP problems.