An improved ants colony algorithm for NP-hard problem of travelling salesman | |
Luo Yabo*; Zhang, Shikun; Feng, Zhang | |
2014 | |
会议名称 | Joint International Conference on Pervasive Computing and Web Society |
会议日期 | DEC 05-07, 2013 |
会议地点 | Univ Adolfo Ibinez, Picturesque Campus, Vina del Mar, CHILE |
关键词 | ants colony algorithm constraint satisfaction travelling salesman problem NP-hard problem combinatorial optimization |
卷号 | 8351 |
DOI | 10.1007/978-3-319-09265-2_44 |
页码 | 432-440 |
会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
![]() |
URL标识 | 查看原文 |
ISSN号 | 0302-9743 |
WOS记录号 | WOS:000348379800044;EI:20143118009310 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/3393886 |
专题 | 武汉理工大学 |
作者单位 | 1.[Zhang, Shikun 2.Feng, Zhang 3.Luo Yabo] Wuhan Univ Technol, Sch Mech & Elect Engn, Wuhan 430070, Peoples R China. |
推荐引用方式 GB/T 7714 | Luo Yabo*,Zhang, Shikun,Feng, Zhang. An improved ants colony algorithm for NP-hard problem of travelling salesman[C]. 见:Joint International Conference on Pervasive Computing and Web Society. Univ Adolfo Ibinez, Picturesque Campus, Vina del Mar, CHILE. DEC 05-07, 2013. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论