{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T19:28:26Z","timestamp":1716924506223},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T00:00:00Z","timestamp":1309996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00500-011-0745-9","type":"journal-article","created":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T09:07:12Z","timestamp":1309943232000},"page":"331-351","source":"Crossref","is-referenced-by-count":2,"title":["Modeling dynamics of a real-coded CHC algorithm in terms of dynamical probability distributions"],"prefix":"10.1007","volume":"16","author":[{"given":"Jes\u00fas","family":"Mar\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Molina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Herrera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,7]]},"reference":[{"key":"745_CR1","unstructured":"Barnett L (1998) Collapsing the state space by applying markov analysis to evolutionary systems. In: Workshop presentation at the sixth international conference on artificial life, UCLA"},{"issue":"1","key":"745_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H Beyer","year":"2002","unstructured":"Beyer H, Schwefel H (2002) Evolution strategies\u2014a comprehensive introduction. Nat Comput 1(1):3\u201352","journal-title":"Nat Comput"},{"issue":"1","key":"745_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0304-3975(02)00137-8","volume":"287","author":"HG Beyer","year":"2002","unstructured":"Beyer HG, Schwefel HP, Wegener I (2002) How to analyse evolutionary algorithms. Theor Comput Sci 287(1):101\u2013130","journal-title":"Theor Comput Sci"},{"issue":"4","key":"745_CR4","doi-asserted-by":"crossref","first-page":"3853","DOI":"10.1103\/PhysRevE.57.3853","volume":"57","author":"S Bornholdt","year":"1998","unstructured":"Bornholdt S (1998) Genetic algorithm dynamics on a rugged landscape. Phys Rev E 57(4):3853\u20133860","journal-title":"Phys Rev E"},{"issue":"6","key":"745_CR6","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TEVC.2003.819265","volume":"7","author":"JR Cano","year":"2003","unstructured":"Cano JR, Herrera F, Lozano M (2003) Using evolutionary algorithms as instance selection for data reduction in kdd: an experimental study. IEEE Trans Evol Comput 7(6):561\u2013575","journal-title":"IEEE Trans Evol Comput"},{"key":"745_CR5","doi-asserted-by":"crossref","unstructured":"Cano JR, Herrera F, Lozano M (2005) Strategies for scaling up evolutionary instance reduction algorithms for data mining. In: Ghosh A, Jain L (eds) Evolutionary computation in data mining. Studies in fuzziness and soft computing, vol 163. Springer, Berlin, pp 21\u201339","DOI":"10.1007\/3-540-32358-9_2"},{"key":"745_CR7","doi-asserted-by":"crossref","unstructured":"Cervone G, Kaufman KK, Michalski RS (2000) Experimental validations of the learnable evolution model. In: Proceedings of the 2000 congress on evolutionary computation, pp 1064\u20131071","DOI":"10.1109\/CEC.2000.870765"},{"issue":"1-2","key":"745_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0303-2647(99)00057-X","volume":"54","author":"K Chellapilla","year":"1999","unstructured":"Chellapilla K, Fogel DB (1999) Fitness distributions in evolutionary computation: motivation and examples in the continuous domain. Biosystems 54(1-2):15\u201329","journal-title":"Biosystems"},{"issue":"5","key":"745_CR9","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.imavis.2006.02.002","volume":"24","author":"O Cord\u00f3n","year":"2006","unstructured":"Cord\u00f3n O, Damas S, Santamar\u00eda J (2006) Feature-based image registration by means of the chc evolutionary algorithm. Image Vis Comput 24(5):525\u2013533","journal-title":"Image Vis Comput"},{"key":"745_CR10","first-page":"89","volume":"13","author":"M Delgado","year":"2006","unstructured":"Delgado M, Pegalajar M, Pegalajar M (2006) Evolutionary training for dynamical recurrent neural networks: an application in finantial time series prediction. Mathware Soft Comput 13:89\u2013110","journal-title":"Mathware Soft Comput"},{"issue":"1","key":"745_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(99)00089-4","volume":"229","author":"AE Eiben","year":"1999","unstructured":"Eiben AE, Rudolph G (1999) Theory of evolutionary algorithms: a bird\u2019s eye view. Theor Comput Sci 229(1):3\u20139","journal-title":"Theor Comput Sci"},{"key":"745_CR12","unstructured":"Eshelman L (1990) The chc adaptive search algorithm. In: Rawlins G (ed) Foundations of genetic algorithms. Morgan Kaufmann, San Francisco, pp 265\u2013283"},{"key":"745_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/B978-0-08-094832-4.50018-0","volume":"2","author":"L Eshelman","year":"1993","unstructured":"Eshelman L, Caruana A, Schaffer J (1993) Real-coded genetic algorithms and interval-schemata. Found Genetic Algorithms 2:187\u2013202","journal-title":"Found Genetic Algorithms"},{"key":"745_CR14","unstructured":"Eshelman LJ, Schaffer JD (1992) Real-coded genetic algorithms and interval-schemata. In: Foundation of genetic algorithms, pp 187\u2013202"},{"key":"745_CR15","unstructured":"Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms in genetic algorithms by preventing incest. Foundation of genetic algorithms, vol 2, pp 187\u2013202"},{"key":"745_CR16","unstructured":"Herrera F, Lozano M, Molina D (2010) Components and parameters of DE, real-coded CHC, and G-CMA-ES. Tech. rep., SCI2S, University of Granada, Spain. http:\/\/sci2s.ugr.es\/eamhco\/descriptions.pdf"},{"key":"745_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"J Holland","year":"1992","unstructured":"Holland J (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. 1st edn. MIT Press, Cambridge","edition":"1"},{"key":"745_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11802-007-0085-7","volume":"6","author":"W Huang","year":"2007","unstructured":"Huang W, Wang X (2007) An improved CHC algorithm for damage diagnosis of offshore platforms. J Ocean Univ China 6:85\u201389 (english edition)","journal-title":"J Ocean Univ China"},{"issue":"4","key":"745_CR19","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1061\/(ASCE)0733-947X(2009)135:4(160)","volume":"135","author":"KB Kesur","year":"2009","unstructured":"Kesur KB (2009) Advances in genetic algorithm optimization of traffic signals. J Transport Eng 135(4):160\u2013173","journal-title":"J Transport Eng"},{"issue":"3","key":"745_CR20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1162\/1063656041774983","volume":"12","author":"M Lozano","year":"2004","unstructured":"Lozano M, Herrera F, Krasnogor N, Molina D (2004) Real-coded memetic algorithms with crossover hill-climbing. Evol Comput 12(3):273\u2013302","journal-title":"Evol Comput"},{"key":"745_CR21","doi-asserted-by":"crossref","unstructured":"Luz\u00f3n M, Barreiro E, Yeguas E, Joan-Arinyo R (2004) GA and CHC two evolutionary algorithms to solve the root identification problem in geometric constraint solving. In: Bubak M, van Albada GD, Sloot PMA, Dongarra JJ (eds) Computational science\u2014ICCS 2004. Lecture notes in computer science, vol 3039. Springer, Berlin, pp 139\u2013146","DOI":"10.1007\/978-3-540-25944-2_18"},{"issue":"4","key":"745_CR22","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/4235.797970","volume":"3","author":"J Mar\u00edn","year":"1999","unstructured":"Mar\u00edn J, Sol\u00e9 RV (1999) Macroevolutionary algorithms: a new optimization method on fitness landscapes. IEEE Trans Evol Comput 3(4):272\u2013286","journal-title":"IEEE Trans Evol Comput"},{"key":"745_CR23","doi-asserted-by":"crossref","unstructured":"Nebro AJ, Alba E, Molina G, Chicano F, Luna F, Durillo JJ (2007) Optimal antenna placement using a new multi-objective chc algorithm. In: GECCO \u201907: proceedings of the 9th annual conference on genetic and evolutionary computation. ACM, New York, NY, USA, pp 876\u2013883","DOI":"10.1145\/1276958.1277128"},{"key":"745_CR25","doi-asserted-by":"crossref","unstructured":"Nomura T (1997) An analysis on crossovers for real number chromosomes in an infinite population size. In: IJCAI\u201997: proceedings of the fifteenth international joint conference on artificial intelligence. Morgan Kaufmann, San Francisco, CA, USA, pp 936\u2013941","DOI":"10.1109\/ICEC.1997.592279"},{"key":"745_CR26","doi-asserted-by":"crossref","unstructured":"Poli R, Langdon W, Clerc M, Stephens C (2007) Continuous optimisation theory made easy? Finite-element models of evolutionary strategies, genetic algorithms and particle swarm optimizers. In: Stephens C, Toussaint M, Whitley D, Stadler P (eds) Foundations of genetic algorithms. Lecture notes in computer science, vol 4436. Springer, Berlin, pp 165\u2013193","DOI":"10.1007\/978-3-540-73482-6_10"},{"key":"745_CR27","unstructured":"Pr\u00fcgel-Bennett A, Rogers A (2001) Modelling GA dynamics. Nat Comput. Springer"},{"issue":"1","key":"745_CR28","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/72.265965","volume":"5","author":"X Qi","year":"1994","unstructured":"Qi X, Palmieri F (1994) Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part I: basic properties of selection and mutation. IEEE Trans Neural Netw 5(1):102\u2013119","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"745_CR29","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/72.265966","volume":"5","author":"X Qi","year":"1994","unstructured":"Qi X, Palmieri F (1994) Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part II: analysis of the diversification role of crossover. IEEE Trans Neural Netw 5(1):120\u2013129","journal-title":"IEEE Trans Neural Netw"},{"key":"745_CR30","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1002\/int.20258","volume":"23","author":"AM S\u00e1nchez","year":"2008","unstructured":"S\u00e1nchez AM, Lozano M, Garc\u00eda-Mart\u00ednez C, Molina D, Herrera F (2008) Real-parameter crossover operators with multiple descendents: an experimental study. Int J Intell Syst 23:246\u2013268","journal-title":"Int J Intell Syst"},{"key":"745_CR31","doi-asserted-by":"crossref","unstructured":"Santamar\u00eda J, Cord\u00f3n O, Damas S, Garc\u00eda-Torres JM, Quirin A (2009) Performance evaluation of memetic approaches in 3d reconstruction of forensic objects. Soft Comput 13:883\u2013904. http:\/\/portal.acm.org\/citation.cfm?id=1530043.1530048","DOI":"10.1007\/s00500-008-0351-7"},{"issue":"1\u20133","key":"745_CR32","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0304-3975(03)00393-1","volume":"310","author":"LM Schmitt","year":"2004","unstructured":"Schmitt LM (2004) Theory of genetic algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. Theor Comput Sci 310(1\u20133):181\u2013231","journal-title":"Theor Comput Sci"},{"key":"745_CR33","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1162\/evco.1999.7.2.109","volume":"7","author":"C Stephens","year":"1998","unstructured":"Stephens C, Waelbroeck H (1998) Schemata evolution and building blocks. Evol Comput 7:109\u2013124","journal-title":"Evol Comput"},{"issue":"1\u20132","key":"745_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0304-3975(99)00119-X","volume":"229","author":"E Nimwegen van","year":"1999","unstructured":"van Nimwegen E, Crutchfield JP, Mitchell M (1999) Statistical dynamics of the Royal Road genetic algorithm. Theor Comput Sci 229(1\u20132):41\u2013102","journal-title":"Theor Comput Sci"},{"key":"745_CR34","volume-title":"The simple genetic algorithm: foundations and theory","author":"MD Vose","year":"1998","unstructured":"Vose MD (1998) The simple genetic algorithm: foundations and theory. MIT Press, Cambridge"},{"key":"745_CR35","doi-asserted-by":"crossref","unstructured":"Whitley D, Lunacek M, Sokolov A (2006) Comparing the niches of CMA-ES, CHC and pattern search using diverse benchmarks. In: Runarsson T, Beyer HG, Burke E, Merelo-Guervs J, Whitley L, Yao X (eds) Parallel problem solving from nature\u2014PPSN IX. Lecture notes in computer science, vol 4193. Springer, Berlin, pp 988\u2013997","DOI":"10.1007\/11844297_100"},{"issue":"1","key":"745_CR36","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tcs.2008.05.011","volume":"403","author":"C Witt","year":"2008","unstructured":"Witt C (2008) Population size versus runtime of a simple evolutionary algorithm. Theor Comput Sci 403(1):104\u2013120","journal-title":"Theor Comput Sci"},{"key":"745_CR37","doi-asserted-by":"crossref","unstructured":"Wright AH, Rowe JE, Neil JR (2002) Analysis of the simple genetic algorithm on the single-peak and double-peak landscapes. In: Proceedings of the congress on evolutionary computation (CEC) 2002. IEEE Press, pp 214\u2013219","DOI":"10.1109\/CEC.2002.1006236"},{"issue":"1","key":"745_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.amc.2006.06.107","volume":"192","author":"X Zhao","year":"2007","unstructured":"Zhao X, Gao XS, Hu ZC (2007) Evolutionary programming based on non-uniform mutation. Appl Math Comput 192(1):1\u201311","journal-title":"Appl Math Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-011-0745-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-011-0745-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-011-0745-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T15:52:32Z","timestamp":1560354752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-011-0745-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,7]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["745"],"URL":"https:\/\/doi.org\/10.1007\/s00500-011-0745-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,7]]}}}