Development of a new optimization method, yin-yang algorithm, for traveling salesman problem

Author

Tam, S.C. ; Chio, C.H. ; Tam, H.K.

Author_Institution

Dept. of Math., Univ. of Macau, Macao, China

fYear

2011

fDate

8-10 June 2011

Firstpage

245

Lastpage

250

Abstract

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.

Keywords

mathematical operators; travelling salesman problems; Chinese classic texts; TSPLIB; hexagrams; optimization method; six symmetric TSP problems; transformation operators; traveling salesman problem; yin-yang algorithm; Aerospace electronics; Algorithm design and analysis; Biological cells; Cities and towns; Encoding; Genetic algorithms; Traveling salesman problems; I Ching; genetic algorithm; optimization method; traveling salesman problem; yin-yang algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

System Science and Engineering (ICSSE), 2011 International Conference on

Conference_Location

Macao

Print_ISBN

978-1-61284-351-3

Electronic_ISBN

978-1-61284-472-5

Type

conf

DOI

10.1109/ICSSE.2011.5961907

Filename

5961907