Matheuristics approaches for the satellite constellation design problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization and Engineering Année : 2023

Matheuristics approaches for the satellite constellation design problem

Julien Floquet
  • Fonction : Auteur
Frédéric Georges
  • Fonction : Auteur

Résumé

In this paper, we propose two novel matheuristic algorithms, i.e., heuristics based on mathematical formulations of the problem, in order to find a good feasible solution to the satellite constellation design problem for discontinuous coverage with a constrained revisit time. This problem consists in searching for a constellation able to periodically observe several targets at the Earth surface with the smallest number of satellites achievable. A Feasibility Pump approach is described: we specifically adapt the Feasibility Pump procedure to our design problem and we report results highlighting the benefits of this approach compared to the base Mixed Integer Nonlinear Programming (MINLP) algorithm it is derived from. Then, we propose a second matheuristic based on the discretized Mixed Integer Linear Programming (MILP) formulation of the problem, which outperforms the plain MILP formulation.

Dates et versions

hal-04221461 , version 1 (28-09-2023)

Identifiants

Citer

Luca Mencarelli, Julien Floquet, Frédéric Georges. Matheuristics approaches for the satellite constellation design problem. Optimization and Engineering, 2023, ⟨10.1007/s11081-023-09834-8⟩. ⟨hal-04221461⟩
21 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More