Chunchun Ma , Panxing Huang , Xiaoze Liu , Chu-ge Wu , Rui Xu
{"title":"敏捷对地观测卫星任务调度问题的混合估计分布算法","authors":"Chunchun Ma , Panxing Huang , Xiaoze Liu , Chu-ge Wu , Rui Xu","doi":"10.1016/j.swevo.2025.101971","DOIUrl":null,"url":null,"abstract":"<div><div>Agile Earth Observing Satellites (AEOSs) represent a new generation of Earth observation satellites, widely used for various observation tasks. To efficiently utilize the visible and observing durations of the orbiting AEOS, the AEOS scheduling problem (AEOSSP) is formulated to maximize the overall observation profit while satisfying the complex operational constraints. In this paper, a hybrid Estimation of Distribution Algorithm (EDA) that incorporates three knowledge-oriented local search operators is proposed to efficiently solve the AEOSSP. The multiple multidimensional knapsack problem with conflicts (MMdKPC) is first modeled and used to formulate AEOSSP. An EDA probability model as well as its updating and sampling mechanisms, is designed to generate solutions to explore the solution space and generate potential solutions. In addition, based on the characteristics of MMdKPC, three knowledge-oriented local search operators are developed to improve the solution. Based on the benchmark instances and simulation data provided sampled from Satellite Tool Kit, the comparison simulation experiments are carried out. The results validate the effectiveness of three knowledge-oriented local search operators, respectively. Additionally, the proposed hybrid EDA performs better compared to the existing state-of-the-art algorithms in terms of overall observation profit.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101971"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A hybrid estimation of distribution algorithm for agile earth observing satellite task scheduling problem\",\"authors\":\"Chunchun Ma , Panxing Huang , Xiaoze Liu , Chu-ge Wu , Rui Xu\",\"doi\":\"10.1016/j.swevo.2025.101971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Agile Earth Observing Satellites (AEOSs) represent a new generation of Earth observation satellites, widely used for various observation tasks. To efficiently utilize the visible and observing durations of the orbiting AEOS, the AEOS scheduling problem (AEOSSP) is formulated to maximize the overall observation profit while satisfying the complex operational constraints. In this paper, a hybrid Estimation of Distribution Algorithm (EDA) that incorporates three knowledge-oriented local search operators is proposed to efficiently solve the AEOSSP. The multiple multidimensional knapsack problem with conflicts (MMdKPC) is first modeled and used to formulate AEOSSP. An EDA probability model as well as its updating and sampling mechanisms, is designed to generate solutions to explore the solution space and generate potential solutions. In addition, based on the characteristics of MMdKPC, three knowledge-oriented local search operators are developed to improve the solution. Based on the benchmark instances and simulation data provided sampled from Satellite Tool Kit, the comparison simulation experiments are carried out. The results validate the effectiveness of three knowledge-oriented local search operators, respectively. Additionally, the proposed hybrid EDA performs better compared to the existing state-of-the-art algorithms in terms of overall observation profit.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"96 \",\"pages\":\"Article 101971\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-05-15\",\"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/S2210650225001294\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001294","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
A hybrid estimation of distribution algorithm for agile earth observing satellite task scheduling problem
Agile Earth Observing Satellites (AEOSs) represent a new generation of Earth observation satellites, widely used for various observation tasks. To efficiently utilize the visible and observing durations of the orbiting AEOS, the AEOS scheduling problem (AEOSSP) is formulated to maximize the overall observation profit while satisfying the complex operational constraints. In this paper, a hybrid Estimation of Distribution Algorithm (EDA) that incorporates three knowledge-oriented local search operators is proposed to efficiently solve the AEOSSP. The multiple multidimensional knapsack problem with conflicts (MMdKPC) is first modeled and used to formulate AEOSSP. An EDA probability model as well as its updating and sampling mechanisms, is designed to generate solutions to explore the solution space and generate potential solutions. In addition, based on the characteristics of MMdKPC, three knowledge-oriented local search operators are developed to improve the solution. Based on the benchmark instances and simulation data provided sampled from Satellite Tool Kit, the comparison simulation experiments are carried out. The results validate the effectiveness of three knowledge-oriented local search operators, respectively. Additionally, the proposed hybrid EDA performs better compared to the existing state-of-the-art algorithms in terms of overall observation profit.
期刊介绍:
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.