科研管理

科研管理 ›› 2010, Vol. 31 ›› Issue (2): 121-125 .

• 论文 • 上一篇    下一篇

大规模突发事件快速消费品的应急调度

唐伟勤1，2，陈荣秋2，赵曼3，张敏2   


  1. （1.中南财经政法大学安全科学与管理学院,湖北 武汉430074；
    2.华中科技大学管理学院,湖北 武汉430073；
    3.中南财经政法大学公共管理学院,湖北 武汉430074）
  • 收稿日期:2008-09-11 修回日期:2009-03-08 出版日期:2010-03-22 发布日期:2010-03-22

Dispatching of fast consumption goods in large-scale emergency

Tang Weiqin1，2, Chen Rongqiu2, Zhao man3, Zhang min2   

  1. (1. School of Safety Science and Management, Zhongnan University of Economics and Law, Wuhan 430074, China;
    2. School of Management, Huazhong University of Science and Technology, Wuhan 430070, China;
    3. School of Public Management, Zhongnan University of Economics and Law, Wuhan 430074, China)
  • Received:2008-09-11 Revised:2009-03-08 Online:2010-03-22 Published:2010-03-22

PDF

2619

摘要： 摘要：在持续时间较长的大规模突发事件中，应急需求点对快速消费品的应急需求也是持续的、动态的。本文讨论在大规模突发事件应急中有多个应急供应点可供选择的前提下，根据每一时间段所需要的某种应急快速消费品的数量确定在各个时间点上应从哪个或哪几个应急物资供应点调度相应数量的快速消费品以使应急成本最小，建立了0－1混合整数规划模型，给出了算法，并用算例验证了模型的有效性。

关键词: 快速消费品的应急, 应急物资存放中心, 0－1混合整数规划模型, 拟多项式时间算法

Abstract: Abstract: In the situation that a large-scale emergency lasts long time, the demand for the fast consumption goods at the emergency demand point is continuous and dynamical. How to determine supply points of emergency commodities, where corresponding quantity of the commodities at every time point are dispatched according to the demand for certain kind of emergency commodity quantity in each period of time in order to keep a minimum emergency cost under the premise that there are many candidate emergency supply points is discussed. The 0-1 mixed integer-programming model is established and the algorithm is given to confirm the validity of the model with the example.

Key words: emergency of fast consumption goods, emergency commodity depositary center, 0-1 mixed integer- programming model, imitative algorithm of multinomial time

中图分类号: