Premium
Locating a Surveillance Infrastructure in and Near Ports or on Other Planar Surfaces to Monitor Flows
Author(s) -
Mirchandani Pitu B.,
Li JingQuan,
Long Yejuan
Publication year - 2010
Publication title -
computer‐aided civil and infrastructure engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.773
H-Index - 82
eISSN - 1467-8667
pISSN - 1093-9687
DOI - 10.1111/j.1467-8667.2009.00623.x
Subject(s) - planar , business , computer science , computer security , telecommunications , computer graphics (images)
A safety and security issue of concern for traffic managers and homeland security is the monitoring of flows on “planar surfaces,” such as ports and border areas. This article addresses the problem of locating surveillance radars to cover a given target surface that may have barriers through which radar signals cannot penetrate. The area of coverage of a radar is assumed to be a disc, or a partial disc when there are barriers, with a known radius. The article shows that the corresponding location problems relate to two well studied problems: the set‐covering model and the maximal covering problem. In the first problem, the minimum number of radars is to be located to completely cover the target area; in the second problem a given number M of radars are to be located to cover the target area as much as possible. Based on a discrete representation of the target area, a Lagrangian heuristic and a two‐stage procedure with a conquer‐and‐divide scaling are developed to solve the above two models. The computational experiences reported demonstrate that the developed method solves well the radar location problems formulated here.