Emerson de O. Antunes

Emerson de O. Antunes

Auto-generated profile, based on publicly available information

Emerson de O. Antunes

Computer Science Department, University of Brasília, Brasília, Brazil

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 March 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
EAEmerson de O. Antunes
Emerson de O. Antunes
MCMarcos F. Caetano
Marcos F. Caetano
MMMarcelo Antonio Marotta
Marcelo Antonio Marotta
AAAleteia Patricia Favacho de Araujo P. F. Araujo
Aleteia Patricia Favacho de Araujo P. F. Araujo
LBLucas Bondan
Lucas Bondan
GFGeraldo Pereira Rocha Filho
Geraldo Pereira Rocha Filho
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.