{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:29:06Z","timestamp":1762338546321,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031417733"},{"type":"electronic","value":"9783031417740"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-41774-0_41","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T03:25:20Z","timestamp":1695266720000},"page":"521-533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Lamarckian and\u00a0Baldwinian Approaches in\u00a0Memetic Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7686-7319","authenticated-orcid":false,"given":"Mei","family":"Jiaojiao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6367-6695","authenticated-orcid":false,"given":"L\u00e1szl\u00f3","family":"Guly\u00e1s","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7838-6148","authenticated-orcid":false,"given":"J\u00e1nos","family":"Botzheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"issue":"1","key":"41_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s12293-018-0256-7","volume":"11","author":"M Bereta","year":"2019","unstructured":"Bereta, M.: Baldwin effect and Lamarckian evolution in a memetic algorithm for Euclidean Steiner tree problem. Memetic Comput. 11(1), 35\u201352 (2019)","journal-title":"Memetic Comput."},{"key":"41_CR2","volume-title":"The Selfish Gene","author":"R Dawkins","year":"1978","unstructured":"Dawkins, R.: The Selfish Gene. Oxford University Press, Oxford (1978)"},{"key":"41_CR3","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-72960-0_10","volume-title":"Advances in Metaheuristics for Hard Optimization","author":"C Garc\u00eda-Mart\u00ednez","year":"2008","unstructured":"Garc\u00eda-Mart\u00ednez, C., Lozano, M.: Local search based on genetic algorithms. In: Siarry, P., Michalewicz, Z. (eds.) Advances in Metaheuristics for Hard Optimization. NCS, pp. 199\u2013221. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-540-72960-0_10"},{"key":"41_CR4","unstructured":"Grefenstette, J.J., Baker, J.E.: How genetic algorithms work: a critical look at implicit parallelism. In: International Conference on Genetic Algorithms (1989)"},{"key":"41_CR5","unstructured":"Hinton, G.E., Nowlan, S.J.: How learning can guide evolution. Complex Syst. 1 (1996)"},{"key":"41_CR6","unstructured":"Houck, C., Joines, J., Kay, M.: Utilizing Lamarckian evolution and the Baldwin effect in hybrid genetic algorithms (1996)"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-31880-4_26","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Ishibuchi","year":"2005","unstructured":"Ishibuchi, H., Kaige, S., Narukawa, K.: Comparison between Lamarckian and Baldwinian repair on multiobjective 0\/1 Knapsack problems. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 370\u2013385. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_26"},{"key":"41_CR8","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-04448-3_8","volume-title":"Theoretical Aspects of Evolutionary Computing","author":"L Kallel","year":"2001","unstructured":"Kallel, L., Naudts, B., Reeves, C.R.: Properties of fitness functions and search landscapes. In: Kallel, L., Naudts, B., Rogers, A. (eds.) Theoretical Aspects of Evolutionary Computing. NCS, pp. 175\u2013206. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04448-3_8"},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch, S., Chauhan, S.S., Kumar, V.: A review on genetic algorithm: past, present, and future. Multimed. Tools Appl. 80, 8091\u20138126 (2021)","journal-title":"Multimed. Tools Appl."},{"key":"41_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)"},{"key":"41_CR11","unstructured":"Moscato, P., et al.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826(1989), 37 (1989)"},{"key":"41_CR12","volume-title":"Handbook of Memetic Algorithms","author":"F Neri","year":"2011","unstructured":"Neri, F., Cotta, C., Moscato, P.: Handbook of Memetic Algorithms, vol. 379. Springer, Heidelberg (2011)"},{"issue":"2","key":"41_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1177\/1059712309103566","volume":"17","author":"I Paenke","year":"2009","unstructured":"Paenke, I., Jin, Y., Branke, J.: Balancing population-and individual-level adaptation in changing environments. Adapt. Behav. 17(2), 153\u2013174 (2009)","journal-title":"Adapt. Behav."},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-74913-4_36","volume-title":"Advances in Artificial Life","author":"I Paenke","year":"2007","unstructured":"Paenke, I., Sendhoff, B., Rowe, J., Fernando, C.: On the adaptive disadvantage of Lamarckianism in rapidly changing environments. In: Almeida e Costa, F., Rocha, L.M., Costa, E., Harvey, I., Coutinho, A. (eds.) ECAL 2007. LNCS (LNAI), vol. 4648, pp. 355\u2013364. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74913-4_36"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.asoc.2014.08.025","volume":"24","author":"HM Pandey","year":"2014","unstructured":"Pandey, H.M., Chaudhary, A., Mehrotra, D.: A comparative review of approaches to prevent premature convergence in GA. Appl. Soft Comput. 24, 1047\u20131077 (2014)","journal-title":"Appl. Soft Comput."},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58483-8_1","volume-title":"Evolutionary Computing","author":"NJ Radcliffe","year":"1994","unstructured":"Radcliffe, N.J., Surry, P.D.: Formal memetic algorithms. In: Fogarty, T.C. (ed.) AISB EC 1994. LNCS, vol. 865, pp. 1\u201316. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58483-8_1"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/0-387-28356-0_4","volume-title":"Search Methodologies","author":"K Sastry","year":"2005","unstructured":"Sastry, K., Goldberg, D., Kendall, G.: Genetic algorithms. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 97\u2013125. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-28356-0_4"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Syswerda, G.: A study of reproduction in generational and steady-state genetic algorithms. In: Foundations of Genetic Algorithms, vol. 1, pp. 94\u2013101. Elsevier (1991)","DOI":"10.1016\/B978-0-08-050684-5.50009-4"},{"key":"41_CR19","unstructured":"Turney, P.D.: Myths and legends of the Baldwin effect. CoRR cs.LG\/0212036 (2002). http:\/\/arxiv.org\/abs\/cs\/0212036"},{"issue":"24","key":"41_CR20","doi-asserted-by":"publisher","first-page":"7345","DOI":"10.1073\/pnas.1507916112","volume":"112","author":"J Van Cleve","year":"2015","unstructured":"Van Cleve, J., Weissman, D.B.: Measuring ruggedness in fitness landscapes. Proc. Natl. Acad. Sci. 112(24), 7345\u20137346 (2015)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"41_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-58484-6_245","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN III","author":"D Whitley","year":"1994","unstructured":"Whitley, D., Gordon, V.S., Mathias, K.: Lamarckian evolution, the Baldwin effect and function optimization. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 5\u201315. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58484-6_245"}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41774-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T06:35:28Z","timestamp":1695278128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41774-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031417733","9783031417740"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41774-0_41","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2023\/","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":"218","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":"59","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":"27% - 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.01","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":"1.86","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)"}}]}}