TY - CHAP
T1 - Exploring the Optimal Camera Placement Problem and Its Relationship with the Set Covering Problem
AU - Almousa, Malek
AU - Ehrgott, Matthias
AU - Kheiri, Ahmed
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
PY - 2024/8/28
Y1 - 2024/8/28
N2 - Optimal Camera Placement (OCP) is the process of finding a subset of cameras that either maximises the coverage, such that the cost of cameras is reduced, or minimises the total cost of cameras, such that coverage constraints are satisfied. By adopting the latter formulation, the OCP problem can be formulated as a Set Covering Problem (SCP), as the concepts of the two problems are inherently similar. Until recently, the literature has not explicitly discussed this similarity. Hence, this paper examines the OCP problem by leveraging the formulation established in prior research. Our focus lies in the practical application, as we implement the model on all instances to derive meaningful insights. Furthermore, we explore techniques from the SCP literature that can be applied to address the OCP problem in future studies. In this study, we address 69 problem instances, utilising a benchmark set generated by other researchers. These instances were employed as part of the GECCO 2021 competition on the optimal camera placement problem and the unicost set covering problem. We provide detailed results, and we conclude with recommendations for future research.
AB - Optimal Camera Placement (OCP) is the process of finding a subset of cameras that either maximises the coverage, such that the cost of cameras is reduced, or minimises the total cost of cameras, such that coverage constraints are satisfied. By adopting the latter formulation, the OCP problem can be formulated as a Set Covering Problem (SCP), as the concepts of the two problems are inherently similar. Until recently, the literature has not explicitly discussed this similarity. Hence, this paper examines the OCP problem by leveraging the formulation established in prior research. Our focus lies in the practical application, as we implement the model on all instances to derive meaningful insights. Furthermore, we explore techniques from the SCP literature that can be applied to address the OCP problem in future studies. In this study, we address 69 problem instances, utilising a benchmark set generated by other researchers. These instances were employed as part of the GECCO 2021 competition on the optimal camera placement problem and the unicost set covering problem. We provide detailed results, and we conclude with recommendations for future research.
KW - combinatorial optimisation
KW - optimal camera placement
KW - set covering problem
UR - https://www.scopus.com/pages/publications/85212479573
U2 - 10.1007/978-3-031-61589-4_23
DO - 10.1007/978-3-031-61589-4_23
M3 - Chapter
AN - SCOPUS:85212479573
SN - 9783031615887
SN - 9783031615917
T3 - Lecture Notes in Operations Research
SP - 295
EP - 306
BT - Business Analytics and Decision Making in Practice
A2 - Emrouznejad, Ali
A2 - Zervopoulos, Panagiotis D.
A2 - Ozturk, Ilhan
A2 - Jamali, Dima
A2 - Rice, John
PB - Springer Cham
CY - Cham
ER -