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-citationReference point based multi-objective optimization using evolutionary algorithms
Deb, K., & Sundar, J. (2006) · Proceedings of the 8th annual conference on Genetic and evolutionary computation · doi:10.1145/1143997.1144112 · Cited by 561
Selecting and scheduling observations of agile satellites
Lemaı̂tre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.-M., & Bataille, N. (2002) · Aerospace Science and Technology · doi:10.1016/s1270-9638(02)01173-2 · Cited by 472 · cited 2×
“The profit of each target (pr) is randomly generated in the range [1, 10] and the requested time of observation (rt) is a random value from 3 seconds to 6 seconds.”
BackgroundReference Point Based Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., Sundar, J., Udaya Bhaskara, R. N., & Chaudhuri, S. (2006) · International Journal of Computational Intelligence Research · doi:10.5019/j.ijcir.2006.67 · Cited by 371
Tangpattanakul, P., Jozefowiez, N., & Lòpez, P. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.03.011 · Cited by 173 · cited 1×
“Researchers have adopted Nondominated Sorting Genetic Algorithm-II (NSGA-II) [8], [9], Strength Pareto Evolutionary Algorithm 2 (SPEA2) [10], multi-objective local search [11], Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) [12], multiobjective scatter search [13] to investigate the problem.”
MethodDaily imaging scheduling of an earth observation satellite
Lin, W.-C., Liao, D.-Y., Liu, C.-Y., & Lee, Y.-Y. (2005) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2005.843380 · Cited by 173
Wu, G., Jin, L., Ma, M., & Qiu, D. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2013.02.009 · Cited by 155 · cited 1×
“Because of the NP-hard nature of the problem [2], heuristic and metaheuristic approaches have been widely used by researchers to solve the problem, such as genetic algorithms [3], [4], ant colony optimization [5], [6], tabu search [7] and so on.”
MethodA Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems
Kukkonen, S., & Deb, K. (2006) · Lecture notes in computer science · doi:10.1007/11844297_56 · Cited by 126
Habet, D., Vasquez, M., & Vimont, Y. (2008) · Computational Optimization and Applications · doi:10.1007/s10589-008-9220-7 · Cited by 121 · cited 1×
“Because of the NP-hard nature of the problem [2], heuristic and metaheuristic approaches have been widely used by researchers to solve the problem, such as genetic algorithms [3], [4], ant colony optimization [5], [6], tabu search [7] and so on.”
MethodGong, D., Sun, J., & Ji, X. (2013) · Information Sciences · doi:10.1016/j.ins.2013.01.020 · Cited by 113 · cited 1×
“The preference information could be imported through reference point [14], achievement scalarizing function [15], Desirability function [16], [17], relative importance of objectives [18], preference polyhedron [19] and other approaches.”
BackgroundWagner, T., & Trautmann, H. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2058119 · Cited by 109 · cited 1×
“The preference information could be imported through reference point [14], achievement scalarizing function [15], Desirability function [16], [17], relative importance of objectives [18], preference polyhedron [19] and other approaches.”
BackgroundMansour, M., & Dessouky, M. M. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.11.012 · Cited by 79 · cited 1×
“Because of the NP-hard nature of the problem [2], heuristic and metaheuristic approaches have been widely used by researchers to solve the problem, such as genetic algorithms [3], [4], ant colony optimization [5], [6], tabu search [7] and so on.”
MethodOn decomposition methods in interactive user-preference based optimization
Zheng, J., Yu, G., Zhu, Q., Li, X., & Zou, J. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.09.032 · Cited by 45 · cited 3×
“, T-NSGA-II [22], T-RVEA [23] and MOEA/D-c [24].”
BackgroundA multi-objective imaging scheduling approach for earth observing satellites
Wang, J., Ning, J., Li, J., & Chen, Z. H. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277381 · Cited by 44 · cited 1×
“Researchers have adopted Nondominated Sorting Genetic Algorithm-II (NSGA-II) [8], [9], Strength Pareto Evolutionary Algorithm 2 (SPEA2) [10], multi-objective local search [11], Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) [12], multiobjective scatter search [13] to investigate the problem.”
MethodSelf-citationGong, D., Ji, X., Sun, J., & Sun, X. (2014) · Neurocomputing · doi:10.1016/j.neucom.2013.04.052 · Cited by 41 · cited 1×
“The preference information could be imported through reference point [14], achievement scalarizing function [15], Desirability function [16], [17], relative importance of objectives [18], preference polyhedron [19] and other approaches.”
BackgroundMultiobjective evolutionary algorithms based on target region preferences
Li, L., Wang, Y., Trautmann, H., Jing, N., & Emmerich, M. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.02.006 · Cited by 41 · cited 2×
“The first one is T-NSGA-II [20], which shares the same coordinate transformation method with the proposed algorithms.”
BackgroundMethodSelf-citationHakanen, J., Chugh, T., Sindhya, K., Jin, Y., & Miettinen, K. (2016) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci.2016.7850220 · Cited by 33 · cited 3×
“The second algorithm is T-RVEA [23], which is based on Reference Vector guided Evolutionary Algorithm (RVEA) [37].”
MethodYuan, Z., Chen, Y., & He, R. (2014) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2014.6900502 · Cited by 26 · cited 1×
“Because of the NP-hard nature of the problem [2], heuristic and metaheuristic approaches have been widely used by researchers to solve the problem, such as genetic algorithms [3], [4], ant colony optimization [5], [6], tabu search [7] and so on.”
MethodSet-based many-objective optimization guided by a preferred region
Gong, D., Sun, F., Sun, J., & Sun, X. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.09.081 · Cited by 22 · cited 1×
“The preference information could be imported through reference point [14], achievement scalarizing function [15], Desirability function [16], [17], relative importance of objectives [18], preference polyhedron [19] and other approaches.”
BackgroundBuilding and Using an Ontology of Preference-Based Multiobjective Evolutionary Algorithms
Li, L., Yevseyeva, I., Basto-Fernandes, V., Trautmann, H., Jing, N., & Emmerich, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-54157-0_28 · Cited by 21
Self-citationA set-based genetic algorithm for solving the many-objective optimization problem
Gong, D., Wang, G., Sun, X., & Han, Y. (2014) · Soft Computing · doi:10.1007/s00500-014-1284-y · Cited by 19 · cited 1×
“The preference information could be imported through reference point [14], achievement scalarizing function [15], Desirability function [16], [17], relative importance of objectives [18], preference polyhedron [19] and other approaches.”
BackgroundLi, L., Yao, F., Jing, N., & Emmerich, M. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969463 · Cited by 19 · cited 1×
“• Timeliness: maximize the averaged timeliness metric [25] for all the observed targets.”
BackgroundSelf-citationIntegrating region preferences in multiobjective evolutionary algorithms based on decomposition
Li, L., Chen, H., Li, J., Jing, N., & Emmerich, M. (2018) · International Conference on Advanced Computational Intelligence (ICACI) · doi:10.1109/icaci.2018.8377488 · Cited by 18 · cited 6×
“, T-MOEA/D and T-NSGA-III (where T represents Target), have shown promising results in DTLZ benchmark problems [30].”
BackgroundMethodSelf-citationMulti-objective evolutionary optimization for geostationary orbit satellite mission planning
College of Information System and Management, N. U. O. D. T., Li, J., Zhang, S., Liu, X., & He, R. (2017) · Journal of Systems Engineering and Electronics · doi:10.21629/jsee.2017.05.11 · Cited by 17 · cited 1×
“Researchers have adopted Nondominated Sorting Genetic Algorithm-II (NSGA-II) [8], [9], Strength Pareto Evolutionary Algorithm 2 (SPEA2) [10], multi-objective local search [11], Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) [12], multiobjective scatter search [13] to investigate the problem.”
MethodSelf-citationAgile satellite scheduling based on hybrid coding genetic algorithm
Geng, X., Li, J., Yang, W., & Gong, H. (2016) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2016.7578683 · Cited by 15 · cited 1×
“proposed a hybrid coding strategy for single objective AEOS mission planning [33].”
MethodSelf-citationA new approach to target region based multiobjective evolutionary algorithms
Wang, Y., Li, L., Yang, K., & Emmerich, M. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969514 · Cited by 14 · cited 2×
“, T-NSGA-II [22], T-RVEA [23] and MOEA/D-c [24].”
Self-citationEO constellation MPS based on ant colony optimization algorithms
Iacopino, C., Palmer, P. L., Brewer, A., Policella, N., & Donati, A. (2013) · International Conference on Recent Advances in Space Technologies · doi:10.1109/rast.2013.6581192 · Cited by 10 · cited 1×
“Because of the NP-hard nature of the problem [2], heuristic and metaheuristic approaches have been widely used by researchers to solve the problem, such as genetic algorithms [3], [4], ant colony optimization [5], [6], tabu search [7] and so on.”
MethodChen, H., Du, C., Li, J., Jing, N., & Wang, L. (2017) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3067695.3082033 · Cited by 8 · cited 1×
“Researchers have adopted Nondominated Sorting Genetic Algorithm-II (NSGA-II) [8], [9], Strength Pareto Evolutionary Algorithm 2 (SPEA2) [10], multi-objective local search [11], Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) [12], multiobjective scatter search [13] to investigate the problem.”
MethodSelf-citationTask Scheduling for Imaging Reconnaissance Satellites Using Multiobjective Scatter Search Algorithm
Shen, Z., Zou, H., & Sun, H. (2012) · Communications in computer and information science · doi:10.1007/978-3-642-34289-9_27 · Cited by 5 · cited 1×
“Researchers have adopted Nondominated Sorting Genetic Algorithm-II (NSGA-II) [8], [9], Strength Pareto Evolutionary Algorithm 2 (SPEA2) [10], multi-objective local search [11], Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) [12], multiobjective scatter search [13] to investigate the problem.”
Method
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 116
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
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.