Resumen:
|
Every day, ground stations need to manage numerous requests for allocation of antenna time slots by customers operating satellites. For multi-antenna, multi-site ground networks serving numerous satellite operators, ...[+]
Every day, ground stations need to manage numerous requests for allocation of antenna time slots by customers operating satellites. For multi-antenna, multi-site ground networks serving numerous satellite operators, oftentimes these requests yield conflicts, which arise when two or more satellites request overlapping time slots on the same antenna. Deconflicting is performed by moving passes to other antennas, shortening their duration, or canceling them, and has frequently been done manually. However, when many conflicts are present, deconflicting becomes a complex and time-consuming when done manually. We propose an automated tool that solves the problem by means of Integer Linear Programming. The models include operational constraints and mimic the manual process but consider the problem globally, thus being able to improve the quality of the solution. A simplified shortening model is also included to avoid excessive computation times, which is crucial given that the general problem has been reported NP-complete. Priorities are taken into account by tuning the cost function according to specifications of the requesting clients. Experiments with real-data scenarios using open-source software show that our tool is able to solve the Antenna Satellite assignment problem for a large number of passes in a short amount of time, thus enormously improving manual scheduling operations, even when performed by a skilled operator.
[-]
|
Código del Proyecto:
|
info:eu-repo/grantAgreement/MINECO//MTM2012-31821/ES/BIFURCACIONES Y COMPLEJIDAD DINAMICA EN SISTEMAS DE EVOLUCION TEMPORAL/
...[+]
info:eu-repo/grantAgreement/MINECO//MTM2012-31821/ES/BIFURCACIONES Y COMPLEJIDAD DINAMICA EN SISTEMAS DE EVOLUCION TEMPORAL/
info:eu-repo/grantAgreement/Junta de Andalucía//P09-TEP-5022/ES/Metodologías Para El Diseño, La Planificación Robusta De Redes Y La Operación Mixta Del Transporte Por Ferrocarril. Aspectos Intermodales Y Convergencia Con Las Políticas De La Ue/
info:eu-repo/grantAgreement/MICINN//MTM2010-19576-C02-01/ES/DISEÑO OPTIMO EN REDES LOGISTICAS/
info:eu-repo/grantAgreement/Junta de Andalucía//FQM-5849/ES/Nuevos desafíos de la matemática combinatoria: Enfoques no estándares en optimización discreta y álgebra computacional. Aplicaciones./
info:eu-repo/grantAgreement/Junta de Andalucía//P12-FQM-1658/ES/Formas Normales, Complejidad y Bifurcaciones de Sistemas Dinámicos/
info:eu-repo/grantAgreement/MINECO//MTM2013- 46962-C2-1/ES/Desafíos Matemáticos en el Diseño y Optimización de Redes Complejas: Aplicaciones/
[-]
|
Agradecimientos:
|
The authors gratefully acknowledge the cooperation of Taitus Software (http://www.taitussoftware.com) and its team, and in particular its founder and CEO (Felipe Martin Crespo), which introduced this problem to us and ...[+]
The authors gratefully acknowledge the cooperation of Taitus Software (http://www.taitussoftware.com) and its team, and in particular its founder and CEO (Felipe Martin Crespo), which introduced this problem to us and provided integration with its orbital mechanics visual software SaVoir. We also acknowledge the cooperation of Kongsberg Satellite Services AS (KSAT). Jorge Galan acknowledges financial support through grants MTM2012-31821 and P12-FQM-1658. Federico Perea acknowledges financial support through grants FQM-5849 and P09-TEP-5022 (Junta de Andalucia and FEDER) and MTM2010-19576-C02-01 and MTM2013-46962-C2-1 (MICINN, Spain). Special thanks are due to three anonymous referees for their valuable comments.
[-]
|