检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵钦[1] 田庆[1] 王竹荣[2] 黑新宏[2] 刘云贺[1] ZHAO Qin;TIAN Qing;WANG Zhu-rong;HEI Xin-hong;LIU Yun-he(School of Civil Engineering and Architecture, Xi' an University of Technology, Xi' an 710048, China;School of Computer Science and Engineering, Xi' an University of Technology, Xi' an 710048, China)
机构地区:[1]西安理工大学土木建筑工程学院,西安710048 [2]西安理工大学计算机科学与工程学院,西安710048
出 处:《环境工程》2018年第5期166-170,共5页Environmental Engineering
基 金:国家自然科学基金(51408488);陕西省科技统筹创新工程计划项目(2015KTZDGY01-04);陕西省社发攻关项目(2012K12-03-05);陕西省教育厅科学研究计划项目(14JK1523)
摘 要:为了提高城市建筑废弃物资源化管理效率,减少回收和非回收废弃物在协同运输过程中的相互影响,对城市建筑废弃物运输路径进行了优化。基于可行性和经济性指标分析了废弃物协同运输的影响因素,建立了建筑废弃物协同运输路径模型。应用负载均衡流水调度策略,改进贪心算法对运输模型进行优化,得到了运输成本低、车辆负载均衡的城市建筑废弃物运输路径。最后以西安市某区为例,对该地区城市建筑废弃物协同运输路径进行优化,实验结果验证了该方法的有效性。In order to improve the efficiency of urban construction waste resource management,and reduce the mutual influence in the process of cooperative transport of recycled and non-recycled wastes, the urban construction waste transportation path was optimized. From of the feasibility and economy indexes,the paths optimization based on influence factors of urban construction waste collaborative transportation were analyzed,and the waste collaborative transportation model was set up. Greedy algorithm was improved to solve the problem of the proposed model with the strategy of the load balancing flow shops scheduling,so as to obtain the transportation route with less transportation cost and balanced vehicle load. Finally,taking a district of Xi'an City as the example,the transportation path was optimizated and the effectiveness of this method was proved.
关 键 词:建筑废弃物 路径优化 负载均衡 流水调度 贪心算法
分 类 号:X799.1[环境科学与工程—环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38