{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T06:01:35Z","timestamp":1783749695729,"version":"3.55.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581114","type":"print"},{"value":"9783030581121","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_16","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T12:04:30Z","timestamp":1599048270000},"page":"229-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Can Compact Optimisation Algorithms Be Structurally Biased?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4138-7024","authenticated-orcid":false,"given":"Anna V.","family":"Kononova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9199-7368","authenticated-orcid":false,"given":"Fabio","family":"Caraffini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4933-5181","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6768-1478","authenticated-orcid":false,"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Campelo, F., Aranha, C.: EC bestiary: a bestiary of evolutionary, swarm and other metaphor-based algorithms, June 2018. https:\/\/doi.org\/10.5281\/zenodo.1293352","DOI":"10.5281\/zenodo.1293352"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Caraffini, F.: The stochastic optimisation software (SOS) platform, June 2019. https:\/\/doi.org\/10.5281\/zenodo.3237023","DOI":"10.5281\/zenodo.3237023"},{"issue":"5","key":"16_CR4","doi-asserted-by":"publisher","first-page":"785","DOI":"10.3390\/math8050785","volume":"8","author":"F Caraffini","year":"2020","unstructured":"Caraffini, F., Iacca, G.: The SOS platform: designing, tuning and statistically benchmarking optimisation algorithms. Mathematics 8(5), 785 (2020). https:\/\/doi.org\/10.3390\/math8050785","journal-title":"Mathematics"},{"key":"16_CR5","unstructured":"Caraffini, F., Kononova, A.V.: Structural bias in differential evolution: a preliminary study. In: 14th International Workshop on Global Optimization, LeGO 2018, vol. 2070, p. 020005. AIP, Leiden (2018)"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Caraffini, F., Kononova, A.V.: Structural Bias in Optimisation Algorithms: Extended Results (2020). https:\/\/doi.org\/10.17632\/zdh2phb3b4.2 . Mendeley Data","DOI":"10.17632\/zdh2phb3b4.2"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ins.2019.05.019","volume":"496","author":"F Caraffini","year":"2019","unstructured":"Caraffini, F., Kononova, A.V., Corne, D.W.: Infeasibility and structural bias in differential evolution. Inf. Sci. 496, 161\u2013179 (2019). https:\/\/doi.org\/10.1016\/j.ins.2019.05.019","journal-title":"Inf. Sci."},{"key":"16_CR8","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-01085-9_2","volume-title":"Foundations of Computational Intelligence","author":"S Das","year":"2009","unstructured":"Das, S., Biswas, A., Dasgupta, S., Abraham, A.: Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications. In: Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence. SCI, vol. 203, pp. 23\u201355. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01085-9_2"},{"key":"16_CR9","unstructured":"De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, USA (1975)"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.swevo.2011.08.003","volume":"1","author":"M Hauschild","year":"2011","unstructured":"Hauschild, M., Pelikan, M.: An introduction and survey of estimation of distribution algorithms. Swarm Evol. Comput. 1(3), 111\u2013128 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.08.003","journal-title":"Swarm Evol. Comput."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-030-16692-2_35","volume-title":"Applications of Evolutionary Computation","author":"G Iacca","year":"2019","unstructured":"Iacca, G., Caraffini, F.: Compact optimization algorithms with re-sampled inheritance. In: Kaufmann, P., Castillo, P.A. (eds.) EvoApplications 2019. LNCS, vol. 11454, pp. 523\u2013534. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16692-2_35"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF01898350","volume":"1","author":"A Inselberg","year":"1985","unstructured":"Inselberg, A.: The plane with parallel coordinates. Vis. Comput. 1(2), 69\u201391 (1985). https:\/\/doi.org\/10.1007\/BF01898350","journal-title":"Vis. Comput."},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0167-7152(97)00020-5","volume":"35","author":"A Justel","year":"1997","unstructured":"Justel, A., Pe\u00f1a, D., Zamar, R.: A multivariate Kolmogorov-Smirnov test of goodness of fit. Stat. Probab. Lett. 35(3), 251\u2013259 (1997)","journal-title":"Stat. Probab. Lett."},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Kononova, A.V., Caraffini, F., Wang, H., B\u00e4ck, T.: Can single solution optimisation methods be structurally biased? MDPI Preprints (2020). https:\/\/doi.org\/10.20944\/preprints202002.0277.v1","DOI":"10.20944\/preprints202002.0277.v1"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.ins.2014.11.035","volume":"298","author":"AV Kononova","year":"2015","unstructured":"Kononova, A.V., Corne, D.W., Wilde, P.D., Shneer, V., Caraffini, F.: Structural bias in population-based algorithms. Inf. Sci. 298, 468\u2013490 (2015). https:\/\/doi.org\/10.1016\/j.ins.2014.11.035","journal-title":"Inf. Sci."},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0167-7152(02)00310-3","volume":"60","author":"JT Kost","year":"2002","unstructured":"Kost, J.T., McDermott, M.P.: Combining dependent p-values. Stat. Probab. Lett. 60(2), 183\u2013190 (2002)","journal-title":"Stat. Probab. Lett."},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"L\u2019Ecuyer, P., Simard, R.: TestU01: a C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4) (2007). https:\/\/doi.org\/10.1145\/1268776.1268777","DOI":"10.1145\/1268776.1268777"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178\u2013187. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_982"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Goldberg, D., Lobo, F.: A survey of optimization by building and using probabilistic models. In: Proceedings of the 2000 American Control Conference, vol. 5, pp. 3289\u20133293 (2000)","DOI":"10.1109\/ACC.2000.879173"},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11721-016-0129-y","volume":"10","author":"AP Piotrowski","year":"2016","unstructured":"Piotrowski, A.P., Napiorkowski, J.J.: Searching for structural bias in particle swarm optimization and differential evolution algorithms. Swarm Intell. 10(4), 307\u2013353 (2016). https:\/\/doi.org\/10.1007\/s11721-016-0129-y","journal-title":"Swarm Intell."},{"key":"16_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31306-0","volume-title":"Differential Evolution: A Practical Approach to Global Optimization","author":"KV Price","year":"2005","unstructured":"Price, K.V., Storn, R., Lampinen, J.: Differential Evolution: A Practical Approach to Global Optimization. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-31306-0"},{"issue":"1","key":"16_CR22","first-page":"21","volume":"2","author":"NM Razali","year":"2011","unstructured":"Razali, N.M., Wah, Y.B.: Power comparisons of Shapiro-Wilk, Kolmogorov-Smirnov, Lilliefors and Anderson-Darling tests. J. Stat. Model. Anal. 2(1), 21\u201333 (2011)","journal-title":"J. Stat. Model. Anal."},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997). https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T13:14:07Z","timestamp":1617110047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_16","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202004.0403.v1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","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":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","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":"268","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":"99","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":"37% - 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","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":"2.2","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)"}}]}}