A hybrid estimation of distribution algorithm for agile earth observing satellite task scheduling problem

被引:0
作者
Ma, Chunchun [1 ]
Huang, Panxing [2 ,3 ]
Liu, Xiaoze [1 ]
Wu, Chu-ge [4 ]
Xu, Rui [1 ]
机构
[1] Beijing Inst Technol, Sch Aerosp Engn, Beijing 100081, Peoples R China
[2] Beijing Inst Control Engn, Beijing 100094, Peoples R China
[3] Natl Key Lab Space Intelligent Control, Beijing 100094, Peoples R China
[4] Beijing Inst Technol, Sch Automat, Beijing 100081, Peoples R China
基金
中国国家自然科学基金;
关键词
Agile earth observing satellite task scheduling; Multiple multidimensional knapsack problem; with conflicts; Estimation of distribution algorithm; Intelligent optimization algorithm; Knowledge-oriented scheduling;
D O I
10.1016/j.swevo.2025.101971
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Agile Earth Observing Satellites (AEOSs) represent a new generation of Earth observation satellites, used for various observation tasks. To efficiently utilize the visible and observing durations of the AEOS, the AEOS scheduling problem (AEOSSP) is formulated to maximize the overall observation profit 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 AEOSSP. The multiple multidimensional knapsack problem with conflicts (MMdKPC) is first modeled and 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 characteristics of MMdKPC, three knowledge-oriented local search operators are developed to improve solution. Based on the benchmark instances and simulation data provided sampled from Satellite Tool 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.
引用
收藏
页数:16
相关论文
共 40 条
[1]   Very large-scale neighborhood search for the K-Constraint Multiple Knapsack Problem [J].
Ahuja, R ;
Cunha, C .
JOURNAL OF HEURISTICS, 2005, 11 (5-6) :465-481
[2]   Model and algorithms for multi-period sea cargo mix problem [J].
Ang, James S. K. ;
Cao, Chengxuan ;
Ye, Heng-Qing .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 180 (03) :1381-1393
[3]  
[Anonymous], Ansys STK digital mission engineering software
[4]  
Baluja S., 1994, Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning
[5]  
Basnet Chuda, 2018, International Journal of Operational Research, V32, P514
[6]   Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems [J].
Cacchiani, Valentina ;
Iori, Manuel ;
Locatelli, Alberto ;
Martello, Silvano .
COMPUTERS & OPERATIONS RESEARCH, 2022, 143
[7]   Three multi-objective memetic algorithms for observation scheduling problem of active-imaging agile earth observation satellites [J].
Chang, Zhongxiang ;
Zhou, Zhongbao .
ANNALS OF OPERATIONS RESEARCH, 2025, 346 (02) :861-893
[8]   Solving satellite image data downlink scheduling problem with family attribute via a bi-stage differential evolutionary algorithm [J].
Chang, Zhongxiang ;
Zhou, Zhongbao ;
Liu, Xiaolu .
APPLIED SOFT COMPUTING, 2024, 164
[9]   Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm [J].
Chang, Zhongxiang ;
Punnen, Abraham P. ;
Zhou, Zhongbao ;
Cheng, Shi .
COMPUTERS & OPERATIONS RESEARCH, 2023, 160
[10]   Observation scheduling for a state-of-the-art SAREOS: Two adaptive multi-objective evolutionary algorithms [J].
Chang, Zhongxiang ;
Zhou, Zhongbao ;
Li, Ruiyang ;
Xiao, Helu ;
Xing, Lining .
COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169