Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
dc.contributor.author | Xhafa Xhafa, Fatos |
dc.contributor.author | Herrero, Xavier |
dc.contributor.author | Barolli, Admir |
dc.contributor.author | Barolli, Leonard |
dc.contributor.author | Takizawa, Makoto |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2013-06-26T15:48:39Z |
dc.date.created | 2012-02-12 |
dc.date.issued | 2012-02-12 |
dc.identifier.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. |
dc.identifier.issn | 0022-0000 |
dc.identifier.uri | http://hdl.handle.net/2117/19681 |
dc.description.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 in terms of management, but in economic terms as well. The problem is known for its high complexity as it is an over-constrained problem. In this paper, we present the resolution of the problem through Struggle Genetic Algorithms – a version of GAs that distinguishes for its efficiency in maintaining the diversity of the population during genetic evolution. We present some computational results obtained with Struggle GA using the STK simulation toolkit, which showed the efficiency of the method in solving the problem. |
dc.format.extent | 15 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject.lcsh | Constraint programming (Computer science) |
dc.subject.lcsh | Computer algorithms |
dc.subject.lcsh | Space vehicles |
dc.subject.other | Ground station scheduling |
dc.subject.other | Satellite scheduling |
dc.subject.other | Struggle Genetic Algorithms |
dc.subject.other | Constraint programming |
dc.subject.other | Simulation |
dc.title | Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem |
dc.type | Article |
dc.subject.lemac | Programació per restriccions (Informàtica) |
dc.subject.lemac | Algorismes genètics |
dc.subject.lemac | Vehicles espacials |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1016/j.jcss.2013.01.023 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0022000013000445 |
dc.rights.access | Open Access |
local.identifier.drac | 12367089 |
dc.description.version | Postprint (author's final draft) |
dc.date.lift | 10000-01-01 |
local.citation.author | Xhafa, F.; Herrero , X.; Barolli, A.; Barolli, L.; Takizawa, M. |
local.citation.publicationName | Journal of computer and system sciences |
local.citation.volume | 79 |
local.citation.number | 7 |
local.citation.startingPage | 1086 |
local.citation.endingPage | 1100 |
Files in this item
This item appears in the following Collection(s)
-
Articles de revista [901]
-
Articles de revista [244]
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain