{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:21:05Z","timestamp":1751516465248,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319781327"},{"type":"electronic","value":"9783319781334"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-78133-4_6","type":"book-chapter","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T06:42:59Z","timestamp":1521441779000},"page":"72-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Use of Dynamic GP Fitness Cases in Static and Dynamic Optimisation Problems"],"prefix":"10.1007","author":[{"given":"Edgar","family":"Galv\u00e1n-L\u00f3pez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucia","family":"V\u00e1zquez-Mendoza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"Trujillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Galv\u00e1n-L\u00f3pez, E., Ait ElHara, O.: Using fitness comparison disagreements as a metric for promoting diversity in dynamic optimisation problems. In: IEEE Symposium Series on Computational Intelligence. Springer (2016)","DOI":"10.1109\/SSCI.2016.7849970"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Galv\u00e1n-L\u00f3pez, E., McDermott, J., O\u2019Neill, M., Brabazon, A.: Defining locality in genetic programming to predict performance. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586095"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Galv\u00e1n-L\u00f3pez, E., McDermott, J., O\u2019Neill, M., Brabazon, A.: Towards an understanding of locality in genetic programming. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO 2010, pp. 901\u2013908. ACM, New York (2010)","DOI":"10.1145\/1830483.1830646"},{"issue":"4","key":"6_CR4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10710-011-9136-3","volume":"12","author":"E Galv\u00e1n-L\u00f3pez","year":"2011","unstructured":"Galv\u00e1n-L\u00f3pez, E., McDermott, J., O\u2019Neill, M., Brabazon, A.: Defining locality as a problem difficulty measure in genetic programming. Genet. Program. Evolvable Mach. 12(4), 365\u2013401 (2011)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-45823-6_33","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"E Galv\u00e1n-L\u00f3pez","year":"2016","unstructured":"Galv\u00e1n-L\u00f3pez, E., Mezura-Montes, E., Ait ElHara, O., Schoenauer, M.: On the use of semantics in multi-objective genetic programming. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 353\u2013363. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_33"},{"key":"6_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-31519-0_3","volume-title":"EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II","author":"E Galv\u00e1n-L\u00f3pez","year":"2012","unstructured":"Galv\u00e1n-L\u00f3pez, E., Trujillo, L., McDermott, J., Kattan, A.: Locality in continuous fitness-valued cases and genetic programming difficulty. In: Sch\u00fctze, O., Coello, C.A.C., Tantar, A., Tantar, E., Bouvry, P., Moral, P.D., Legrand, P. (eds.) EVOLVE 2012. AISC, vol. 175, pp. 41\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31519-0_3"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Galv\u00e1n-L\u00f3pez, E., V\u00e1zquez-Mendoza, L., Schoenauer, M., Trujillo, L.: Dynamic GP fitness cases in static and dynamic optimisation problems. In: Bosman, P.A.N. (ed.) Genetic and Evolutionary Computation Conference, Berlin, Germany, 15\u201319 July 2017, Companion Material Proceedings, pp. 227\u2013228. ACM (2017)","DOI":"10.1145\/3067695.3076055"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-62428-0_22","volume-title":"Advances in Soft Computing","author":"E Galv\u00e1n-L\u00f3pez","year":"2017","unstructured":"Galv\u00e1n-L\u00f3pez, E., V\u00e1zquez-Mendoza, L., Trujillo, L.: Stochastic semantic-based multi-objective genetic programming optimisation for classification of imbalanced data. In: Pichardo-Lagunas, O., Miranda-Jim\u00e9nez, S. (eds.) MICAI 2016. LNCS (LNAI), vol. 10062, pp. 261\u2013272. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62428-0_22"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-58484-6_275","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN III","author":"C Gathercole","year":"1994","unstructured":"Gathercole, C., Ross, P.: Dynamic training subset selection for supervised learning in genetic programming. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 312\u2013321. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58484-6_275"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45712-7_36","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN VII","author":"M Giacobini","year":"2002","unstructured":"Giacobini, M., Tomassini, M., Vanneschi, L.: Limiting the number of fitness cases in genetic programming using statistics. In: Guerv\u00f3s, J.J.M., Adamidis, P., Beyer, H.-G., Schwefel, H.-P., Fern\u00e1ndez-Villaca\u00f1as, J.-L. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 371\u2013380. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45712-7_36"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-37207-0_7","volume-title":"Genetic Programming","author":"I Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves, I., Silva, S.: Balancing learning and overfitting in genetic programming with interleaved sampling of training data. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.\u015e., Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 73\u201384. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37207-0_7"},{"key":"6_CR12","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 184\u2013192. Morgan Kaufmann (1995)"},{"key":"6_CR13","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"La Cava, W., Spector, L., Danai, K.: Epsilon-lexicase selection for regression. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, GECCO 2016, pp. 741\u2013748. ACM, New York (2016)","DOI":"10.1145\/2908812.2908898"},{"issue":"2","key":"6_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1162\/106365604773955157","volume":"12","author":"CWG Lasarczyk","year":"2004","unstructured":"Lasarczyk, C.W.G., Dittrich, P.W.G., Banzhaf, W.W.G.: Dynamic subset selection based on a fitness case topology. Evol. Comput. 12(2), 223\u2013242 (2004)","journal-title":"Evol. Comput."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-55696-3_8","volume-title":"Genetic Programming","author":"U L\u00f3pez","year":"2017","unstructured":"L\u00f3pez, U., Trujillo, L., Martinez, Y., Legrand, P., Naredo, E., Silva, S.: RANSAC-GP: dealing with outliers in symbolic regression with genetic programming. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 114\u2013130. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55696-3_8"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-31153-1_19","volume-title":"Applications of Evolutionary Computation","author":"J Macedo","year":"2016","unstructured":"Macedo, J., Costa, E., Marques, L.: Genetic programming algorithms for dynamic environments. In: Squillero, G., Burelli, P. (eds.) EvoApplications 2016. LNCS, vol. 9598, pp. 280\u2013295. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31153-1_19"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, Y., Naredo, E., Trujillo, L., Legrand, P., L\u00f3pez, U.: A comparison of fitness-case sampling methods for genetic programming. J. Exp. Theor. Artif. Intell. 1\u201322 (2017)","DOI":"10.1080\/0952813X.2017.1328461"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"McDermott, J., et al.: Genetic programming needs better benchmarks. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, GECCO 2012, pp. 791\u2013798. ACM, New York (2012)","DOI":"10.1145\/2330163.2330273"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol. Comput. 6, 1\u201324 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Riekert, M., Malan, K.M., Engelbrect, A.P.: Adaptive genetic programming for dynamic classification problems. In: Proceedings of the Eleventh Conference on Congress on Evolutionary Computation, CEC 2009, pp. 674\u2013681. IEEE Press, Piscataway (2009)","DOI":"10.1109\/CEC.2009.4983010"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Spector, L.: Assessment of problem modality by differential performance of lexicase selection in genetic programming: a preliminary report. In: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference Companion, GECCO Companion 2012, pp. 401\u2013408. ACM (2012)","DOI":"10.1145\/2330784.2330846"},{"key":"6_CR23","unstructured":"Teller, A., Andre, D.: Automatically choosing the number of fitness cases: the rational allocation of trials. In: Koza, J.R., et al. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, CA, USA, 13\u201316 July 1997, pp. 321\u2013328. Morgan Kaufmann (1997)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Vanneschi, L., Cuccu, G.: A study of genetic programming variable population size for dynamic optimization problems. In: IJCCI, pp. 119\u2013126 (2009)","DOI":"10.5220\/0002314701190126"},{"issue":"4","key":"6_CR25","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TEVC.2006.882430","volume":"11","author":"N Wagner","year":"2007","unstructured":"Wagner, N., Michalewicz, Z., Khouja, M., McGregor, R.R.: Time series forecasting for dynamic environments: the DyFor genetic program model. IEEE Trans. Evol. Comput. 11(4), 433\u2013452 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-48873-1_20","volume-title":"Simulated Evolution and Learning","author":"B-T Zhang","year":"1999","unstructured":"Zhang, B.-T., Cho, D.-Y.: Genetic programming with active data selection. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol. 1585, pp. 146\u2013153. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48873-1_20"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78133-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T21:31:55Z","timestamp":1751491915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78133-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319781327","9783319781334"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78133-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}