蚁群算法的最优路径规划

Y. Hsiao, Cheng-Long Chuang, Cheng-Chih Chien
{"title":"蚁群算法的最优路径规划","authors":"Y. Hsiao, Cheng-Long Chuang, Cheng-Chih Chien","doi":"10.1109/ISCIT.2004.1412460","DOIUrl":null,"url":null,"abstract":"The paper presents an optimal approach to search the best path of a map considering the traffic loading conditions. The main objective of this work is to minimize the path length to get the best path planning for a given map. This study proposes a solution algorithm based on the ant colony optimization technique to search the shortest path from a desired origin to a desired destination of the map. The proposed algorithm is implemented in C++. Furthermore, the simulation program can randomly generate maps for evaluating its flexibility and performance. Simulation results demonstrate that the proposed algorithm can obtain the shortest path of a map with fast speed.","PeriodicalId":237047,"journal":{"name":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":"{\"title\":\"Ant colony optimization for best path planning\",\"authors\":\"Y. Hsiao, Cheng-Long Chuang, Cheng-Chih Chien\",\"doi\":\"10.1109/ISCIT.2004.1412460\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an optimal approach to search the best path of a map considering the traffic loading conditions. The main objective of this work is to minimize the path length to get the best path planning for a given map. This study proposes a solution algorithm based on the ant colony optimization technique to search the shortest path from a desired origin to a desired destination of the map. The proposed algorithm is implemented in C++. Furthermore, the simulation program can randomly generate maps for evaluating its flexibility and performance. Simulation results demonstrate that the proposed algorithm can obtain the shortest path of a map with fast speed.\",\"PeriodicalId\":237047,\"journal\":{\"name\":\"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"64\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2004.1412460\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2004.1412460","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64

摘要

本文提出了一种考虑交通负荷条件的地图最优路径搜索方法。这项工作的主要目标是最小化路径长度,以获得给定地图的最佳路径规划。本文提出了一种基于蚁群优化技术的求解算法,用于搜索地图从期望原点到期望目的地的最短路径。该算法在c++语言中实现。此外,仿真程序可以随机生成地图,以评估其灵活性和性能。仿真结果表明,该算法能够以较快的速度获得地图的最短路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ant colony optimization for best path planning
The paper presents an optimal approach to search the best path of a map considering the traffic loading conditions. The main objective of this work is to minimize the path length to get the best path planning for a given map. This study proposes a solution algorithm based on the ant colony optimization technique to search the shortest path from a desired origin to a desired destination of the map. The proposed algorithm is implemented in C++. Furthermore, the simulation program can randomly generate maps for evaluating its flexibility and performance. Simulation results demonstrate that the proposed algorithm can obtain the shortest path of a map with fast speed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信