Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

58.698 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
FX_EtAl_STRUGGLE-GA-Ground-Sched-SI-JCSS.pdf (1,757Mb)
Share:
 
 
10.1016/j.jcss.2013.01.023
 
  View Usage Statistics
Cita com:
hdl:2117/19681

Show full item record
Xhafa Xhafa, FatosMés informacióMés informacióMés informació
Herrero, Xavier
Barolli, Admir
Barolli, Leonard
Takizawa, Makoto
Document typeArticle
Defense date2012-02-12
Rights accessOpen Access
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
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.
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. 
URIhttp://hdl.handle.net/2117/19681
DOI10.1016/j.jcss.2013.01.023
ISSN0022-0000
Publisher versionhttps://www.sciencedirect.com/science/article/pii/S0022000013000445
Collections
  • Departament de Ciències de la Computació - Articles de revista [941]
  • ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals - Articles de revista [245]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
FX_EtAl_STRUGGLE-GA-Ground-Sched-SI-JCSS.pdf1,757MbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina