{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T02:02:57Z","timestamp":1772676177068,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Science and Technology on Complex Electronic System Simulation Laboratory","award":["Grant No. 6142401003022109"],"award-info":[{"award-number":["Grant No. 6142401003022109"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Satellite range scheduling, a multi-constrained combinatorial optimization problem, is crucial to guaranteeing the normal operation and application of onboard satellites. Traditional methods are dedicated to finding one optimal schedule, having ignored the problem may process multiple high-quality schedules. To provide a set of alternative schedules while maintaining the solution quality, we propose a co-evolutionary algorithm with elite archive strategy (COEAS) in this article. In COEAS, two populations are evolved to solve the original and relaxed problem in terms of schedule quality and diversity, respectively. During the evolution, the populations maintain a weak cooperation and only share the information in offspring combination phase. Further, an elite archive strategy is derived to identify and preserve potential stagnated and optimal individuals. In this strategy, the promising individuals would further participate in parent mating and offspring replacement for the dual purpose of maintaining potential optima recovery and fine-tuning the population. The experimental results show that the proposed algorithm is better than comparison algorithms in terms of efficacy (obtaining higher quality schedule), diversity (locating more optimal schedules) and flexibility (providing better alternatives).<\/jats:p>","DOI":"10.1007\/s40747-023-01008-4","type":"journal-article","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T07:03:02Z","timestamp":1678431782000},"page":"5157-5172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A co-evolutionary algorithm with elite archive strategy for generating diverse high-quality satellite range schedules"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4940-532X","authenticated-orcid":false,"given":"Minghui","family":"Xiong","sequence":"first","affiliation":[]},{"given":"Wei","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,10]]},"reference":[{"issue":"1","key":"1008_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/B:JOSH.0000013053.32600.3c","volume":"7","author":"L Barbulescu","year":"2004","unstructured":"Barbulescu L, Watson J-P, Whitley LD, Howe AE (2004) Scheduling space-ground communications for the air force satellite control network. J Sched 7(1):7\u201334","journal-title":"J Sched"},{"issue":"2","key":"1008_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11590-014-0744-8","volume":"9","author":"AJ Vazquez","year":"2015","unstructured":"Vazquez AJ, Erwin RS (2015) On the tractability of satellite range scheduling. Optim Lett 9(2):311\u2013327","journal-title":"Optim Lett"},{"issue":"11","key":"1008_CR3","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1016\/j.cor.2011.01.016","volume":"38","author":"F Marinelli","year":"2011","unstructured":"Marinelli F, Nocella S, Rossi F, Smriglio S (2011) A Lagrangian heuristic for satellite range scheduling with resource constraints. Comput Oper Res 38(11):1572\u20131583","journal-title":"Comput Oper Res"},{"key":"1008_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2016.04.014","volume":"74","author":"J Wang","year":"2016","unstructured":"Wang J, Demeulemeester E, Qiu D (2016) A pure proactive scheduling algorithm for multiple earth observation satellites under uncertainties of clouds. Comput Oper Res 74:1\u201313","journal-title":"Comput Oper Res"},{"key":"1008_CR5","doi-asserted-by":"crossref","unstructured":"Vazquez AJ, Erwin RS ( 2014) Optimal fixed interval satellite range scheduling. In: ICORES, pp 401\u2013 408","DOI":"10.1109\/AERO.2015.7119277"},{"issue":"11","key":"1008_CR6","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1080\/0305215X.2018.1558445","volume":"51","author":"Z Liu","year":"2019","unstructured":"Liu Z, Feng Z, Ren Z (2019) Route-reduction-based dynamic programming for large-scale satellite range scheduling problem. Eng Optim 51(11):1944\u20131964","journal-title":"Eng Optim"},{"issue":"1","key":"1008_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/B:JOSH.0000013053.32600.3c","volume":"7","author":"L Barbulescu","year":"2004","unstructured":"Barbulescu L, Watson J-P, Whitley LD, Howe AE (2004) Scheduling space-ground communications for the air force satellite control network. J Sched 7(1):7\u201334","journal-title":"J Sched"},{"issue":"1","key":"1008_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ast.2013.04.001","volume":"29","author":"A Sarkheyli","year":"2013","unstructured":"Sarkheyli A, Bagheri A, Ghorbani-Vaghei B, Askari-Moghadam R (2013) Using an effective Tabu search in interactive resources scheduling problem for Leo satellites missions. Aerosp Sci Technol 29(1):287\u2013295","journal-title":"Aerosp Sci Technol"},{"issue":"1","key":"1008_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00500-017-2889-8","volume":"23","author":"Z Waiming","year":"2019","unstructured":"Waiming Z, Xiaoxuan H, Wei X, Peng J (2019) A two-phase genetic annealing method for integrated earth observation satellite scheduling problems. Soft Comput 23(1):181\u2013196","journal-title":"Soft Comput"},{"key":"1008_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2017.03.012","volume":"85","author":"K Luo","year":"2017","unstructured":"Luo K, Wang H, Li Y, Li Q (2017) High-performance technique for satellite range scheduling. Comput Oper Res 85:12\u201321","journal-title":"Comput Oper Res"},{"issue":"3","key":"1008_CR11","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.cja.2015.04.012","volume":"28","author":"Y Li","year":"2015","unstructured":"Li Y, Wang R, Liu Y, Xu M (2015) Satellite range scheduling with the priority constraint: an improved genetic algorithm using a station id encoding method. Chin J Aeronaut 28(3):789\u2013803","journal-title":"Chin J Aeronaut"},{"issue":"10","key":"1008_CR12","doi-asserted-by":"publisher","first-page":"3295","DOI":"10.1007\/s10489-018-1144-z","volume":"48","author":"Z Zhang","year":"2018","unstructured":"Zhang Z, Hu F, Zhang N (2018) Ant colony algorithm for satellite control resource scheduling problem. Appl Intell 48(10):3295\u20133305","journal-title":"Appl Intell"},{"key":"1008_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106830","volume":"150","author":"Y Song","year":"2020","unstructured":"Song Y, Xing L, Wang M, Yi Y, Xiang W, Zhang Z (2020) A knowledge-based evolutionary algorithm for relay satellite system mission scheduling problem. Comput Ind Eng 150:106830","journal-title":"Comput Ind Eng"},{"key":"1008_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100576","volume":"50","author":"Y Du","year":"2019","unstructured":"Du Y, Xing L, Zhang J, Chen Y, He Y (2019) Moea based memetic algorithms for multi-objective satellite range scheduling problem. Swarm Evol Comput 50:100576","journal-title":"Swarm Evol Comput"},{"key":"1008_CR15","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.swevo.2019.06.008","volume":"49","author":"Y-J Song","year":"2019","unstructured":"Song Y-J, Ma X, Li X-J, Xing L-N, Wang P (2019) Learning-guided nondominated sorting genetic algorithm ii for multi-objective satellite range scheduling problem. Swarm Evol Comput 49:194\u2013205","journal-title":"Swarm Evol Comput"},{"key":"1008_CR16","doi-asserted-by":"crossref","unstructured":"Huang T, Gong Y-J, Zhang Y-H, Zhan Z-H, Zhang J (2019) Automatic planning of multiple itineraries: a niching genetic evolution approach. IEEE Trans Intell Transp Syst 21(10):4225\u20134240","DOI":"10.1109\/TITS.2019.2939224"},{"key":"1008_CR17","doi-asserted-by":"crossref","unstructured":"Do AV, Guo M, Neumann A, Neumann F (2022) Niching-based evolutionary diversity optimization for the traveling salesperson problem. arXiv preprint arXiv:2201.10316","DOI":"10.1145\/3512290.3528724"},{"issue":"3","key":"1008_CR18","first-page":"508","volume":"24","author":"T Huang","year":"2019","unstructured":"Huang T, Gong Y-J, Kwong S, Wang H, Zhang J (2019) A niching memetic algorithm for multi-solution traveling salesman problem. IEEE Trans Evol Comput 24(3):508\u2013522","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"1008_CR19","doi-asserted-by":"publisher","first-page":"3388","DOI":"10.3390\/app11083388","volume":"11","author":"P Zou","year":"2021","unstructured":"Zou P, Rajora M, Liang SY (2021) Multimodal optimization of permutation flow-shop scheduling problems using a clustering-genetic-algorithm-based approach. Appl Sci 11(8):3388","journal-title":"Appl Sci"},{"key":"1008_CR20","unstructured":"Yao X (2006) A new multi-objective evolutionary optimisation algorithm: the two-archive algorithm. In: 2006 International Conference on computational intelligence and security, vol 1:286\u2013291, IEEE"},{"issue":"2","key":"1008_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2018.2855411","volume":"23","author":"K Li","year":"2018","unstructured":"Li K, Chen R, Fu G, Yao X (2018) Two-archive evolutionary algorithm for constrained multiobjective optimization. IEEE Trans Evol Comput 23(2):303\u2013315","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1008_CR22","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TEVC.2020.3004012","volume":"25","author":"Y Tian","year":"2020","unstructured":"Tian Y, Zhang T, Xiao J, Zhang X, Jin Y (2020) A coevolutionary framework for constrained multiobjective optimization problems. IEEE Trans Evol Comput 25(1):102\u2013116","journal-title":"IEEE Trans Evol Comput"},{"key":"1008_CR23","doi-asserted-by":"crossref","unstructured":"Li Y, Feng X, Yu H (2022) A constrained multiobjective evolutionary algorithm with the two-archive weak cooperation. Inf Sci","DOI":"10.1016\/j.ins.2022.10.050"},{"issue":"4","key":"1008_CR24","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TEVC.2018.2879406","volume":"23","author":"Y Liu","year":"2018","unstructured":"Liu Y, Yen GG, Gong D (2018) A multimodal multiobjective evolutionary algorithm using two-archive and recombination strategies. IEEE Trans Evol Comput 23(4):660\u2013674","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1008_CR25","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1109\/TEVC.2017.2769108","volume":"22","author":"Z-J Wang","year":"2017","unstructured":"Wang Z-J, Zhan Z-H, Lin Y, Yu W-J, Yuan H-Q, Gu T-L, Kwong S, Zhang J (2017) Dual-strategy differential evolution with affinity propagation clustering for multimodal optimization problems. IEEE Trans Evol Comput 22(6):894\u2013908","journal-title":"IEEE Trans Evol Comput"},{"key":"1008_CR26","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ins.2021.04.093","volume":"573","author":"W Sheng","year":"2021","unstructured":"Sheng W, Wang X, Wang Z, Li Q, Chen Y (2021) Adaptive memetic differential evolution with niching competition and supporting archive strategies for multimodal optimization. Inf Sci 573:316\u2013331","journal-title":"Inf Sci"},{"issue":"4","key":"1008_CR27","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/TEVC.2018.2877215","volume":"23","author":"D Gravina","year":"2018","unstructured":"Gravina D, Liapis A, Yannakakis GN (2018) Quality diversity through surprise. IEEE Trans Evol Comput 23(4):603\u2013616","journal-title":"IEEE Trans Evol Comput"},{"key":"1008_CR28","doi-asserted-by":"publisher","first-page":"100912","DOI":"10.1016\/j.swevo.2021.100912","volume":"65","author":"M Chen","year":"2021","unstructured":"Chen M, Wen J, Song Y-J, Xing L-N, Chen Y-W (2021) A population perturbation and elimination strategy based genetic algorithm for multi-satellite tt &c scheduling problem. Swarm Evol Comput 65:100912","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1008_CR29","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65\u201385","journal-title":"Stat Comput"},{"key":"1008_CR30","unstructured":"Flach P, Kull M (2015) Precision-recall-gain curves: Pr analysis done right. In: Advances in neural information processing systems 28"},{"key":"1008_CR31","doi-asserted-by":"crossref","unstructured":"Huang T, Gong Y-J, Zhang J ( 2018) Seeking multiple solutions of combinatorial optimization problems: a proof of principle study. In: 2018 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1212\u2013 1218. IEEE","DOI":"10.1109\/SSCI.2018.8628856"},{"issue":"1","key":"1008_CR32","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader J, Zitzler E (2011) Hype: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45\u201376","journal-title":"Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01008-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01008-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01008-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T17:16:27Z","timestamp":1695402987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01008-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,10]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1008"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01008-4","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,10]]},"assertion":[{"value":"21 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}