{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:10:48Z","timestamp":1742911848127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"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-26504-4_27","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"378-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Selecting the\u00a0Parameters of\u00a0an\u00a0Evolutionary Algorithm for\u00a0the\u00a0Generation of\u00a0Phenotypically Accurate Fractal Patterns"],"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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2093-8990","authenticated-orcid":false,"given":"John","family":"Woodward","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"27_CR1","unstructured":"Barnsley, M., Hutchinson, J.E., Stenflo, \u00d6.: V-variable fractals and superfractals. arXiv: preprint math\/0312314 (2003)"},{"key":"27_CR2","volume-title":"Fractals Everywhere","author":"MF Barnsley","year":"2014","unstructured":"Barnsley, M.F.: Fractals Everywhere. Academic press, Boston (2014)"},{"issue":"1817","key":"27_CR3","first-page":"243","volume":"399","author":"MF Barnsley","year":"1985","unstructured":"Barnsley, M.F., Demko, S.: Iterated function systems and the global construction of fractals. Proc. Roy. Soc. London. A. Math. Phys. Sci. 399(1817), 243\u2013275 (1985)","journal-title":"Proc. Roy. Soc. London. A. Math. Phys. Sci."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Bay\u0131rl\u0131, M., Selvi, S., \u00c7ak\u0131lc\u0131o\u011flu, U.: Determining different plant leaves\u2019 fractal dimensions: a new approach to taxonomical study of plants (2014)","DOI":"10.3329\/bjb.v43i3.21593"},{"key":"27_CR5","unstructured":"Bourke, P.: Macintosh IFS manual. Retrieved from Paul Bourke: http:\/\/paulbourke.net\/fractals\/ifs (1990)"},{"key":"27_CR6","volume-title":"Fractals in Science","author":"A Bunde","year":"2013","unstructured":"Bunde, A., Havlin, S.: Fractals in Science. Springer, Cham (2013)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Campbell, P., Abhyankar, S.: Fractals, Form, Chance and Dimension (1978)","DOI":"10.1007\/BF03023043"},{"key":"27_CR8","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":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1010065123132","volume":"1","author":"P Collet","year":"2000","unstructured":"Collet, P., Lutton, E., Raynal, F., Schoenauer, M.: Polar ifs+ parisian genetic programming= efficient ifs inverse problem solving. Genet. Program Evolvable Mach. 1(4), 339\u2013361 (2000)","journal-title":"Genet. Program Evolvable Mach."},{"key":"27_CR10","unstructured":"Supervised by Dr Chris Phillips, H.A.: PhD Thesis: AS Domain Tunnelling for User-Selectable Loose Source Routing. PhD thesis, Queen Mary Univesity of London (2020)"},{"key":"27_CR11","volume-title":"Fractal Geometry: Mathematical Foundations and Applications","author":"K Falconer","year":"2004","unstructured":"Falconer, K.: Fractal Geometry: Mathematical Foundations and Applications. John Wiley, Hoboken (2004)"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jmaa.2013.07.011","volume":"409","author":"M Fern\u00e1ndez-Mart\u00ednez","year":"2014","unstructured":"Fern\u00e1ndez-Mart\u00ednez, M., S\u00e1nchez-Granero, M.: Fractal dimension for fractal structures: a hausdorff approach revisited. J. Math. Anal. Appl. 409(1), 321\u2013330 (2014)","journal-title":"J. Math. Anal. Appl."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.topol.2013.10.010","volume":"163","author":"M Fern\u00e1ndez-Mart\u00ednez","year":"2014","unstructured":"Fern\u00e1ndez-Mart\u00ednez, M., S\u00e1nchez-Granero, M.: Fractal dimension for fractal structures. Topology Appl. 163, 93\u2013111 (2014)","journal-title":"Topology Appl."},{"key":"27_CR14","volume-title":"Fractal Worlds: Grown, built, and Imagined","author":"M Frame","year":"2016","unstructured":"Frame, M., Urry, A.: Fractal Worlds: Grown, built, and Imagined. Yale University Press, New Heaven and London (2016)"},{"key":"27_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"},{"key":"27_CR16","first-page":"333","volume":"6","author":"DE Goldberg","year":"1992","unstructured":"Goldberg, D.E., Deb, K., Clark, J.H., et al.: Genetic algorithms, noise, and the sizing of populations. Complex Syst. 6, 333\u2013333 (1992)","journal-title":"Complex Syst."},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/evco.1999.7.3.231","volume":"7","author":"G Harik","year":"1999","unstructured":"Harik, G., Cant\u00fa-Paz, E., Goldberg, D.E., Miller, B.L.: The gambler\u2019s ruin problem, genetic algorithms, and the sizing of populations. Evol. Comput. 7(3), 231\u2013253 (1999)","journal-title":"Evol. Comput."},{"issue":"12","key":"27_CR18","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"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-021-85405-0","volume":"11","author":"A Husain","year":"2021","unstructured":"Husain, A., Reddy, J., Bisht, D., Sajid, M.: Fractal dimension of coastline of Australia. Sci. Rep. 11(1), 1\u201310 (2021)","journal-title":"Sci. Rep."},{"issue":"5","key":"27_CR20","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(5), 8091\u20138126 (2021)","journal-title":"Multimed. Tools Appl."},{"key":"27_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"},{"issue":"1","key":"27_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/4235.728210","volume":"2","author":"WG Macready","year":"1998","unstructured":"Macready, W.G., Wolpert, D.H.: Bandit problems and the exploration\/ exploitation tradeoff. IEEE Trans. Evol. Comput. 2(1), 2\u201322 (1998)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"27_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4017-2","volume-title":"Fractals and Chaos: The Mandelbrot Set and Beyond","author":"BB Mandelbrot","year":"2004","unstructured":"Mandelbrot, B.B., Evertsz, C.J., Gutzwiller, M.C.: Fractals and Chaos: The Mandelbrot Set and Beyond, vol. 3. Springer, Cham (2004)"},{"key":"27_CR24","volume-title":"The Fractal Geometry of Nature","author":"BB Mandelbrot","year":"1982","unstructured":"Mandelbrot, B.B., Mandelbrot, B.B.: The Fractal Geometry of Nature, vol. 1. WH freeman and Co., New York (1982)"},{"issue":"5961","key":"27_CR25","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1038\/308721a0","volume":"308","author":"BB Mandelbrot","year":"1984","unstructured":"Mandelbrot, B.B., Passoja, D.E., Paullay, A.J.: Fractal character of fracture surfaces of metals. Nature 308(5961), 721\u2013722 (1984)","journal-title":"Nature"},{"key":"27_CR26","unstructured":"Pedro, S.S.: Fractal dimensions of leaf shapes. https:\/\/www.math.tamu.edu\/mpilant\/math614\/StudentFinalProjects\/SanPedro_Final.pdf (2009)"},{"issue":"9","key":"27_CR27","first-page":"1018","volume":"55","author":"A Schrijver","year":"2004","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency (algorithms and combinatorics). J.-Oper. Res. Soc. 55(9), 1018\u20131018 (2004)","journal-title":"J.-Oper. Res. Soc."},{"issue":"16","key":"27_CR28","doi-asserted-by":"publisher","first-page":"12363","DOI":"10.1007\/s00521-020-04832-8","volume":"32","author":"A Slowik","year":"2020","unstructured":"Slowik, A., Kwasnicka, H.: Evolutionary algorithms and their applications to engineering problems. Neural Comput. Appl. 32(16), 12363\u201312379 (2020). https:\/\/doi.org\/10.1007\/s00521-020-04832-8","journal-title":"Neural Comput. Appl."},{"key":"27_CR29","unstructured":"V\u00e9hel, J.L., Lutton, E.: Optimization of fractal: function using genetic algorithms. Ph.D. thesis, INRIA (1993)"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:04:38Z","timestamp":1688198678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_27","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":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","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":"72","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":"17","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":"67% - 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)"}}]}}