{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:30:28Z","timestamp":1784212228428,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Council for Scientific and Technological Development (CNPq)","award":["305755\/2018-8"],"award-info":[{"award-number":["305755\/2018-8"]}]},{"name":"S\u00e3o Paulo Research Foundation (FAPESP)","award":["2013\/07375-0, 2019\/07665-4"],"award-info":[{"award-number":["2013\/07375-0, 2019\/07665-4"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,26]]},"DOI":"10.1145\/3449639.3459296","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:51:58Z","timestamp":1624297918000},"page":"627-635","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Partition crossover for continuous optimization"],"prefix":"10.1145","author":[{"given":"Renato","family":"Tin\u00f3s","sequence":"first","affiliation":[{"name":"University of S\u00e3o Paulo, Ribeir\u00e3o Preto, S\u00e3o Paulo, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[{"name":"Colorado State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[{"name":"University of M\u00e1laga, Malaga, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[{"name":"University of Stirling, Stirling, Scotland, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"N. H. Awad M. Z. Ali P. N. Suganthan J. J. Liang and B. Y. Qu. 2016. Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective bound constrained real-parameter numerical optimization. Technical Report. Nanyang Technological University Jordan University of Science and Technology Zhengzhou University.  N. H. Awad M. Z. Ali P. N. Suganthan J. J. Liang and B. Y. Qu. 2016. Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective bound constrained real-parameter numerical optimization. Technical Report. Nanyang Technological University Jordan University of Science and Technology Zhengzhou University."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377930.3390225"},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. of GECCO'2018","author":"Chicano F.","unstructured":"F. Chicano , G. Ochoa , D. Whitley , and R. Tin\u00f3s . 2018. Enhancing Partition Crossover with Articulation Points Analysis . In Proc. of GECCO'2018 . 269--276. F. Chicano, G. Ochoa, D. Whitley, and R. Tin\u00f3s. 2018. Enhancing Partition Crossover with Articulation Points Analysis. In Proc. of GECCO'2018. 269--276."},{"key":"e_1_3_2_2_4_1","volume-title":"Quasi-Optimal Recombination Operator. In European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar). Springer, 131--146","author":"Chicano F.","unstructured":"F. Chicano , G. Ochoa , D. Whitley , and R. Tin\u00f3s . 2019 . Quasi-Optimal Recombination Operator. In European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar). Springer, 131--146 . F. Chicano, G. Ochoa, D. Whitley, and R. Tin\u00f3s. 2019. Quasi-Optimal Recombination Operator. In European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar). Springer, 131--146."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.2298\/YJOR131030041E"},{"key":"e_1_3_2_2_6_1","volume-title":"Int. Conf. on Large-Scale Scientific Computing. 341--349","author":"Eremeev A. V.","unstructured":"A. V. Eremeev and Y. V. Kovalenko . 2017. Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem . In Int. Conf. on Large-Scale Scientific Computing. 341--349 . A. V. Eremeev and Y. V. Kovalenko. 2017. Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem. In Int. Conf. on Large-Scale Scientific Computing. 341--349."},{"key":"e_1_3_2_2_7_1","volume-title":"Proc. of GECCO'2010","author":"Hauschild M. W.","unstructured":"M. W. Hauschild and M. Pelikan . 2010. Network crossover performance on NK landscapes and deceptive problems . In Proc. of GECCO'2010 . 713--720. M. W. Hauschild and M. Pelikan. 2010. Network crossover performance on NK landscapes and deceptive problems. In Proc. of GECCO'2010. 713--720."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01531276"},{"key":"e_1_3_2_2_9_1","volume-title":"Gray-box optimization and factorized distribution algorithms: where two worlds collide. arXiv preprint arXiv:1707.03093","author":"Santana R.","year":"2017","unstructured":"R. Santana . 2017. Gray-box optimization and factorized distribution algorithms: where two worlds collide. arXiv preprint arXiv:1707.03093 ( 2017 ). R. Santana. 2017. Gray-box optimization and factorized distribution algorithms: where two worlds collide. arXiv preprint arXiv:1707.03093 (2017)."},{"key":"e_1_3_2_2_10_1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"Thierens D.","unstructured":"D. Thierens . 2010. The Linkage Tree Genetic Algorithm . In Parallel Problem Solving from Nature, PPSN XI , R. Schaefer, C. Cotta, J. Ko\u0142odziej, and G. Rudolph (Eds.). Springer Berlin Heidelberg, Berlin , Heidelberg , 264--273. D. Thierens. 2010. The Linkage Tree Genetic Algorithm. In Parallel Problem Solving from Nature, PPSN XI, R. Schaefer, C. Cotta, J. Ko\u0142odziej, and G. Rudolph (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 264--273."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106512"},{"key":"e_1_3_2_2_12_1","volume-title":"Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII. 137--149","author":"Tin\u00f3s R.","unstructured":"R. Tin\u00f3s , D. Whitley , and F. Chicano . 2015. Partition crossover for pseudo-boolean optimization . In Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII. 137--149 . R. Tin\u00f3s, D. Whitley, and F. Chicano. 2015. Partition crossover for pseudo-boolean optimization. In Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII. 137--149."},{"key":"e_1_3_2_2_13_1","volume-title":"Handbook of Metaheuristics","author":"Whitley D.","unstructured":"D. Whitley . 2019. Next generation genetic algorithms: a user's guide and tutorial . In Handbook of Metaheuristics . Springer , 245--274. D. Whitley. 2019. Next generation genetic algorithms: a user's guide and tutorial. In Handbook of Metaheuristics. Springer, 245--274."},{"key":"e_1_3_2_2_14_1","volume-title":"Proc. of GECCO'2009","author":"Whitley D.","unstructured":"D. Whitley , D. Hains , and A. Howe . 2009. Tunneling between optima: partition crossover for the traveling salesman problem . In Proc. of GECCO'2009 . 915--922. D. Whitley, D. Hains, and A. Howe. 2009. Tunneling between optima: partition crossover for the traveling salesman problem. In Proc. of GECCO'2009. 915--922."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.02.012"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","location":"Lille France","acronym":"GECCO '21","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459296","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449639.3459296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:57Z","timestamp":1750197717000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449639.3459296"}},"subtitle":["ePX"],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":15,"alternative-id":["10.1145\/3449639.3459296","10.1145\/3449639"],"URL":"https:\/\/doi.org\/10.1145\/3449639.3459296","relation":{},"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"2021-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}