Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
From MaRDI portal
Publication:394328
DOI10.1016/j.jcss.2013.01.023zbMath1311.90056WikidataQ61736296 ScholiaQ61736296MaRDI QIDQ394328
Fatos Xhafa, Makoto Takizawa, Xavier Herrero, Leonard Barolli, Admir Barolli
Publication date: 27 January 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2013.01.023
simulation; constraint programming; satellite scheduling; ground station scheduling; struggle genetic algorithms
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Stochastic satellite tracking with constrained budget via structured-chromosome genetic algorithms, A mixed integer linear programming model for multi-satellite scheduling, Approximate path searching method for single-satellite observation and transmission task planning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Graph colouring approaches for a satellite range scheduling problem
- Combinatorial optimization techniques for spacecraft scheduling automation
- AFSCN scheduling: how the problem and solution have evolved
- Scheduling space-ground communications for the air force satellite control network