Show simple item record

dc.contributor.authorXhafa Xhafa, Fatos
dc.contributor.authorHerrero, Xavier
dc.contributor.authorBarolli, Admir
dc.contributor.authorBarolli, Leonard
dc.contributor.authorTakizawa, Makoto
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2013-06-26T15:48:39Z
dc.date.created2012-02-12
dc.date.issued2012-02-12
dc.identifier.citationXhafa, 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.issn0022-0000
dc.identifier.urihttp://hdl.handle.net/2117/19681
dc.description.abstractGround 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.extent15 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject.lcshConstraint programming (Computer science)
dc.subject.lcshComputer algorithms
dc.subject.lcshSpace vehicles
dc.subject.otherGround station scheduling
dc.subject.otherSatellite scheduling
dc.subject.otherStruggle Genetic Algorithms
dc.subject.otherConstraint programming
dc.subject.otherSimulation
dc.titleEvaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
dc.typeArticle
dc.subject.lemacProgramació per restriccions (Informàtica)
dc.subject.lemacAlgorismes genètics
dc.subject.lemacVehicles espacials
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1016/j.jcss.2013.01.023
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/pii/S0022000013000445
dc.rights.accessOpen Access
local.identifier.drac12367089
dc.description.versionPostprint (author's final draft)
dc.date.lift10000-01-01
local.citation.authorXhafa, F.; Herrero , X.; Barolli, A.; Barolli, L.; Takizawa, M.
local.citation.publicationNameJournal of computer and system sciences
local.citation.volume79
local.citation.number7
local.citation.startingPage1086
local.citation.endingPage1100


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain