Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.3390/a13010027 | ALGORITHMS |
Keywords | Field | DocType |
telecommunications,DVB-T,antenna design,network optimization,mixed integer linear programming,tight linear relaxations,matheuristics,ILP heuristics | DVB-T2,Mathematical optimization,DVB-T,Scheduling (computing),Software,Integer programming,Solver,Digital Video Broadcasting,Genetic algorithm,Mathematics | Journal |
Volume | Issue | Citations |
13 | 1 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabio D'Andreagiovanni | 1 | 0 | 0.34 |
| Hicham Lakhlef | 2 | 112 | 16.86 |
| Antonella Nardin | 3 | 38 | 3.14 |