Soluções Otimizadas para o Problema de Localização de Máxima Cobertura em Redes Militarizadas 4G/LTE
Abstract
This work proposes to solve the maximal covering location problem of the Mobile Operations Coordination Center (CCOp Mv), which aims to support the operational command of the Brazilian Army. This problem consists of selecting, in a limited region and with poor communication infrastructure to the ground troops's operating area, the positions of vehicles equipped with antennas that maximize the coverage area. For this reason, analytical modeling based on the mixed-integer linear problem was proposed that guided two optimization solutions: (i) E-ALLOCATOR – Exact ALLOCATiOn seRvice; and (ii) M-ALLOCATOR – Metaheuristic ALLOCATiOn seRvice. The solutions were evaluated in a scenario that employs CCOp Mv to support a rescue operation based on the tragedy that occurred in January 2019 in Brumadinho-MG. The results showed that E-ALLOCATOR is suitable for a low workload on the network, while M-ALLOCATOR is suitable for scenarios with a high workload. Furthermore, the results indicate that M-ALLOCATOR provides almost optimal solutions within the adequate computational time for all instances of the problem.
References
Alizadeh, R., Nishi, T., Bagherinejad, J., and Bashiri, M. (2021). Multi-period maximal covering location problem with capacitated facilities and modules for natural disaster relief services. Applied Sciences, 11(1):397.
Atta, S., Mahapatra, P. R. S., and Mukhopadhyay, A. (2018). Solving maximal covering location problem using genetic algorithm with local refinement. Soft Computing, 22(12):3891–3906.
Bagherinejad, J. and Shoeib, M. (2018). Dynamic capacitated maximal covering location problem by considering dynamic capacity. International Journal of Industrial Engineering Computations, 9(2):249–264.
Church, R. and ReVelle, C. (1974). The maximal covering location problem. In Papers of the regional science association, volume 32, pages 101–118. Springer-Verlag.
Costa, V. O. (2016). Alocação de antenas para rede celular de 4g utilizando algoritmos meméticos. Dissertação de Mestrado.
Farahani, R. Z., Asgari, N., Heidari, N., Hosseininia, M., and Goh, M. (2012). Covering problems in facility location: A review. Computers & Industrial Engineering, 62(1):368–407.
Gazani, M. and Niaki, S. (2021). The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach. International Journal of Industrial Engineering Computations, 12(1):79–90.
Mathar, R. and Niessen, T. (2000). Optimum positioning of base stations for cellular radio networks. Wireless Networks, 6(6):421–428.
Mehboob, U., Qadir, J., Ali, S., and Vasilakos, A. (2016). Genetic algorithms in wireless networking: techniques, applications, and issues. Soft Computing, 20(6):2467–2501.
Rappaport, T. S. et al. (1996). Wireless communications: principles and practice, volume 2. Prentice Hall PTR New Jersey.
Seda, P., Seda, M., and Hosek, J. (2020). On mathematical modelling of automated coverage optimization in wireless 5g and beyond deployments. Applied Sciences, 10(24):8853.
Seybold, J. S. (2005). Introduction to RF propagation. John Wiley & Sons.
Yang, P., Xiao, Y., Zhang, Y., Zhou, S., Yang, J., and Xu, Y. (2020). The continuous maximal covering location problem in large-scale natural disaster rescue scenes. Computers Industrial Engineering, 146:106608.
