arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.18593cs.NE
收藏

自杀式炸弹探测器布置的元启发式方法

Metaheuristic approaches to the placement of suicide bomber detectors

Carlos Cotta, José E. Gallardo

AI总结:

针对自杀式炸弹探测器布置问题,提出并评估多种元启发式方法,其中爬山算法表现最佳,优于贪婪算法,并在现实场景中验证了其有效性。

摘要:

自杀式爆炸是一种臭名昭著的恐怖主义形式,在当今全球恐怖战争时代日益猖獗。我们考虑此类定向攻击的情况,并利用分布在受威胁区域内的探测器作为保护性对策。这些探测器并非完全可靠,必须进行战略性布置,以最大化探测到攻击的可能性,从而最小化预期伤亡人数。为此,我们考虑了基于局部搜索和基于种群搜索的不同元启发式方法,并与文献中一种强大的贪婪启发式算法进行了基准比较。我们在具有多种多样属性的合成实例上进行了广泛的实证评估。大多数元启发式方法优于贪婪算法,并且爬山算法被证明优于其余方法。随后,对该爬山算法进行了敏感性分析,以确定哪些问题特征使其优于贪婪方法,并最终将其部署在基于现实场景构建的多个问题实例上,证实了该启发式算法的良好性能。

英文摘要:

Suicide bombing is an infamous form of terrorism that is becoming increasingly prevalent in the current era of global terror warfare. We consider the case of targeted attacks of this kind, and the use of detectors distributed over the area under threat as a protective countermeasure. Such detectors are non-fully reliable, and must be strategically placed in order to maximize the chances of detecting the attack, hence minimizing the expected number of casualties. To this end, different metaheuristic approaches based on local search and on population-based search are considered and benchmarked against a powerful greedy heuristic from the literature. We conduct an extensive empirical evaluation on synthetic instances featuring very diverse properties. Most metaheuristics outperform the greedy algorithm, and a hill-climber is shown to be superior to remaining approaches. This hill-climber is subsequently subject to a sensitivity analysis to determine which problem features make it stand above the greedy approach, and is finally deployed on a number of problem instances built after realistic scenarios, corroborating the good performance of the heuristic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑