检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《数学的实践与认识》2013年第16期27-34,共8页Mathematics in Practice and Theory
基 金:国家自然科学基金(71071163)
摘 要:针对逆向物流网络的多目标性和回收废旧产品数量的不确定性,在再制造产品和新产品可相互替代的情形下,建立了随机多目标规划模型.通过求解该模型,可以确定逆向物流网络中设施的位置、数量以及设施间的流量分配.对模型中的机会约束,将其转化为各自的确定性等价类,采用主目标法对多目标问题加以处理.通过Lingo 11.0对模型算例进行求解,并分析了当置信水平和可回收量波动时网络结构和最小成本的变化,进而验证模型的稳定性.The uncertainty of the returnable quantities and multi-objective are the main characteristics of remanufacturing reverse logistics network. Considering these features, a stochastic multi-objective programming model was proposed. The model can determined the number and location of facilities in the network and the flow rate between different facil- ities. Stochastic chance-constrained programming was used to change the model into a clear equivalent form. For multiple targets, deal with the main target method. An example was solved by operations research software Lingo 11.0. Then, the analysis with different confi- dence levels and quantity of recycling products demonstrated the validity and the stability of the model.
分 类 号:O221.6[理学—运筹学与控制论] F259.2[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.225