A matheuristic for joint optimal power and scheduling assignment in DVB-T2 networks

6Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Because of the introduction and spread of the second generation of the Digital Video Broadcasting-Terrestrial standard (DVB-T2), already active television broadcasters and new broadcasters that have entered in the market will be required to (re)design their networks. This is generating a new interest for effective and efficient DVB optimization software tools. In this work, we propose a strengthened binary linear programming model for representing the optimal DVB design problem, including power and scheduling configuration, and propose a new matheuristic for its solution. The matheuristic combines a genetic algorithm, adopted to efficiently explore the solution space of power emissions of DVB stations, with relaxation-guided variable fixing and exact large neighborhood searches formulated as integer linear programming (ILP) problems solved exactly. Computational tests on realistic instances show that the new matheuristic performs much better than a state-of-the-art optimization solver, identifying solutions associated with much higher user coverage.

Cite

CITATION STYLE

APA

D’Andreagiovanni, F., Lakhlef, H., & Nardin, A. (2020). A matheuristic for joint optimal power and scheduling assignment in DVB-T2 networks. Algorithms, 13(1). https://doi.org/10.3390/a13010027

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free