{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:57:19Z","timestamp":1758819439393,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"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":[[2024,7,14]]},"DOI":"10.1145\/3638529.3654020","type":"proceedings-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:33:04Z","timestamp":1720456384000},"page":"1045-1053","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Deep Neural Crossover"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1313-0504","authenticated-orcid":false,"given":"Eliad","family":"Shem-Tov","sequence":"first","affiliation":[{"name":"Ben-Gurion University, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4009-5353","authenticated-orcid":false,"given":"Achiya","family":"Elyasaf","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"96","article-title":"Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator","volume":"3","author":"Ahmed Zakir H","year":"2010","unstructured":"Zakir H Ahmed. 2010. Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. International Journal of Biometrics & Bioinformatics (IJBB) 3, 6 (2010), 96.","journal-title":"International Journal of Biometrics & Bioinformatics (IJBB)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECACE.2019.8679367"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.08.024"},{"key":"e_1_3_2_1_4_1","volume-title":"Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940","author":"Bello Irwan","year":"2016","unstructured":"Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio. 2016. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksues.2013.04.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58484-6_252"},{"volume-title":"Introduction to evolutionary computing","author":"Eiben Agoston E","key":"e_1_3_2_1_7_1","unstructured":"Agoston E Eiben and James E Smith. 2015. Introduction to evolutionary computing. Springer."},{"key":"e_1_3_2_1_8_1","volume-title":"Long short-term memory. Neural computation 9, 8","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9, 8 (1997), 1735--1780."},{"key":"e_1_3_2_1_9_1","volume-title":"Genetic algorithms. Scientific american 267, 1","author":"Holland John H","year":"1992","unstructured":"John H Holland. 1992. Genetic algorithms. Scientific american 267, 1 (1992), 66--73."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299783"},{"key":"e_1_3_2_1_11_1","volume-title":"October 11-13","author":"Johnson David S","year":"1993","unstructured":"David S Johnson and Michael A Trick. 1996. Cliques, coloring, and satisfiability: second DIMACS implementation challenge, October 11-13, 1993. Vol. 26. American Mathematical Soc."},{"key":"e_1_3_2_1_12_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC42975.2020.9282841"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110680"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116042"},{"key":"e_1_3_2_1_16_1","volume-title":"A comparative study of crossover operators for genetic algorithms to solve the job shop scheduling problem. WSEAS transactions on computers 12, 4","author":"Magalhaes-Mendes Jorge","year":"2013","unstructured":"Jorge Magalhaes-Mendes. 2013. A comparative study of crossover operators for genetic algorithms to solve the job shop scheduling problem. WSEAS transactions on computers 12, 4 (2013), 164--173."},{"key":"e_1_3_2_1_17_1","volume-title":"Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.10.010"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125404"},{"key":"e_1_3_2_1_20_1","volume-title":"US Army Space and Missile Defense Command","author":"Schoenfield Jon E","year":"2002","unstructured":"Jon E Schoenfield. 2002. Fast, exact solution of open bin packing problems without linear programming. Draft, US Army Space and Missile Defense Command, Huntsville, Alabama, USA (2002)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30976-2_50"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.785564"},{"key":"e_1_3_2_1_23_1","volume-title":"Pointer Networks. Advances in Neural Information Processing Systems 28","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer Networks. Advances in Neural Information Processing Systems 28 (2015). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2015\/file\/29921001f2f04bd3baee84a12e98098f-Paper.pdf"},{"key":"e_1_3_2_1_24_1","volume-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8","author":"Williams Ronald J","year":"1992","unstructured":"Ronald J Williams. 1992. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8 (1992), 229--256."}],"event":{"name":"GECCO '24: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Melbourne VIC Australia","acronym":"GECCO '24"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654020","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638529.3654020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:50Z","timestamp":1750291010000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638529.3654020"}},"subtitle":["A Multi-Parent Operator That Leverages Gene Correlations"],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":24,"alternative-id":["10.1145\/3638529.3654020","10.1145\/3638529"],"URL":"https:\/\/doi.org\/10.1145\/3638529.3654020","relation":{},"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"2024-07-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}