Loading...
Loading...

Go to the content (press return)

Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem

Author
Xhafa, F.; Herrero , X.; Barolli, A.; Barolli, L.; Takizawa, M.
Type of activity
Journal article
Journal
Journal of computer and system sciences
Date of publication
2013-11
Volume
79
Number
7
First page
1086
Last page
1100
DOI
https://doi.org/10.1016/j.jcss.2013.01.023 Open in new window
Repository
http://hdl.handle.net/2117/19681 Open in new window
URL
https://www.sciencedirect.com/science/article/pii/S0022000013000445 Open in new window
Abstract
Ground station scheduling problem arises in spacecraft operations and aims to allocate ground stations to spacecraft to make possible the communication between operations teams and spacecraft systems. The problem belongs to the family of satellite scheduling for the specific case of mapping communications to ground stations. The allocation of a ground station to a mission (e.g. telemetry, tracking information, etc.) has a high cost, and automation of the process provides many benefits not only i...
Citation
Xhafa, F. [et al.]. Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem. "Journal of computer and system sciences", 12 Febrer 2012, vol. 79, núm. 7, p. 1086-1100.
Keywords
Constraint programming, Ground station scheduling, Satellite scheduling, Simulation, Struggle Genetic Algorithms
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

  • Xhafa Xhafa, Fatos  (author)
  • Herrero, Xavier  (author)
  • Barolli, Admir  (author)
  • Barolli, Leonard  (author)
  • Takizawa, Makoto  (author)

Attachments