{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T18:16:59Z","timestamp":1783707419502,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T00:00:00Z","timestamp":1783641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2426840"],"award-info":[{"award-number":["2426840"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2025-185"],"award-info":[{"award-number":["RPG-2025-185"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MCIN\/AEI\/10.13039\/501100011033","award":["PID2024-158752OB-I00"],"award-info":[{"award-number":["PID2024-158752OB-I00"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,13]]},"DOI":"10.1145\/3795095.3805090","type":"proceedings-article","created":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T17:44:29Z","timestamp":1783705469000},"page":"663-671","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Tunneling and Periodicity Across the Big Valley Distribution"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2752-6534","authenticated-orcid":false,"given":"Darrell","family":"Whitley","sequence":"first","affiliation":[{"name":"Colorado State University, Fort Collins, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[{"name":"University of Stirling, Stirling, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[{"name":"University of M\u00e1laga, M\u00e1laga, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Kenneth D. Boese Andrew B. Kahng and Sudhakar Muddu. 1993. On the big valley and adaptive multi-start for discrete global optimizations. Technical Report. UCLA CS Department."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(94)90065-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"E. Boros and P.L. Hammer. 2002. Pseudo-Boolean Optimization. Discrete applied mathematics 123 1 (2002) 155\u2013225.","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"e_1_3_2_1_4_1","volume-title":"Discovering and Harnessing Structures in Solving Application Satisfiability Instances. Ph. D. Dissertation","author":"Chen W.","unstructured":"W. Chen. 2018. Discovering and Harnessing Structures in Solving Application Satisfiability Instances. Ph. D. Dissertation. University Tech."},{"key":"e_1_3_2_1_5_1","volume-title":"Dynastic Potential Crossover Operator. Evolutionary Computation 30, 3 (09","author":"Chicano Francisco","year":"2022","unstructured":"Francisco Chicano, Gabriela Ochoa, L. Darrell Whitley, and Renato Tin\u00f3s. 2022. Dynastic Potential Crossover Operator. Evolutionary Computation 30, 3 (09 2022), 409\u2013446."},{"key":"e_1_3_2_1_6_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 437\u2013444","author":"Chicano F.","unstructured":"F. Chicano, D. Whitley, and A. Sutton. 2014. Efficient Identification of Improving Moves in a Ball for Pseudo-Boolean Problems. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 437\u2013444."},{"key":"e_1_3_2_1_7_1","first-page":"2","article-title":"The basic algorithm for pseudo-Boolean programming revisited","volume":"29","author":"Crama Y.","year":"1990","unstructured":"Y. Crama, P. Hansen, and B. Jaumard. 1990. The basic algorithm for pseudo-Boolean programming revisited. Discr. App. Maths. 29, 2\u20133 (1990), 171\u2013185.","journal-title":"Discr. App. Maths."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.13164\/mendel.2020.1.023"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.478595"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622776.1622786"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"e_1_3_2_1_12_1","unstructured":"F. Glover. 1994. Tabu Search Fundamentals and Uses. Technical Report. University of Colorado at Boulder Boulder CO."},{"key":"e_1_3_2_1_13_1","volume-title":"Hyperplane Elimination for Quickly Enumerating Local Optima. In European Conference on Evolutionary Computation in Combinatorial Optimization. Springer LNCS.","author":"Goldman B.","unstructured":"B. Goldman and W. Punch. 2016. Hyperplane Elimination for Quickly Enumerating Local Optima. In European Conference on Evolutionary Computation in Combinatorial Optimization. Springer LNCS."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"D. Hains D. Whitley and A. Howe. 2011. Revisiting the big valley search space structure in the TSP. J. Operational Research Society 62(2) (2011) 305\u2013312.","DOI":"10.1057\/jors.2010.116"},{"key":"e_1_3_2_1_15_1","volume-title":"Genetic and Evolutionary Computation Conference (GECCO). ACM, 437\u2013444","author":"Hains D.","unstructured":"D. Hains, D. Whitley, A. Howe, and W. Chen. 2013. Hyperplane initialized local search for MAX-SAT. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 437\u2013444."},{"key":"e_1_3_2_1_16_1","unstructured":"Robert B. Heckendorn Soraya Rana and Darrell Whitley. [n. d.]. Polynomial time summary statistics for a generalization of MAXSAT."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_6"},{"key":"e_1_3_2_1_18_1","volume-title":"Lectures in the Science of Complexity","author":"Kauffman S.A.","unstructured":"S.A. Kauffman. 1989. Adaptation on Rugged Fitness Landscapes. In Lectures in the Science of Complexity, D.L. Stein (Ed.). Addison-Wesley, 527\u2013618."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(87)80029-2"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05)","author":"Kilby Philip","year":"2005","unstructured":"Philip Kilby, John Slaney, and Toby Walsh. 2005. The Backbone of the Travelling Salesperson. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05). 175\u2013180."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick C. D. Gelatt and M. P. Vecchi. 1983. Optimization by Simulated Annealing. Science Number 4598 13 May 1983 220 4598 (1983) 671\u2013680. citeseer.ist.psu.edu\/kirkpatrick83optimization.html","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_22_1","volume-title":"The National Conference on Artificial Intelligence (AAAI). MIT Press, 392\u2013397","author":"Rana S.","unstructured":"S. Rana, R. Heckendorn, and D. Whitley. 1998. A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms. In The National Conference on Artificial Intelligence (AAAI). MIT Press, 392\u2013397."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_15"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"R. Tin\u00f3s D. Whitley and F. Chicano. 2015. Partition Crossover for Pseudo-Boolean Optimization. In Foundations of Genetic Algorithms (FOGA-15). 137\u2013149.","DOI":"10.1145\/2725494.2725497"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202749"},{"key":"e_1_3_2_1_27_1","volume-title":"Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 1357\u20131364","author":"Whitley D.","unstructured":"D. Whitley and W. Chen. 2012. Constant Time Steepest Descent Local Search with Lookahead for NK-Landscapes and MAX-kSAT. In Genetic and Evolutionary Computation Conference (GECCO). ACM, 1357\u20131364."},{"key":"e_1_3_2_1_28_1","volume-title":"The National Conference on Artificial Intelligence (AAAI). 940\u2013946","author":"Whitley D.","unstructured":"D. Whitley, A. Howe, and D. Hains. 2013. Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT. In The National Conference on Artificial Intelligence (AAAI). 940\u2013946."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"D. Whitley G. Ochoa and F. Chicano. 2023. Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions. In Foundations of Genetic Algorithms (FOGA). ACM.","DOI":"10.1145\/3594805.3607129"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the International Conference on Theory and Applications of Satisfiability Testing.","author":"Williams Ryan","year":"2003","unstructured":"Ryan Williams, Carla Gomes, and Bart Selman. 2003. On the Connections between Heavy-tails, Backdoors, and Restarts in Combinatorial search. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing."}],"event":{"name":"GECCO '26: Genetic and Evolutionary Computation Conference","location":"Centro Internacional de Convenciones CIC-ANDE San Jose Costa Rica","acronym":"GECCO '26","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\/pdf\/10.1145\/3795095.3805090","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3795095.3805090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T17:45:48Z","timestamp":1783705548000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3795095.3805090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,10]]},"references-count":30,"alternative-id":["10.1145\/3795095.3805090","10.1145\/3795095"],"URL":"https:\/\/doi.org\/10.1145\/3795095.3805090","relation":{},"subject":[],"published":{"date-parts":[[2026,7,10]]},"assertion":[{"value":"2026-07-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}