A comparison study on meta-heuristics for ground station scheduling problem
Visualitza/Obre
Cita com:
hdl:2117/105018
Tipus de documentText en actes de congrés
Data publicació2014
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
In ground station scheduling problem the aim is to compute an optimal planning of communications between Spacecrafts (SCs) and operations teams of Ground Stations (GSs). While such allocation of tasks to ground stations traditionally is mostly done by human intervention, modern scheduling systems look at optimization and automation features. Such features, on the one hand, would increase the efficiency and productivity of the mission planning systems by handling a larger number of missions, achieve a higher usage of the infrastructure (grand stations' antennae) and, on the other, would avoid error-prone human allocation and reduce human labour costs. Designing such modern, automated scheduling/planning systems is however challenging due to the highly constraint and complex nature of the problem seeking to optimize along various objectives or system parameters. In this paper we present a study on the performance of several meta-heuristics methods for solving ground station scheduling problem. Local search methods (Hill Climbing, Simulated Annealing and Tabu Search) and population-based methods (GA, Steady State GA and Struggle GA) have been considered for the study. The performance of these resolution methods was measured by a set of instances of varying size and complexity generated by STK toolkit. The study revealed the strengths and weaknesses of the considered methods while solving different size instances and considering several objective functions, namely, windows fitness, clashes fitness, time requirement fitness, and resource usage fitness.
CitacióXhafa, F., Herrero , X., Barolli, A., Takizawa, M. A comparison study on meta-heuristics for ground station scheduling problem. A: International Conference on Network-Based Information Systems. "2014 International Conference on Network-Based Information Systems, NBiS 2014, 10-12 September 2014, University of Salerno, Salerno, Italy: proceedings". Salerno: Institute of Electrical and Electronics Engineers (IEEE), 2014, p. 172-179.
ISBN978-1-4799-4226-8
Versió de l'editorhttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7023950
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
FX_EtAl_NBiS-2014-Paper-MH.pdf | 2,249Mb | Visualitza/Obre |