{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T17:30:49Z","timestamp":1747330249245},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030399573"},{"type":"electronic","value":"9783030399580"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-39958-0_14","type":"book-chapter","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T13:29:08Z","timestamp":1588858148000},"page":"275-293","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Enhanced Optimization with Composite Objectives and Novelty Pulsation"],"prefix":"10.1007","author":[{"given":"Hormoz","family":"Shahrzad","sequence":"first","affiliation":[]},{"given":"Babak","family":"Hodjat","sequence":"additional","affiliation":[]},{"given":"Camille","family":"Doll\u00e9","sequence":"additional","affiliation":[]},{"given":"Andrei","family":"Denissov","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Lau","sequence":"additional","affiliation":[]},{"given":"Donn","family":"Goodhew","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Risto","family":"Miikkulainen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0304-405X(98)00052-X","volume":"51","author":"F Allen","year":"1999","unstructured":"F. Allen, R. Karjalainen. 1999. Using genetic algorithms to find technical trading rules. Journal of Financial Economics 51, 245\u2013271.","journal-title":"Journal of Financial Economics"},{"key":"14_CR2","unstructured":"S. W. A. Baddar. 2009. Finding Better Sorting Networks. PhD thesis, Kent State University."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"J. A. Bowren, J. K. Pugh, and K. O. Stanley. 2016. Fully Autonomous Real-Time Autoencoder Augmented Hebbian Learning through the Collection of Novel Experiences. In Proceedings of ALIFE. 382\u2013389.","DOI":"10.7551\/978-0-262-33936-0-ch064"},{"key":"14_CR4","unstructured":"A. Brabazon, M. O\u2019Neill. 2006. Biologically Inspired Algorithms for Financial Modelling. Springer."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"R. Bradley, A. Brabazon, M. O\u2019Neill. 2010. Objective function design in a grammatical evolutionary trading system. In: 2010 IEEE World Congress on Computational Intelligence, pp. 3487\u20133494. IEEE Press.","DOI":"10.1109\/CEC.2010.5586020"},{"key":"14_CR6","unstructured":"M. \u010crepin\u0161ek, S. Liu, M. Mernik. 2013. Exploration and Exploitation in Evolutionary Algorithms: A Survey. ACM Computing Surveys 45, Article 35."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"M. Codish, L. Cruz-Filipe, and P. Schneider-Kamp. 2014. The quest for optimal sorting-networks: Efficient generation of two-layer prefixes. In Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 16th International Symposium on (pp. 359\u2013366). IEEE.","DOI":"10.1109\/SYNASC.2014.55"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"M. Codish, L. Cruz-Filipe, T. Ehlers, M. Muller, and P. Schneider-Kamp. 2016. Sorting networks: To the end and back again. Journal of Computer and System Sciences.","DOI":"10.1007\/978-3-319-15579-1_52"},{"key":"14_CR9","unstructured":"C. A. C. Coello, G. B. Lamont, and D. A. Van Veldhuizen. 2007. Evolutionary algorithms for solving multi-objective problems. Vol. 5. Springer."},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10710-017-9304-1","volume":"18","author":"I Contreras","year":"2017","unstructured":"I. Contreras, J.I. Hidalgo, L. Nunez-Letamendia, J.M. Velasco. 2017. A meta-grammatical evolutionary process for portfolio selection and trading. Genetic Programming and Evolvable Machines 18(4), 411\u2013431.","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"G. Cuccu and F Gomez. 2011. When Novelty is Not Enough. In Evostar. 234\u2013243.","DOI":"10.1007\/978-3-642-20525-5_24"},{"issue":"1\/2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1504\/IJFMD.2011.038526","volume":"2","author":"W Cui","year":"2011","unstructured":"W. Cui, A. Brabazon, M. O\u2019Neill. 2011. Adaptive trade execution using a grammatical evolution approach. International Journal of Financial Markets and Derivatives 2(1\/2), 4\u20133.","journal-title":"International Journal of Financial Markets and Derivatives"},{"key":"14_CR13","unstructured":"A. Cully, J. Clune, D. Tarapore, and J-B. Mouret. 2015. Robots that can adapt like animals. Nature 521, 7553 (2015), 503\u2013507."},{"key":"14_CR14","unstructured":"K. Deb, A. Pratap, S. Agarwal, and T. A. Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6, 2 (2002), 182\u2013197."},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"K. Deb, and H. Jain. 2014. An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints. In IEEE Transactions on Evolutionary Computation, vol. 18, no. 4, 577\u2013601.","journal-title":"In IEEE Transactions on Evolutionary Computation"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"K. Deb, K. Sindhya, and J. Hakanen. 2016. Multi-objective optimization. In Decision Sciences: Theory and Practice. 145\u2013184.","DOI":"10.1201\/9781315183176-4"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"J. Gomes, P. Mariano, and A. L. Christensen. 2015. Devising effective novelty search algorithms: A comprehensive empirical study. In Proc. of GECCO. 943\u2013950.","DOI":"10.1145\/2739480.2754736"},{"issue":"3\u20134","key":"14_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1177\/105971239700500305","volume":"5","author":"F Gomez","year":"1997","unstructured":"F. Gomez, and R. Miikkulainen. 1997. Incremental evolution of complex general behavior. Adaptive Behavior 5(3\u20134), pp.317\u2013342.","journal-title":"Adaptive Behavior"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11721-013-0081-z","volume":"7","author":"J Gomes","year":"2013","unstructured":"J. Gomes, P. Urbano, and A. L. Christensen. 2013. Evolution of swarm robotics systems with novelty search. Swarm Intelligence, 7:115\u2013144.","journal-title":"Swarm Intelligence"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"F. J. Gomez. 2009. Sustaining diversity using behavioral information distance. In Proc. of GECCO. 113\u2013120.","DOI":"10.1145\/1569901.1569918"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"I. Gon\u00e7alves, S. Silva. 2013. Balancing Learning and Overfitting in Genetic Programming with Interleaved Sampling of Training Data. In: Krawiec K., Moraglio A., Hu T., Etaner-Uyar A., Hu B. (eds) Genetic Programming. EuroGP 2013. Lecture Notes in Computer Science, vol 7831. Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-37207-0_7"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"B. Hodjat, H. Shahrzad, and R. Miikkulainen. 2016. Distributed Age-Layered Novelty Search. In Proc. of ALIFE. 131\u2013138.","DOI":"10.7551\/978-0-262-33936-0-ch027"},{"issue":"4","key":"14_CR23","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2014","unstructured":"H. Jain, and K. Deb. 2014. An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach. In IEEE Transactions on Evolutionary Computation, vol. 18, no. 4, 602\u2013622.","journal-title":"In IEEE Transactions on Evolutionary Computation"},{"key":"14_CR24","unstructured":"P. Kipfer, M. Segal, and R. Westermann. 2004. Uberflow: A gpu-based particle engine. In HWWS 2004: Proc. of the ACM SIGGRAPH\/EUROGRAPHICS, 115\u2013122."},{"key":"14_CR25","unstructured":"D. E. Knuth. 1998. Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley Professional, 2 edition."},{"key":"14_CR26","unstructured":"P. Krcah, and D. Toropila. 2010. Combination of novelty search and fitness-based search applied to robot body-brain coevolution. In Proc. of 13th Czech-Japan Seminar on Data Analysis and Decision Making in Service Science."},{"key":"14_CR27","unstructured":"J. Lehman, S. Risi, and J. Clune. 2016. Creative Generation of 3D Objects with Deep Learning and Innovation Engines. In Proc. of ICCC. 180\u2013187."},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"J. Lehman, and R. Miikkulainen. 2014. Overcoming deception in evolution of cognitive behaviors. In Proc. of GECCO.","DOI":"10.1145\/2576768.2598300"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"J. Lehman and K. O. Stanley. 2012. Beyond open-endedness: Quantifying impressiveness. In Proc. of ALIFE. 75\u201382.","DOI":"10.7551\/978-0-262-31050-5-ch011"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"J. Lehman and K. O. Stanley. 2011. Evolving a diversity of virtual creatures through novelty search and local competition. In Proc. of GECCO. 211\u2013218.","DOI":"10.1145\/2001576.2001606"},{"key":"14_CR31","unstructured":"J. Lehman and K. O. Stanley. 2011. Abandoning objectives: Evolution through the search for novelty alone. Evolutionary Computation 19, 2 (2011), 189\u2013223."},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"J. Lehman and K. O. Stanley. 2010. Efficiently evolving programs through the search for novelty. In Proc. of GECCO. 836\u2013844.","DOI":"10.1145\/1830483.1830638"},{"key":"14_CR33","unstructured":"J. Lehman and K. O. Stanley. 2008. Exploiting Open-Endedness to Solve Problems Through the Search for Novelty. In Proc. of ALIFE. 329\u2013336."},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"E. Meyerson, and R. Miikkulainen. 2017. Discovering evolutionary stepping stones through behavior domination. In Proc. of GECCO, 139\u2013146. ACM.","DOI":"10.1145\/3071178.3071315"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"E. Meyerson, J. Lehman, and R. Miikkulainen. 2016. Learning behavior characterizations for novelty search. In Proc. of GECCO. 149\u2013156.","DOI":"10.1145\/2908812.2908929"},{"key":"14_CR36","unstructured":"J-B. Mouret and J. Clune. 2015. Illuminating search spaces by mapping elites. CoRR abs\/1504.04909 (2015)."},{"key":"14_CR37","unstructured":"J-B. Mouret and S. Doncieux. 2012. Encouraging behavioral diversity in evolutionary robotics: An empirical study. Evolutionary Computation 20, 1 (2012), 91\u2013133."},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"J. K. Pugh, L. B. Soros, P. A. Szerlip, and K. O. Stanley. 2015. Confronting the Challenge of Quality Diversity. In Proc. of GECCO. 967\u2013974.","DOI":"10.1145\/2739480.2754664"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"H. Shahrzad, D. Fink, and R. Miikkulainen. 2018. Enhanced Optimization with Composite Objectives and Novelty Selection. In Proc. of ALIFE. 616\u2013622.","DOI":"10.1162\/isal_a_00113"},{"issue":"Feb","key":"14_CR40","first-page":"303","volume":"14","author":"V K Valsalam","year":"2013","unstructured":"V. K. Valsalam, and R. Miikkulainen. 2013. Using symmetry and evolutionary search to minimize sorting networks. Journal of Machine Learning Research 14(Feb):303\u2013331.","journal-title":"Journal of Machine Learning Research"},{"key":"14_CR41","unstructured":"H. White. 2000. A reality check for data snooping. Econometrica Sep. 2000; 68(5):1097\u2013126."},{"key":"14_CR42","unstructured":"D. Whitley, K. Mathias, P. Fitzhorn. 1991. Delta coding: An iterative search strategy for genetic algorithms. In ICGA (Vol. 91, pp. 77\u201384)."}],"container-title":["Genetic and Evolutionary Computation","Genetic Programming Theory and Practice XVII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39958-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T07:21:25Z","timestamp":1666509685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39958-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030399573","9783030399580"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39958-0_14","relation":{},"ISSN":["1932-0167","1932-0175"],"issn-type":[{"type":"print","value":"1932-0167"},{"type":"electronic","value":"1932-0175"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}