基于蚁群算法的旅游巴士路线优化研究

Mingyan Li, Qiuli Qin, Kun Fan
{"title":"基于蚁群算法的旅游巴士路线优化研究","authors":"Mingyan Li, Qiuli Qin, Kun Fan","doi":"10.1145/3373419.3373435","DOIUrl":null,"url":null,"abstract":"Based on the current economic background, combined with the principle of ant colony algorithm, mathematical modeling and parameter setting are carried out. The simulation experiments are carried out on the basic ant colony algorithm, the improved maximum and minimum ant colony algorithm and the ant colony algorithm with independent improved pheromone updating method. Solve the optimal path and the shortest distance. Finally, the improved algorithm is compared with the experimental results of the two existing algorithms, and the improved algorithm is obtained. Although the result is relatively weaker than the maximum and minimum ant colony algorithm, it can be obtained with faster convergence speed and basic ant. The conclusion of the approximate result of the group algorithm, and the significance of the improved algorithm is proved to some extent.","PeriodicalId":352528,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Advances in Image Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Research on Tourism Bus Route Optimization Based on Ant Colony Algorithm\",\"authors\":\"Mingyan Li, Qiuli Qin, Kun Fan\",\"doi\":\"10.1145/3373419.3373435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the current economic background, combined with the principle of ant colony algorithm, mathematical modeling and parameter setting are carried out. The simulation experiments are carried out on the basic ant colony algorithm, the improved maximum and minimum ant colony algorithm and the ant colony algorithm with independent improved pheromone updating method. Solve the optimal path and the shortest distance. Finally, the improved algorithm is compared with the experimental results of the two existing algorithms, and the improved algorithm is obtained. Although the result is relatively weaker than the maximum and minimum ant colony algorithm, it can be obtained with faster convergence speed and basic ant. The conclusion of the approximate result of the group algorithm, and the significance of the improved algorithm is proved to some extent.\",\"PeriodicalId\":352528,\"journal\":{\"name\":\"Proceedings of the 2019 3rd International Conference on Advances in Image Processing\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 3rd International Conference on Advances in Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3373419.3373435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 3rd International Conference on Advances in Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3373419.3373435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于当前的经济背景,结合蚁群算法原理,进行了数学建模和参数设置。对基本蚁群算法、改进的最大最小蚁群算法和具有独立改进信息素更新方法的蚁群算法进行了仿真实验。求解最优路径和最短距离。最后,将改进算法与现有两种算法的实验结果进行比较,得到改进算法。虽然结果相对弱于最大最小蚁群算法,但可以获得更快的收敛速度和基本蚁群算法。得出了群算法的近似结果,并在一定程度上证明了改进算法的意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Tourism Bus Route Optimization Based on Ant Colony Algorithm
Based on the current economic background, combined with the principle of ant colony algorithm, mathematical modeling and parameter setting are carried out. The simulation experiments are carried out on the basic ant colony algorithm, the improved maximum and minimum ant colony algorithm and the ant colony algorithm with independent improved pheromone updating method. Solve the optimal path and the shortest distance. Finally, the improved algorithm is compared with the experimental results of the two existing algorithms, and the improved algorithm is obtained. Although the result is relatively weaker than the maximum and minimum ant colony algorithm, it can be obtained with faster convergence speed and basic ant. The conclusion of the approximate result of the group algorithm, and the significance of the improved algorithm is proved to some extent.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信