{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:49:42Z","timestamp":1773737382372,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University","award":["CX2022019"],"award-info":[{"award-number":["CX2022019"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62473319,62073267"],"award-info":[{"award-number":["62473319,62073267"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["G2020KY05110"],"award-info":[{"award-number":["G2020KY05110"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-024-06771-w","type":"journal-article","created":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T13:38:58Z","timestamp":1736257138000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Monte Carlo hyper-heuristic algorithm with low-level heuristics reward prediction for missile path planning"],"prefix":"10.1007","volume":"81","author":[{"given":"Shuangfei","family":"Xu","sequence":"first","affiliation":[]},{"given":"Zhanjun","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Wenhao","family":"Bi","sequence":"additional","affiliation":[]},{"given":"An","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,7]]},"reference":[{"key":"6771_CR1","doi-asserted-by":"publisher","unstructured":"Xiao W, Wang H, Shi Z ( 2014) Research on collaborative decision-making in ship-to-air missile relay guidance. In: 2014 IEEE Workshop on Electronics, Computer and Applications, pp. 681\u2013 684. IEEE, Ottawa. https:\/\/doi.org\/10.1109\/IWECA.2014.6845712","DOI":"10.1109\/IWECA.2014.6845712"},{"key":"6771_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1023\/A:1011325912346","volume":"7","author":"RV Helgason","year":"2001","unstructured":"Helgason RV, Kennington JL, Lewis KR (2001) Cruise missile mission planning: a heuristic algorithm for automatic path generation. J Heuristics 7:473\u2013494. https:\/\/doi.org\/10.1023\/A:1011325912346","journal-title":"J. Heuristics"},{"key":"6771_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.comcom.2019.10.014","volume":"149","author":"S Aggarwal","year":"2020","unstructured":"Aggarwal S, Kumar N (2020) Path planning techniques for unmanned aerial vehicles: a review, solutions, and challenges. Comput Commun 149:270\u2013299. https:\/\/doi.org\/10.1016\/j.comcom.2019.10.014","journal-title":"Comput. Commun."},{"key":"6771_CR4","doi-asserted-by":"publisher","first-page":"111928","DOI":"10.1016\/j.oceaneng.2022.111928","volume":"260","author":"L Gan","year":"2022","unstructured":"Gan L, Yan Z, Zhang L, Liu K, Zheng Y, Zhou C, Shu Y (2022) Ship path planning based on safety potential field in inland rivers. Ocean Eng 260:111928. https:\/\/doi.org\/10.1016\/j.oceaneng.2022.111928","journal-title":"Ocean Eng."},{"key":"6771_CR5","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1007\/s11227-023-05528-1","volume":"80","author":"X Li","year":"2024","unstructured":"Li X, Lu Y, Zhao X, Deng X, Xie Z (2024) Path planning for intelligent vehicles based on improved d* lite. J Supercomput 80:1294\u20131330. https:\/\/doi.org\/10.1007\/s11227-023-05528-1","journal-title":"J. Supercomput."},{"key":"6771_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00607-021-00955-5","volume":"104","author":"S Vcs","year":"2022","unstructured":"Vcs S, Ah S (2022) Nature inspired meta heuristic algorithms for optimization problems. Computing 104:251\u2013269. https:\/\/doi.org\/10.1007\/s00607-021-00955-5","journal-title":"Computing"},{"key":"6771_CR7","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1007\/s13042-023-01998-0","volume":"15","author":"S Xu","year":"2024","unstructured":"Xu S, Bi W, Zhang A, Wang Y (2024) A deep reinforcement learning approach incorporating genetic algorithm for missile path planning. Int J Mach Learn Cybern 15:1795\u20131814. https:\/\/doi.org\/10.1007\/s13042-023-01998-0","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"6771_CR8","doi-asserted-by":"publisher","first-page":"5408","DOI":"10.1007\/s11227-023-05661-x","volume":"80","author":"R Sun","year":"2024","unstructured":"Sun R, Yang T (2024) Hybrid parameter-based pso flexible needle percutaneous puncture path planning. J Supercomput 80:5408\u20135427. https:\/\/doi.org\/10.1007\/s11227-023-05661-x","journal-title":"J. Supercomput."},{"key":"6771_CR9","doi-asserted-by":"publisher","first-page":"119910","DOI":"10.1016\/j.eswa.2023.119910","volume":"223","author":"X Yu","year":"2023","unstructured":"Yu X, Luo W (2023) Reinforcement learning-based multi-strategy cuckoo search algorithm for 3d uav path planning. Expert Syst Appl 223:119910. https:\/\/doi.org\/10.1016\/j.eswa.2023.119910","journal-title":"Expert Syst. Appl."},{"key":"6771_CR10","doi-asserted-by":"publisher","first-page":"106209","DOI":"10.1016\/j.knosys.2020.106209","volume":"204","author":"X Yu","year":"2020","unstructured":"Yu X, Li C, Zhou J (2020) A constrained differential evolution algorithm to solve uav path planning in disaster scenarios. Knowledge-Based Syst 204:106209. https:\/\/doi.org\/10.1016\/j.knosys.2020.106209","journal-title":"Knowledge-Based Syst."},{"key":"6771_CR11","doi-asserted-by":"publisher","first-page":"109815","DOI":"10.1016\/j.cie.2023.109815","volume":"187","author":"T Dokeroglu","year":"2024","unstructured":"Dokeroglu T, Kucukyilmaz T, Talbi E-G (2024) Hyper-heuristics: a survey and taxonomy. Comput Ind Eng 187:109815. https:\/\/doi.org\/10.1016\/j.cie.2023.109815","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"6771_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake JH, Kheiri A, \u00d6zcan E, Burke EK (2020) Recent advances in selection hyper-heuristics. Eur J Oper Res 285(2):405\u2013428. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.073","journal-title":"Eur. J. Oper. Res."},{"key":"6771_CR13","doi-asserted-by":"publisher","first-page":"12186","DOI":"10.1007\/s11227-024-05909-0","volume":"80","author":"R Zhong","year":"2024","unstructured":"Zhong R, Zhang E, Munetomo M (2024) Evolutionary multi-mode slime mold optimization: a hyper-heuristic algorithm inspired by slime mold foraging behaviors. J Supercomput 80:12186\u201312217. https:\/\/doi.org\/10.1007\/s11227-024-05909-0","journal-title":"J. Supercomput."},{"key":"6771_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jmsy.2021.05.012","volume":"60","author":"S Zhang","year":"2021","unstructured":"Zhang S, Xu Y, Zhang W (2021) Multitask-oriented manufacturing service composition in an uncertain environment using a hyper-heuristic algorithm. J Manuf Syst 60:138\u2013151. https:\/\/doi.org\/10.1016\/j.jmsy.2021.05.012","journal-title":"J. Manuf. Syst."},{"key":"6771_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.asoc.2014.12.012","volume":"28","author":"M Maashi","year":"2015","unstructured":"Maashi M, Kendall G, \u00d6zcan E (2015) Choice function based hyper-heuristics for multi-objective optimization. Appl Soft Comput 28:312\u2013326. https:\/\/doi.org\/10.1016\/j.asoc.2014.12.012","journal-title":"Appl. Soft. Comput."},{"issue":"13","key":"6771_CR16","doi-asserted-by":"publisher","first-page":"2654","DOI":"10.3390\/app9132654","volume":"9","author":"D Wei","year":"2019","unstructured":"Wei D, Wang F, Ma H (2019) Autonomous path planning of auv in large-scale complex marine environment based on swarm hyper-heuristic algorithm. Appl Sci 9(13):2654. https:\/\/doi.org\/10.3390\/app9132654","journal-title":"Appl. Sci."},{"issue":"6","key":"6771_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MSP.2017.2743240","volume":"34","author":"K Arulkumaran","year":"2017","unstructured":"Arulkumaran K, Deisenroth MP, Brundage M, Bharath AA (2017) Deep reinforcement learning: a brief survey. IEEE Signal Process Mag 34(6):26\u201338. https:\/\/doi.org\/10.1109\/MSP.2017.2743240","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"6771_CR18","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ejor.2023.01.017","volume":"309","author":"J Kallestad","year":"2023","unstructured":"Kallestad J, Hasibi R, Hemmati A, S\u00f6rensen K (2023) A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems. Eur J Oper Res 309(1):446\u2013468. https:\/\/doi.org\/10.1016\/j.ejor.2023.01.017","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6771_CR19","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2021.10.032","volume":"300","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Bai R, Qu R, Tu C, Jin J (2022) A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties. Eur J Oper Res 300(2):418\u2013427. https:\/\/doi.org\/10.1016\/j.ejor.2021.10.032","journal-title":"Eur. J. Oper. Res."},{"key":"6771_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104284","volume":"102","author":"FB G\u00f6lc\u00fck Ozsoydan","year":"2021","unstructured":"G\u00f6lc\u00fck Ozsoydan FB (2021) Q-learning and hyper-heuristic based algorithm recommendation for changing environments. Eng Appl Artif Intell 102:104284. https:\/\/doi.org\/10.1016\/j.engappai.2021.104284","journal-title":"Eng. Appl. Artif. Intell."},{"key":"6771_CR21","doi-asserted-by":"publisher","unstructured":"Raychaudhuri S ( 2008) Introduction to monte carlo simulation. In: 2008 Winter Simulation Conference, pp. 91\u2013 100. IEEE, Miami. https:\/\/doi.org\/10.1109\/WSC.2008.4736059","DOI":"10.1109\/WSC.2008.4736059"},{"key":"6771_CR22","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1146\/annurev-statistics-040220-090158","volume":"9","author":"GL Jones","year":"2022","unstructured":"Jones GL, Qin Q (2022) Markov chain monte carlo in practice. Annu Rev Stat Appl 9:557\u2013578. https:\/\/doi.org\/10.1146\/annurev-statistics-040220-090158","journal-title":"Annu. Rev. Stat. Application"},{"key":"6771_CR23","first-page":"64","volume-title":"Airspace allocation method in mission planning of early warning aircraft","author":"W Qi","year":"2022","unstructured":"Qi W, Cheng D, Sun H, Lin Q, Li X, Huang Z, Jiang W, Jiang Y (2022) Airspace allocation method in mission planning of early warning aircraft. Publishing House of Electronics Industry, Beijing, pp 64\u201382"},{"issue":"7","key":"6771_CR24","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1109\/TCSI.2022.3163463","volume":"69","author":"W Luo","year":"2022","unstructured":"Luo W, Chen L, Liu K, Gu H, L\u00fc J (2022) Optimizing constrained guidance policy with minimum overload regularization. IEEE Trans Biomed Circuits Syst 69(7):2994\u20133005. https:\/\/doi.org\/10.1109\/TCSI.2022.3163463","journal-title":"IEEE Trans. Biomed. Circuits Syst."},{"key":"6771_CR25","doi-asserted-by":"publisher","first-page":"108241","DOI":"10.1016\/j.asoc.2021.108241","volume":"115","author":"S Xu","year":"2022","unstructured":"Xu S, Bi W, Zhang A, Mao Z (2022) Optimization of flight test tasks allocation and sequencing using genetic algorithm. Appl Soft Comput 115:108241. https:\/\/doi.org\/10.1016\/j.asoc.2021.108241","journal-title":"Appl. Soft. Comput."},{"key":"6771_CR26","doi-asserted-by":"publisher","first-page":"18777","DOI":"10.1007\/s11227-023-05385-y","volume":"79","author":"DJ Kalita","year":"2023","unstructured":"Kalita DJ, Singh VP, Kumar V (2023) A lightweight knowledge-based pso for svm hyper-parameters tuning in a dynamic environment. J Supercomput 79:18777\u201318799. https:\/\/doi.org\/10.1007\/s11227-023-05385-y","journal-title":"J. Supercomput."},{"key":"6771_CR27","doi-asserted-by":"publisher","first-page":"18227","DOI":"10.1007\/s11227-023-05358-1","volume":"79","author":"M Bakshi","year":"2023","unstructured":"Bakshi M, Chowdhury C, Maulik U (2023) Cuckoo search optimization-based energy efficient job scheduling approach for iot-edge environment. J Supercomput 79:18227\u201318255. https:\/\/doi.org\/10.1007\/s11227-023-05358-1","journal-title":"J. Supercomput."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06771-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06771-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06771-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T14:05:14Z","timestamp":1736258714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06771-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,7]]},"references-count":27,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,1]]}},"alternative-id":["6771"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06771-w","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,7]]},"assertion":[{"value":"23 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"374"}}