Bicriteria approach to the optimal location of surveillance cameras

  • We consider the problem of finding efficient locations of surveillance cameras, where we distinguish between two different problems. In the first, the whole area must be monitored and the number of cameras should be as small as possible. In the second, the goal is to maximize the monitored area for a fixed number of cameras. In both of these problems, restrictions on the ability of the cameras, like limited depth of view or range of vision are taken into account. We present solution approaches for these problems and report on results of their implementations applied to an authentic problem. We also consider a bicriteria problem with two objectives: maximizing the monitored area and minimizing the number of cameras, and solve it for our study case.

Download full text files

Export metadata

Author:Horst W. Hamacher, Gross Aleksandra
URN (permanent link):urn:nbn:de:hbz:386-kluedo-39975
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (154)
Document Type:Preprint
Language of publication:German
Publication Date:2015/02/19
Year of Publication:2014
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2015/02/20
Number of page:10
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
MSC-Classification (mathematics):90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming
Licence (German):Standard gemäß KLUEDO-Leitlinien vom 13.02.2015