{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:05:27Z","timestamp":1777637127708,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2005,7,2]],"date-time":"2005-07-02T00:00:00Z","timestamp":1120262400000},"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":[[2005,11]]},"DOI":"10.1007\/s00500-004-0421-4","type":"journal-article","created":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T08:18:03Z","timestamp":1120205883000},"page":"803-814","source":"Crossref","is-referenced-by-count":56,"title":["A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments"],"prefix":"10.1007","volume":"9","author":[{"given":"A. \u015eima.","family":"Uyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Emre","family":"Harmanci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,2]]},"reference":[{"key":"421_CR1","doi-asserted-by":"crossref","unstructured":"Baluja S, Caruana R (1995) Removing the genetics from the standard genetic algorithm. In: Proceedings of international conference on machine learning, Morgan Kaufmann, pp 38\u201346","DOI":"10.1016\/B978-1-55860-377-6.50014-1"},{"key":"421_CR2","doi-asserted-by":"crossref","unstructured":"Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. Congress on evolutionary computation CEC99, IEEE, pp 1875\u20131882","DOI":"10.1109\/CEC.1999.785502"},{"key":"421_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0911-0","volume-title":"Evolutionary optimization in dynamic environments","author":"J Branke","year":"2002","unstructured":"Branke J (2002) Evolutionary optimization in dynamic environments. Kluwer, Dordrecht"},{"key":"421_CR4","first-page":"239","volume-title":"Theory and application of evolutionary computation: recent trends","author":"J Branke","year":"2002","unstructured":"Branke J, Schmeck H (2002) Designing evolutionary algorithms for dynamic optimization problems. In: Tsutsui S, Ghosh A (eds) Theory and application of evolutionary computation: recent trends. Springer, Berlin Heidelberg New York, pp 239\u2013262"},{"key":"421_CR5","unstructured":"Cantu-Paz E (2002) On random numbers and the performance of genetic algorithms. Genetic and evolutionary computation conference GECCO\u201902. Morgan Kaufman, pp 311\u2013318"},{"key":"421_CR6","doi-asserted-by":"crossref","unstructured":"Cobb HG (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent, nonstationary environments. Technical report AIC-90-001, Naval research Laboratory","DOI":"10.21236\/ADA229159"},{"key":"421_CR7","doi-asserted-by":"crossref","unstructured":"Collingwood E, Corne D, Ross P (1996) Useful diversity via multiploidy. In: Proceedings of AISB workshop on evolutionary computation","DOI":"10.1109\/ICEC.1996.542705"},{"key":"421_CR8","volume-title":"Invitation to biology","author":"H Curtis","year":"1981","unstructured":"Curtis H, Barnes NS (1981) Invitation to Biology, 3rd edn. Worth, New York","edition":"3"},{"issue":"2","key":"421_CR9","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evolut Comput 3(2):124\u2013141","journal-title":"IEEE Trans Evolut Comput"},{"key":"421_CR10","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"421_CR11","unstructured":"Greene F (1996) A method for utilizing diploid\/dominance in genetic search. In: Proceedings of the first IEEE conference on evolutionary computation"},{"key":"421_CR12","unstructured":"Grefenstette JJ (1992) Genetic algorithms for changing environments. Parallel problem solving from nature 2. North Holland, pp 137\u2013144"},{"key":"421_CR13","doi-asserted-by":"crossref","unstructured":"Hadad BS, Eick CF (1997) Supporting polyploidy in genetic algorithms using dominance vectors. In: Proceedings of the sixth international conference on evolutionary programming, Vol 1213. Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York","DOI":"10.1007\/BFb0014814"},{"key":"421_CR14","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"key":"421_CR15","doi-asserted-by":"crossref","unstructured":"Lewis J, Hart E, Graeme R (1998) A comparison of dominance mechanisms and simple mutation on non-stationary problems. In: Proceedings of parallel problem solving from nature, Vol 1498. Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York","DOI":"10.1007\/BFb0056857"},{"key":"421_CR16","doi-asserted-by":"crossref","unstructured":"Mori N, Kita H, Nishikawa Y (1996) Adaptation to a changing environment by means of the thermodynamical genetic algorithm. Parallel problem solving from nature, Vol 1141. Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York, pp 513\u2013522","DOI":"10.1007\/3-540-61723-X_1015"},{"key":"421_CR17","unstructured":"Ng KP, Wong KC (1995) A new diploid scheme and dominance change mechanism for non-stationary function optimization. In: Proceedings of the sixth international conference on genetic algorithms"},{"key":"421_CR18","unstructured":"Ryan C (1994) The degree of oneness. In: Proceedings of the 1994 ECAI workshop on genetic algorithms. Springer, Berlin Heidelberg New York"},{"key":"421_CR19","first-page":"251","volume":"6","author":"RE Smith","year":"1992","unstructured":"Smith RE, Goldberg DE (1992) Diploidy and dominance in artificial genetic search. Complex Syst 6:251\u2013285","journal-title":"Complex Syst"},{"key":"421_CR20","doi-asserted-by":"crossref","unstructured":"Uyar AS, Harmanci AE (1999) Investigation of new operators for a diploid genetic algorithm. Proceedings of SPIE: applications and science of neural networks. Fuzzy systems and evolutionary computation II","DOI":"10.1117\/12.367702"},{"key":"421_CR21","unstructured":"Uyar AS, Harmanci AE (2002) Preserving diversity through diploidy and meiosis for improved GA performance in dynamic environments, Vol 2457. Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 314\u2013323"},{"key":"421_CR22","unstructured":"Uyar AS, Harmanci AE (2002) Performance comparisons of genotype to phenotype mapping schemes for diploid representations in changing environments. Recent advances in soft computing RASC\u201902"},{"key":"421_CR23","unstructured":"Uyar AS, Harmanci AE (2003) An adaptive domination map approach for multi-allelic diploid genetic algorithms. Genetic and evolutionary computation congress, GECCO 2003, Late breaking papers, pp 291\u2013298"},{"key":"421_CR24","unstructured":"Uyar AS, Harmanci AE (2004) Comparison of domination approaches for diploid binary genetic algorithms. Applications and science in soft computing, Advances in soft computing. Springer, Berlin Heidelberg New York, pp 75\u201380"},{"key":"421_CR25","doi-asserted-by":"crossref","unstructured":"Uyar AS, Sariel S, Eryigit G (2004) A gene based adaptive mutation strategy for genetic algorithms. accepted for publication in genetic and evolutionary computation conference, GECCO\u201904. Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-3-540-24855-2_24"},{"key":"421_CR26","unstructured":"Vavak F, Jukes K, Fogarty TC (1997) Adaptive combustion balancing in multiple burner boiler using a genetic algorithm with variable range of local search. Seventh international conference on evolutionary programming, Vol 1213. Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York, pp 719\u2013726"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-004-0421-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-004-0421-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-004-0421-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T02:55:19Z","timestamp":1586314519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-004-0421-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,2]]},"references-count":26,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["421"],"URL":"https:\/\/doi.org\/10.1007\/s00500-004-0421-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,2]]}}}