{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:42:40Z","timestamp":1743090160603,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_11","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"146-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Surrogate-Assisted LSHADE Algorithm Utilizing Recursive Least Squares Filter"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9371-1690","authenticated-orcid":false,"given":"Mateusz","family":"Zaborski","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0947-028X","authenticated-orcid":false,"given":"Jacek","family":"Ma\u0144dziuk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Atkeson, C.G., Moore, A.W., Schaal, S.: Locally weighted learning. In: Aha, D.W. (ed.) Lazy Learning, pp. 11\u201373. Springer, Dordrecht (1997). https:\/\/doi.org\/10.1007\/978-94-017-2053-3_2","DOI":"10.1007\/978-94-017-2053-3_2"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1769\u20131776. IEEE (2005)","DOI":"10.1109\/CEC.2005.1554902"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-30217-9_19","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"A Auger","year":"2004","unstructured":"Auger, A., Schoenauer, M., Vanhaecke, N.: LS-CMA-ES: a second-order algorithm for covariance matrix adaptation. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 182\u2013191. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_19"},{"key":"11_CR4","doi-asserted-by":"crossref","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), pp. 372\u2013379. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969336"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bajer, L., Pitra, Z., Hole\u0148a, M.: Benchmarking gaussian processes and random forests surrogate models on the bbob noiseless testbed. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1143\u20131150 (2015)","DOI":"10.1145\/2739482.2768468"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1162\/evco_a_00244","volume":"27","author":"L Bajer","year":"2019","unstructured":"Bajer, L., Pitra, Z., Repick\u1ef3, J., Hole\u0148a, M.: Gaussian process surrogate models for the CMA evolution strategy. Evol. Comput. 27(4), 665\u2013697 (2019)","journal-title":"Evol. Comput."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Biswas, S., Saha, D., De, S., Cobb, A.D., Das, S., Jalaian, B.A.: Improving differential evolution through Bayesian hyperparameter optimization. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 832\u2013840. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9504792"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bliek, L., Guijt, A., Verwer, S., De Weerdt, M.: Black-box mixed-variable optimisation using a surrogate model that satisfies integer constraints. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1851\u20131859 (2021)","DOI":"10.1145\/3449726.3463136"},{"issue":"7","key":"11_CR9","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10472-020-09712-4","volume":"89","author":"L Bliek","year":"2020","unstructured":"Bliek, L., Verwer, S., de Weerdt, M.: Black-box combinatorial optimization using models with integer-valued minima. Ann. Math. Artif. Intell. 89(7), 639\u2013653 (2020). https:\/\/doi.org\/10.1007\/s10472-020-09712-4","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR10","unstructured":"Chen, Q., Liu, B., Zhang, Q., Liang, J., Suganthan, P., Qu, B.: Problem definitions and evaluation criteria for CEC 2015 special session on bound constrained single-objective computationally expensive numerical optimization. Technical report, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Technical report, Nanyang Technological University (2014)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00889887","volume":"22","author":"N Cressie","year":"1990","unstructured":"Cressie, N.: The origins of kriging. Math. Geol. 22(3), 239\u2013252 (1990)","journal-title":"Math. Geol."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, N.: A global surrogate assisted CMA-ES. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 664\u2013672 (2019)","DOI":"10.1145\/3321707.3321842"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen, N., M\u00fcller, S.D., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput. 11(1), 1\u201318 (2003)","journal-title":"Evol. Comput."},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0951-8320(03)00058-9","volume":"81","author":"JC Helton","year":"2003","unstructured":"Helton, J.C., Davis, F.J.: Latin hypercube sampling and the propagation of uncertainty in analyses of complex systems. Reliabil. Eng. Syst. Saf. 81(1), 23\u201369 (2003)","journal-title":"Reliabil. Eng. Syst. Saf."},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.swevo.2011.05.001","volume":"1","author":"Y Jin","year":"2011","unstructured":"Jin, Y.: Surrogate-assisted evolutionary computation: recent advances and future challenges. Swarm Evol. Comput. 1(2), 61\u201370 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4), 455\u2013492 (1998)","journal-title":"J. Global Optim."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1007\/11844297_95","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"S Kern","year":"2006","unstructured":"Kern, S., Hansen, N., Koumoutsakos, P.: Local meta-models for optimization using evolution strategies. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 939\u2013948. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844297_95"},{"key":"11_CR19","unstructured":"Mohamed, A.W., Hadi, A.A., Mohamed, A.K., Agrawal, P., Kumar, A., Suganthan, P.: Problem definitions and evaluation criteria for the CEC 2021 special session and competition on single objective bound constrained numerical optimization. https:\/\/github.com\/P-N-Suganthan\/2021-SO-BCO\/blob\/main\/CEC2021%20TR_final%20(1).pdf"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Nishida, K., Akimoto, Y.: Benchmarking the PSA-CMA-ES on the BBOB noiseless testbed. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1529\u20131536 (2018)","DOI":"10.1145\/3205651.3208297"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Sallam, K.M., Elsayed, S.M., Chakrabortty, R.K., Ryan, M.J.: Improved multi-operator differential evolution algorithm for solving unconstrained problems. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185577"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Sayed, A.H., Kailath, T.: Recursive least-squares adaptive filters. Digit. Sig. Process. Handb. 21(1) (1998)","DOI":"10.1201\/9781420046076-c21"},{"issue":"4","key":"11_CR23","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 - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.: Success-history based parameter adaptation for differential evolution. In: 2013 IEEE Congress on Evolutionary Computation, pp. 71\u201378. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557555"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.S.: Improving the search performance of SHADE using linear population size reduction. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 1658\u20131665. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900380"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Vikhar, P.A.: Evolutionary algorithms: a critical review and its future prospects. In: 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC), pp. 261\u2013265. IEEE (2016)","DOI":"10.1109\/ICGTSPICC.2016.7955308"},{"key":"11_CR27","unstructured":"Weisberg, S.: Applied Linear Regression. Wiley, Hoboken (2013)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Yamaguchi, T., Akimoto, Y.: Benchmarking the novel CMA-ES restart strategy using the search history on the BBOB noiseless testbed. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1780\u20131787 (2017)","DOI":"10.1145\/3067695.3084203"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Zaborski, M., Ma\u0144dziuk, J.: Improving LSHADE by means of a pre-screening mechanism. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2022, Boston, Massachusetts, pp. 884\u2013892. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3512290.3528805","DOI":"10.1145\/3512290.3528805"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Zaborski, M., Ma\u0144dziuk, J.: LQ-R-SHADE: R-SHADE with quadratic surrogate model. In: Proceedings of the 21st International Conference on Artificial Intelligence and Soft Computing (ICAISC 2022), Zakopane, Poland (2022)","DOI":"10.1007\/978-3-031-23492-7_23"},{"issue":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2478\/fcds-2020-0013","volume":"45","author":"M Zaborski","year":"2020","unstructured":"Zaborski, M., Okulewicz, M., Ma\u0144dziuk, J.: Analysis of statistical model-based optimization enhancements in generalized self-adapting particle swarm optimization framework. Found. Comput. Decis. Sci. 45(3), 233\u2013254 (2020)","journal-title":"Found. Comput. Decis. Sci."},{"issue":"5","key":"11_CR32","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang, J., Sanderson, A.C.: JADE: adaptive differential evolution with optional external archive. IEEE Trans. Evol. Comput. 13(5), 945\u2013958 (2009)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T17:48:48Z","timestamp":1727804928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}