Multiobjective evolutionary algorithm for frequency assignment problem in satellite communications
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605470502 | ||
| 003 | CHVBK | ||
| 005 | 20210128100328.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150501xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1337-2 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1337-2 | ||
| 245 | 0 | 0 | |a Multiobjective evolutionary algorithm for frequency assignment problem in satellite communications |h [Elektronische Daten] |c [Jiahai Wang, Yiqiao Cai] |
| 520 | 3 | |a Satellite communications technology leads to an important improvement in our life and world. The frequency assignment problem (FAP) is a fundamental problem in satellite communication system for providing high-quality transmissions. The whole goal of the FAP in satellite communication system is to minimize co-channel interference between two satellite systems by rearranging frequency assignment. Recently, many metaheuristics, including neural networks and evolutionary algorithms, are proposed for this NP-complete problem. All such algorithms formulate the FAP as a single-objective problem, although it obviously has two objectives and thus essentially is a multiobjective optimization problem. This study explicitly formulates FAP as a multiobjective optimization problem and presents a multiobjective evolutionary algorithm based on decomposition (MOEA/D) with a problem-specific subproblem-dependent heuristic assignment (SHA), called MOEA/D-SHA, for the multiobjective FAP. Simulation results show that the MOEA/D-SHA outperforms significantly general-purpose MOEA/D, and an off-the-shelf multiobjective algorithm, i.e., NSGA-II. The advantages of the MOEA/D-SHA over the state-of-the-art single-objective approaches are also shown. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Frequency assignment problem |2 nationallicence | |
| 690 | 7 | |a Multiobjective optimization |2 nationallicence | |
| 690 | 7 | |a Differential evolution |2 nationallicence | |
| 690 | 7 | |a Decomposition |2 nationallicence | |
| 690 | 7 | |a Subproblem-dependent heuristic assignment |2 nationallicence | |
| 700 | 1 | |a Wang |D Jiahai |u Department of Computer Science, Sun Yat-sen University, 510006, Guangzhou, People's Republic of China |4 aut | |
| 700 | 1 | |a Cai |D Yiqiao |u College of Computer Science and Technology, Huaqiao University, 361021, Xiamen, People's Republic of China |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/5(2015-05-01), 1229-1253 |x 1432-7643 |q 19:5<1229 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1337-2 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1337-2 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Wang |D Jiahai |u Department of Computer Science, Sun Yat-sen University, 510006, Guangzhou, People's Republic of China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Cai |D Yiqiao |u College of Computer Science and Technology, Huaqiao University, 361021, Xiamen, People's Republic of China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/5(2015-05-01), 1229-1253 |x 1432-7643 |q 19:5<1229 |1 2015 |2 19 |o 500 | ||