摘要
最佳路径是实际动态路网中备受关注的话题之一,为了提高出行的效率、缓解交通拥堵的状况,本文对动态路网进行分析研究。通过分析实际动态路网的可通行性及影响因素,针对在理论研究中未结合实际路网中的影响因素而得出的最佳路线不符实际路线中的最优情况,在蚁群算法的基础上,结合实际路况,笔者对其进行改进,该算法可实现计算出一条从起始点到终点的最佳路径,并在Visual Studio 2010中用C#语言设计并验证了该算法,证明了它的正确性和有效性。
The best path is one of the most concerned topics in the actual dynamic network. In order to improve the efficiency of the trip and to ease the traffic congestion,this paper analysis the dynamic network. Through analyzing the practical dynamic network and its influencing factors. In view of theoretical research,the best route is not in the actual route,which is the best route to the actual road network. Therefore,based on ant colony algorithm,combining with the actual road conditions,the author makes an improvement,the algorithm can calculate the best path from the starting point to the end,and the Studio C# 2010 in Visual language design and verify the algorithm,proved its correctness and effectiveness.
出处
《测绘与空间地理信息》
2016年第3期49-51,54,共4页
Geomatics & Spatial Information Technology
基金
江西省研究生创新基金项目(DHYC2014002)
国家自然科学基金(41161069)
广西空间信息与测绘重点实验室资助课题(13-051-14-18
11-031-08-26)
江西省教育厅科技资助项目(GJJ12384)资助
关键词
最佳路径
实际路网
改进算法
best path
actual road network
improved algorithm
