IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-61589-4_23.html
   My bibliography  Save this book chapter

Exploring the Optimal Camera Placement Problem and Its Relationship with the Set Covering Problem

In: Business Analytics and Decision Making in Practice

Author

Listed:
  • Malek Almousa

    (Lancaster University)

  • Matthias Ehrgott

    (Lancaster University)

  • Ahmed Kheiri

    (Lancaster University)

Abstract

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.

Suggested Citation

  • Malek Almousa & Matthias Ehrgott & Ahmed Kheiri, 2024. "Exploring the Optimal Camera Placement Problem and Its Relationship with the Set Covering Problem," Lecture Notes in Operations Research, in: Ali Emrouznejad & Panagiotis D. Zervopoulos & Ilhan Ozturk & Dima Jamali & John Rice (ed.), Business Analytics and Decision Making in Practice, chapter 0, pages 295-306, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-61589-4_23
    DOI: 10.1007/978-3-031-61589-4_23
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnopch:978-3-031-61589-4_23. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.