{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:57:24Z","timestamp":1768449444446,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Science Center Program of the National Natural Science Foundation of China","award":["62188101"],"award-info":[{"award-number":["62188101"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61833009"],"award-info":[{"award-number":["61833009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00521-023-09399-8","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T12:02:28Z","timestamp":1708344148000},"page":"6597-6612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Task planning of space debris removal based on a hierarchical exploration artificial bee colony algorithm"],"prefix":"10.1007","volume":"36","author":[{"given":"Qing","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0066-6139","authenticated-orcid":false,"given":"Shi","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiaoHui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"9399_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.actaastro.2012.11.009","volume":"85","author":"C Bonnal","year":"2013","unstructured":"Bonnal C, Ruault J-M, Desjean M-C (2013) Active debris removal: recent progress and current trends. Acta Astronaut 85:51\u201360","journal-title":"Acta Astronaut"},{"key":"9399_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.spacepol.2018.12.005","volume":"47","author":"CP Mark","year":"2019","unstructured":"Mark CP, Kamath S (2019) Review of active space debris removal methods. Space Policy 47:194\u2013206","journal-title":"Space Policy"},{"key":"9399_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.actaastro.2019.09.002","volume":"168","author":"JL Forshaw","year":"2020","unstructured":"Forshaw JL, Aglietti GS, Fellowes S, Salmon T, Retat I, Hall A, Chabot T, Pisseloup A, Tye D, Bernal C (2020) The active space debris removal mission removedebris. Part 1: from concept to launch. Acta Astronaut 168:293\u2013309","journal-title":"Acta Astronaut"},{"key":"9399_CR4","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.actaastro.2019.09.001","volume":"168","author":"GS Aglietti","year":"2020","unstructured":"Aglietti GS, Taylor B, Fellowes S, Salmon T, Retat I, Hall A, Chabot T, Pisseloup A, Cox C, Mafficini A (2020) The active space debris removal mission removedebris. Part 2: in orbit operations. Acta Astronaut 168:310\u2013322","journal-title":"Acta Astronaut"},{"key":"9399_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00784-020-03358-6","volume":"25","author":"G Plotino","year":"2021","unstructured":"Plotino G, Colangeli M, \u00d6zy\u00fcrek T, DeDeus G, Panzetta C, Castagnola R, Grande NM, Marigo L (2021) Evaluation of smear layer and debris removal by stepwise intraoperative activation (sia) of sodium hypochlorite. Clin Oral Invest 25:237\u2013245","journal-title":"Clin Oral Invest"},{"issue":"10","key":"9399_CR6","doi-asserted-by":"publisher","first-page":"4276","DOI":"10.1016\/j.asr.2022.12.049","volume":"71","author":"S Narayanaswamy","year":"2023","unstructured":"Narayanaswamy S, Wu B, Ludivig P, Soboczenski F, Venkataramani K, Damaren CJ (2023) Low-thrust rendezvous trajectory generation for multi-target active space debris removal using the RQ-law. Adv Space Res 71(10):4276\u20134287","journal-title":"Adv Space Res"},{"key":"9399_CR7","unstructured":"Federici L, Zavoli A, Colasurdo G (2019) A time-dependent tsp formulation for the design of an active debris removal mission using simulated annealing. arXiv preprint arXiv:1909.10427"},{"key":"9399_CR8","doi-asserted-by":"crossref","unstructured":"Kanazaki M, Yamada Y, Nakamiya M (2020) Performance of space debris removal satellite considering total thrust by evolutionary algorithm. In: 2020 IEEE aerospace conference, IEEE, pp 1\u20139","DOI":"10.1109\/AERO47225.2020.9172676"},{"key":"9399_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.actaastro.2020.01.032","volume":"170","author":"A Barea","year":"2020","unstructured":"Barea A, Urrutxua H, Cadarso L (2020) Large-scale object selection and trajectory planning for multi-target space debris removal missions. Acta Astronaut 170:289\u2013301","journal-title":"Acta Astronaut"},{"key":"9399_CR10","doi-asserted-by":"crossref","unstructured":"Izzo D, Getzner I, Hennes D, Sim\u00f5es LF (2015) Evolving solutions to TSP variants for active space debris removal. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation, pp 1207\u20131214","DOI":"10.1145\/2739480.2754727"},{"issue":"10","key":"9399_CR11","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.2514\/1.G005602","volume":"44","author":"S Chen","year":"2021","unstructured":"Chen S, Jiang F, Li H, Baoyin H (2021) Optimization for multitarget, multispacecraft impulsive rendezvous considering J2 perturbation. J Guid Control Dyn 44(10):1811\u20131822","journal-title":"J Guid Control Dyn"},{"key":"9399_CR12","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.actaastro.2022.10.046","volume":"203","author":"J Yang","year":"2023","unstructured":"Yang J, Hu YH, Hou X, Huang H, Zhao N, Fan H (2023) A multi-platform active debris removal mission planning method based on DCOP with chain topology. Acta Astronaut 203:495\u2013509","journal-title":"Acta Astronaut"},{"key":"9399_CR13","first-page":"1","volume":"6","author":"N Zhang","year":"2021","unstructured":"Zhang N, Zhang Z, Baoyin H (2021) Timeline club: an optimization algorithm for solving multiple debris removal missions of the time-dependent traveling salesman problem model. Astrodynamics 6:1\u201316","journal-title":"Astrodynamics"},{"key":"9399_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3245334","author":"L Zhang","year":"2023","unstructured":"Zhang L, Zhou M, Yang F et al (2023) Elastic tracking operation method for high-speed railway using deep reinforcement learning. IEEE Trans Consum Electron. https:\/\/doi.org\/10.1109\/TCE.2023.3245334","journal-title":"IEEE Trans Consum Electron"},{"key":"9399_CR15","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3241684","author":"X Tong","year":"2023","unstructured":"Tong X, Ma D, Wang R, Xie X, Zhang H (2023) Dynamic event-triggered-based integral reinforcement learning algorithm for frequency control of microgrid with stochastic uncertainty. IEEE Trans Consum Electron. https:\/\/doi.org\/10.1109\/TCE.2023.3241684","journal-title":"IEEE Trans Consum Electron"},{"key":"9399_CR16","doi-asserted-by":"publisher","first-page":"12721","DOI":"10.1007\/s00521-021-05918-7","volume":"33","author":"X Qi","year":"2021","unstructured":"Qi X, Gan Z, Liu C, Xu Z, Zhang X, Li W, Ouyang C (2021) Collective intelligence evolution using ant colony optimization and neural networks. Neural Comput Appl 33:12721\u201312735","journal-title":"Neural Comput Appl"},{"key":"9399_CR17","doi-asserted-by":"publisher","first-page":"6405","DOI":"10.1007\/s00521-020-05402-8","volume":"33","author":"T-H Nguyen","year":"2021","unstructured":"Nguyen T-H, Jung JJ (2021) Multiple ACO-based method for solving dynamic MSMD traffic routing problem in connected vehicles. Neural Comput Appl 33:6405\u20136414","journal-title":"Neural Comput Appl"},{"issue":"8","key":"9399_CR18","doi-asserted-by":"publisher","first-page":"3469","DOI":"10.1007\/s00521-020-05174-1","volume":"33","author":"OA Ar\u0131k","year":"2021","unstructured":"Ar\u0131k OA (2021) Artificial bee colony algorithm including some components of iterated greedy algorithm for permutation flow shop scheduling problems. Neural Comput Appl 33(8):3469\u20133486","journal-title":"Neural Comput Appl"},{"issue":"1","key":"9399_CR19","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TAES.2019.2934373","volume":"56","author":"H Li","year":"2019","unstructured":"Li H, Baoyin H (2019) Optimization of multiple debris removal missions using an evolving elitist club algorithm. IEEE Trans Aerosp Electron Syst 56(1):773\u2013784","journal-title":"IEEE Trans Aerosp Electron Syst"},{"key":"9399_CR20","doi-asserted-by":"crossref","unstructured":"Medioni L, Gary Y, Monclin M, Oosterhof C, Pierre G, Semblanet T, Comte P, Nocentini K (2023) Trajectory optimization for multi-target Active Debris Removal missions[J]. Adv Space Res 72(7):2801\u20132823","DOI":"10.1016\/j.asr.2022.12.013"},{"key":"9399_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.actaastro.2018.05.040","volume":"149","author":"J Yang","year":"2018","unstructured":"Yang J, Hu YH, Liu Y, Pan Q (2018) A maximal-reward preliminary planning for multi-debris active removal mission in LEO with a greedy heuristic method. Acta Astronaut 149:123\u2013142","journal-title":"Acta Astronaut"},{"issue":"8","key":"9399_CR22","doi-asserted-by":"publisher","first-page":"8286","DOI":"10.1109\/TCYB.2020.3043265","volume":"52","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Mei Y, Huang S, Zheng X, Zhang C (2022) A route clustering and search heuristic for large-scale multidepot-capacitated arc routing problem. IEEE Trans Cybern 52(8):8286\u20138299. https:\/\/doi.org\/10.1109\/TCYB.2020.3043265","journal-title":"IEEE Trans Cybern"},{"key":"9399_CR23","doi-asserted-by":"publisher","unstructured":"Gao X, Chen MZQ, Zhang L (2022) A new edge removal strategy for complex networks based on an improved tabu search algorithm. In: 2022 41st Chinese control conference (CCC), pp 965\u2013970. https:\/\/doi.org\/10.23919\/CCC55666.2022.9902152","DOI":"10.23919\/CCC55666.2022.9902152"},{"issue":"8","key":"9399_CR24","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1109\/TCYB.2019.2950626","volume":"51","author":"J Xiao","year":"2021","unstructured":"Xiao J, Zhang T, Du J, Zhang X (2021) An evolutionary multiobjective route grouping-based heuristic algorithm for large-scale capacitated vehicle routing problems. IEEE Trans Cybern 51(8):4173\u20134186. https:\/\/doi.org\/10.1109\/TCYB.2019.2950626","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"9399_CR25","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1109\/TCYB.2019.2928563","volume":"51","author":"X He","year":"2021","unstructured":"He X, Zhou Y, Chen Z, Zhang J, Chen W-N (2021) Large-scale evolution strategy based on search direction adaptation. IEEE Trans Cybern 51(3):1651\u20131665. https:\/\/doi.org\/10.1109\/TCYB.2019.2928563","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"9399_CR26","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s11431-020-1560-9","volume":"64","author":"H Li","year":"2021","unstructured":"Li H, Baoyin H (2021) Sequence optimization for multiple asteroids rendezvous via cluster analysis and probability-based beam search. Sci China Technol Sci 64(1):122\u2013130","journal-title":"Sci China Technol Sci"},{"key":"9399_CR27","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2018","unstructured":"Alipour MM, Razavi SN, Feizi Derakhshi MR, Balafar MA (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30:2935\u20132951","journal-title":"Neural Comput Appl"},{"key":"9399_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00521-022-07683-7","volume":"34","author":"A Biswas","year":"2022","unstructured":"Biswas A, Tripathy SP, Pal T (2022) On multi-objective covering salesman problem. Neural Comput Appl 34:1\u201314","journal-title":"Neural Comput Appl"},{"issue":"2","key":"9399_CR29","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1007\/s00521-022-07816-y","volume":"35","author":"M Sahin","year":"2023","unstructured":"Sahin M (2023) Solving TSP by using combinatorial bees algorithm with nearest neighbor method. Neural Comput Appl 35(2):1863\u20131879","journal-title":"Neural Comput Appl"},{"key":"9399_CR30","doi-asserted-by":"publisher","first-page":"15643","DOI":"10.1007\/s00521-020-04898-4","volume":"32","author":"V Pandiri","year":"2020","unstructured":"Pandiri V, Singh A, Rossi A (2020) Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput Appl 32:15643\u201315663","journal-title":"Neural Comput Appl"},{"key":"9399_CR31","doi-asserted-by":"publisher","first-page":"6939","DOI":"10.1007\/s00521-020-05468-4","volume":"33","author":"Z Wu","year":"2021","unstructured":"Wu Z, Wu J, Zhao M, Feng L, Liu K (2021) Two-layered ant colony system to improve engraving robot\u2019s efficiency based on a large-scale tsp model. Neural Comput Appl 33:6939\u20136949","journal-title":"Neural Comput Appl"},{"key":"9399_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3269071","author":"J Wu","year":"2023","unstructured":"Wu J, Yang H, Zeng Y, Wu Z, Liu J, Feng L (2023) A twin learning framework for traveling salesman problem based on autoencoder, graph filter, and transfer learning. IEEE Trans Consum Electron. https:\/\/doi.org\/10.1109\/TCE.2023.3269071","journal-title":"IEEE Trans Consum Electron"},{"key":"9399_CR33","unstructured":"http:\/\/celestrak.org\/norad\/elements\/"},{"key":"9399_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102816","volume":"164","author":"Z Liu","year":"2022","unstructured":"Liu Z, Li X, Khojandi A (2022) The flying sidekick traveling salesman problem with stochastic travel time: a reinforcement learning approach. Transp Res Part E Logist Transp Rev 164:102816","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"9399_CR35","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3131318","author":"X Zhu","year":"2021","unstructured":"Zhu X, Qiu T, Qu W, Zhou X, Wang Y, Wu O (2021) Path planning for adaptive CSI map construction with A3C in dynamic environments. IEEE Trans Mob Comput. https:\/\/doi.org\/10.1109\/TMC.2021.3131318","journal-title":"IEEE Trans Mob Comput"},{"issue":"3","key":"9399_CR36","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1109\/TCC.2019.2904227","volume":"9","author":"M Diallo","year":"2019","unstructured":"Diallo M, Quintero A, Pierre S (2019) An efficient approach based on ant colony optimization and tabu search for a resource embedding across multiple cloud providers. IEEE Trans Cloud Comput 9(3):896\u2013909","journal-title":"IEEE Trans Cloud Comput"},{"key":"9399_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00521-021-06883-x","volume":"34","author":"\u0130 \u0130lhan","year":"2022","unstructured":"\u0130lhan \u0130, G\u00f6kmen G (2022) A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem. Neural Comput Appl 34:1\u201326","journal-title":"Neural Comput Appl"},{"key":"9399_CR38","doi-asserted-by":"crossref","unstructured":"Zhang J (2021) An improved genetic algorithm with 2-opt local search for the traveling salesman problem. In: application of intelligent systems in multi-modal information analytics: 2021 international conference on multi-modal information analytics (MMIA 2021), vol 2. Springer, pp 404\u2013409","DOI":"10.1007\/978-3-030-74814-2_57"},{"key":"9399_CR39","doi-asserted-by":"publisher","first-page":"3942","DOI":"10.1007\/s10489-020-01713-4","volume":"50","author":"I Khan","year":"2020","unstructured":"Khan I, Maiti MK, Basuli K (2020) Multi-objective traveling salesman problem: an ABC approach. Appl Intell 50:3942\u20133960","journal-title":"Appl Intell"},{"key":"9399_CR40","doi-asserted-by":"publisher","first-page":"9859","DOI":"10.1007\/s00521-019-04570-6","volume":"32","author":"M Shehab","year":"2020","unstructured":"Shehab M, Abualigah L, Al Hamad H, Alabool H, Alshinwan M, Khasawneh AM (2020) Moth-flame optimization algorithm: variants and applications. Neural Comput Appl 32:9859\u20139884","journal-title":"Neural Comput Appl"},{"key":"9399_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"8","key":"9399_CR42","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) Max\u2013min ant system. Futur Gener Comput Syst 16(8):889\u2013914","journal-title":"Futur Gener Comput Syst"},{"key":"9399_CR43","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.matcom.2020.06.012","volume":"178","author":"C Yu","year":"2020","unstructured":"Yu C, Cai Z, Ye X, Wang M, Zhao X, Liang G, Chen H, Li C (2020) Quantum-like mutation-induced dragonfly-inspired optimization approach. Math Comput Simul 178:259\u2013289","journal-title":"Math Comput Simul"},{"key":"9399_CR44","unstructured":"Van der Maaten L, Hinton G (2008) Visualizing data using t-SNE[J]. J Mach Learn Res 9(11)"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09399-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09399-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09399-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T19:10:00Z","timestamp":1710616200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09399-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":44,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["9399"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09399-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,19]]},"assertion":[{"value":"26 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}