Locating a surveillance infrastructure in and near ports or on other planar surfaces to monitor flows

Pitu Mirchandani, Jing Quan Li, Yejuan Long

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)89-100
Number of pages12
JournalComputer-Aided Civil and Infrastructure Engineering
Volume25
Issue number2
DOIs
StatePublished - Feb 2010

Fingerprint

Radar
National security
Managers
Monitoring

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design

Cite this

Locating a surveillance infrastructure in and near ports or on other planar surfaces to monitor flows. / Mirchandani, Pitu; Li, Jing Quan; Long, Yejuan.

In: Computer-Aided Civil and Infrastructure Engineering, Vol. 25, No. 2, 02.2010, p. 89-100.

Research output: Contribution to journalArticle

@article{e6e3345dd2ab46ffb25c6cd85689c3f0,
title = "Locating a surveillance infrastructure in and near ports or on other planar surfaces to monitor flows",
abstract = "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.",
author = "Pitu Mirchandani and Li, {Jing Quan} and Yejuan Long",
year = "2010",
month = "2",
doi = "10.1111/j.1467-8667.2009.00623.x",
language = "English (US)",
volume = "25",
pages = "89--100",
journal = "Computer-Aided Civil and Infrastructure Engineering",
issn = "1093-9687",
publisher = "Wiley-Blackwell",
number = "2",

}

TY - JOUR

T1 - Locating a surveillance infrastructure in and near ports or on other planar surfaces to monitor flows

AU - Mirchandani, Pitu

AU - Li, Jing Quan

AU - Long, Yejuan

PY - 2010/2

Y1 - 2010/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=73949127121&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=73949127121&partnerID=8YFLogxK

U2 - 10.1111/j.1467-8667.2009.00623.x

DO - 10.1111/j.1467-8667.2009.00623.x

M3 - Article

AN - SCOPUS:73949127121

VL - 25

SP - 89

EP - 100

JO - Computer-Aided Civil and Infrastructure Engineering

JF - Computer-Aided Civil and Infrastructure Engineering

SN - 1093-9687

IS - 2

ER -