Heuristic Methods for the Antenna-Constrained Beam Layout Optimization on Multibeam Broadcasting Mission - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Heuristic Methods for the Antenna-Constrained Beam Layout Optimization on Multibeam Broadcasting Mission

Résumé

In this paper, we tackle a payload design problem for a broadcasting mission where a telecommunication satellite must provide television services to distinct regions defined as polygons. To cover these polygons, several telecommunication beams are emitted by the satellite, with the risk that they mutually degrade their performance while also being hard to accommodate mechanically on the spacecraft. The problem is to determine a set of non-conflicting beams that cover all the regions and optimize a performance metric related to the sizes of the beams used. The first method is a matheuristic exploiting iterative solv of an ILP model. The second method, called the merge-and-split heuristic, is inspired by Iterated Local Search and reuses a fast graph coloring algorithm to analyze conflicts among selected beams. These two methods are evaluated on realistic instances, the largest one involving more than one hundred regions to cover.
Fichier principal
Vignette du fichier
Lescuyer-ICORES-author-version.pdf (3.07 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04521756 , version 1 (26-03-2024)

Identifiants

Citer

Camille Lescuyer, Christian Artigues, Jean-Thomas Camino, Cédric Pralet. Heuristic Methods for the Antenna-Constrained Beam Layout Optimization on Multibeam Broadcasting Mission. 13th International Conference on Operations Research and Enterprise Systems, Feb 2024, Rome, Italy. pp.294-301, ⟨10.5220/0012380200003639⟩. ⟨hal-04521756⟩
43 Consultations
39 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More