Lagrangian relaxation for the directional sensor coverage problem with continuous orientation

Annabella Astorino, Manlio Gaudioso and Giovanna Miglionico

Omega, 2018, vol. 75, issue C, 77-86

Abstract: We present a mixed integer nonlinear programming formulation of the Directional Sensors Continuous Coverage Problem (DSCCP), where a given set of targets on a plane are to be covered by a set of sensors whose locations are known. Sensors are supposed to be directional, that is characterized by a discrete set of possible radii and aperture angles. The orientation (which is a continuous variable), the radius and the aperture angle of each sensor are to be decided, taking into account possibility of keeping one or more sensors switched off. The objective is to minimize cost coverage. We incorporate into the objective function penalty cost for possibly uncovered targets.

Keywords: Directional sensors; Lagrangian relaxation; Lagrangian heuristics; MINLP (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048316301566
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:75:y:2018:i:c:p:77-86

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2017.03.001

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().