{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:53:50Z","timestamp":1743058430477,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031302282"},{"type":"electronic","value":"9783031302299"}],"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-30229-9_21","type":"book-chapter","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T19:02:39Z","timestamp":1680980559000},"page":"319-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Use of\u00a0a\u00a0Genetic Algorithm to\u00a0Evolve the\u00a0Parameters of\u00a0an\u00a0Iterated Function System in\u00a0Order to\u00a0Create Adapted Phenotypic Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6873-7549","authenticated-orcid":false,"given":"Habiba","family":"Akter","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1669-2393","authenticated-orcid":false,"given":"Rupert","family":"Young","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7740-9379","authenticated-orcid":false,"given":"Phil","family":"Birch","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9371-8502","authenticated-orcid":false,"given":"Chris","family":"Chatwin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"key":"21_CR1","unstructured":"Akter, H.: AS domain tunnelling for user-selectable loose source routing, Ph. D. thesis, Queen Mary University of London (2020)"},{"issue":"2","key":"21_CR2","first-page":"22","volume":"82","author":"P Ball","year":"2012","unstructured":"Ball, P.: Pattern formation in nature: Physical constraints and self-organising characteristics. Archit. Des. 82(2), 22\u201327 (2012)","journal-title":"Archit. Des."},{"key":"21_CR3","volume-title":"Fractals everywhere","author":"MF Barnsley","year":"2014","unstructured":"Barnsley, M.F.: Fractals everywhere. Academic press, Boston (2014)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Barnsley, M.F., Demko, S.: Iterated function systems and the global construction of fractals. Proceed. Royal Soc. London. A. Math. Phys. Sci. 399(1817), 243\u2013275 (1985)","DOI":"10.1098\/rspa.1985.0057"},{"issue":"23","key":"21_CR5","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cub.2016.09.044","volume":"26","author":"N Bhatia","year":"2016","unstructured":"Bhatia, N., Bozorg, B., Larsson, A., Ohno, C., J\u00f6nsson, H., Heisler, M.G.: Auxin acts through monopteros to regulate plant cell polarity and pattern phyllotaxis. Curr. Biol. 26(23), 3202\u20133208 (2016)","journal-title":"Curr. Biol."},{"issue":"6","key":"21_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0143-8166(00)00044-0","volume":"33","author":"P Birch","year":"2000","unstructured":"Birch, P., Young, R., Farsari, M., Chatwin, C., Budgett, D.: A comparison of the iterative Fourier Transform method and evolutionary algorithms for the design of diffractive optical elements. Opt. Lasers Eng. 33(6), 439\u2013448 (2000)","journal-title":"Opt. Lasers Eng."},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Bunde, A., Havlin, S. (eds.): Fractals in science. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-642-77953-4","DOI":"10.1007\/978-3-642-77953-4"},{"key":"21_CR8","unstructured":"Carroll, S.B.: Endless forms most beautiful: The new science of evo devo and the making of the animal kingdom. WW Norton & Company, USA (2005)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Chiu, C.S.: A genetic algorithm for multiobjective path optimisation problem. In: 2010 Sixth International Conference on Natural Computation, vol. 5, pp. 2217\u20132222. IEEE (2010)","DOI":"10.1109\/ICNC.2010.5582429"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0097-8493(03)00035-9","volume":"27","author":"HT Chu","year":"2003","unstructured":"Chu, H.T., Chen, C.C.: On bounding boxes of iterated function system attractors. Comput. Graph. 27(3), 407\u2013414 (2003)","journal-title":"Comput. Graph."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ydbio.2011.02.004","volume":"357","author":"EH Davidson","year":"2011","unstructured":"Davidson, E.H.: Evolutionary bioscience as regulatory systems biology. Dev. Biol. 357(1), 35\u201340 (2011)","journal-title":"Dev. Biol."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Dullemeijer, P.: The self-made tapestry: pattern formation in nature. Science 284(5420), 1627 (1999)","DOI":"10.1126\/science.284.5420.1627"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Gen, M., Cheng, R.: Genetic algorithms and engineering optimization, vol. 7. John Wiley & Sons (1999)","DOI":"10.1002\/9780470172261"},{"key":"21_CR14","unstructured":"Goldberg, D.E.: Optimization, and machine learning. Genetic algorithms in Search (1989)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of genetic algorithms, vol. 1, pp. 69\u201393. Elsevier (1991)","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"issue":"12","key":"21_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.3390\/info10120390","volume":"10","author":"A Hassanat","year":"2019","unstructured":"Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., Prasath, V.: Choosing mutation and crossover ratios for genetic algorithms-a review with a new dynamic approach. Information 10(12), 390 (2019)","journal-title":"Information"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Haupt, R.L., Haupt, S.E.: Practical genetic algorithms. John Wiley & Sons (2004)","DOI":"10.1002\/0471671746"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Holland, J.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press (1992)","DOI":"10.7551\/mitpress\/1090.001.0001"},{"issue":"5","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1073\/pnas.0509839103","volume":"103","author":"H J\u00f6nsson","year":"2006","unstructured":"J\u00f6nsson, H., Heisler, M.G., Shapiro, B.E., Meyerowitz, E.M., Mjolsness, E.: An auxin-driven polarized transport model for phyllotaxis. Proc. Natl. Acad. Sci. 103(5), 1633\u20131638 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00175355","volume":"4","author":"JR Koza","year":"1994","unstructured":"Koza, J.R.: Genetic programming as a means for programming computers by natural selection. Stat. Comput. 4(2), 87\u2013112 (1994)","journal-title":"Stat. Comput."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Liu, F., Tang, X., Yang, Z.: An encoding algorithm based on the shortest path problem. In: 2018 14th International Conference on Computational Intelligence and Security (CIS), pp. 35\u201339. IEEE (2018)","DOI":"10.1109\/CIS2018.2018.00016"},{"key":"21_CR22","unstructured":"Mandelbrot, B.B., Mandelbrot, B.B.: The fractal geometry of nature, vol. 1. WH freeman and Co., New York (1982)"},{"key":"21_CR23","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency (algorithms and combinatorics). J. Operat. Res. Soc. 55(9), 1018 (2004)"},{"issue":"5","key":"21_CR24","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1073\/pnas.0510457103","volume":"103","author":"RS Smith","year":"2006","unstructured":"Smith, R.S., Guyomarc\u2019h, S., Mandel, T., Reinhardt, D., Kuhlemeier, C., Prusinkiewicz, P.: A plausible model of phyllotaxis. Proc. Natl. Acad. Sci. 103(5), 1301\u20131306 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"21_CR25","unstructured":"V\u00e9hel, J.L., Lutton, E.: Optimization of fractal: function using genetic algorithms, Ph. D. thesis, INRIA (1993)"},{"key":"21_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.rineng.2020.100106","volume":"6","author":"J Wu","year":"2020","unstructured":"Wu, J., Jin, X., Mi, S., Tang, J.: An effective method to compute the box-counting dimension based on the mathematical definition and intervals. Results Eng. 6, 100106 (2020)","journal-title":"Results Eng."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30229-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T23:09:20Z","timestamp":1681081760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30229-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031302282","9783031302299"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30229-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evoapps\/","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":"78","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":"37","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":"47% - 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":"3","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)"}}]}}