检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王矿山 王晨曦 谢明龙 成卫杰 黄玉翠 WANG Kuangshan;WANG Chenxi;XIE Minglong;CHENG Weijie;HUANG Yucui(Zhejiang Huadong Engineering Consulting Co.,Ltd,Hangzhou 311122,China;Jiangxi Communications Investment Group Limited Company,Nanchang 330108,China)
机构地区:[1]浙江华东工程咨询有限公司,浙江杭州311122 [2]江西省交通投资集团有限责任公司,江西南昌330108
出 处:《建筑经济》2024年第S2期215-220,共6页Construction Economy
摘 要:为解决传统土石方调配模型未考虑分配点间隔序列和算法易陷入局部最优的问题,本文构建以土石方调配费用最低为目标函数的数学模型,结合遗传算法(GA)的全局搜索优势和禁忌搜索算法(TS)的局部搜索优势对目标函数进行求解,得到土石方调配平衡匹配方案和运转过程中的最优运输路径,并结合实际案例对提出的模型算法进行验证和对比分析。研究结果表明,与遗传算法相比,混合算法能够有效降低土石方调配成本,提高转运效率、减少转运量,为土石方调度方案优化提供有力的方法支撑和实践参考。In this paper,a mathematical model with the lowest cost of earth and rock deployment as the objective function is constructed,combining the global search advantage of the genetic algorithm and the local search advantage of the taboo search algorithm,and solving the objective function by a specific hybrid strategy,so as to obtain the optimal earth and rock matching scheme,as well as the complete earth and rock transport path.Meanwhile,the proposed model and algorithm are verified with practical cases,and the schemes obtained by the hybrid algorithm and the genetic algorithm are compared and analysed.The results show that the results obtained by both algorithms can meet the construction requirements,but the results obtained by the hybrid algorithm are better,thus reducing the cost of earth and rock deployment,the number of transfers and the amount of transfers.This will provide methodological and theoretical support for the optimisation of earthmoving schemes for similar projects and the applicability of the model and algorithm in the engineering field.
关 键 词:土石方调配 线性规划 遗传算法 禁忌搜索算法 全局最优
分 类 号:TU751[建筑科学—建筑技术科学] TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.162.18