The Angular Set Covering Problem

被引:0
作者
Barriga-Gallegos, Fredy [1 ]
Lur-Villagra, Armin [2 ]
Gutierrez-Jarpa, Gabriel [1 ]
机构
[1] Pontificia Univ Catolica Valparaiso, Sch Ind Engn, Valparaiso 2340025, Chile
[2] Univ Andres Bello, Dept Engn Sci, Talcahuano 4260000, Chile
关键词
Servers; Costs; Cameras; Optimization methods; Computational modeling; Security; Linear programming; Combinatorial mathematics; Angular covering; column generation; combinatorial optimization; location problem; set covering; LOCATION PROBLEM; SURVEILLANCE; COVERAGE; CENTERS; SYSTEM;
D O I
10.1109/ACCESS.2024.3416871
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. The decisions are based on locating the facilities and identifying the directional servers installed in each, covering a set of points in a geographic area. The strategic placement of surveillance cameras inspired this novel approach. We aim to minimize the cost of covering demand points by strategically installing directional servers on facilities. We propose an integer linear model and an initial approach based on column generation decomposition. We conducted extensive computational experiments on different test instances, including a practical case study involving positioning security cameras for surveillance in Valpara & iacute;so, Chile. The results highlight the effectiveness of column generation in achieving optimal solutions or significantly improving solution quality compared with solving the model directly with standard optimization solvers, especially for larger instances. In particular, the column generation algorithm achieves up to a 67% improvement in solution quality compared to the optimization model for real-world size instances, demonstrating its practical applicability and potential for enhancing surveillance infrastructure design.
引用
收藏
页码:87181 / 87198
页数:18
相关论文
共 36 条
[1]   Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning [J].
Alfandari, L. ;
Sadki, J. ;
Plateau, A. ;
Nagih, A. .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) :1938-1946
[2]   The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements [J].
Alvarez-Miranda, Eduardo ;
Goycoolea, Marcos ;
Ljubic, Ivana ;
Sinnl, Markus .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (03) :1013-1029
[3]  
[Anonymous], 1988, Facility Location: Models and Methods
[4]   Generalized coverage: New developments in covering location models [J].
Berman, Oded ;
Drezner, Zvi ;
Krass, Dmitry .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (10) :1675-1687
[5]   Efficient presolving methods for solving maximal covering and partial set covering location problems [J].
Chen, Liang ;
Chen, Sheng-Jie ;
Chen, Wei-Kun ;
Dai, Yu-Hong ;
Quan, Tao ;
Chen, Juan .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 311 (01) :73-87
[6]   THE DYNAMIC SET COVERING PROBLEM [J].
CHRISSIS, JW ;
DAVIS, RP ;
MILLER, DM .
APPLIED MATHEMATICAL MODELLING, 1982, 6 (01) :2-6
[7]   A decomposition approach for the probabilistic maximal covering location-allocation problem [J].
Correa, Francisco de Assis ;
Nogueira Lorena, Luiz Antonio ;
Ribeiro, Glaydston Mattos .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (10) :2729-2739
[8]   CAPACITATED COVERING MODELS [J].
CURRENT, JR ;
STORBECK, JE .
ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, 1988, 15 (02) :153-163
[9]   RATIONALIZING TOOL SELECTION IN A FLEXIBLE MANUFACTURING SYSTEM FOR SHEET-METAL PRODUCTS [J].
DASKIN, M ;
JONES, PC ;
LOWE, TJ .
OPERATIONS RESEARCH, 1990, 38 (06) :1104-1115
[10]  
Daskin M., 2013, Covering Problems, P124