摘要
主要研究在需求不确定的救援环境下,由一个区域救援总站和多个地方救援点组成的二级应急救援系统多种救援物资协同共享问题.各地方救援点对救援物资的需求为随机模糊变量,当某一地方救援点救援物资不足时,可以通过不同的协同方式进行应急补库,所有应急补库方式均考虑了地方救援点的优先级.据此建立了在一定服务满足率条件下以救援时间最短为目标函数的模型,结合随机模糊变量模拟和PSO、PSO-SA算法对模型进行了求解.最后对各种协同方式进行了对比并分析了相关变量的敏感性.结果表明:允许完全转运的协同共享方式能有效地缩短救援时间.
Emergency rescue materials collaborative sharing problem are studied in a two- echelon and multi-item emergency rescue system made up of one territorial rescue center and multiple local rescue spots under the uncertainty rescue environment. The rescue material demand in the local rescue spots is random fuzzy demand, different collaborative emergency replenishment modes are applied to replenish when the shortage of rescue material happens in local rescue spots, and replenishment priorities for the local rescue spots are considered for all the .replenishment modes. The models aimed to minimize the rescue time are developed based on these modes under certain service satisfaction rates, then random fuzzy variable simulation and two algorithms i.e. PSO algorithm and PSO-SA algorithm are used to calculate the models, the comparison of these collaborative emergency replenishment modes and the variables sensitivity analysis are given at last. The result shows that the collaborative sharing mode which allows completely emergency transshipment is effective to save the rescue time.
出处
《数学的实践与认识》
CSCD
北大核心
2012年第16期59-69,共11页
Mathematics in Practice and Theory
基金
国家自然科学基金(70973074)
上海海事大学博士创新能力培养专项资金(yc2010020)
关键词
应急补库
救援时间
随机模糊
PSO-SA算法
优先级
Keywords" emergency replenishment
rescue time
random fuzziness
PSO-SA algorithem
priority