| Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem | |
| Lin, Dong; He, Lingchao; Feng, Xinxin; Luo, Wei | |
| 刊名 | IEEE ACCESS
 |
| 2018 | |
| 卷号 | 6页码:21184-21194 |
| 关键词 | Pathfinding problem Pareto optimal solution Ant colony optimization |
| ISSN号 | 2169-3536 |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2890122 |
| 专题 | 福州大学 |
| 推荐引用方式 GB/T 7714 | Lin, Dong,He, Lingchao,Feng, Xinxin,et al. Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem[J]. IEEE ACCESS,2018,6:21184-21194. |
| APA | Lin, Dong,He, Lingchao,Feng, Xinxin,&Luo, Wei.(2018).Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem.IEEE ACCESS,6,21184-21194. |
| MLA | Lin, Dong,et al."Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem".IEEE ACCESS 6(2018):21184-21194. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论