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.

A matheuristic for joint optimal power and scheduling assignment in DVB-T2 networks / D'Andreagiovanni, F.; Lakhlef, H.; Nardin, A.. - In: ALGORITHMS. - ISSN 1999-4893. - 13:1(2020), pp. 1-18. [10.3390/a13010027]

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

D'Andreagiovanni F.;
2020

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.
2020
13
1
1
18
A matheuristic for joint optimal power and scheduling assignment in DVB-T2 networks / D'Andreagiovanni, F.; Lakhlef, H.; Nardin, A.. - In: ALGORITHMS. - ISSN 1999-4893. - 13:1(2020), pp. 1-18. [10.3390/a13010027]
D'Andreagiovanni, F.; Lakhlef, H.; Nardin, A.
File in questo prodotto:
File Dimensione Formato  
algorithms-13-00027.pdf

Open access

Tipologia: VOR - Versione pubblicata dall'editore
Dimensione 295.99 kB
Formato Adobe PDF
295.99 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1367922
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 3
social impact