Abstract: The properties of casualties cluster function and ambulance rescuing capacity function are studied to obtain the simplified equivalent condition of ambulances full-loaded constraints in large-scale emergency. Based on this condition, a lower bound for the rescuing makespan is derived and minimized makespan is obtained in the condition of ambulances with single capacity. With given rescuing makespan, the minimum demand for ambulances and its allocation scheme is proposed by setting up programming model. With given number of ambulances and different thresholds, the minimum makespan and weighted total flow time allocation scheme is also obtained by improved model. The combination of ambulances with different capacities is considered in these models. The numerical case based on a simulated earthquake scenario illustrates the validity and efficiency of the proposed method.

Key words: emergency, ambulance allocation, casualties cluster function, rescuing makespan, weighted total flow time

摘要： 研究了伤员簇人数函数和救护车救助能力函数的性质，提出了大规模伤员救助中救护车满负荷工作约束的简化等价条件。基于此条件，给出了伤员救助工期的一个下界和单种救护车情形下的最小救助工期。通过建立数学模型，在给定救助工期的条件下求救护车最小需求量及其分配方案；在给定救护车数量条件下求最小工期和最小总加权工期救护车分配方案。以上模型考虑了多种规格救护车的组合。利用模拟地震场景数据进行试算，结果表明模型的合理性和求解方法的有效性。

关键词: 突发事件, 救护车分配, 伤员簇人数函数, 救助工期, 加权救助时间