CASIA OpenIR  > 09年以前成果
Neurodynamic programming: a case study of the traveling salesman problem
Ma, Jia1; Yang, Tao1; Hou, Zeng-Guang1; Tan, Min1; Liu, Derong2
Source PublicationNEURAL COMPUTING & APPLICATIONS
2008-08-01
Volume17Issue:4Pages:347-355
SubtypeArticle
AbstractThe paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal difference learning and approximate Sarsa, are presented in detail. In essence, both of them try to learn an appropriate evaluation function on the basis of a finite amount of experience. To evaluate their performances, some computational experiments on both the Euclidean and asymmetric TSP instances are conducted. In contrast with the large size of the state space, only a few training sets have been used to obtain the initial results. Hence, the results are acceptable and encouraging in comparisons with some classical algorithms, and further study of this kind of methods, as well as applications in combinatorial optimization problems, is worth investigating.
KeywordNeurodynamic Programming Temporal Difference Learning Approximate Sarsa Traveling Salesman Problem
WOS HeadingsScience & Technology ; Technology
WOS KeywordALGORITHM ; SEARCH ; NET
Indexed BySCI ; ISTP
Language英语
WOS Research AreaComputer Science
WOS SubjectComputer Science, Artificial Intelligence
WOS IDWOS:000257124100004
Citation statistics
Document Type期刊论文
Identifierhttp://ir.ia.ac.cn/handle/173211/9557
Collection09年以前成果
Affiliation1.Chinese Acad Sci, Inst Automat, Key Lab Complex Syst & Intelligence Sci, Beijing 100080, Peoples R China
2.Univ Illinois, Dept Elect & Comp Engn, Chicago, IL 60607 USA
Recommended Citation
GB/T 7714
Ma, Jia,Yang, Tao,Hou, Zeng-Guang,et al. Neurodynamic programming: a case study of the traveling salesman problem[J]. NEURAL COMPUTING & APPLICATIONS,2008,17(4):347-355.
APA Ma, Jia,Yang, Tao,Hou, Zeng-Guang,Tan, Min,&Liu, Derong.(2008).Neurodynamic programming: a case study of the traveling salesman problem.NEURAL COMPUTING & APPLICATIONS,17(4),347-355.
MLA Ma, Jia,et al."Neurodynamic programming: a case study of the traveling salesman problem".NEURAL COMPUTING & APPLICATIONS 17.4(2008):347-355.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ma, Jia]'s Articles
[Yang, Tao]'s Articles
[Hou, Zeng-Guang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ma, Jia]'s Articles
[Yang, Tao]'s Articles
[Hou, Zeng-Guang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ma, Jia]'s Articles
[Yang, Tao]'s Articles
[Hou, Zeng-Guang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.