Artículo
A mixed integer linear programming model for resolution of the antenna-satellite scheduling problem
Autor/es | Linares López, Lorena
Vázquez Valenzuela, Rafael Perea Rojas-Marcos, Federico Galán Vioque, Jorge Francisco |
Departamento | Universidad de Sevilla. Departamento de Ingeniería Aeroespacial y Mecánica de Fluidos Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) |
Fecha de publicación | 2024-02 |
Fecha de depósito | 2024-02-23 |
Publicado en |
|
Resumen | This article deals with one of the types of “Satellite Range Scheduling” problems arising in Earth Observation Satellite operations, Antenna-Satellite Scheduling. Given a set of satellites, a set of available antennas and ... This article deals with one of the types of “Satellite Range Scheduling” problems arising in Earth Observation Satellite operations, Antenna-Satellite Scheduling. Given a set of satellites, a set of available antennas and a time horizon, the problem consists of designing an operational plan that assigns satellites to antennas in an optimal fashion. Extending a previous integer linear programming (ILP) model (shortening model, with only integer variables), we propose a mixed ILP (MILP) (shaving model, which includes both continuous and integer variables), to more efficiently solve this problem. After computing the passes generated by the satellites' windows of visibility from the antennas, the optimal planner is able to cancel a pass, move it to another antenna, or shorten its duration, in order to avoid scheduling conflicts. In contrast to the shortening model, which used intersections between passes to determine the best schedule, the shortening operation is now referred to as shaving, since the shaving model can arbitrarily adjust the duration of a pass in a razor-like fashion, giving the model its name. Computational results obtained in tests over realistic scenarios prove that the shaving model outperforms the shortening model, producing fewer cancellations, smaller shaved times, and a fairer distribution of cancelled passes among satellites, with much shorter preprocessing times. |
Agencias financiadoras | European Union Agencia Estatal de Investigación. España European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER) Junta de Andalucía Ministerio de Ciencia e Innovación (MICIN). España |
Identificador del proyecto | MCIN/AEI/10.13039/501100011033
TED2021-132099B-C33 PID2020-114594GB-C21 PID2021-124975OBI00 FEDERUS-1256951 AT21_00032 PID2021-123200NB-I00 |
Cita | Linares López, L., Vázquez Valenzuela, R., Perea Rojas-Marcos, F. y Galán Vioque, J.F. (2024). A mixed integer linear programming model for resolution of the antenna-satellite scheduling problem. IEEE Transactions on Aerospace and Electronic Systems, 60 (1), 463-473. https://doi.org/10.1109/TAES.2023.3326422. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A mixed integer linear programming ... | 1.791Mb | [PDF] | Ver/ | |