{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:53:15Z","timestamp":1743040395987,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581114"},{"type":"electronic","value":"9783030581121"}],"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_29","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"418-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameter-Less Population Pyramid for Permutation-Based Problems"],"prefix":"10.1007","author":[{"given":"Szymon","family":"Wozniak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal W.","family":"Przewozniczek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin M.","family":"Komarnicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. INFORMS J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"INFORMS J. Comput."},{"key":"29_CR2","unstructured":"Bosman, P.A.N., Thierens, D.: Crossing the road to efficient ideas for permutation problems. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, GECCO 2001, pp. 219\u2013226. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bosman, P.A., Luong, N.H., Thierens, D.: Expanding from discrete Cartesian to permutation gene-pool optimal mixing evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, GECCO 2016, pp. 637\u2013644. Association for Computing Machinery, New York (2016)","DOI":"10.1145\/2908812.2908917"},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","volume":"18","author":"J Ceberio","year":"2014","unstructured":"Ceberio, J., Irurozki, E., Mendiburu, A., Lozano, J.A.: A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans. Evol. Comput. 18(2), 286\u2013300 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"29_CR5","doi-asserted-by":"publisher","unstructured":"Goldman, B.W., Punch, W.F.: Parameter-less population pyramid. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, GECCO 2014, pp. 785\u2013792. ACM, New York (2014). \nhttps:\/\/doi.org\/10.1145\/2576768.2598350","DOI":"10.1145\/2576768.2598350"},{"key":"29_CR6","doi-asserted-by":"publisher","unstructured":"Gomes, T.M., de Freitas, A.R.R., Lopes, R.A.: Multi-heap constraint handling in gray box evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 829\u2013836. Association for Computing Machinery, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3321707.3321872","DOI":"10.1145\/3321707.3321872"},{"key":"29_CR7","unstructured":"Harik, G.R., Lobo, F.G.: A parameter-less genetic algorithm. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation - Volume 1, GECCO 1999, pp. 258\u2013265 (1999)"},{"key":"29_CR8","doi-asserted-by":"publisher","unstructured":"Hsu, S.H., Yu, T.L.: Optimization by pairwise linkage detection, incremental linkage set, and restricted\/back mixing: DSMGA-II. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO 2015, pp. 519\u2013526. ACM, New York (2015). \nhttps:\/\/doi.org\/10.1145\/2739480.2754737","DOI":"10.1145\/2739480.2754737"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Komarnicki, M.M., Przewozniczek, M.W.: Comparative mixing for DSMGA-II. In: Proceedings of the 2020 Annual Conference on Genetic and Evolutionary Computation, GECCO 2020 (2020, in press)","DOI":"10.1145\/3377930.3390223"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1109\/TEVC.2010.2102038","volume":"15","author":"H Kwasnicka","year":"2011","unstructured":"Kwasnicka, H., Przewozniczek, M.: Multi population pattern searching algorithm: a new evolutionary method based on the idea of messy genetic algorithm. IEEE Trans. Evol. Comput. 15, 715\u2013734 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"29_CR11","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TEVC.2017.2694221","volume":"21","author":"MN Omidvar","year":"2017","unstructured":"Omidvar, M.N., Yang, M., Mei, Y., Li, X., Yao, X.: DG2: a faster and more accurate differential grouping for large-scale black-box optimization. IEEE Trans. Evol. Comput. 21(6), 929\u2013942 (2017). \nhttps:\/\/doi.org\/10.1109\/TEVC.2017.2694221","journal-title":"IEEE Trans. Evol. Comput."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Przewozniczek, M.W., Frej, B., Komarnicki, M.M.: On measuring and improving the quality of linkage learning in modern evolutionary algorithms applied to solve partially additively separable problems. In: Proceedings of the 2020 Annual Conference on Genetic and Evolutionary Computation, GECCO 2020 (2020, in press)","DOI":"10.1145\/3377930.3390242"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Przewozniczek, M.W., Komarnicki, M.M.: Empirical linkage learning. IEEE Trans. Evol. Comput. (2020, in press)","DOI":"10.1145\/3377929.3397771"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Watson, R.A., Hornby, G.S., Pollack, J.B.: Hierarchical building-block problems for GA evaluation. In: Proceedings of the 1998 International Conference on Parallel Problem Solving from Nature, vol. 2, pp. 97\u2013106 (1998)","DOI":"10.1007\/BFb0056853"},{"key":"29_CR15","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993). Project Management anf Scheduling"},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Thierens, D., Bosman, P.A.: Hierarchical problem solving with the linkage tree genetic algorithm. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013, pp. 877\u2013884. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2463372.2463477","DOI":"10.1145\/2463372.2463477"},{"issue":"3","key":"29_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1162\/EVCO_a_00184","volume":"24","author":"LD Whitley","year":"2016","unstructured":"Whitley, L.D., Chicano, F., Goldman, B.W.: Gray box optimization for Mk landscapes (NK landscapes and MAX-kSAT). Evol. Comput. 24(3), 491\u2013519 (2016)","journal-title":"Evol. Comput."},{"key":"29_CR18","doi-asserted-by":"publisher","unstructured":"Zielinski, A.M., Komarnicki, M.M., Przewozniczek, M.W.: Parameter-less population pyramid with automatic feedback. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, pp. 312\u2013313. Association for Computing Machinery, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3319619.3322052","DOI":"10.1145\/3319619.3322052"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:17:25Z","timestamp":1599063445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}