{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:06:04Z","timestamp":1742929564555,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"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_24","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"393-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Over Sampling Local Optima: Selection and\u00a0Sampling Bias in\u00a0Hybrid Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Darrell","family":"Whitley","sequence":"first","affiliation":[]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Canonne, L., Derbel, B.: DRILS revisited: designing perturbation in graybox optimization techniques. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 204-212. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3512290.3528774","key":"24_CR1","DOI":"10.1145\/3512290.3528774"},{"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: GECCO 2023: Genetic and Evolutionary Computation Conference, pp. 257\u2013265. ACM, Lisbon Portugal, Portugal (Jul 2023). https:\/\/doi.org\/10.1145\/3583131.3590466, https:\/\/inria.hal.science\/hal-04379253","key":"24_CR2","DOI":"10.1145\/3583131.3590466"},{"doi-asserted-by":"crossref","unstructured":"Chen, W., Whitley, D., Tin\u00f3s, R., Chicano, F.: Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover. In: GECCO Genetic and Evolutionay Computation Conference, pp. 921\u2013928. ACM (2018)","key":"24_CR3","DOI":"10.1145\/3205455.3205482"},{"doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Ochoa, G., Tinos, R.: Optimizing one million variable nk landscapes by hybridizing deterministic recombination and local search. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 753\u2013760. ACM (2017)","key":"24_CR4","DOI":"10.1145\/3071178.3071285"},{"doi-asserted-by":"crossref","unstructured":"Dunton, P., Whitley, D.: Reducing the cost of partition crossover on large maxsat problems: the px-preprocessor. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 694-702. ACM (2022)","key":"24_CR5","DOI":"10.1145\/3512290.3528748"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-319-30698-8_11","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"BW Goldman","year":"2016","unstructured":"Goldman, B.W., Punch, W.F.: Hyperplane elimination for quickly enumerating local optima. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 154\u2013169. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_11"},{"issue":"1","key":"24_CR7","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."},{"issue":"1","key":"24_CR8","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. Euro. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Euro. J. Oper. Res."},{"unstructured":"Helsgaun, K.: DIMACS TSP Challenge Results: Current Best Tours Found by LKH (2013). http:\/\/www.akira.ruc.dk\/ keld\/research\/LKH\/DIMACS results.html. (24 November 2013)","key":"24_CR9"},{"unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufman (2004)","key":"24_CR10"},{"unstructured":"Kauffman, S.: Adaptation on rugged fitness landscapes. In: Stein, D. (ed.) Lectures in the Science of Complexity, pp. 527\u2013618. Addison-Wesley (1989)","key":"24_CR11"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0022-5193(87)80029-2","volume":"128","author":"S Kauffman","year":"1987","unstructured":"Kauffman, S., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. J. Theor. Biol. 128, 11\u201345 (1987)","journal-title":"J. Theor. Biol."},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"4667","DOI":"10.1103\/PhysRevE.59.4667","volume":"59","author":"A M\u00f6bius","year":"1999","unstructured":"M\u00f6bius, A., Freisleben, B., Merz, P., Schreiber, M.: Combinatorial optimization by iterative partial transcription. Phys. Rev. E 59(4), 4667\u20134674 (1999)","journal-title":"Phys. Rev. E"},{"unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Trick, J. (ed.) Second DIMACS Challenge on Cliques, Coloring and Satisfiability (1993)","key":"24_CR14"},{"unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: The National Conference on Artificial Intelligence (AAAI), San Jose, CA, pp. 440\u2013446 (1992)","key":"24_CR15"},{"doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Johnson, D.S., Trick, M.A. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. AMS (1996)","key":"24_CR16","DOI":"10.1090\/dimacs\/026\/25"},{"doi-asserted-by":"crossref","unstructured":"Tin\u00f3s, R., Whitley, D., Chicano, F.: Partition crossover for pseudo-boolean optimization. In: Foundations of Genetic Algorithms, (FOGA 2015), pp. 137\u2013149 (2015)","key":"24_CR17","DOI":"10.1145\/2725494.2725497"},{"doi-asserted-by":"crossref","unstructured":"Whitley, D., Chen, W.: Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 1357\u20131364. ACM (2012)","key":"24_CR18","DOI":"10.1145\/2330163.2330351"},{"doi-asserted-by":"crossref","unstructured":"Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pp. 915\u2013922. ACM (2009)","key":"24_CR19","DOI":"10.1145\/1569901.1570026"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-15844-5_57","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D Whitley","year":"2010","unstructured":"Whitley, D., Hains, D., Howe, A.: A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 566\u2013575. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_57"},{"doi-asserted-by":"crossref","unstructured":"Whitley, D., Ochoa, G., Chicano, F.: Partition crossover can linearize local optima lattices of k-bounded pseudo-boolean functions. In: Foundations of Genetic Algorithms. ACM (2023)","key":"24_CR21","DOI":"10.1145\/3594805.3607129"}],"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_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:05:59Z","timestamp":1725649559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_24","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":"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"}}]}}