基于蚁群算法的二维场地土石方运输路径优化研究

Research on Two-dimensional Earthwork Transportation Path Optimization Based on Ant Colony Algorithm

土石方调配是工程建设中重要环节之一。由于规划的原因,通常取土和弃土点相距较远,这种现象在工程建设中尤为常见。因此运距和运费往往占工程建安费中较大的比例,如何在既有的取土点和弃土点前提下通过对原有的运输路线进行优化,缩短运距、节省运费是工程建设中应考虑的问题。本文以荔玉高速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.