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

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.