检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输与物流学院,四川成都610031
出 处:《计算机集成制造系统》2016年第8期2023-2034,共12页Computer Integrated Manufacturing Systems
基 金:教育部人文社会科学研究青年基金资助项目(15XJC630008);中央高校基本科研业务费专项资金资助项目(2682016CX047);西南交通大学博士研究生创新基金资助项目(2015CX029)~~
摘 要:为了从宏观角度最优化配置规划期内系统的废物设施,并确定废物设施间危险废物和残渣的运输方案,以满足所有相关的运营和能力约束,借鉴网络流问题的路径模型,以运输和选址决策中的总费用和总风险最小为目标,引入路段风险承载能力约束,构建基于路径的大规模双目标混合整数线性规划模型。利用所构建模型的优势,开发增广ε-约束算法,获得近似的非支配前沿。对1个大规模切实算例的计算测试显示,与既有的路段模型相比,所提出的路径模型可在更短的时间内返回相同数量的非支配解,所开发的增广ε-约束算法在解的质量上明显优于既有的线性加权求和算法。To strategically configure the system facilities and determine the transportation plan of hazardous wastes and waste residuals among these facilities in a planning horizon, while satisfied all corresponding operational and capacity constraints, referred to the path-based model of network flow problem and introduced the link risk tolerance capacity, a path-based large-scale bi-objective mixed integer linear programming model was formulated which took minimum total cost and total risk in the transportation and location decisions as the objectives. By utilizing the ad-vantages of proposed model, an augmented s-constraint approach was customized to obtain the approximate nondominated frontier. Computational tests on a large-scale realistic example showed that the proposed path-based for-mulation could output the same number of non-dominated solutions within much shorter computation times compared with the existed link-based formulation. Meanwhile, the developed augmented ε-constraint approach was obviously better than the existed weighted-sum approach in terms of the solution quality.
关 键 词:区域危险废物管理 选址-路径问题 多目标优化 增广r约束算法 路径模型
分 类 号:O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3