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.
Verfasser*innenangaben: | Horst W. Hamacher, Gross Aleksandra |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-39975 |
Schriftenreihe (Bandnummer): | Report in Wirtschaftsmathematik (WIMA Report) (154) |
Dokumentart: | Preprint |
Sprache der Veröffentlichung: | Deutsch |
Datum der Veröffentlichung (online): | 19.02.2015 |
Jahr der Erstveröffentlichung: | 2014 |
Veröffentlichende Institution: | Technische Universität Kaiserslautern |
Datum der Publikation (Server): | 20.02.2015 |
Seitenzahl: | 10 |
Fachbereiche / Organisatorische Einheiten: | Kaiserslautern - Fachbereich Mathematik |
DDC-Sachgruppen: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
MSC-Klassifikation (Mathematik): | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming |
Lizenz (Deutsch): | Standard gemäß KLUEDO-Leitlinien vom 13.02.2015 |