检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭希旺[1] 张威[1] 葛琳琳[1] 胡承波[2] Guo Xiwang Zhang Wei Ge Linlin Hu Chengbo(School of Computer and Communication Engineering ,Liaoning Shihua University, Fushun Liaoning 113001, China School of Economics & Management ,Shenyang University of Chemical Technology , Shenyang Liaoning 110142, China)
机构地区:[1]辽宁石油化工大学计算机与通信工程学院,辽宁抚顺113001 [2]沈阳化工大学经济与管理学院,辽宁沈阳110142
出 处:《辽宁石油化工大学学报》2016年第3期63-66,75,共5页Journal of Liaoning Petrochemical University
基 金:抚顺市科学技术发展资金计划项目(FSKJHT201548);大学生创新创业资助项目(201410148060;201510148068)
摘 要:拆卸建模和规划对废旧产品的回收和再利用具有重要意义,目前的拆卸方法很少关注多资源约束对拆卸问题的影响。根据批量拆卸优化问题的特点,建立了多资源约束下以拆卸获得收益最大为优化目标的批量拆卸优化问题的数学模型,采用CPLEX软件对多资源约束下批量拆卸优化问题进行求解。为了验证该模型在求解此类批量拆卸优化问题的有效性,采用多组随机算例的仿真实验对其验证,结果表明该模型求解此类问题有效。Disassembly modeling and planning are meaningful for the reuse and recycling of obsolete and discarded products. However, the existing disassembly methods pay little or no attention to impact of resources constraints for disassembly problem. According to the characteristics of lot sizing disassembly optimization problem with multi-resource constraints, a mathematical model was established to solve disassembly optimization problems with multi-resource capacity constraints. The model aims at maximizing the profit of disassembly. The CPLEX software is used to solve the model. In order to approve the effectiveness of the proposed model, several randomly generated problem instances are used, the experimental results approved the effectiveness of the proposed model for the lot sizing disassembly optimization problem.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15