{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:55Z","timestamp":1750307815455,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389271","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"905-912","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Rank based variation operators for genetic algorithms"],"prefix":"10.1145","author":[{"given":"Jorge","family":"Cervantes","sequence":"first","affiliation":[{"name":"Universidad Aut\u00f3noma Metropolitana, Cd. de M\u00e9xico, M\u00e9xico"}]},{"given":"Christopher Rhodes","family":"Stephens","sequence":"additional","affiliation":[{"name":"Instituto de Ciencias Nucleares UNAM, Cd. de M\u00e9xico, M\u00e9xico"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1986.289288"},{"key":"e_1_3_2_1_2_1","volume-title":"Optimal Mutation Rates in Genetic Search. In Proceedings of ICGA 5, ed. S. Forrest, 2--8, Morgan Kaufmann","author":"B\u00e4ck T.","year":"1993","unstructured":"T. B\u00e4ck , Optimal Mutation Rates in Genetic Search. In Proceedings of ICGA 5, ed. S. Forrest, 2--8, Morgan Kaufmann ( 1993 ).]] T. B\u00e4ck, Optimal Mutation Rates in Genetic Search. In Proceedings of ICGA 5, ed. S. Forrest, 2--8, Morgan Kaufmann (1993).]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144201"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"J.\n      Cervantes C. R.\n      Stephens A Rank Proportional Generic Genetic Algorithm\n  . \n  Lecture Series on Computer and Computational Sciences Volume 7 2006 pp \n  71\n  --\n  74\n  . \n  Brill Academic Publishers\n  .]]  J. Cervantes C. R. Stephens A Rank Proportional Generic Genetic Algorithm. Lecture Series on Computer and Computational Sciences Volume 7 2006 pp 71--74. Brill Academic Publishers.]]","DOI":"10.1201\/9780429070655-17"},{"key":"e_1_3_2_1_5_1","volume-title":"s B. M\u00e4nner and R. Manderick, 15--25, North Holland","author":"M\u00fchlenbein H.","year":"1992","unstructured":"H. M\u00fchlenbein , How Genetic Algorithms Really Work: Mutation and Hill Climbing , PPSN II, ed. s B. M\u00e4nner and R. Manderick, 15--25, North Holland ( 1992 ).]] H. M\u00fchlenbein, How Genetic Algorithms Really Work: Mutation and Hill Climbing, PPSN II, ed.s B. M\u00e4nner and R. Manderick, 15--25, North Holland (1992).]]"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of 1st European Conference on Artificial Life, 263--271 MIT Press","author":"B\u00e4ck T.","year":"1991","unstructured":"T. B\u00e4ck , Self-adaptation in Genetic Algorithms , In Proceedings of 1st European Conference on Artificial Life, 263--271 MIT Press ( 1991 ).]] T. B\u00e4ck, Self-adaptation in Genetic Algorithms, In Proceedings of 1st European Conference on Artificial Life, 263--271 MIT Press (1991).]]"},{"key":"e_1_3_2_1_7_1","volume-title":"LNCS 496, ed. H.P. Schwefel","author":"Hesser J.","year":"1991","unstructured":"J. Hesser and R. M\u00e4nner , Towards an Optimal Mutation Probability for Genetic Algorithms , LNCS 496, ed. H.P. Schwefel , Springer Verlag ( 1991 ).]] J. Hesser and R. M\u00e4nner, Towards an Optimal Mutation Probability for Genetic Algorithms, LNCS 496, ed. H.P. Schwefel, Springer Verlag (1991).]]"},{"key":"e_1_3_2_1_8_1","volume-title":"ICGA 3, ed. J.D. Schaffer, 104--109, Morgan-Kaufmann","author":"Fogarty T.C.","year":"1989","unstructured":"T.C. Fogarty , Varying the Probability of Mutation in the Genetic Algorithm , ICGA 3, ed. J.D. Schaffer, 104--109, Morgan-Kaufmann ( 1989 ).]] T.C. Fogarty, Varying the Probability of Mutation in the Genetic Algorithm, ICGA 3, ed. J.D. Schaffer, 104--109, Morgan-Kaufmann (1989).]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/106454698568512"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542382"},{"key":"e_1_3_2_1_11_1","first-page":"54","volume-title":"D. Floreano, J-D","author":"Ochoa G.","year":"1999","unstructured":"G. Ochoa , I. Harvey and H. Buxton , Error Thresholds and their Relation to Optimal Mutation Rates . In D. Floreano, J-D . Nicoud, and F. Mondada (Eds.) ECAL'99, Lecture Notes in Artificial Intelligence 1674, pp 54 -- 63 , Springer-Verlag , Berlin ( 1999 ).]] G. Ochoa, I. Harvey and H. Buxton, Error Thresholds and their Relation to Optimal Mutation Rates. In D. Floreano, J-D. Nicoud, and F. Mondada (Eds.) ECAL'99, Lecture Notes in Artificial Intelligence 1674, pp 54--63, Springer-Verlag, Berlin (1999).]]"},{"key":"e_1_3_2_1_12_1","first-page":"315","volume-title":"GECCO-2002","author":"Ochoa G.","year":"2002","unstructured":"G. Ochoa , Setting the Mutation Rate : Scope and Limitations of the 1\/L Heuristics , GECCO-2002 , pp 315 -- 322 , Morgan Kaufmann, San Francisco, CA ( 2002 ).]] G. Ochoa, Setting the Mutation Rate: Scope and Limitations of the 1\/L Heuristics, GECCO-2002, pp 315--322, Morgan Kaufmann, San Francisco, CA (2002).]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2006.14.2.157"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/21.286385"},{"key":"e_1_3_2_1_15_1","volume":"3","author":"Sewell M.","year":"2006","unstructured":"M. Sewell , J. Samarabandu , R. Rodrigo , and K. McIsaac. The Rank-scaled Mutation Rate for Genetic Algorithms. International Journal of Information Technology , Volume 3 Number 1, 2006 .]] M. Sewell, J. Samarabandu, R. Rodrigo, and K. McIsaac. The Rank-scaled Mutation Rate for Genetic Algorithms. International Journal of Information Technology, Volume 3 Number 1, 2006.]]","journal-title":"McIsaac. The Rank-scaled Mutation Rate for Genetic Algorithms. International Journal of Information Technology"},{"key":"e_1_3_2_1_16_1","first-page":"238","volume-title":"Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, UAI-98","author":"Hoos H.","year":"1998","unstructured":"H. Hoos , T. St\u00fctzle . Evaluating Las Vegas Algorithms: Pitfalls and Remedies . Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, UAI-98 pages 238 -- 245 , Morgan Kaufmann Publishers, San Francisco CA , 1998 .]] H. Hoos, T. St\u00fctzle. Evaluating Las Vegas Algorithms: Pitfalls and Remedies. Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, UAI-98 pages 238--245, Morgan Kaufmann Publishers, San Francisco CA, 1998.]]"},{"key":"e_1_3_2_1_17_1","first-page":"1065","volume-title":"A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization. E.Cant\u00fa-Paz et al.(Eds.):GECCO","author":"Ishibuchi H.","year":"2003","unstructured":"H. Ishibuchi and Y. Shibata . A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization. E.Cant\u00fa-Paz et al.(Eds.):GECCO 2003 , LNCS 2723, pp. 1065 -- 1076 ,2003. Copyright Springer Verlag Berlin Heidelberg 2003.]] H. Ishibuchi and Y. Shibata. A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization. E.Cant\u00fa-Paz et al.(Eds.):GECCO 2003, LNCS 2723, pp.1065--1076,2003. Copyright Springer Verlag Berlin Heidelberg 2003.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_19"},{"volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation, CEC 99","author":"Chakraborty G.","key":"e_1_3_2_1_19_1","unstructured":"G. Chakraborty , K. Hoshi . Rank Based Crossover - A new technique to improve the speed and Quality of convergence in GA . Proceedings of the 1999 Congress on Evolutionary Computation, CEC 99 .]] G. Chakraborty, K. Hoshi. Rank Based Crossover - A new technique to improve the speed and Quality of convergence in GA. Proceedings of the 1999 Congress on Evolutionary Computation, CEC 99.]]"}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Atlanta GA USA","acronym":"GECCO08"},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:41Z","timestamp":1750255061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":19,"alternative-id":["10.1145\/1389095.1389271","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389271","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}