SearcharxivSearch

arXiv subjects

Pasquale Avella

Publications and source records attributed to Pasquale Avella.

3 recordsLinked to original sources

Speeding up the solution of the Site and Power Assignment Problem in Wireless Networks

This paper addresses the optimal design of wireless networks through the site and power assignment problem. Given a set of candidate transmitters, this problem involves choosing optimal transmitter locations and powers to provide service coverage over a target area. In the modern context of increasing traffic, establishing suitable locations and power emissions for the transmitters in wireless networks is a relevant and challenging task due to heavy radio spectrum congestion. Traditional network design formulations are very ill-conditioned and suffer from numerical inaccuracies and limited applicability to large-scale practical scenarios. Our contribution consists of speeding up the solution of the problem under consideration by addressing its drawbacks from a modeling point of view. We propose valid cutting planes and various presolve operations to reduce the problem size and strengthen existing formulations, along with a reduction scheme based on reduced cost fixing to reduce the sources of numerical inaccuracies. Our proposals prove effective, allowing us to achieve optimality on large-scale instances obtained from a real 4G LTE network in solution times aligning well with planning windows.

cs.DM

Power Reduction in FM Networks by Mixed-Integer Programming. A Case Study

The climate change emergency calls for a reduction in energy consumption in all human activities and production processes. The radio broadcasting industry is no exception. However, reducing energy requirements by uniformly cutting the radiated power at every transmitter can potentially impair the quality of service. A careful evaluation and optimization study are in order. In this paper, by analyzing the Italian frequency modulation analog broadcasting service, we show that it is indeed possible to significantly reduce the energy consumption of the broadcasters without sacrificing the quality of the service, rather, even getting improvements.

math.OC

A computational study of off-the-shelf MINLP solvers on a benchmark set of congested capacitated facility location problems

This paper analyzes the performance of five well-known off-the-shelf optimization solvers on a set of congested capacitated facility location problems formulated as mixed-integer conic programs (MICPs). We aim to compare the computational efficiency of the solvers and examine the solution strategies they adopt when solving instances with different sizes and complexity. The solvers we compare are Gurobi, Cplex, Mosek, Xpress, and Scip. We run extensive numerical tests on a testbed of 30 instances from the literature. Our results show that Mosek and Gurobi are the most competitive solvers, as they achieve better time and gap performance, solving most instances within the time limit. Mosek outperforms Gurobi in large-size problems and provides more accurate solutions in terms of feasibility. Xpress solves to optimality about half of the instances tested within the time limit, and in this half, it achieves performance similar to that of Gurobi and Mosek. Cplex and Scip emerge as the least competitive solvers. The results provide guidelines on how each solver behaves on this class of problems and highlight the importance of choosing a solver suited to the problem type.

math.OC