By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tam, S.C. ; Dept. of Math., Univ. of Macau, Macao, China ; Chio, C.H. ; Tam, H.K.

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.

Published in:

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

Date of Conference:

8-10 June 2011