{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T11:26:57Z","timestamp":1768994817409,"version":"3.49.0"},"reference-count":23,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T00:00:00Z","timestamp":1572825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Young talent Cultivating Program of Shanghai Jiao Tong University","award":["18X100040006"],"award-info":[{"award-number":["18X100040006"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper presents a space mission planning tool, which was developed for LEO (Low Earth Orbit) observation satellites. The tool is focused on a two-phase planning strategy with clustering preprocessing and mission planning, where an improved clustering algorithm is applied, and a hybrid algorithm that combines the genetic algorithm with the simulated annealing algorithm (GA\u2013SA) is given and discussed. Experimental simulation studies demonstrate that the GA\u2013SA algorithm with the improved clique partition algorithm based on the graph theory model exhibits higher fitness value and better optimization performance and reliability than the GA or SA algorithms alone.<\/jats:p>","DOI":"10.3390\/a12110231","type":"journal-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T10:49:07Z","timestamp":1572864547000},"page":"231","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A GA-SA Hybrid Planning Algorithm Combined with Improved Clustering for LEO Observation Satellite Missions"],"prefix":"10.3390","volume":"12","author":[{"given":"Xiangyu","family":"Long","sequence":"first","affiliation":[{"name":"School of Aeronautics and Astronautics, Shanghai Jiao Tong University, Shanghai 200240, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8138-5533","authenticated-orcid":false,"given":"Shufan","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Aeronautics and Astronautics, Shanghai Jiao Tong University, Shanghai 200240, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Aeronautics and Astronautics, Shanghai Jiao Tong University, Shanghai 200240, China"},{"name":"School of Aerospace, Mechanical and Mechatronic Engineering, University of Sydney, NSW 2006, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixin","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Aeronautics and Astronautics, Shanghai Jiao Tong University, Shanghai 200240, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongcheng","family":"Mu","sequence":"additional","affiliation":[{"name":"School of Aeronautics and Astronautics, Shanghai Jiao Tong University, Shanghai 200240, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,11,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Long, X., Wu, S., Cui, B., Mu, Z., Huang, Y., and Chu, S. (2019, January 10\u201313). Analysis of satellite observation task clustering based on the improved clique partition algorithm. Proceedings of the 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand.","DOI":"10.1109\/CEC.2019.8790243"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1016\/j.cor.2013.02.009","article-title":"A two-phase scheduling method with the consideration of task clustering for earth observing satellites","volume":"40","author":"Wu","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1016\/j.dam.2013.02.011","article-title":"New bounds and constraint propagation techniques for the clique partitioning problem","volume":"161","author":"Jaehn","year":"2013","journal-title":"Discret. Appl. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.cie.2017.09.050","article-title":"Satellite observation scheduling with a novel adaptive simulated annealing algorithm and a dynamic task clustering strategy","volume":"113","author":"Wu","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_5","first-page":"143","article-title":"Clustering of Imaging Reconnaissance Tasks Based on Clique Partition","volume":"19","author":"Xu","year":"2010","journal-title":"Oper. Res. Manag. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.actaastro.2018.11.001","article-title":"A new multi-satellite autonomous mission allocation and planning method","volume":"163","author":"Du","year":"2018","journal-title":"Acta Astronaut."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/TCAD.1986.1270207","article-title":"Automated synthesis of data paths in digital systems","volume":"5","author":"Tseng","year":"1986","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"ref_8","unstructured":"Frank, J., Jonsson, A., Morris, R., Smith, D.E., and Norvig, P. (2001, January 18\u201322). Planning and scheduling for fleets of earth observing satellites. Proceedings of the Sixth International Symposium on Artificial Intelligence, Robotics, Automation and Space, Montreal, QC, Canada."},{"key":"ref_9","unstructured":"Globus, A., Crawford, J., Lohn, J., and Pryor, A. (2004, January 25\u201329). A Comparison of Techniques for Scheduling Earth-Observing Satellites. Proceedings of the Conference on Nineteenth National Conference on Artificial Intelligence, San Jose, CA, USA."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"3258","DOI":"10.1016\/j.asr.2019.01.043","article-title":"A multi-objective binary-encoding differential evolution algorithm for proactive scheduling of agile earth observation satellites","volume":"63","author":"Li","year":"2019","journal-title":"Adv. Space Rese."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.ast.2014.10.006","article-title":"Mission scheduling optimization of SAR satellite constellation for minimizing system response time","volume":"40","author":"Kim","year":"2015","journal-title":"Aerosp. Sci. Technol."},{"key":"ref_12","unstructured":"Grasset-Bourdel, R., Verfaillie, G., and Flipo, A. (2011, January 13). Planning and replanning for a constellation of agile Earth observation satellites. Proceedings of the ICAPS-11 Workshop on Scheduling and Planning Applications (SPARK-11), Freiburg, Germany."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Sarkheyli, A., Vaghei, B.G., and Bagheri, A. (2010, January 3\u20135). New tabu search heuristic in scheduling earth observation satellites. Proceedings of the 2010 2nd International Conference on Software Technology and Engineering, San Juan, Puerto Rico.","DOI":"10.1109\/ICSTE.2010.5608821"},{"key":"ref_14","first-page":"928","article-title":"Method of agile imaging satellites autonomous task planning","volume":"22","author":"Liu","year":"2016","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.ijdrr.2018.02.013","article-title":"Satellite scheduling of large areal tasks for rapid response to natural disaster using a multi-objective genetic algorithm","volume":"28","author":"Niu","year":"2018","journal-title":"Int. J. Disaster Risk Reduct."},{"key":"ref_16","first-page":"411","article-title":"Models, algorithms and applications to the mission planning system of imaging satellites","volume":"31","author":"He","year":"2010","journal-title":"Syst. Eng. Theory Pract."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.eswa.2015.12.039","article-title":"Priority-based constructive algorithms for scheduling agile earth observation satellites with total priority maximization","volume":"51","author":"Xu","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_18","first-page":"138","article-title":"A Petri Net Model and Algorithm for Remotely Sensed Data Processing Task Scheduling Problem","volume":"33","author":"Li","year":"2011","journal-title":"J. Univ. Def. Technol."},{"key":"ref_19","unstructured":"Jiang, W., and Pang, X. (2016). Collaborative Mission Planning for Networked Imaging Satellites, Harbin Institute of Technology Press."},{"key":"ref_20","unstructured":"Wang, L. (2001). Intelligent Optimization Algorithms with Applications, Tsinghua University Press."},{"key":"ref_21","unstructured":"Yu, H. (2009). The Improvement of Genetic Algorithm and It\u2019s Application on Knapsack Problem. [Master\u2019s Thesis, Shandong Normal University]."},{"key":"ref_22","first-page":"309","article-title":"A genetic algorithm with competitive selection between adjacent two generations and its applications to TSP","volume":"29","author":"Yu","year":"2000","journal-title":"Inf. Control"},{"key":"ref_23","unstructured":"Bao, Z., and Yu, X. (2016). Intelligent Optimization Algorithm and Its MATLAB Example, Publishing House of Electronics Industry."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/231\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:31:47Z","timestamp":1760189507000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,4]]},"references-count":23,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2019,11]]}},"alternative-id":["a12110231"],"URL":"https:\/\/doi.org\/10.3390\/a12110231","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,4]]}}}