Preference-Based Evolutionary Many-Objective Optimization for Agile Satellite Mission Planning
Open accessThe DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
With the development of aerospace technologies, the mission planning of agile earth observation satellites has to consider several objectives simultaneously, such as profit, observation task number, image quality, resource balance, and observation timeliness. In this paper, a five-objective mixed-integer optimization problem is formulated for agile satellite mission planning. Preference-based multi-objective evolutionary algorithms, i.e., T-MOEA/D-TCH, T-MOEA/D-PBI, and T-NSGA-III are applied to solve the problem. Problem-specific coding and decoding approaches are proposed based on heuristic rules. Experiments have shown the advantage of integrating preferences in many-objective satellite mission planning. A comparative study is conducted with other state-of-the-art preference-based methods (T-NSGA-II, T-RVEA, and MOEA/D-c). Results have demonstrated that the proposed T-MOEA/D-TCH has the best performance with regard to IGD and elapsed runtime. An interactive framework is also proposed for the decision maker to adjust preferences during the search. We have exemplified that a more satisfactory solution could be gained through the interactive approach.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053 · cited 1×
“The framework of NSGA-III keeps the same as the wellknown NSGA-II [32], but replaces the crowding distance with a niche-preservation selection.”
Use of Ranks in One-Criterion Variance Analysis
Kruskal, W. H., & Wallis, W. A. (1952) · Journal of the American Statistical Association · doi:10.1080/01621459.1952.10483441 · Cited by 13,912 · cited 1×
“Kruskal-Wall test [35] is adopted to test whether some results are from the same distribution.”
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069 · cited 2×
“Two well-known MOEAs, MOEA/D [28] and NSGA-III [29] are employed to embed the preference information.”
BackgroundMethodDeb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133 · cited 3×
“Two well-known MOEAs, MOEA/D [28] and NSGA-III [29] are employed to embed the preference information.”
MethodPerformance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330 · cited 6×
“T-NSGA-II is better than T-NSGA-III with regard to the IGD values, but it takes T-NSGA-II almost twice time to have a single run, comparing with T-NSGA-III.”
MethodInfluentialMultiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543 · cited 1×
“T-MOEA/D is based on MOEA/D [31], the main differences for preference incorporation are underlined in Algorithm 1.”
BackgroundUse of Ranks in One-Criterion Variance Analysis
Kruskal, W., & Wallis, W. A. (1952) · Journal of the American Statistical Association · doi:10.2307/2280779 · Cited by 2,455
Multiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255
A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & Sendhoff, B. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2519378 · Cited by 1,760
Many-Objective Evolutionary Algorithms: A Survey
Li, B., Li, J., Tang, K., & Yao, X. (2015) · ACM Computing Surveys · doi:10.1145/2792984 · Cited by 815
Self-citation
Research works printed but not linked: 1
- sun, 2012, Multi-objective mission planning problem of agile Earth observing satellites, AIAA J, 4, 2802
Cited by
Wang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260
“Metaheuristic 31 GA [3, 64, 77, 66], ACO [37, 60], EA for multi-objective AEOSSP [56, 14, 15, 44, 45, 46, 78, 47, 49, 48, 28, 50], Tabu search [79, 80, 39, 81], local search [63, 65, 5, 82, 83, 17, 84, 56], Russian Dolls [85]”
BackgroundMethodInfluentialWei, L., Chen, Y., Chen, M., & Chen, Y. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107607 · Cited by 115
Champasak, P., Panagant, N., Pholdee, N., Bureerat, S., & Yıldız, A. R. (2020) · Aerospace Science and Technology · doi:10.1016/j.ast.2020.105783 · Cited by 103
Zhao, X., Wang, Z., & Zheng, G. (2020) · Journal of Aerospace Information Systems · doi:10.2514/1.i010754 · Cited by 53
Wei, L., Xing, L., Wan, Q., Song, Y., & Chen, Y. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107530 · Cited by 54
Agile Earth Observation Satellite Scheduling With a Quantum Annealer
Stollenwerk, T., Michaud, V., Lobe, E., Picard, M., Basermann, A., & Botter, T. (2021) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2021.3088490 · Cited by 56
Wei, L., Chen, M., Xing, L., Wan, Q., Song, Y., Chen, Y., & Chen, Y. (2024) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2023.101460 · Cited by 51
Peng, S., Chen, H., Du, C., Li, J., & Ning, J. (2018) · IEEE Access · doi:10.1109/access.2018.2877687 · Cited by 50
“In the batch-based planning approach, planning is considered a batch process and the onboard planner schedules the observation tasks in a relatively long-term planning horizon (one to several days) [4]–[6].”
BackgroundSelf-citationSatellite Scheduling Problems: A survey of applications in Earth and outer space observation
Ferrari, B., Cordeau, J., Delorme, M., Iori, M., & Orosei, R. (2024) · Computers & Operations Research · doi:10.1016/j.cor.2024.106875 · Cited by 62
Joint Observation and Transmission Scheduling in Agile Satellite Networks
He, L., Liang, B., Li, J., & Sheng, M. (2021) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2021.3076088 · Cited by 38
“In [14], the authors considered a many-objective agile satellite mission planning problem.”
BackgroundSelf-citationService Chaining Placement Based on Satellite Mission Planning in Ground Station Networks
Gao, X., Liu, R., & Kaushik, A. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.3045432 · Cited by 30
“In [36], the authors formulated the agile satellite mission planning problem as a mixed integer optimization problem and addressed that by a preference-based evolutionary multiple objective optimization.”
Chen, J., Chen, M., Wen, J., He, L., & Liu, X. (2022) · Mathematics · doi:10.3390/math10193498 · Cited by 26
Yu, Y., Hou, Q., Zhang, J., & Zhang, W. (2020) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2020.06.023 · Cited by 22
Wei, L., Cui, Y., Chen, M., Wan, Q., & Xing, L. (2025) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2025.101857 · Cited by 16
Wang, Z., Li, Q., Yang, Q.-T., & Ishibuchi, H. (2021) · Complex & Intelligent Systems · doi:10.1007/s40747-021-00543-2 · Cited by 14
Yang, Q.-T., Wang, Z., & Ishibuchi, H. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-72062-9_1 · Cited by 10
A Hybrid Many-Objective Evolutionary Algorithm With Region Preference for Decision Makers
Xiong, M., Xiong, W., & Liu, C. (2019) · IEEE Access · doi:10.1109/access.2019.2931742 · Cited by 9
“Among the above preference-based algorithms, we select T-MOEA/D andT-NSGA-III [33] for comparison.”
MethodInteractive MOEA/D with multiple types of preference information
Lárraga, G., & Miettinen, K. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3534013 · Cited by 7
“[16] utilize the preferred ranges provided by the DM to transform the solutions in a new coordinate system with the lower bound as the origin.”
MethodDecomposition Based Multi-objectives Evolutionary Algorithms Challenges and Circumvention
Omran, S. M., El-Behaidy, W. H., & Youssif, A. A. A. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-52246-9_6 · Cited by 8
Weapon target assignment strategy for multi-missile cooperative guidance with auction algorithm
Li, Q., Dong, X., Li, Q., Yu, J., & Ren, Z. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9550060 · Cited by 7
“[14] compares a variety of multi-objective optimization algorithms for agile satellite mission planning, and puts forward an interactive framework to help decision makers adjust parameters.”
BackgroundWang, Y., Liu, J., Yin, Y., Tong, Y., & Liu, J. (2022) · Wireless Communications and Mobile Computing · doi:10.1155/2022/1927937 · Cited by 6
“The results show that the performance of this method is remarkable [21].”
MethodAn Innovative Priority-Aware Mission Planning Framework for an Agile Earth Observation Satellite
Zhu, G., Zheng, Z., Ouyang, C., Guo, Y., & Sun, P. (2025) · Aerospace · doi:10.3390/aerospace12040309 · Cited by 4
A Two-Stage Adjustment Strategy for Space Division Based Many-Objective Evolutionary Optimization
Zhong, W., Hu, X., Lu, F., Wang, J., Liu, X., & Chen, Y. (2020) · IEEE Access · doi:10.1109/access.2020.3034754 · Cited by 4
“Six test instances from agile satellite task planning [58] are employed to compare the performance of the TSAS with the five comparison algorithms.”
MethodYing, W., Huang, J., Wu, Y., Deng, Y., Xie, Y., Wang, Z., & Lin, Z. (2020) · Information Sciences · doi:10.1016/j.ins.2020.03.093 · Cited by 4
A Preference-based Multiobjective Evolutionary Algorithm Based on Weight Vector Adjustment Strategy
Tang, H., Liu, X., Zheng, J., & Tian, C. (2021) · International Conference on Computational Intelligence and Applications (ICCIA) · doi:10.1109/iccia52886.2021.00018 · Cited by 3
Vasegaard, A. E., Picard, M., Nielsen, P. A., & Saha, S. (2024) · IEEE Access · doi:10.1109/access.2024.3366454 · Cited by 4
“The work by Li et al. [34] showed great promise as the preference-based algorithms t-NSGA-III are compared with other state-of-the-art MOEAs.”
BackgroundWang, B., Feng, Y., Zhang, G., Zhang, L., & Yang, Y. (2024) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2024.3429302 · Cited by 6
Task planning using immune tabu search genetic algorithm for satellite swarm earth observations
Wu, X., Liu, K., Ma, Q., Liu, D., & Wang, E. (2025) · Advances in Space Research · doi:10.1016/j.asr.2025.07.009 · Cited by 2
Khatir, P. A., Homayounpour, M. M., & Charmacani, K. R. (2025) · Journal of Aerospace Information Systems · doi:10.2514/1.i011555 · Cited by 2
Qin, M., Zhao, X., Xu, Z., Sun, W., Xie, W., & Liu, Q. (2026) · International Journal of Digital Earth · doi:10.1080/17538947.2026.2643501 · Cited by 3
“Several studies (Tangpattanakul, Jozefowiez, and Lopez 2015; Wang et al. 2011; Li et al. 2017, 2018) successfully managed Pareto trade-offs and fairness among competing objectives through EMO frameworks combined with priority-based and performance-index mechanisms.”
Lárraga, G., Saini, B. S., & Miettinen, K. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-27250-9_41 · Cited by 2
Surface Reconstruction Planning with High-Quality Satellite Stereo Pairs Searching
Li, J., Ren, G., Pan, Y., Sun, J., Wang, P., Xu, F., & Liu, Z. (2025) · Remote Sensing · doi:10.3390/rs17142390 · Cited by 1
Self-citationWei, L., Song, Y., Xing, L., Chen, M., & Chen, Y. (2022) · Communications in computer and information science · doi:10.1007/978-981-19-1256-6_18 · Cited by 1
Multi-Criteria Decision Making in Complex Decision Environments
Vasegaard, A. E. (2023) · VBN Forskningsportal (Aalborg Universitet) · doi:10.54337/aau561817671 · Cited by 4
A Region Preference-based Optimization Algorithm for Satellite Mission Planning Problem
Xiong, M., & Xiong, W. (2022) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2179/1/012035
Wang, L., Chen, L., Li, M., Yang, Z., Yang, K., & Li, M. (2022) · IEEE International Conference on Control Science and Systems Engineering (ICCSSE) · doi:10.1109/iccsse55346.2022.10079790
“In terms of equipment system planning, Li et al [7] proposed evolutionary multi-objective optimization based on preference and its application in satellite mission planning.”
BackgroundManaging Objective Archives for Solution Set Reduction in Many-Objective Optimization
Peerlinck, A., & Sheppard, J. W. (2023) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci52147.2023.10372007
“Most research focuses on helping the decision maker in their choice for a final solution focuses on dimensionality reduction to aid in visualization [19] or by incorporating preferences directly into the search processes [27].”
BackgroundA Ground Application System for On-Orbit Servicing Satellite Based on OODA Loop
Liang, H., Lin, J., & Zhou, X. B. (2024) · IEEE International Conference on Advanced Infocomm Technology · doi:10.1109/icait62580.2024.10808054
“The preference-based multi-objective optimization algorithm has been attempted to be applied in the satellite mission planning [26].”
RenukaJyothi, S., Loonkar, S., & Batra, R. (2024) · International Conference on Sustainable Computing and Integrated Communication in Changing Landscape of AI (ICSCAI) · doi:10.1109/icscai61790.2024.10866968
Liu, W., Zhang, D., Tian, Y., & Shao, X. (2025) · Aerospace Systems · doi:10.1007/s42401-025-00354-0
Lárraga, G., & Miettinen, K. (2025) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3712256.3726367
“Other methods for expressing preferences include defining desirable ranges for each objective function (e.g.,[25, 33]) and selecting preferred or non-preferred solutions (e.g., [24, 25]).”
Large-scale hybrid mission scheduling for LuTan-1 satellites using sparse evolutionary algorithm
Liu, W., Zhang, D., Tian, Y., & Shao, X. (2025) · Acta Astronautica · doi:10.1016/j.actaastro.2025.08.044
Multi-Objective Optimization for Weapon-Target Assignment with Decision Preferences
Hu, T., Wang, L., Li, L., & Yun, X. (2025) · International Conference on Algorithms, Data Mining, and Information Technology (ADMIT) · doi:10.1109/admit67050.2025.11336825
“In this paper, based on the T-NSGA-III algorithm proposed by Li Longmei for satellite planning [17] , adaptability improvements have been made for the WTA problems.”
Self-citation(2026) · Elsevier eBooks · doi:10.1016/b978-0-44-345103-4.00011-5
Song, Y., Zhang, Y., Du, Y., Xing, L., & Pedrycz, W. (2026) · Elsevier eBooks · doi:10.1016/b978-0-44-345103-4.00005-x
Metadata
- Authors
- Li, L., Chen, H., Li, J., Jing, N., & Emmerich, M.
- Affiliations
- National University of Defense Technology (CN)
- Leiden University (NL)
- Venue
- IEEE Access
- Published
- 2018
- Volume
- 6
- Pages
- 40963-40978
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2883461192
- Semantic Scholar
- db39ed9b07ab744016f3c7f447b1b1959c31b8e7
- Cited by
- 46
- References
- 37
- Citations by year
- 2026: 3 · 2025: 9 · 2024: 6 · 2023: 3 · 2022: 7 · 2021: 8 · 2020: 8 · 2019: 1 · 2018: 1
- FWCI
- 3.33
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion)
- Leiden Repository (Leiden University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
- Funders
- National Natural Science Foundation of China (61101184, 61174159)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- Earth observation satellites, many-objective optimization, mixed integer programming, interactive decision making, preference adjustment, image quality, resource balance
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.