{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:10:07Z","timestamp":1751703007434,"version":"3.41.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T00:00:00Z","timestamp":1529625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005989","name":"Ministrstvo za Izobra\u017eevanje, Znanost in \u0160port","doi-asserted-by":"publisher","award":["P2-0246"],"award-info":[{"award-number":["P2-0246"]}],"id":[{"id":"10.13039\/501100005989","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10710-018-9324-5","type":"journal-article","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T01:41:23Z","timestamp":1529631683000},"page":"473-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Grammatical evolution as a hyper-heuristic to evolve deterministic real-valued optimization algorithms"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-5432","authenticated-orcid":false,"given":"Iztok","family":"Fajfar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1rp\u00e1d","family":"B\u0171rmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"Puhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,22]]},"reference":[{"key":"9324_CR1","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1186\/s40064-016-2064-1","volume":"5","author":"AF Ali","year":"2016","unstructured":"A.F. Ali, M.A. Tawhid, A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems. SpringerPlus 5, 473 (2016). https:\/\/doi.org\/10.1186\/s40064-016-2064-1","journal-title":"SpringerPlus"},{"key":"9324_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.eswa.2017.11.035","volume":"95","author":"H Assimi","year":"2018","unstructured":"H. Assimi, A. Jamali, A hybrid algorithm coupling genetic programming and nelder-mead for topology and size optimization of trusses with static and dynamic constraints. Expert Syst. Appl. 95, 127\u2013141 (2018)","journal-title":"Expert Syst. Appl."},{"issue":"12","key":"9324_CR3","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"E.K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. \u00d6zcan, R. Qu, Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013). https:\/\/doi.org\/10.1057\/jors.2013.71","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9324_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10589-005-3912-z","volume":"34","author":"\u00c1 B\u0171rmen","year":"2006","unstructured":"\u00c1. B\u0171rmen, J. Puhan, T. Tuma, Grid restrained Nelder\u2013Mead algorithm. Comput. Optim. Appl. 34(3), 359\u2013375 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"9324_CR5","doi-asserted-by":"publisher","unstructured":"J. Byrne, M. O\u2019Neill, A. Brabazon, Structural and nodal mutation in grammatical evolution, in Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, ACM, New York, NY, USA, GECCO \u201909, pp. 1881\u20131882 (2009). https:\/\/doi.org\/10.1145\/1569901.1570215","DOI":"10.1145\/1569901.1570215"},{"key":"9324_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0377-2217(02)00401-0","volume":"148","author":"R Chelouah","year":"2003","unstructured":"R. Chelouah, P. Siarry, Genetic and neldermead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. Eur. J. Oper. Res. 148, 335\u2013348 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9324_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2009","unstructured":"A.R. Conn, K. Scheinberg, L.N. Vicente, Introduction to Derivative-Free Optimization (Society for Industrial and Applied Mathematics, Philadelphia, 2009)"},{"issue":"3","key":"9324_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10710-009-9081-6","volume":"10","author":"L Dio\u015fan","year":"2009","unstructured":"L. Dio\u015fan, M. Oltean, Evolutionary design of evolutionary algorithms. Genet. Program Evolvable Mach. 10(3), 263\u2013306 (2009)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"3","key":"9324_CR9","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1162\/evco_a_00174","volume":"25","author":"I Fajfar","year":"2017","unstructured":"I. Fajfar, J. Puhan, \u00c1. B\u00fcrmen, Evolving a nelder-mead algorithm for optimization with genetic programming. Evol. Comput. 25(3), 351\u2013373 (2017). https:\/\/doi.org\/10.1162\/evco_a_00174","journal-title":"Evol. Comput."},{"issue":"1","key":"9324_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","volume":"51","author":"F Gao","year":"2012","unstructured":"F. Gao, L. Han, Implementing the Nelder\u2013Mead simplex algorithm with adaptive parameters. Comput. Optim. Appl. 51(1), 259\u2013277 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9324_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556780512331318290","volume":"21","author":"L Han","year":"2006","unstructured":"L. Han, M. Neumann, Effect of dimensionality on the Nelder\u2013Mead simplex method. Optim. Methods Softw. 21(1), 1\u201316 (2006). https:\/\/doi.org\/10.1080\/10556780512331318290","journal-title":"Optim. Methods Softw."},{"key":"9324_CR12","doi-asserted-by":"crossref","unstructured":"R. Harper, A. Blair, A structure preserving crossover in grammatical evolution, in ed. by D. Corne, et\u00a0al. Proceedings of the 2005 IEEE Congress on Evolutionary Computation, vol\u00a03. (IEEE Press, 2005), pp. 2537\u20132544","DOI":"10.1109\/CEC.2005.1555012"},{"key":"9324_CR13","doi-asserted-by":"crossref","unstructured":"T. Helmuth, L. Spector, B. Martin, Size-based tournaments for node selection, in ed. by N. Krasnogor, et\u00a0al. Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation GECCO \u201911 (ACM, 2011), pp. 799\u2013802","DOI":"10.1145\/2001858.2002095"},{"key":"9324_CR14","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, 1992)"},{"issue":"1","key":"9324_CR15","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"JC Lagarias","year":"1998","unstructured":"J.C. Lagarias, J.A. Reeds, M.H. Wright, P.E. Wright, Convergence properties of the Nelder\u2013Mead simplex method in low dimensions. SIAM J. Optim. 9(1), 112\u2013147 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9324_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1162\/evco.2006.14.3.309","volume":"14","author":"S Luke","year":"2006","unstructured":"S. Luke, L. Panait, A comparison of bloat control methods for genetic programming. Evol. Comput. 14(3), 309\u2013344 (2006)","journal-title":"Evol. Comput."},{"issue":"1","key":"9324_CR17","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"J.J. Mor\u00e9, S.M. Wild, Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9324_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"J.J. Mor\u00e9, B.S. Garbow, K.E. Hillstrom, Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"9324_CR19","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"J.A. Nelder, R. Mead, A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"issue":"3","key":"9324_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1162\/1063656054794815","volume":"13","author":"M Oltean","year":"2005","unstructured":"M. Oltean, Evolving evolutionary algorithms using linear genetic programming. Evol. Comput. 13(3), 387\u2013410 (2005). https:\/\/doi.org\/10.1162\/1063656054794815","journal-title":"Evol. Comput."},{"issue":"4","key":"9324_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"M. O\u2019Neill, C. Ryan, Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"9324_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-013-9186-9","volume":"15","author":"GL Pappa","year":"2014","unstructured":"G.L. Pappa, G. Ochoa, M.R. Hyde, A.A. Freitas, J. Woodward, J. Swan, Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms. Genet. Program Evolvable Mach. 15(1), 3\u201335 (2014). https:\/\/doi.org\/10.1007\/s10710-013-9186-9","journal-title":"Genet. Program Evolvable Mach."},{"key":"9324_CR23","unstructured":"R. Poli, W.B. Langdon, N.F. McPhee, A field guide to genetic programming. Published via lulu.com (with contributions by J. R. Koza) (2008)"},{"issue":"3","key":"9324_CR24","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"L.M. Rios, N.V. Sahinidis, Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"9324_CR25","doi-asserted-by":"crossref","unstructured":"C. Ryan, R.M.A. Azad, Sensible initialisation in chorus, in ed. by C. Ryan, T. Soule, M. Keijzer, E.P.K. Tsang, R. Poli, E. Costa, Genetic Programming, 6th European Conference, EuroGP 2003 (Springer, Berlin, 2003), pp. 394\u2013403","DOI":"10.1007\/3-540-36599-0_37"},{"key":"9324_CR26","doi-asserted-by":"crossref","unstructured":"M.H. Wright, Nelder, Mead, and the other simplex method. Documenta Math. special volume (\u201cOptimization Stories\u201d), 271\u2013276 (2012)","DOI":"10.4171\/dms\/6\/29"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-018-9324-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-018-9324-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-018-9324-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:40:42Z","timestamp":1751701242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-018-9324-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,22]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["9324"],"URL":"https:\/\/doi.org\/10.1007\/s10710-018-9324-5","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2018,6,22]]},"assertion":[{"value":"28 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}