摘要
通过对应急物资紧急保障的特征进行分析,运用关键因素分析确定应急物资优先级;采用群决策理论,确定网络的权值,利用Dijkstra算法求取保障点到需求点的最短路径;以最少保障点数为目标,以各个优先级最早应急开始时间为约束构建数学模型,提出应急保障点最优组合方案;最后通过实例进行验证。
In this paper,firstly analyzing the characteristics of emergency material supply,confirming emergency material priority by CVA method,adopting group decider method to determine the network weight,computing the shortest path by Dijkstra algorithm,then the least supply points as the object function and the earliest action start time at different levels as the subject condition,an optimized model is constructed.On the basis of above,the problem of supplying emergency material is solved.Finally feasibility and effectiveness of the model is testified by practical example.
出处
《军事交通学院学报》
2011年第5期65-69,共5页
Journal of Military Transportation University
关键词
应急物资保障
优先级
决策者偏好
路径选择
组合优化
emergency material supply
priority
decision-maker's preference
path selection
combination optimization