检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:许辉 XU Hui(Huazhong Engineering Co.,Ltd.of CCCC First Highway Engineering Co.,Ltd.,Wuhan Hubei 430014)
机构地区:[1]中交一公局集团华中工程有限公司,湖北武汉430014
出 处:《中国科技纵横》2022年第7期112-114,共3页China Science & Technology Overview
摘 要:土石方调配是工程建设中重要环节之一。由于规划的原因,通常取土和弃土点相距较远,这种现象在工程建设中尤为常见。因此运距和运费往往占工程建安费中较大的比例,如何在既有的取土点和弃土点前提下通过对原有的运输路线进行优化,缩短运距、节省运费是工程建设中应考虑的问题。本文以荔玉高速21分部1#取土场为例,通过在MATLAB软件中建立填方和挖方无向模型,并在设置车辆不可通过的区域,尽量还原现场真实的运输情况。利用Dijkstra算法进行路径的初始规划以节省后期运算量,再通过蚁群算法进行路径二次优化,使得到的优化后路径相较仅由Dijkstra算法优化的路径相比长度减少20%。本算法收敛速度快,性能较稳定,对于障碍物的分辨能力强,能实现全局最优路径搜寻,可以一定程度上为项目方案优化提供依据。Ear thwork alloca tion is one of the impor tant links in engineering cons true tion.Due to planning reasons,the borrow and spoil poin ts are usually far away,which is par ticularly common in engineering cons true tion.Therefore,the transpor tat ion dis tance and freigh t often accoun t for a large propor tion of the projec t cons true tion and ins talla tion cos t.How to shor ten the transpor tat ion dis tance and save freigh t by opt imizing the original transpor tat ion route on the premise of exis ting borrow poin ts and spoil poin ts is a problem that should be considered in the projec t cons true tion.Taking the 21 branch 1#borrow area of Liyu expressway as an example,t his paper est ablishes the undirec ted model of filling and excava tion in MATLAB software,and sets the area where vehicles can not pass,so as to restore the real transpor tat ion si tuat ion on the si te as far as possible.The Dijkstra algorithm is used for the initial path planning to save the amount of later calculation,and then the ant colony algorithm is used for the secondary path optimization to reduce the length of the optimized path by 20%compared with the path optimized only by Dijkstra algorithm.The algorithm has fast convergence speed,stable performance,strong ability to distinguish obstacles,can realize global optimal path search,and can provide basis for project scheme optimization to a certain extent.
关 键 词:路径优化 Maklink图 DIJKSTRA算法 蚁群算法
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147