作者: Tom M. Cavalier , Whitney A. Conner , Enrique del Castillo , Stuart I. Brown
DOI: 10.1016/J.EJOR.2006.10.055
关键词: Heuristic (computer science) 、 Mathematics 、 Minimax 、 Finite set 、 Nonlinear programming 、 Heuristics 、 Voronoi diagram 、 Nonlinear system 、 Mathematical optimization 、 Convex polygon
摘要: This paper addresses the problem of locating a finite number sensors to detect an event in given planar region. The objective is minimize maximum probability non-detection where underlying region consists convex polygon. sensor location has multitude applications, including aircraft detection sensors, placement sentries along border enemy penetration, nuclear tests, and natural hazardous man-made events. difficult nonlinear nonconvex programming even case two sensors. A fast heuristic based on Voronoi polygons developed this paper. algorithm can quickly generate high-quality solutions. Computational experience provided.