| Status | 已發表Published |
| Development of a new optimization method, yin-yang algorithm, for traveling salesman problem | |
| Tam S.C.; Chio C.H.; Tam H.K. | |
| 2011-08-24 | |
| Source Publication | Proceedings 2011 International Conference on System Science and Engineering, ICSSE 2011
 |
| Pages | 245-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. © 2011 IEEE. |
| Keyword | genetic algorithm I Ching optimization method traveling salesman problem yin-yang algorithm |
| DOI | 10.1109/ICSSE.2011.5961907 |
| URL | View the original |
| Language | 英語English |
| Fulltext Access | |
| Citation statistics | |
| Document Type | Conference paper |
| Collection | University of Macau |
| Affiliation | Universidade de Macau |
| First Author Affilication | University of Macau |
| Recommended Citation GB/T 7714 | Tam S.C.,Chio C.H.,Tam H.K.. Development of a new optimization method, yin-yang algorithm, for traveling salesman problem[C], 2011, 245-250. |
| APA | Tam S.C.., Chio C.H.., & Tam H.K. (2011). Development of a new optimization method, yin-yang algorithm, for traveling salesman problem. Proceedings 2011 International Conference on System Science and Engineering, ICSSE 2011, 245-250. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment