检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2015年第8期255-259,共5页Computer Engineering and Applications
基 金:国际科技合作研究项目(No.2011DFR70500);财政部环保公益性行业科研专项(No.200909070)
摘 要:研究不确定战时情景下的军事物流配送中心选址问题。兼顾军事物流系统性能优化和成本节约建立了两个随机规划模型,模型中引入情景分析,考虑了设施损毁、库容和配送时间约束。讨论了模型求解方法,通过求解模型得到配送中心选址、选型和预置量决策。模型一在情景出现前为每个用户指派了首选与后备供应点,模型二给出了每个情景下的配送方案。仿真算例表明了模型的合理性和解法的有效性,也验证了模型一优于模型二。The location problem of military logistics distribution centers in the uncertain wartime scenarios is studied in this paper. Considering the military logistics system performance optimization and cost saving , two stochastic program-ming models are presented based on scenario analysis. Infrastructure damage, storage capacity and delivery time con-straints are contained in these models. The method to solve this model is discussed. The decision for distribution center loca-tion, type and munitions quantity is given by solving these models. A pair of“preferred-reserve”supply point is assigned for each user before the war in the first model, and the distribution plan under each scenario is given in the second model. Numerical example shows the rationality of the models, illustrates that the second model outperforms the first one.
关 键 词:军事物流配送中心 设施损毁 设施选址 情景分析 随机规划
分 类 号:O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15