{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:11:36Z","timestamp":1760645496007},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T00:00:00Z","timestamp":1194048000000},"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":[[2008,8]]},"DOI":"10.1007\/s00500-007-0265-9","type":"journal-article","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T14:54:22Z","timestamp":1194015262000},"page":"955-979","source":"Crossref","is-referenced-by-count":20,"title":["Self-adjusting the intensity of assortative mating in genetic algorithms"],"prefix":"10.1007","volume":"12","author":[{"given":"Carlos","family":"Fernandes","sequence":"first","affiliation":[]},{"given":"Agostinho C.","family":"Rosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,3]]},"reference":[{"key":"265_CR1","doi-asserted-by":"crossref","unstructured":"Arabas J, Michalewicz Z, Mulawka J (1994) GAVaPS\u2014a genetic algorithm with varying population Size. In: Proceedings of the first IEEE conference on evolutionary computation 1:73\u201378","DOI":"10.1109\/ICEC.1994.350039"},{"key":"265_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996). Evolutionary algorithms in theory and practice. Oxford University, New York"},{"key":"265_CR3","unstructured":"B\u00e4ck T, Eiben AE, van der Vaart NAL (2000) An empirical study on GAs without parameters. In: Proceedings of 5th international conference on parallel problem solving from Nature, LNCS 1917. Springer, Berlin, pp 315\u2013324"},{"key":"265_CR4","unstructured":"Bian R, Chen Z, Yuan Z (2000) Improved crossover strategy of genetic algorithms and analysis of its performance. In: Proceedings of the third world congress on intelligent control and automation, pp 516\u2013520"},{"key":"265_CR5","unstructured":"Craighurst R, Martin W (1995) Enhancing GA performance through crossover prohibitions based on ancestry. In: Proceedings of the sixth international conference on genetic algorithms, Morgan Kauffman, Los Altos"},{"key":"265_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0020-0255(97)10035-4","volume":"105","author":"S De","year":"1998","unstructured":"De S, Pal SK and Ghosh A (1998). Genotypic and phenotypic assortative mating in genetic algorithm. Inf Sci 105: 209\u2013225","journal-title":"Inf Sci"},{"key":"265_CR7","first-page":"70","volume":"1","author":"LJ Eschelman","year":"1991","unstructured":"Eschelman LJ (1991). The CHC algorithm: how to have safe search when engaging in non-traditional genetic recombination. Proc Found Genet\u00a0algorithms 1: 70\u201379","journal-title":"Proc Found Genet\u00a0algorithms"},{"key":"265_CR8","doi-asserted-by":"crossref","unstructured":"Eschelman LJ, Schaffer JD (1991) Preventing premature convergence in genetic algorithms by preventing incest. In: Proceedings of the fourth international conference on genetic algorithms, Morgan Kauffman, Los Altos","DOI":"10.1016\/B978-0-08-050684-5.50010-0"},{"key":"265_CR9","doi-asserted-by":"crossref","unstructured":"Fernandes C, Tavares R, Rosa AC (2000) NiGAVaPS\u2014outbreeding in genetic algorithms. In: Proc of 2000 ACM symposium on applied computing, pp 477\u2013482","DOI":"10.1145\/335603.335917"},{"key":"265_CR10","doi-asserted-by":"crossref","unstructured":"Fernandes C, Rosa AC (2001) A study on non-random mating in evolutionary algorithms using a royal road function. In: Proceedings of the 2001 congress on evolutionary computation, pp 60\u201366","DOI":"10.1109\/CEC.2001.934371"},{"key":"265_CR11","doi-asserted-by":"crossref","unstructured":"Fernandes C, Tavares T, Munteanu C, Rosa AC (2001) Using assortative mating in genetic algorithms for vector quantization problems. In: Proceedings of the 2001 ACM symposium on applied computing, pp 361\u2013365","DOI":"10.1145\/372202.372367"},{"key":"265_CR12","unstructured":"Fernandes C (2002) Algoritmos Gen\u00e9ticos e Acasalamento n\u00e3o-aleat\u00f3rio. MSc dissertation thesis, IST, Universidade T\u00e9cnica de Lisboa, in Portuguese"},{"key":"265_CR13","doi-asserted-by":"crossref","unstructured":"Fernandes C, Rosa AC (2006) Self-regulated population size in evolutionary algorithms. In: Proceedings of 9th international conference on parallel problem solving from Nature, LNCS 4193, pp 920\u2013929","DOI":"10.1007\/11844297_93"},{"key":"265_CR14","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00ednez C, Lozano M, Molina D (2006) A local genetic algorithm for binary-coded problems. In: Runarsson T et\u00a0al. (eds) Proceedings of 9th international conference on parallel problem solving from Nature, LNCS 4193, pp 192\u2013201","DOI":"10.1007\/11844297_20"},{"key":"265_CR15","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00ednez C, Lozano M, Herrera F, Molina D, S\u00e1nchez AM (2007) Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur J Oper Res (in press)","DOI":"10.1016\/j.ejor.2006.06.043"},{"key":"265_CR16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"5","author":"F Glover","year":"1986","unstructured":"Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comput Oper Res 5: 533\u2013549","journal-title":"Comput Oper Res"},{"key":"265_CR17","unstructured":"Hillis W (1991) Co-evolving parasites improve simulated evolution as an optimization procedure. In: Artificial Life II, SFI Studies in the Sciences of Complexity, vol X. Addison-Wesley, Reading"},{"key":"265_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1002022126388","volume":"47","author":"K Jaffe","year":"1999","unstructured":"Jaffe K (1999). On the adaptive value of some mate selection techniques. Acta Biotheoretica 47: 29\u201340","journal-title":"Acta Biotheoretica"},{"issue":"3","key":"265_CR19","first-page":"409","volume":"2","author":"T Jones","year":"1995","unstructured":"Jones T (1995). A description of Holland\u2019s royal road function. Evol Comput 2(3): 409\u2013415","journal-title":"Evol Comput"},{"key":"265_CR20","unstructured":"Lobo F, Lima C (2005) Revisiting evolutionary algorithm with on-the-fly population size adjustment. In: Proceedings of the 8th annual conference on genetic and evolutionary computation, pp 1241\u20131248"},{"key":"265_CR21","unstructured":"Lobo F, Lima C (2006) On the utility of the multimodal problem generator for assessing the performance of evolutionary algorithms, UAlg-ILab Report No. 200601. Also arXiv report No. cs.NE\/0602051"},{"issue":"3","key":"265_CR22","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 and Molina D (2004). Real coded memetic algorithms with crossover hill-climbing. Evol Comput J 12(3): 273\u2013302","journal-title":"Evol Comput J"},{"key":"265_CR23","unstructured":"Matsui K (1999) New selection method to improve the population diversity in genetic algorithms. In: Proceedings of the 1999 IEEE international conference on systems, man, and cybernetics"},{"key":"265_CR24","unstructured":"Mauldin M (1984) Maintaining genetic diversity in genetic search. In: National conference on artificial intelligence, pp 247\u2013250"},{"issue":"6","key":"265_CR25","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10732-005-5430-7","volume":"10","author":"C Munteanu","year":"2004","unstructured":"Munteanu C and Rosa AC (2004). Adaptive reservoir evolutionary algorithm: an evolutionary on-line adaptation scheme for global function optimization. J Heuristics 10(6): 555\u2013586","journal-title":"J Heuristics"},{"key":"265_CR26","first-page":"51","volume":"6","author":"M Mitchell","year":"1994","unstructured":"Mitchell M (1994). When will a GA outperform hillclimbing?. Adv Neural Inf Proc Syst 6: 51\u201358","journal-title":"Adv Neural Inf Proc Syst"},{"key":"265_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jtbi.1999.0931","volume":"199","author":"G Ochoa","year":"1999","unstructured":"Ochoa G, Madler-Kron C, Rodriguez R and Jaffe K (1999). On sex, selection and the Red Queen. J Theor Biol 199: 1\u20139","journal-title":"J Theor Biol"},{"key":"265_CR28","doi-asserted-by":"crossref","unstructured":"Ochoa G, Madler-Kron C, Rodriguez R, Jaffe K (2005) Assortative mating in genetic algorithms for dynamic problems. In: Rothlauf F et\u00a0al (eds) Proceedings of the 2005 EvoWorkshops, LNCS 3449, pp 617\u2013622","DOI":"10.1007\/978-3-540-32003-6_65"},{"issue":"2","key":"265_CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1162\/evco.2006.14.2.157","volume":"14","author":"G Ochoa","year":"2006","unstructured":"Ochoa G (2006). Error thresholds in genetic algorithms. Evol Comput 14(2): 157\u2013182","journal-title":"Evol Comput"},{"key":"265_CR30","doi-asserted-by":"crossref","unstructured":"Ochoa G, Jaffe K (2006) Assortative mating drastically alters the magnitude of error thresholds. In: Proceedings of 9th international conference on parallel problem solving from Nature, LNCS 4193, pp 890\u2013899","DOI":"10.1007\/11844297_90"},{"key":"265_CR31","unstructured":"Petrowski A (1997) A new selection operator dedicated to speciation. In: Proceedings of the 7th international conference on genetic algorithms, pp 144\u2013151"},{"key":"265_CR32","unstructured":"Ronald E (1995) When selection meets seduction. In: Proceedings of the 6th international conference on genetic algorithms, Morgan Kauffman, Los Altos, pp 167\u2013173"},{"key":"265_CR33","volume-title":"Theory of population genetics and evolutionary ecology","author":"J Roughgarden","year":"1979","unstructured":"Roughgarden J (1979). Theory of population genetics and evolutionary ecology. Prentice-Hall, Englewood Cliffs"},{"key":"265_CR34","volume-title":"Genetics","author":"PJ Russel","year":"1998","unstructured":"Russel PJ (1998). Genetics. Benjamin\/Cummings, Reading"},{"key":"265_CR35","doi-asserted-by":"crossref","unstructured":"Shimodaira H (1997) DCGA: a diversity control oriented genetic algorithm, In: Proceedings of the IEEE international conference on tools with artificial intelligence, pp 367\u2013374","DOI":"10.1109\/TAI.1997.632277"},{"key":"265_CR36","unstructured":"Spears W (1998) The role of mutation and recombination in evolutionary algorithms. Ph.d. dissertation thesis, George Mason University"},{"issue":"3\u20134","key":"265_CR37","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0020-0255(03)00176-2","volume":"156","author":"C Ting","year":"2003","unstructured":"Ting C, Sheng-Tu L and Chungnan L (2003). On the harmounious mating strategy through tabu search. J Inf Sci 156(3\u20134): 189\u2013214","journal-title":"J Inf Sci"},{"key":"265_CR38","first-page":"547","volume-title":"Proceedings of the IV international conference on genetic algorithms","author":"PM Todd","year":"1991","unstructured":"Todd PM and Miller GF (1991). On the sympatric origin of species: mercurian mating in the quicksilver model. In: Belew, RK and Booker, LB (eds) Proceedings of the IV international conference on genetic algorithms, pp 547\u2013554. Morgan Kaufmann, Los Altos"},{"key":"265_CR39","unstructured":"Wagner S, Affenzeller M (2005) SexualGA: gender-specific selection for genetic algorithms. In: Proceedings of the 9th world multiconference on systemics, cybernetics and informatics"},{"key":"265_CR40","unstructured":"Whitley D (1988) GENITOR: a different genetic algorithm. In: Proceedings of the Rocky mountain conference on artificial intelligence"},{"key":"265_CR41","first-page":"221","volume":"1","author":"D Whitley","year":"1991","unstructured":"Whitley D (1991). Fundamental principles of deception in genetic search. Found Genet\u00a0algorithms 1: 221\u2013241","journal-title":"Found Genet\u00a0algorithms"},{"issue":"11","key":"265_CR42","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"Yang S and Yao X (2005). Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput 9(11): 815\u2013834","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0265-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-007-0265-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0265-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T16:48:35Z","timestamp":1629996515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-007-0265-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,3]]},"references-count":42,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s00500-007-0265-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,3]]}}}