Incorporating the threat of terrorist attacks in the design of public service facility networks
Incorporating the threat of terrorist attacks in the design of public service facility networks
复制标题
DOI：
10.1007/s11590-011-0412-1
复制
发表时间：
2012-08
影响因子：
1.6
通讯作者：
Serhat Keçici;N. Aras;V. Verter
中科院分区：
文献类型：
--
作者：
Serhat Keçici;N. Aras;V. Verter
在本文中，我们考虑的设计问题的公共服务设施网络与现有的设施时，有可能的恐怖袭击的威胁。负责网络运营的系统规划人员的目标是开设新设施，必要时重新安置现有设施，并保护一些设施，以确保最大限度地满足假定在客户区聚集的需求。通过这样做，系统规划者预计许多未受保护的设施将因恐怖袭击而停止服务。假设开设新设施的固定费用、搬迁费用和保护费用的总和不能超过预定的预算水平。采用逐步（或部分）覆盖的方法，我们制定了一个双层规划模型，其中系统规划者是领导者和攻击者是追随者。前者的目标是最大化的总服务coverage，而后者希望最小化it.We提出了一个启发式的解决方案，基于禁忌搜索的搜索空间由系统规划的决策，并计算相应的目标值最优解决攻击者的问题，使用CPLEX。为了评估禁忌搜索（TS）启发式产生的解决方案的质量，我们还开发了一个穷举方法，探索所有可能的组合，打开新的设施，重新定位现有的，并保护它们。由于它的时间复杂度是指数级的，因此它只能用于相对较小的实例。因此，作为一个基准方法，我们还实现了爬山过程采用相同类型的移动TS启发式。此外，我们对一些问题参数进行了敏感性分析，以研究它们对解特性的影响。
In this paper, we consider the design problem of a public service facility network with existing facilities when there is a threat of possible terrorist attacks. The aim of the system planner, who is responsible for the operation of the network, is to open new facilities, relocate existing ones if necessary, and protect some of the facilities to ensure a maximum coverage of the demand that is assumed to be aggregated at customer zones. By doing so, the system planner anticipates that a number of unprotected facilities will be rendered out-of-service by terrorist attacks. It is assumed that the sum of the fixed cost of opening new facilities, the relocation costs, and the protection costs cannot exceed a predetermined budget level. Adopting the approach of gradual (or partial) coverage, we formulate a bilevel programming model where the system planner is the leader and the attacker is the follower. The objective of the former is the maximization of the total service coverage, whereas the latter wants to minimize it. We propose a heuristic solution procedure based on tabu search where the search space consists of the decisions of the system planner, and the corresponding objective value is computed by optimally solving the attacker’s problem using CPLEX. To assess the quality of the solutions produced by the tabu search (TS) heuristic, we also develop an exhaustive enumeration method, which explores all the possible combinations of opening new facilities, relocating existing ones, and protecting them. Since its time complexity is exponential, it can only be used for relatively small instances. Therefore, to be used as a benchmark method, we also implement a hill climbing procedure employed with the same type of moves as the TS heuristic. Besides, we carry out a sensitivity analysis on some of the problem parameters to investigate their effect on the solution characteristics.