Abstract: This paper dealt with emergency service location problem with a deadline, which is NP-complete. Its representation in penalty function easy to be achieved by computer was put forward. Then, corresponding simulated annealing algorithm was designed in temperature parameter, iteration strategy and termination condition. A numerical example demonstrates that the given SA algorithm is effective.

摘要： 讨论了一类带限期约束的应急服务设施选址问题，给出了其易于实现计算机计算的罚函数表示，在温度参数、迭代策略和算法终止条件三个方面设置了适合该问题的模拟退火算法，并通过实例的计算说明该算法是有效的。