{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:28:08Z","timestamp":1761920888315,"version":"3.41.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779634"},{"type":"electronic","value":"9783030779641"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-77964-1_26","type":"book-chapter","created":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T08:03:43Z","timestamp":1623398623000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Socio-cognitive Evolution Strategies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6040-554X","authenticated-orcid":false,"given":"Aleksandra","family":"Urba\u0144czyk","sequence":"first","affiliation":[]},{"given":"Bartosz","family":"Nowak","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3578-9809","authenticated-orcid":false,"given":"Patryk","family":"Orzechowski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5015-1099","authenticated-orcid":false,"given":"Jason H.","family":"Moore","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8459-1877","authenticated-orcid":false,"given":"Marek","family":"Kisiel-Dorohinicki","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6317-7012","authenticated-orcid":false,"given":"Aleksander","family":"Byrski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2006.04.003","volume":"361","author":"DV Arnold","year":"2006","unstructured":"Arnold, D.V.: Weighted multirecombination evolution strategies. Theoret. Comput. Sci. 361(1), 18\u201337 (2006). foundations of Genetic Algorithms","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1037\/0033-295X.84.2.191","volume":"84","author":"A Bandura","year":"1977","unstructured":"Bandura, A.: Self-efficacy: toward a unifying theory of behavioral change. Psychol. Rev. 84(2), 191\u2013215 (1977)","journal-title":"Psychol. Rev."},{"key":"26_CR3","volume-title":"Social Foundations of Thought and Action: A Social Cognitive Theory","author":"A Bandura","year":"1986","unstructured":"Bandura, A.: Social Foundations of Thought and Action: A Social Cognitive Theory. Prentice-Hall, Englewood Cliffs (1986)"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1037\/h0045925","volume":"63","author":"A Bandura","year":"1961","unstructured":"Bandura, A., Ross, D., Ross, S.: Transmission of aggression through the imitation of aggressive models. J. Abnormal Soc. Psychol. 63(3), 575\u2013582 (1961)","journal-title":"J. Abnormal Soc. Psychol."},{"key":"26_CR5","unstructured":"Beume, N., Rudolph, G.: Faster s-metric calculation by considering dominated hypervolume as klee\u2019s measure problem. In: Kovalerchuk, B. (ed.) Proceedings of the Second IASTED International Conference on Computational Intelligence, San Francisco, California, USA, November 20\u201322, 2006, pp. 233\u2013238. IASTED\/ACTA Press (2006)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011). 10.1016\/j.asoc.2011.02.032, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494611000962","DOI":"10.1016\/j.asoc.2011.02.032"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-15844-5_2","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D Brockhoff","year":"2010","unstructured":"Brockhoff, D., Auger, A., Hansen, N., Arnold, D.V., Hohm, T.: Mirrored sampling and sequential selection for evolution strategies. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 11\u201321. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_2"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Bugajski, I., et al.: Enhancing particle swarm optimization with socio-cognitive inspirations. In: Connolly, M. (ed.) International Conference on Computational Science 2016, ICCS 2016. Procedia Computer Science, vol. 80, pp. 804\u2013813. Elsevier (2016)","DOI":"10.1016\/j.procs.2016.05.370"},{"issue":"1","key":"26_CR9","first-page":"257","volume":"61","author":"A Byrski","year":"2013","unstructured":"Byrski, A., Schaefer, R., Smo\u0142ka, M., Cotta, C.: Asymptotic guarantee of success for multi-agent memetic systems. Bull. Pol. Acad. Sci. Tech. Sci. 61(1), 257\u2013278 (2013)","journal-title":"Bull. Pol. Acad. Sci. Tech. Sci."},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1017\/S0269888914000289","volume":"30","author":"A Byrski","year":"2015","unstructured":"Byrski, A., Drezewski, R., Siwik, L., Kisiel-Dorohinicki, M.: Evolutionary multi-agent systems. Knowl. Eng. Rev. 30(2), 171\u2013186 (2015)","journal-title":"Knowl. Eng. Rev."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.jocs.2016.10.010","volume":"21","author":"A Byrski","year":"2017","unstructured":"Byrski, A., Swiderska, E., Lasisz, J., Kisiel-Dorohinicki, M., Lenaerts, T., Samson, D., Indurkhya, B., Now\u00e9, A.: Socio-cognitively inspired ant colony optimization. J. Comput. Sci. 21, 397\u2013406 (2017)","journal-title":"J. Comput. Sci."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Dieterich, J., Hartke, B.: Empirical review of standard benchmark functions using evolutionary global optimization. Appl. Math. 3(18A) (2012)","DOI":"10.4236\/am.2012.330215"},{"key":"26_CR13","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"44531","DOI":"10.1109\/ACCESS.2018.2861760","volume":"6","author":"H Du","year":"2018","unstructured":"Du, H., Wang, Z., Zhan, W., Guo, J.: Elitism and distance strategy for selection of evolutionary algorithms. IEEE Access 6, 44531\u201344541 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2861760","journal-title":"IEEE Access"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001)","journal-title":"Evol. Comput."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Jamasb, A., Motavalli-Anbaran, S.H., Ghasemi, K.: A novel hybrid algorithm of particle swarm optimization and evolution strategies for geophysical non-linear inverse problems. Pure Appl. Geophys. 176 (2019)","DOI":"10.1007\/s00024-018-2059-7"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, vol. 4, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Klose, A.D., Hielscher, A.H.: Hybrid approach for diffuse optical tomography combining evolution strategies and gradient techniques. In: Chance, B., Alfano, R.R., Tromberg, B.J., Tamura, M., Sevick-Muraca, E.M. (eds.) Optical Tomography and Spectroscopy of Tissue IV. International Society for Optics and Photonics, SPIE, vol. 4250, pp. 11\u201319 (2001)","DOI":"10.1117\/12.434484"},{"key":"26_CR19","unstructured":"Koulocheris, D., Vrazopoulos, H., Dertimanis, V.: Hybrid evolution strategy for the design of welded beams. In: Proceedings of International Congress on Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems EUROGEN 2003. CIMNE Barcelona (2003)"},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Liagkouras, K., Metaxiotis, K.: An elitist polynomial mutation operator for improved performance of moeas in computer networks. In: 2013 22nd International Conference on Computer Communication and Networks (ICCCN). pp. 1\u20135 (2013). https:\/\/doi.org\/10.1109\/ICCCN.2013.6614105","DOI":"10.1109\/ICCCN.2013.6614105"},{"key":"26_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2004","unstructured":"Michalewicz, Z., Fogel, D.: How to Solve It: Modern Heuristics. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-07807-5"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/10721187_9","volume-title":"Artificial Evolution","author":"L Moreau-Giraud","year":"2000","unstructured":"Moreau-Giraud, L., Lafon, P.: A hybrid evolution strategy for mixed discrete continuous constrained problems. In: Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M., Ronald, E. (eds.) AE 1999. LNCS, vol. 1829, pp. 123\u2013135. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721187_9"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-93701-4_7","volume-title":"Computational Science \u2013 ICCS 2018","author":"L Placzkiewicz","year":"2018","unstructured":"Placzkiewicz, L., et al.: Hybrid swarm and agent-based evolutionary optimization. In: Shi, Y., et al. (eds.) ICCS 2018. LNCS, vol. 10861, pp. 89\u2013102. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93701-4_7"},{"issue":"5","key":"26_CR24","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1107\/S1600576714014782","volume":"47","author":"M Rabiej","year":"2014","unstructured":"Rabiej, M.: A hybrid immune-evolutionary strategy algorithm for the analysis of the wide-angle X-ray diffraction curves of semicrystalline polymers. J. Appl. Crystallogr. 47(5), 1502\u20131511 (2014)","journal-title":"J. Appl. Crystallogr."},{"key":"26_CR25","unstructured":"Rechenberg, I.: Cybernetic solution path of an experimental problem. Roy. Aircraft Establishment Lib. Transl. 1122 (1965). https:\/\/ci.nii.ac.jp\/naid\/10000137330\/en\/"},{"issue":"3","key":"26_CR26","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.cor.2008.11.003","volume":"37","author":"P Repoussis","year":"2010","unstructured":"Repoussis, P., Tarantilis, C., Br\u00e4ysy, O., Ioannou, G.: A hybrid evolution strategy for the open vehicle routing problem. Comput. Oper. Res. 37(3), 443\u2013455 (2010). hybrid Metaheuristics","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"26_CR27","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1108\/03321640710727638","volume":"26","author":"L dos Santos Coelho","year":"2007","unstructured":"dos Santos Coelho, L., Alotto, P.: Electromagnetic device optimization by hybrid evolution strategy approaches. Int. J. Comput. Math. Electr. Electr. Eng 26(2), 269\u2013279 (2007)","journal-title":"Int. J. Comput. Math. Electr. Electr. Eng"},{"key":"26_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5927-1","volume-title":"Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie: mit einer vergleichenden Einf\u00fchrung in die Hill-Climbing-und Zufallsstrategie","author":"HP Schwefel","year":"1977","unstructured":"Schwefel, H.P.: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie: mit einer vergleichenden Einf\u00fchrung in die Hill-Climbing-und Zufallsstrategie, vol. 1. Springer, Heidelberg (1977). https:\/\/doi.org\/10.1007\/978-3-0348-5927-1"},{"key":"26_CR29","volume-title":"Evolution and Optimum Seeking","author":"HP Schwefel","year":"1995","unstructured":"Schwefel, H.P.: Evolution and Optimum Seeking. Wiley, New York (1995)"},{"key":"26_CR30","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, New York (2009)"},{"key":"26_CR31","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heurist. 8, 541\u2013564 (2002). https:\/\/doi.org\/10.1023\/A:1016540724870","journal-title":"J. Heurist."},{"key":"26_CR32","unstructured":"Huang, T.-Y., Chen, Y.-Y.: Modified evolution strategies with a diversity-based parent-inclusion scheme. In: Proceedings of the 2000. IEEE International Conference on Control Applications. Conference Proceedings (Cat. No.00CH37162), pp. 379\u2013384 (2000)"},{"key":"26_CR33","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The Simple Genetic Algorithm - Foundations and Theory. Complex Adaptive Systems","author":"MD Vose","year":"1999","unstructured":"Vose, M.D.: The Simple Genetic Algorithm - Foundations and Theory. Complex Adaptive Systems. MIT Press, Cambridge (1999)"},{"issue":"1","key":"26_CR34","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"Trans. Evol. Comput."},{"key":"26_CR35","doi-asserted-by":"publisher","unstructured":"Zhang, G., Shi, Y.: Hybrid sampling evolution strategy for solving single objective bound constrained problems. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20137 (2018). https:\/\/doi.org\/10.1109\/CEC.2018.8477908","DOI":"10.1109\/CEC.2018.8477908"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77964-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T22:03:40Z","timestamp":1749593020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77964-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779634","9783030779641"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77964-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"156","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":"48","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":"14","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":"31% - 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":"2.8","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.9","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}