Abstract: The available resources may be limited when multiple emergencies occur simultaneously.A non-cooperative games model for scheduling of relief resources and an algorithm for calculating Nash Equilibrium（NE） are proposed.In this model，the players represent the multiple emergency locations，strategies correspond to possible resource allocations.Then an improved Ant Colony Optimization（ACO） algorithm to obtain the NE is developed by introducing crossover operation of Genetic Algorithm（GA） and variable neighbourhood search method.Experimental results demonstrate the feasibility and availability of the proposed model and algorithm.

Key words: resources scheduling, game theory, ant colony algorithm, emergency

摘要： 针对突发事件发生后存在多个事故、应急资源有限的情况，提出了基于非合作博弈的应急资源调度模型和算法。在该调度模型中，各个事故点被视为博弈模型的局中人，可能的资源调度方案映射为策略集，将应急资源的调度问题转化为对非合作博弈调度模型的Nash均衡点求解问题，并对基本蚁群算法进行了改进，嵌入了遗传算法的交叉操作和变邻域搜索策略，将其应用于求解该博弈模型的Nash均衡解。最后通过算例测试验证了模型和算法的有效性和可行性。

关键词: 资源调度, 博弈论, 蚁群算法, 突发事件