Apostolos Stathakis
ABSTRACT
The size and complexity of communication satellite payloads have been increasing very quickly over the last years and their configuration / reconfiguration have become very difficult problems. In this work, we propose to compare the efficiency of three well-known metaheuristic methods to solve an initial configuration problem, which objective is to minimise the length of the longest channel path. Experiments are conducted on real-world problem instances with realistic operational constraints (e.g., a maximum computation time of 10 minutes) and Wilcoxon test is used to determine with statistical confidence what technique is more suitable and what are its limitations. The results of this work will serve as an initial step in our research to design hybrid approaches to push even further the solving capabilities, i.e., tackling bigger payloads and more channels to activate.
- Ibm ilog cplex. http://www.ilog.com/products/cplex/.Google Scholar
- T. Achterberg. SCIP - a framework to integrate constraint and mixed integer programming. Technical Report 04-19, Zuse Institute Berlin, 2004.Google Scholar
- E. Alba and B. Dorronsoro. Cellular Genetic Algorithms. Operations Research/Compuer Science Interfaces. Springer-Verlag Heidelberg, 2008. Google ScholarDigital Library
- C. Balty, J.-D. Gayrard, and P. Agnieray. Communication satellites to enter a new age of flexibility. Acta Astronautica, 65(1-2):75--81, 2009.Google ScholarCross Ref
- S. Cahon, N. Melab, and E.-G. Talbi. Paradiseo: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics, 10(3):357--380, May 2004. Google ScholarDigital Library
- J. Chaumon, J. Gil, T. Beech, and G. Garcia. Smartrings: advanced tool for communications satellite payload reconfiguration. In Aerospace Conference, 2006 IEEE, page 11 pp., 2006.Google ScholarCross Ref
- S. Gulgonul, E. Koklukaya, I. Erturk, and A. Y. Tesneli. Communication satellite payload redundancy reconfiguration. In Satellite Telecommunications (ESTEL), 2012 IEEE First AESS European Conference on, pages 1--4, oct. 2012.Google ScholarCross Ref
- J. Kennedy and R. Eberhart. Particle swarm optimization. In Neural Networks, 1995. Proceedings., IEEE International Conference on, volume 4, pages 1942--1948 vol.4. IEEE, Nov. 1995.Google ScholarCross Ref
- A. Stathakis, G. Danoy, P. Bouvry, and G. Morelli. Satellite payload reconfiguration optimisation: An ilp model. In J.-S. Pan, S.-M. Chen, and N. T. Nguyen, editors, ACIIDS (2), volume 7197 of Lecture Notes in Computer Science, pages 311--320. Springer, 2012. Google ScholarDigital Library
- A. Stathakis, G. Danoy, T. Veneziano, J. Schleich, and P. Bouvry. Optimising satellite payload reconfiguration: An ilp approach for minimising channel interruptions. In 2nd ESA Workshop on Advanced Flexible Telecom Payloads, pages 1--8. European Space Agency, 2012.Google Scholar
- TRECS. Transponder reconfiguration system {online}. http://www.integ.com/TRECS.html.Google Scholar
- F. Wilcoxon. Individual Comparisons by Ranking Methods. Biometrics Bulletin, 1(6):80--83, 1945.Google ScholarCross Ref
Index Terms
- Minimising longest path length in communication satellite payloads via metaheuristics
Recommendations
Metaheuristics for large-scale instances of the linear ordering problem
ILS and GDA metaheuristics for the linear ordering problem are introduced.They are able to tackle large instances in line with real applications.Introduced methods are the first of their kind ever applied to large-sized instances.All best known ...
A Time-Efficient Method for Metaheuristics: Using Tabu Search and Tabu GA as a Case
HIS '09: Proceedings of the 2009 Ninth International Conference on Hybrid Intelligent Systems - Volume 02This paper presents an efficient algorithm for reducing the computation time of metaheuristics. The proposed algorithm is motivated by the observation that some of the subsolutions of metaheuristics will eventually end up being part of the final ...
Integrating matheuristics and metaheuristics for timetabling
The High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work ...
Comments