{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:09:43Z","timestamp":1778213383986,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032236036","type":"print"},{"value":"9783032236043","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-23604-3_28","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:17:22Z","timestamp":1778210242000},"page":"451-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to\u00a0Search: A Reinforcement Learning Agent for\u00a0Global Optimization"],"prefix":"10.1007","author":[{"given":"Boukthir","family":"Haddar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Ali","family":"Elleuch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chedli","family":"Damak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","unstructured":"Awad, N.H., Ali, M.Z., Suganthan, P.N.: Ensemble sinusoidal differential covariance matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark problems. In: 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia, San Sebasti\u00e1n, Spain, pp. 372\u2013379. IEEE (2017). https:\/\/doi.org\/10.1109\/CEC.2017.7969336","DOI":"10.1109\/CEC.2017.7969336"},{"issue":"5044","key":"28_CR2","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1126\/science.1736359","volume":"255","author":"A Baddeley","year":"1992","unstructured":"Baddeley, A.: Working memory. Science 255(5044), 556\u2013559 (1992). https:\/\/doi.org\/10.1126\/science.1736359","journal-title":"Science"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"108457","DOI":"10.1016\/j.knosys.2022.108457","volume":"243","author":"M Braik","year":"2022","unstructured":"Braik, M., Hammouri, A., Atwan, J., Al-Betar, M.A., Awadallah, M.A.: White shark optimizer: a novel bio-inspired meta-heuristic algorithm for global optimization problems. Knowl. Based Syst. 243, 108457 (2022). https:\/\/doi.org\/10.1016\/j.knosys.2022.108457","journal-title":"Knowl. Based Syst."},{"issue":"22","key":"28_CR4","doi-asserted-by":"publisher","first-page":"20017","DOI":"10.1007\/s00521-022-07530-9","volume":"34","author":"AE Ezugwu","year":"2022","unstructured":"Ezugwu, A.E., Agushaka, J.O., Abualigah, L., Mirjalili, S., Gandomi, A.H.: Prairie dog optimization algorithm. Neural Comput. Appl. 34(22), 20017\u201320065 (2022). https:\/\/doi.org\/10.1007\/s00521-022-07530-9","journal-title":"Neural Comput. Appl."},{"key":"28_CR5","doi-asserted-by":"publisher","unstructured":"Fialho, \u00c1., Da Costa, L., Schoenauer, M., Sebag, M.: Dynamic multi-armed bandits and extreme value-based rewards for adaptive operator selection in evolutionary algorithms. In: St\u00fctzle, T. (ed.) Learning and Intelligent Optimization, LION 2009, LNCS, vol. 5851, pp. 176\u2013190. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11169-3_13","DOI":"10.1007\/978-3-642-11169-3_13"},{"issue":"6","key":"28_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda, S., Molina, D., Lozano, M., Herrera, F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J. Heuristics 15(6), 617\u2013644 (2009). https:\/\/doi.org\/10.1007\/s10732-008-9080-4","journal-title":"J. Heuristics"},{"key":"28_CR7","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"DE Goldberg","year":"1988","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning, 1st edn. Addison-Wesley, Reading, MA (1988)","edition":"1"},{"key":"28_CR8","unstructured":"Hadi, A.A., Mohamed, A.W., Jambi, K.M.: ELSHADE-SPACMA: enhanced LSHADE-SPACMA algorithm for solving CEC2018 real-parameter optimization problems. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2018)"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.ijforecast.2003.09.015","volume":"20","author":"CC Holt","year":"2004","unstructured":"Holt, C.C.: Forecasting seasonals and trends by exponentially weighted moving averages. Int. J. Forecast. 20(1), 5\u201310 (2004). https:\/\/doi.org\/10.1016\/j.ijforecast.2003.09.015","journal-title":"Int. J. Forecast."},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2014","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.E.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19(2), 167\u2013187 (2014). https:\/\/doi.org\/10.1109\/TEVC.2014.2308294","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR11","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks, Perth, Australia, vol. 4, pp. 1942\u20131948. IEEE (1995). https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen, K.: Metaheuristics-the metaphor exposed. Int. Trans. Oper. Res. 22, 3\u201318 (2015). https:\/\/doi.org\/10.1111\/itor.12001","journal-title":"Int. Trans. Oper. Res."},{"issue":"5","key":"28_CR13","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1103\/PhysRevE.49.4677","volume":"49","author":"RN Mantegna","year":"1994","unstructured":"Mantegna, R.N.: Fast, accurate algorithm for numerical simulation of L\u00e9vy stable stochastic processes. Phys. Rev. E 49(5), 4677\u20134683 (1994). https:\/\/doi.org\/10.1103\/PhysRevE.49.4677","journal-title":"Phys. Rev. E"},{"issue":"5560","key":"28_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1038\/261459a0","volume":"261","author":"RM May","year":"1976","unstructured":"May, R.M.: Simple mathematical models with very complicated dynamics. Nature 261(5560), 459\u2013467 (1976). https:\/\/doi.org\/10.1038\/261459a0","journal-title":"Nature"},{"issue":"5","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"28","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili, S.: Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput. Appl. 28(5), 1053\u20131073 (2017). https:\/\/doi.org\/10.1007\/s00521-015-1920-1","journal-title":"Neural Comput. Appl."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"100455","DOI":"10.1016\/j.swevo.2018.10.006","volume":"50","author":"AW Mohamed","year":"2019","unstructured":"Mohamed, A.W., Hadi, A.A., Jambi, K.M.: Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization. Swarm Evol. Comput. 50, 100455 (2019). https:\/\/doi.org\/10.1016\/j.swevo.2018.10.006","journal-title":"Swarm Evol. Comput."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Mohamed, A.W., Hadi, A.A., Mohamed, A.K., Awad, N.H.: Evaluating the performance of adaptive gainingsharing knowledge based algorithm on CEC 2020 benchmark problems. In 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185901"},{"key":"28_CR18","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-58930-1_7","volume-title":"Heuristics for Optimization and Learning","author":"AA Hadi","year":"2021","unstructured":"Hadi, A.A., Mohamed, A.W., Jambi, K.M.: Single-objective real-parameter optimization: enhanced LSHADE-SPACMA algorithm. In: Yalaoui, F., Amodeo, L., Talbi, E.-G. (eds.) Heuristics for Optimization and Learning. SCI, vol. 906, pp. 103\u2013121. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-58930-1_7"},{"key":"28_CR19","doi-asserted-by":"publisher","unstructured":"Pellerin, E., Pigeon, L., Delisle, S.: Self-adaptive parameters in genetic algorithms. In: Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI, Proceeding of SPIE, 12 April 2004, vol. 5433, pp. 53\u201364. SPIE, Orlando, FL (2004). https:\/\/doi.org\/10.1117\/12.542156","DOI":"10.1117\/12.542156"},{"key":"28_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. Wiley, New York (1994)","edition":"1"},{"issue":"1","key":"28_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen, K.: Metaheuristics\u2013the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3\u201318 (2015). https:\/\/doi.org\/10.1111\/itor.12001","journal-title":"Int. Trans. Oper. Res."},{"issue":"4","key":"28_CR22","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997). https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Global Optim."},{"issue":"1","key":"28_CR23","first-page":"9","volume":"1","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press 1(1), 9\u201311 (1998)","journal-title":"MIT Press"},{"key":"28_CR24","doi-asserted-by":"publisher","unstructured":"Tanabe, R., Fukunaga, A.: Improving the search performance of SHADE using linear population size reduction. In: 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China, pp. 1658\u20131665. IEEE (2014). https:\/\/doi.org\/10.1109\/CEC.2014.6900380","DOI":"10.1109\/CEC.2014.6900380"},{"key":"28_CR25","doi-asserted-by":"publisher","unstructured":"Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC\u201906), Vienna, Austria, pp. 695\u2013701. IEEE (2005). https:\/\/doi.org\/10.1109\/CIMCA.2005.1631345","DOI":"10.1109\/CIMCA.2005.1631345"},{"issue":"3\u20134","key":"28_CR26","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8(3\u20134), 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/BF00992698","journal-title":"Mach. Learn."},{"key":"28_CR27","doi-asserted-by":"publisher","unstructured":"Yang, X.-S., Deb, S.: Cuckoo search via L\u00e9vy flights. In: 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), Coimbatore, India, pp. 210\u2013214. IEEE (2009). https:\/\/doi.org\/10.1109\/NABIC.2009.5393690","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-20662-7_2","volume-title":"Experimental Algorithms","author":"X-S Yang","year":"2011","unstructured":"Yang, X.-S.: Metaheuristic optimization: algorithm analysis and open problems. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 21\u201332. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_2"},{"key":"28_CR29","doi-asserted-by":"publisher","unstructured":"Yang, X.-S.: Nature-Inspired Optimization Algorithms. Elsevier, Amsterdam (2014). https:\/\/doi.org\/10.1016\/C2013-0-01368-0","DOI":"10.1016\/C2013-0-01368-0"},{"key":"28_CR30","unstructured":"Yue, C.T., et al.: Problem definitions and evaluation criteria for the CEC 2020 special session and competition on single-objective bound-constrained numerical optimization. Technical Report 201911, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China (2019)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-23604-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:17:26Z","timestamp":1778210246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-23604-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032236036","9783032236043"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-23604-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}