| 查看: 517 | 回复: 1 | ||
[求助]
请问这篇文章检索没？ 已有1人参与
|
|
PLS help！ title：The Performance Research on Solving TSP by Four Typical AI Algorithms Journal: <BioTechnology: An Indian Journal> Author: Zhengqiang JIANG,…… 谢谢！ |
回复此楼» 猜你喜欢
售SCI-T0P文章，我:8O.5.5.1.O.54,科目齐全,可+急
已经有7人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有8人回复
-
售SCI一区T0P文章，我:8.O55.1.O.54,科目全,可十急
已经有15人回复
-
有多少人是今天查系统知道结果的？
已经有19人回复
-
国社科又开始会评了，不知道这次命运如何
已经有9人回复
-
能否申诉？
已经有5人回复
-
为什么到现在没收到通知？
已经有5人回复
-
有没有仍没收到信息的
已经有8人回复
-
售SCI一区文章，我:8O5.5.1.O5.4,科目全,可伽急
已经有5人回复
-
售SCI一区文章，我:8O5.5.1.O5.4,科目全,可伽急
已经有4人回复
» 本主题相关价值贴推荐，对您同样有帮助:
- 请同仁帮忙验证以下论文是否被Web of science （SCI）检索
已经有10人回复
- AMM 530-531 大约什么时候可以检索啊？
已经有48人回复
- 谁帮忙检索这篇论文是否SCI，web of science的检索信息，万分感谢。
已经有5人回复
- 请问mathematical problems in engineering 2014年的文章sci检索了吗
已经有12人回复
- 请帮忙列示这篇文章的详细检索信息！！谢谢，在线等！！！
已经有12人回复
- 请教一下，我的文章被cscd扩展库《计算机仿真》录用，这篇文章可以开出检索证明吗？
已经有7人回复
- sci与pubmed检索的区别是什么？
已经有19人回复
- 知网上优先出版的论文可以开检索证明吗？急急急急急急。在线等啊。。。
已经有8人回复
- 帮我看下这篇文章是不是SCI，如何判断是不是SCI？
已经有7人回复
- 这个论文能被SCI检索吗，请问Erratum算不算新的论文
已经有19人回复
- 检索报告的单位顺序弄反了，怎么办？
已经有10人回复
- 哪位帮我查一下这篇文章现在能被web of science出sci检索报告吗？（金币为谢）
已经有15人回复
- 文章有页码但在ISI上检索不到
已经有3人回复
- 如何根据基金号,查找已经发表的文章？
已经有5人回复
- 请问如何获知某篇文章的SCI号或EI号？哪里能查到呢？
已经有10人回复
- 请哪位大侠帮忙查一篇文章是否被ISTP检索
已经有5人回复
【答案】应助回帖
★ ★ ★ ★ ★
injt19891011(杈杈代发): 金币+5, Thanks very much！ 2014-04-26 20:09:18
injt19891011(杈杈代发): 金币+5, Thanks very much！ 2014-04-26 20:09:18
|
Accession number: 20141317528604 Title: The performance research on solving TSP by four typical AI algorithms Authors: Wu, Yue1 Email author wuyuenet@wo.com.cn; Jiang, Zheng-Qiang1 Email author injt19891011@126.com Author affiliation: 1 School of Logistics, Beijing Wuzi University, Beijing 101149, China Source title: BioTechnology: An Indian Journal Abbreviated source title: Biotechnol. An Indian J. Volume: 8 Issue: 9 Issue date: 2013 Publication year: 2013 Pages: 1234-1239 Language: English ISSN: 09747435 Document type: Journal article (JA) Publisher: Trade Science Inc Abstract: Travelling Salesmen Problem (VRP) has an important theoretical value and practical significance in mathematical and logistics field. It's a typical NPHard problem, and artificial intelligent (AI) Algorithm has been already proven to be a very effect way in solving this problem. This paper carried out the performance research on solving TSP by four typical AI algorithms after in-depth analyzed the TSP and these four algorithms (genetic algorithm, particle swarm optimization algorithm, simulated annealing algorithm and ant colony algorithm). This paper verified the TSP solving performance by China travelling salesmen problem experiments and MATLAB programming. The results showed that: considering the average iteration time, SA < PSO< ACA <GA; considering the optimal route length, GA<ACA<SA<PSO; and considering the iterative time to obtain optimal route, SA<ACA<PSO<GA. © 2013 Trade Science Inc. - INDIA. Number of references: 12 Main heading: Problem solving Controlled terms: Genetic algorithms - Iterative methods - Particle swarm optimization (PSO) Uncontrolled terms: AI algorithms - Ant colony algorithms - Artificial intelligent - Particle swarm optimization algorithm - Performance research - Simulated annealing algorithms - Solving performance - Travelling salesman Classification code: 723 Computer Software, Data Handling and Applications - 921 Mathematics - 921.6 Numerical Methods Database: Compendex Compilation and indexing terms, © 2013 Elsevier Inc. |
2楼2014-04-25 18:22:11
投票:
