Name
Title | ||
|---|---|---|
Minimising longest path length in communication satellite payloads via metaheuristics |
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2463372.2463535 | GECCO |
Keywords | DocType | Citations |
last year,wilcoxon test,difficult problem,initial step,longest channel path,real-world problem instance,bigger payload,hybrid approach,communication satellite payload,initial configuration problem,longest path length,communication satellite,metaheuristics | Conference | 1 |
PageRank | References | Authors |
0.42 | 3 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Apostolos Stathakis | 1 | 5 | 1.42 |
| Grégoire Danoy | 2 | 239 | 33.33 |
| Julien Schleich | 3 | 48 | 5.32 |
| Bouvry, Pascal | 4 | 706 | 51.54 |
| Gianluigi Morelli | 5 | 23 | 2.99 |