| ²é¿´: 485 | »Ø¸´: 1 | |||
injt19891011гæ (³õÈëÎÄ̳)
|
[ÇóÖú]
ÇëÎÊÕâÆªÎÄÕ¼ìË÷û£¿ ÒÑÓÐ1È˲ÎÓë
|
|
PLS help£¡ title£ºThe Performance Research on Solving TSP by Four Typical AI Algorithms Journal: <BioTechnology: An Indian Journal> Author: Zhengqiang JIANG,¡¡ лл£¡ |
» ²ÂÄãϲ»¶
291Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
300Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
Çóµ÷¼ÁÍÆ¼ö
ÒѾÓÐ7È˻ظ´
289 ·Ö105500ҩѧר˶Çóµ÷¼Á(ÕÒBÇøÑ§Ð£)
ÒѾÓÐ4È˻ظ´
0854Çóµ÷¼Á
ÒѾÓÐ13È˻ظ´
³õÊÔ324 ÖÐҩѧ Ò»Ö¾Ô¸ÌìÖÐÒ½ Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
ҩѧÇóµ÷¼Á
ÒѾÓÐ14È˻ظ´
327Çóµ÷¼Á
ÒѾÓÐ27È˻ظ´
¼±Ðèµ÷¼Á
ÒѾÓÐ5È˻ظ´
271Çóµ÷¼Á
ÒѾÓÐ33È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
ÇëͬÈʰïæÑéÖ¤ÒÔÏÂÂÛÎÄÊÇ·ñ±»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È˻ظ´
°ïÎÒ¿´ÏÂÕâÆªÎÄÕÂÊDz»ÊÇSCI£¬ÈçºÎÅжÏÊDz»ÊÇSCI£¿
ÒѾÓÐ7È˻ظ´
Õâ¸öÂÛÎÄÄܱ»SCI¼ìË÷Âð£¬ÇëÎÊErratumËã²»ËãеÄÂÛÎÄ
ÒѾÓÐ19È˻ظ´
¼ìË÷±¨¸æµÄµ¥Î»Ë³ÐòŪ·´ÁË£¬Ôõô°ì£¿
ÒѾÓÐ10È˻ظ´
ÄÄλ°ïÎÒ²éÒ»ÏÂÕâÆªÎÄÕÂÏÖÔÚÄܱ»web of science³ösci¼ìË÷±¨¸æÂ𣿣¨½ð±ÒΪл£©
ÒѾÓÐ15È˻ظ´
ÎÄÕÂÓÐÒ³Â뵫ÔÚISIÉϼìË÷²»µ½
ÒѾÓÐ3È˻ظ´
ÈçºÎ¸ù¾Ý»ù½ðºÅ,²éÕÒÒѾ·¢±íµÄÎÄÕ£¿
ÒѾÓÐ5È˻ظ´
ÇëÎÊÈçºÎ»ñ֪ijƪÎÄÕµÄSCIºÅ»òEIºÅ£¿ÄÄÀïÄܲ鵽Ĩ£¿
ÒѾÓÐ10È˻ظ´
ÇëÄÄλ´óÏÀ°ïæ²éһƪÎÄÕÂÊÇ·ñ±»ISTP¼ìË÷
ÒѾÓÐ5È˻ظ´
fallsoft
½ð³æ (ÕýʽдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 849.1
- É¢½ð: 13
- ºì»¨: 7
- Ìû×Ó: 315
- ÔÚÏß: 86.6Сʱ
- ³æºÅ: 1548818
- ×¢²á: 2011-12-23
- ÐÔ±ð: MM
- רҵ: ¼ÆËã»úÈí¼þ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï
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













»Ø¸´´ËÂ¥