| Full text | |
| Author(s): |
Antunes, Emerson de O.
;
Caetano, Marcos F.
;
Marotta, Marcelo A.
;
Araujo, Aleteia
;
Bondan, Lucas
;
Meneguette, Rodolfo, I
;
Filho, Geraldo P. Rocha
Total Authors: 7
|
| Document type: | Journal article |
| Source: | IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT; v. 19, n. 3, p. 12-pg., 2022-09-01. |
| 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 Base Transceiver Station (BTS), the amount needed, and theirs transmission power to be set that maximizes the coverage area and reduce the interference due to the overlap of signals. 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 in January 2019 in Brumadinho-MG and compared with a heuristic. The performance evaluation results show evidence of efficiencies in terms of quality and resource savings of the proposed solutions. Furthermore, E-ALLOCATOR has been proven to be suitable for a low workload on the network. At the same time, M-ALLOCATOR is suitable for scenarios with a high workload providing almost optimal solutions within the adequate computational time for all problem instances. (AU) | |
| FAPESP's process: | 20/07162-0 - Services for an intelligent transport system |
| Grantee: | Rodolfo Ipolito Meneguette |
| Support Opportunities: | Regular Research Grants |