{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:54:29Z","timestamp":1743267269991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_4","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"52-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalizing and\u00a0Unifying Gray-Box Combinatorial Optimization Operators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2752-6534","authenticated-orcid":false,"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4027-8851","authenticated-orcid":false,"given":"Renato","family":"Tin\u00f3s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Canonne, L., Derbel, B., Chicano, F., Ochoa, G.: To combine or not to combine graybox crossover and local search? In: Silva, S., Paquete, L. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023, Lisbon, Portugal, 15\u201319 July 2023, pp. 257\u2013265. ACM (2023). https:\/\/doi.org\/10.1145\/3583131.3590466","DOI":"10.1145\/3583131.3590466"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Chen, W., Whitley, L.D., Tin\u00f3s, R., Chicano, F.: Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover. In: Aguirre, H.E., Takadama, K. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, 15\u201319 July 2018, pp. 921\u2013928. ACM (2018). https:\/\/doi.org\/10.1145\/3205455.3205482","DOI":"10.1145\/3205455.3205482"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Chicano, F., Whitley, L.D., Ochoa, G., Tin\u00f3s, R.: Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In: Bosman, P.A.N. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, 15\u201319 July 2017, pp. 753\u2013760. ACM (2017). https:\/\/doi.org\/10.1145\/3071178.3071285","DOI":"10.1145\/3071178.3071285"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Chicano, F., Whitley, L.D., Sutton, A.M.: Efficient identification of improving moves in a ball for pseudo-boolean problems. In: Arnold, D.V. (ed.) Genetic and Evolutionary Computation Conference, GECCO 2014, Vancouver, BC, Canada, 12\u201316 July 2014, pp. 437\u2013444. ACM (2014). https:\/\/doi.org\/10.1145\/2576768.2598304","DOI":"10.1145\/2576768.2598304"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Fulton, W., Harris, J.: Representation Theory, A First Course. Springer, Cham (2004). https:\/\/doi.org\/10.1007\/978-1-4612-0979-9","DOI":"10.1007\/978-1-4612-0979-9"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR7","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufman, New York (2004)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-30217-9_6","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., Smyth, K., St\u00fctzle, T.: Search space features underlying the performance of stochastic local search algorithms for MAX-SAT. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 51\u201360. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_6"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Lenstra, J., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. In: Hammer, P., Johnson, E., Korte, B., Nemhauser, G. (eds.) Studies in Integer Programming, Annals of Discrete Mathematics, vol.\u00a01, pp. 343\u2013362. Elsevier (1977). https:\/\/doi.org\/10.1016\/S0167-5060(08)70743-X","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Mart\u00ed, R., Reinelt, G.: The Linear Ordering Problem. Exact and Heuristic Methods in Combinatorial Optimization, vol.\u00a0175. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-16729-4","DOI":"10.1007\/978-3-642-16729-4"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithms using edge assemble crossover the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s, R., Whitley, L.D., Chicano, F.: Partition crossover for pseudo-Boolean optimization. In: He, J., Jansen, T., Ochoa, G., Zarges, C. (eds.) Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, 17\u201320 January 2015, pp. 137\u2013149. ACM (2015). https:\/\/doi.org\/10.1145\/2725494.2725497","DOI":"10.1145\/2725494.2725497"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s, R., Whitley, L.D., Ochoa, G.: Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP. In: Arnold, D.V. (ed.) Genetic and Evolutionary Computation Conference, GECCO 2014, Vancouver, BC, Canada, 12\u201316 July 2014, pp. 501\u2013508. ACM (2014). https:\/\/doi.org\/10.1145\/2576768.2598245","DOI":"10.1145\/2576768.2598245"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.2307\/2387224","volume":"45","author":"JL Walsh","year":"1923","unstructured":"Walsh, J.L.: A closed set of normal orthogonal functions. Am. J. Math. 45(1), 5 (1923)","journal-title":"Am. J. Math."},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Whitley, L.D., Chen, W.: Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT. In: Soule, T., Moore, J.H. (eds.) Genetic and Evolutionary Computation Conference, GECCO 2012, Philadelphia, PA, USA, 7\u201311 July 2012, pp. 1357\u20131364. ACM (2012). https:\/\/doi.org\/10.1145\/2330163.2330351","DOI":"10.1145\/2330163.2330351"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Whitley, L.D., Chicano, F., Goldman, B.W.: Gray box optimization for Mk landscapes (NK landscapes and MAX-kSAT). Evol. Comput. 24(3), 491\u2013519 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00184","DOI":"10.1162\/EVCO_a_00184"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Whitley, L.D., Hains, D., Howe, A.E.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Rothlauf, F. (ed.) Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Qu\u00e9bec, Canada, 8\u201312 July 2009, pp. 915\u2013922. ACM (2009). https:\/\/doi.org\/10.1145\/1569901.1570026","DOI":"10.1145\/1569901.1570026"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:03:21Z","timestamp":1725649401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}