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