{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:15Z","timestamp":1759667295635,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T00:00:00Z","timestamp":1310428800000},"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":[[2011,7,12]]},"DOI":"10.1145\/2001576.2001644","type":"proceedings-article","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T12:25:09Z","timestamp":1310732709000},"page":"489-496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The TransRAR crossover operator for genetic algorithms with set encoding"],"prefix":"10.1145","author":[{"given":"Ruben","family":"Ruiz-Torrubiano","sequence":"first","affiliation":[{"name":"Universidad Autonoma de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Suarez","sequence":"additional","affiliation":[{"name":"Universidad Autonoma de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1990.166"},{"key":"e_1_3_2_1_2_1","first-page":"365","volume-title":"Foundations of Genetic Algorithms 4","author":"Crawford K. D.","year":"1997","unstructured":"K. D. Crawford , C. J. Hoelting , R. L. Wainwright , and D. Schoenefeld . A study of fixed-length subset recombination . In R. K. Belew and M. D. Vose (Eds.) Foundations of Genetic Algorithms 4 , pages 365 -- 378 . Morgan Kaufmann , 1997 . K. D. Crawford, C. J. Hoelting, R. L. Wainwright, and D. Schoenefeld. A study of fixed-length subset recombination. In R. K. Belew and M. D. Vose (Eds.) Foundations of Genetic Algorithms 4, pages 365--378. Morgan Kaufmann, 1997."},{"key":"e_1_3_2_1_3_1","volume-title":"Optimization and Machine Learning. Addison-Weasley","author":"Goldberg D.","year":"1989","unstructured":"D. Goldberg . Genetic Algorithms in Search , Optimization and Machine Learning. Addison-Weasley , Reading, MA , 1989 . D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Weasley, Reading, MA, 1989."},{"key":"e_1_3_2_1_4_1","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland J. H.","year":"1975","unstructured":"J. H. Holland . Adaptation in Natural and Artificial Systems . University of Michigan Press , 1975 . J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975."},{"issue":"3","key":"e_1_3_2_1_5_1","first-page":"385","article-title":"Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem","volume":"14","author":"Julstrom B. A.","year":"2004","unstructured":"B. A. Julstrom . Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem . International Journal of Applied Mathematics and Computer Science , 14 ( 3 ): 385 -- 396 , 2004 . B. A. Julstrom. Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem. International Journal of Applied Mathematics and Computer Science, 14(3):385--396, 2004.","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the IEEE World Congress on Evolutionary Computation (CEC2001)","author":"Ku S.","year":"2001","unstructured":"S. Ku and B. Lee . A set-oriented genetic algorithm and the knapsack problem . In Proceedings of the IEEE World Congress on Evolutionary Computation (CEC2001) , 2001 . S. Ku and B. Lee. A set-oriented genetic algorithm and the knapsack problem. In Proceedings of the IEEE World Congress on Evolutionary Computation (CEC2001), 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/559621"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2006.384598"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756582.1756626"},{"key":"e_1_3_2_1_11_1","first-page":"77","article-title":"Portfolio selection","volume":"7","author":"Markowitz H.","year":"1952","unstructured":"H. Markowitz . Portfolio selection . Journal of Finance , 7 : 77 -- 91 , 1952 . H. Markowitz. Portfolio selection. Journal of Finance, 7:77--91, 1952.","journal-title":"Journal of Finance"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT)","author":"Meng X.","year":"2010","unstructured":"X. Meng , Y. Zhu , and X. Wu . Improved dynamic programming algorithms for the 0--1 knapsack problem . In Proceedings of the 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT) , 2010 . X. Meng, Y. Zhu, and X. Wu. Improved dynamic programming algorithms for the 0--1 knapsack problem. In Proceedings of the 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT), 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Michalewicz Z.","year":"1996","unstructured":"Z. Michalewicz . Genetic Algorithms + Data Structures = Evolution Programs . Springer Verlag , 1996 . Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, 1996."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688603"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.03.002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-094832-4.50019-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01531276"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645513.657443"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12775-5_5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020920706534"},{"key":"e_1_3_2_1_21_1","volume-title":"Index tracking: genetic algorithms for investment portfolio selection. Technical report","author":"Shapcott J.","year":"1992","unstructured":"J. Shapcott . Index tracking: genetic algorithms for investment portfolio selection. Technical report , EPCC-SS92--24, Edinburgh, Parallel Computing Centre , 1992 . J. Shapcott. Index tracking: genetic algorithms for investment portfolio selection. Technical report, EPCC-SS92--24, Edinburgh, Parallel Computing Centre, 1992."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6230-9_58"}],"event":{"name":"GECCO '11: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Dublin Ireland","acronym":"GECCO '11"},"container-title":["Proceedings of the 13th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2001576.2001644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:20Z","timestamp":1750244780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,12]]},"references-count":22,"alternative-id":["10.1145\/2001576.2001644","10.1145\/2001576"],"URL":"https:\/\/doi.org\/10.1145\/2001576.2001644","relation":{},"subject":[],"published":{"date-parts":[[2011,7,12]]},"assertion":[{"value":"2011-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}