{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:41:02Z","timestamp":1769442062832,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T00:00:00Z","timestamp":1341619200000},"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":[[2012,7,7]]},"DOI":"10.1145\/2330163.2330339","type":"proceedings-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T16:41:12Z","timestamp":1341938472000},"page":"1269-1276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving the performance of vector hyper-heuristics through local search"],"prefix":"10.1145","author":[{"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"first","affiliation":[{"name":"Tecnol\u00f3gico de Monterrey, Monterrey, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[{"name":"Tecnol\u00f3gico de Monterrey, Monterrey, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago Enrique","family":"Conant-Pablos","sequence":"additional","affiliation":[{"name":"Tecnol\u00f3gico de Monterrey, Monterrey, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[{"name":"Universtity of Nottingham, Nottingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Parkes","sequence":"additional","affiliation":[{"name":"University of Nottingham, Nottingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011402324562"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-61291-2_40","volume-title":"Advances in Artificial Intelligence","author":"Allen J.","year":"1996","unstructured":"J. Allen and S. Minton . Selecting the right heuristic algorithm: Runtime performance predictors . In G. McCalla, editor, Advances in Artificial Intelligence , volume 1081 of Lecture Notes in Computer Science , pages 41 -- 53 . Springer , 1996 . J. Allen and S. Minton. Selecting the right heuristic algorithm: Runtime performance predictors. In G. McCalla, editor, Advances in Artificial Intelligence, volume 1081 of Lecture Notes in Computer Science, pages 41--53. Springer, 1996."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61551-2_66"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361224"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1570256.1570304"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_3_2_1_7_1","first-page":"1","volume-title":"Proceedings of the fifth Metaheuristics International Conference (MIC'03)","volume":"10","author":"Burke E.","year":"2003","unstructured":"E. Burke , G. Kendall , R. O'Brien , D. Redrup , and E. Soubeiga . An ant algorithm hyper-heuristic . In Proceedings of the fifth Metaheuristics International Conference (MIC'03) , volume 10 , pages 1 -- 10 , 2003 . E. Burke, G. Kendall, R. O'Brien, D. Redrup, and E. Soubeiga. An ant algorithm hyper-heuristic. In Proceedings of the fifth Metaheuristics International Conference (MIC'03), volume 10, pages 1--10, 2003."},{"key":"e_1_3_2_1_8_1","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"M. Gendreau and J.-Y","author":"Burke E. K.","year":"2010","unstructured":"E. K. Burke , M. Hyde , G. Kendall , G. Ochoa , E. \u00d6zcan , and J. R. Woodward . A classification of hyper-heuristic approaches . In M. Gendreau and J.-Y . Potvin, editors, Handbook of Metaheuristics, volume 146 of International Series in Operations Research and Management Science , pages 449 -- 468 . Springer , 2010 . E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. \u00d6zcan, and J. R. Woodward. A classification of hyper-heuristic approaches. In M. Gendreau and J.-Y. Potvin, editors, Handbook of Metaheuristics, volume 146 of International Series in Operations Research and Management Science, pages 449--468. Springer, 2010."},{"key":"e_1_3_2_1_9_1","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","volume-title":"Adaptive and Multilevel Metaheuristics","author":"Chakhlevitch K.","year":"2008","unstructured":"K. Chakhlevitch and P. Cowling . Hyperheuristics: Recent developments . In C. Cotta, M. Sevaux, and K. S\u00f6rensen, editors, Adaptive and Multilevel Metaheuristics , volume 136 of Studies in Computational Intelligence , pages 3 -- 29 . Springer , 2008 . K. Chakhlevitch and P. Cowling. Hyperheuristics: Recent developments. In C. Cotta, M. Sevaux, and K. S\u00f6rensen, editors, Adaptive and Multilevel Metaheuristics, volume 136 of Studies in Computational Intelligence, pages 3--29. Springer, 2008."},{"key":"e_1_3_2_1_10_1","first-page":"331","volume-title":"Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI'91)","author":"Cheeseman P.","year":"1991","unstructured":"P. Cheeseman , B. Kanefsky , and W. M. Taylor . Where the really hard problems are . In Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI'91) , pages 331 -- 337 , 1991 . P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI'91), pages 331--337, 1991."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/51909.52120"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645826.669410"},{"key":"e_1_3_2_1_13_1","volume-title":"Using case-based reasoning in an algorithm portfolio for constraint solving","author":"Eoin O'Mahony A. H. C. N.","year":"2008","unstructured":"A. H. C. N. Eoin O'Mahony , Emmanuel Hebrard and B. O'Sullivan . Using case-based reasoning in an algorithm portfolio for constraint solving . 2008 . A. H. C. N. Eoin O'Mahony, Emmanuel Hebrard and B. O'Sullivan. Using case-based reasoning in an algorithm portfolio for constraint solving. 2008."},{"key":"e_1_3_2_1_14_1","volume-title":"Factory Scheduling Conference. Carnegie Institute of Technology","author":"Fisher H.","year":"1961","unstructured":"H. Fisher and G. L. Thompson . Probabilistic learning combinations of local job-shop scheduling rules . In Factory Scheduling Conference. Carnegie Institute of Technology , 1961 . H. Fisher and G. L. Thompson. Probabilistic learning combinations of local job-shop scheduling rules. In Factory Scheduling Conference. Carnegie Institute of Technology, 1961."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/359642.359654"},{"key":"e_1_3_2_1_16_1","first-page":"268","volume-title":"Proceedings of the Canadian Artificial Intelligence Conference","author":"Gaschnig J. G.","year":"1978","unstructured":"J. G. Gaschnig . Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisficing assignment problems . In Proceedings of the Canadian Artificial Intelligence Conference , pages 268 -- 277 , 1978 . J. G. Gaschnig. Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisficing assignment problems. In Proceedings of the Canadian Artificial Intelligence Conference, pages 268--277, 1978."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61551-2_74"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90051-X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00050-X"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/647288.721441"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5585965"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001858.2002005"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1368027.1368029"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213008004023"},{"key":"e_1_3_2_1_27_1","first-page":"95","volume-title":"Proceedings of the European Conference in Artificial Intelligence","author":"Prosser P.","year":"1994","unstructured":"P. Prosser . Binary constraint satisfaction problems: Some are harder than others . In Proceedings of the European Conference in Artificial Intelligence , pages 95 -- 99 , 1994 . P. Prosser. Binary constraint satisfaction problems: Some are harder than others. In Proceedings of the European Conference in Artificial Intelligence, pages 95--99, 1994."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(83)80007-1"},{"key":"e_1_3_2_1_29_1","volume-title":"Artificial Intelligence A Modern Approach","author":"Russell S.","year":"1995","unstructured":"S. Russell and P. Norvig . Artificial Intelligence A Modern Approach . Prentice Hall , 1995 . S. Russell and P. Norvig. Artificial Intelligence A Modern Approach. Prentice Hall, 1995."},{"key":"e_1_3_2_1_30_1","first-page":"110","volume-title":"First International Conference on Evolutionary Computation and its applications (EvCa'96)","author":"Schaffer J. D.","year":"1996","unstructured":"J. D. Schaffer and L. J. Eshelman . Combinatorial optimisation by genetic algorithms: The value of the genotype\/phenotype distinction . In First International Conference on Evolutionary Computation and its applications (EvCa'96) , pages 110 -- 120 . Springer , 1996 . J. D. Schaffer and L. J. Eshelman. Combinatorial optimisation by genetic algorithms: The value of the genotype\/phenotype distinction. In First International Conference on Evolutionary Computation and its applications (EvCa'96), pages 110--120. Springer, 1996."},{"key":"e_1_3_2_1_31_1","volume-title":"A tutorial on constraint programming. Technical report","author":"Smith B. M.","year":"1995","unstructured":"B. M. Smith . A tutorial on constraint programming. Technical report , University of Leeds , 1995 . B. M. Smith. A tutorial on constraint programming. Technical report, University of Leeds, 1995."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00052-6"},{"key":"e_1_3_2_1_33_1","first-page":"249","volume-title":"Thirteenth European Conference on Artificial Intelligence (ECAI'97)","author":"Smith B. M.","year":"1997","unstructured":"B. M. Smith and S. A. Grant . Trying harder to fail first . In Thirteenth European Conference on Artificial Intelligence (ECAI'97) , pages 249 -- 253 . John Wiley & Sons , 1997 . B. M. Smith and S. A. Grant. Trying harder to fail first. In Thirteenth European Conference on Artificial Intelligence (ECAI'97), pages 249--253. John Wiley & Sons, 1997."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.314.0464"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.10.1495"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389206"},{"key":"e_1_3_2_1_37_1","first-page":"635","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99)","author":"Terashima-Mar\u00edn H.","year":"1999","unstructured":"H. Terashima-Mar\u00edn , P. Ross , and M. Valenzuela-Rend\u00f3n . Evolution of constraint satisfaction strategies in examination timetabling . In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99) , pages 635 -- 642 . Morgan Kaufmann , 1999 . H. Terashima-Mar\u00edn, P. Ross, and M. Valenzuela-Rend\u00f3n. Evolution of constraint satisfaction strategies in examination timetabling. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99), pages 635--642. Morgan Kaufmann, 1999."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11754602_6"}],"event":{"name":"GECCO '12: Genetic and Evolutionary Computation Conference","location":"Philadelphia Pennsylvania USA","acronym":"GECCO '12","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 14th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330339","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2330163.2330339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:09Z","timestamp":1750236549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2330163.2330339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,7]]},"references-count":38,"alternative-id":["10.1145\/2330163.2330339","10.1145\/2330163"],"URL":"https:\/\/doi.org\/10.1145\/2330163.2330339","relation":{},"subject":[],"published":{"date-parts":[[2012,7,7]]},"assertion":[{"value":"2012-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}