Samuel Martínez Zamacola , Francisco Luna Valero , Ramón Martínez Rodríguez-Osorio
{"title":"Hybrid MOEA with problem-specific operators for beam-hopping based resource allocation in multi-beam LEO satellites","authors":"Samuel Martínez Zamacola , Francisco Luna Valero , Ramón Martínez Rodríguez-Osorio","doi":"10.1016/j.swevo.2025.102174","DOIUrl":null,"url":null,"abstract":"<div><div>The efficient allocation of satellite communication resources has become increasingly vital due to the dynamic and growing nature of traffic demand. The beam-hopping resource allocation technique addresses this challenge by enabling sequential and adaptive beam illumination, along with a dynamic distribution of power and bandwidth based on existing user demand. This work formulates the large-dimensional and highly constrained beam-hopping problem for low-power, low earth orbit satellites as a multi-objective optimization problem. It considers three key objectives: unserved capacity (UC), which measures the portion of traffic demand that remains unmet; extra served capacity (EC), which reflects excess traffic delivered beyond the requested demand, indicating possible inefficiencies; and time to serve (TTS), which represents the average waiting time for users in non-illuminated cells. Aiming at innovating in optimization, specialized initialization, crossover, mutation, and local search operators for multi-objective evolutionary algorithms (MOEAs) have been proposed. Performance is assessed through Hypervolume (HV) metrics and statistical confidence analysis. An extensive experimental analysis is presented first for a canonical NSGA-II algorithm, characterizing the impact of the new operators and hybrid components on performance. Then, beyond Pareto-based approaches such as NSGA-II, a study of both decomposition- and indicator-based MOEAs, namely MOEA/D and SMS-EMOA is assessed, demonstrating the generalizability of the presented approach. Compared to previous results in the literature, our hybrid approaches achieve up to 5% improvement in UC, up to 100% gains in EC, and up to 60% improvement in TTS for the best configuration.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"99 ","pages":"Article 102174"},"PeriodicalIF":8.5000,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225003311","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The efficient allocation of satellite communication resources has become increasingly vital due to the dynamic and growing nature of traffic demand. The beam-hopping resource allocation technique addresses this challenge by enabling sequential and adaptive beam illumination, along with a dynamic distribution of power and bandwidth based on existing user demand. This work formulates the large-dimensional and highly constrained beam-hopping problem for low-power, low earth orbit satellites as a multi-objective optimization problem. It considers three key objectives: unserved capacity (UC), which measures the portion of traffic demand that remains unmet; extra served capacity (EC), which reflects excess traffic delivered beyond the requested demand, indicating possible inefficiencies; and time to serve (TTS), which represents the average waiting time for users in non-illuminated cells. Aiming at innovating in optimization, specialized initialization, crossover, mutation, and local search operators for multi-objective evolutionary algorithms (MOEAs) have been proposed. Performance is assessed through Hypervolume (HV) metrics and statistical confidence analysis. An extensive experimental analysis is presented first for a canonical NSGA-II algorithm, characterizing the impact of the new operators and hybrid components on performance. Then, beyond Pareto-based approaches such as NSGA-II, a study of both decomposition- and indicator-based MOEAs, namely MOEA/D and SMS-EMOA is assessed, demonstrating the generalizability of the presented approach. Compared to previous results in the literature, our hybrid approaches achieve up to 5% improvement in UC, up to 100% gains in EC, and up to 60% improvement in TTS for the best configuration.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.