{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T19:15:39Z","timestamp":1723144539102},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T00:00:00Z","timestamp":1450828800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ITESM Strategic Project","award":["PRY075"],"award-info":[{"award-number":["PRY075"]}]},{"name":"ITESM Research Group with Strategic Focus in Intelligent Systems"},{"name":"CONACyT - Basic Science Project","award":["99695"],"award-info":[{"award-number":["99695"]}]},{"name":"CONACyT - Basic Science Project","award":["241461"],"award-info":[{"award-number":["241461"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s12559-015-9368-2","type":"journal-article","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T06:07:08Z","timestamp":1450850828000},"page":"429-441","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Neuro-evolutionary Hyper-heuristic Approach for Constraint Satisfaction Problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[]},{"given":"Santiago Enrique","family":"Conant-Pablos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,23]]},"reference":[{"issue":"4","key":"9368_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/A:1011402324562","volume":"6","author":"D Achlioptas","year":"2001","unstructured":"Achlioptas D, Molloy MSO, Kirousis LM, Stamatiou YC, Kranakis E, Krizanc D. Random constraint satisfaction: a more accurate picture. Constraints. 2001;6(4):329\u201344.","journal-title":"Constraints"},{"key":"9368_CR2","doi-asserted-by":"crossref","unstructured":"Berlier J, McCollum J. A constraint satisfaction algorithm for microcontroller selection and pin assignment. In: Proceedings of the IEEE SoutheastCon 2010 (SoutheastCon); 2010. p. 348\u201351.","DOI":"10.1109\/SECON.2010.5453854"},{"key":"9368_CR3","doi-asserted-by":"crossref","unstructured":"Bittle SA, Fox MS. Learning and using hyper-heuristics for variable and value ordering in constraint satisfaction problems. In: Proceedings of the 11th annual conference companion on genetic and evolutionary computation conference: late breaking papers. ACM; 2009. p. 2209\u201312.","DOI":"10.1145\/1570256.1570304"},{"key":"9368_CR4","unstructured":"Boussemart F, Hemery F, Lecoutre C, Sais L. Boosting systematic search by weighting constraints. In: European conference on artificial intelligence (ECAI\u201904); 2004. p. 146\u201350."},{"issue":"4","key":"9368_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Brelaz","year":"1979","unstructured":"Brelaz D. New methods to colour the vertices of a graph. Commun ACM. 1979;22(4):251\u201356.","journal-title":"Commun ACM"},{"key":"9368_CR6","doi-asserted-by":"crossref","unstructured":"Burke E, Hart E, Kendall G, Newall J, Ross P, Shulenburg S. Hyper-heuristics: an emerging direction in modern research technology. In: Handbook of metaheuristics. Kluwer Academic Publishers; 2003. p. 457\u201374.","DOI":"10.1007\/0-306-48056-5_16"},{"key":"9368_CR7","unstructured":"Burke E, Kendall G, O\u2019Brien R, Redrup D, Soubeiga E. An ant algorithm hyper-heuristic. In: Proceedings of the fifth metaheuristics international conference (MIC\u201903), vol.\u00a010; 2003. p. 1\u201310."},{"issue":"9","key":"9368_CR8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"6","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Soubeiga E. A tabu-search hyperheuristic for timetabling and rostering. J Heuristics. 2003;6(9):451\u201370.","journal-title":"J Heuristics"},{"key":"9368_CR9","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Castro C, Monfroy E. A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction. In: Proceedings of the 4th international conference on interplay between natural and artificial computation: new challenges on bioinspired applications, vol. Part II, IWINAC\u201911. Berlin: Springer; 2011. p. 295\u2013304.","DOI":"10.1007\/978-3-642-21326-7_32"},{"key":"9368_CR10","unstructured":"Dechter R. Constraint networks. In: Encyclopedia of artificial intelligence. Wiley; 1992. p. 276\u201386."},{"key":"9368_CR11","unstructured":"Dunkin N, Allen S. Frequency assignment problems: representations and solutions. Tech. Rep. CSD-TR-97-14, University of London (1997)"},{"key":"9368_CR12","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS. Computers and intractability; a guide to the theory of NP-completeness. New York: W. H. Freeman & Co; 1979."},{"key":"9368_CR13","doi-asserted-by":"crossref","unstructured":"Gent I, MacIntyre E, Prosser P, Smith B, Walsh T. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In: Proceedings of the international conference on principles and practice of constraint programming (CP\u201996); 1996. p. 179\u201393.","DOI":"10.1007\/3-540-61551-2_74"},{"key":"9368_CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick RM, Elliott GL. Increasing tree search efficiency for constraint satisfaction problems. Artif Intell. 1980;14:263\u2013313.","journal-title":"Artif Intell"},{"issue":"3","key":"9368_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.cosrev.2008.10.003","volume":"2","author":"P Hell","year":"2008","unstructured":"Hell P, Nesetril J. Colouring, constraint satisfaction, and complexity. Comput Sci Rev. 2008;2(3):143\u201363.","journal-title":"Comput Sci Rev"},{"issue":"1","key":"9368_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(02)00291-6","volume":"142","author":"H J\u00f6nsson","year":"2002","unstructured":"J\u00f6nsson H, S\u00f6derberg B. An information-based neural approach to generic constraint satisfaction. Artif Intell. 2002;142(1):1\u201317.","journal-title":"Artif Intell"},{"key":"9368_CR17","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o N, Pereira FB, Costa E. The importance of the learning conditions in hyper-heuristics. In: Proceedings of the 15th annual conference on genetic and evolutionary computation, GECCO \u201913. ACM, New York; 2013. p. 1525\u201332.","DOI":"10.1145\/2463372.2463558"},{"issue":"9","key":"9368_CR18","doi-asserted-by":"crossref","first-page":"4475","DOI":"10.1016\/j.eswa.2013.12.050","volume":"41","author":"M Maashi","year":"2014","unstructured":"Maashi M, \u00d6zcan E, Kendall G. A multi-objective hyper-heuristic based on choice function. Expert Syst Appl. 2014;41(9):4475\u201393.","journal-title":"Expert Syst Appl"},{"issue":"1","key":"9368_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth AK. Consistency in networks of relations. Artif Intell. 1977;8(1):99\u2013118.","journal-title":"Artif Intell"},{"key":"9368_CR20","doi-asserted-by":"crossref","unstructured":"Marchiori E, Steenbeek A. A genetic local search algorithm for random binary constraint satisfaction problems. In: Proceedings of the ACM symposium on applied computing (2000). p. 458\u201362 .","DOI":"10.1145\/335603.335910"},{"key":"9368_CR21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S Minton","year":"1992","unstructured":"Minton S, Johnston MD, Phillips A, Laird P. Minimizing conflicts: a heuristic repair method for CSP and scheduling problems. Artif Intell. 1992;58:161\u2013205.","journal-title":"Artif Intell"},{"issue":"3","key":"9368_CR22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10951-012-0295-8","volume":"16","author":"M Misir","year":"2013","unstructured":"Misir M, Verbeeck K, Causmaecker P, Berghe G. A new hyper-heuristic as a general problem solver: an implementation in HyFlex. J Sched. 2013;16(3):291\u2013311.","journal-title":"J Sched"},{"key":"9368_CR23","doi-asserted-by":"crossref","unstructured":"Nakano T, Nagamatu M. Lagrange neural network for solving CSP which includes linear inequality constraints. In: Duch W, Kacprzyk J, Oja E, Zadrozny S, editors. Artificial neural networks: formal models and their applications (ICANN\u201905), vol. 3697, Lecture Notes in Computer Science. Berlin: Springer; 2005. p. 943\u20138.","DOI":"10.1007\/11550907_149"},{"key":"9368_CR24","doi-asserted-by":"crossref","unstructured":"Ochoa G, Hyde M, Curtois T, Vazquez-Rodriguez J, Walker J, Gendreau M, Kendall G, McCollum B, Parkes A, Petrovic S, Burke E. Hyflex: a benchmark framework for cross-domain heuristic search. In: Hao JK, Middendorf M, editors. European conference on evolutionary computation in combinatorial optimisation (EvoCOP 2012), vol. 7245, LNCS. Heidelberg: Springer; 2012. p. 136\u201347.","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"9368_CR25","unstructured":"O\u2019Mahony E, Hebrard E, Holland A, Nugent C, O\u2019Sullivan B. Using case-based reasoning in an algorithm portfolio for constraint solving. In: Proceedings of the 19th Irish conference on artificial intelligence and cognitive science (2008)."},{"key":"9368_CR26","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss JC, \u00d6zcan E, Parkes AJ, Terashima-Mar\u00edn H. Mapping the performance of heuristics for constraint satisfaction. In: Proceedings of the 2010 IEEE congress on evolutionary computation (CEC\u201910). IEEE Press; 2010. p. 1\u20138.","DOI":"10.1109\/CEC.2010.5585965"},{"issue":"4","key":"9368_CR27","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.patrec.2012.09.009","volume":"34","author":"JC Ortiz-Bayliss","year":"2013","unstructured":"Ortiz-Bayliss JC, Terashima-Mar\u00edn H, Conant-Pablos SE. Learning vector quantization for variable ordering in constraint satisfaction problems. Pattern Recogn Lett. 2013;34(4):423\u201332.","journal-title":"Pattern Recogn Lett"},{"key":"9368_CR28","doi-asserted-by":"crossref","unstructured":"Ortiz-Bayliss JC, Terashima-Mar\u00edn H, Ross P, Conant-Pablos SE. Evolution of neural networks topologies and learning parameters to produce hyper-heuristics for constraint satisfaction problems. In: Proceedings of the 13th annual conference companion on genetic and evolutionary computation (GECCO\u201911). ACM; 2011. p. 261\u201362.","DOI":"10.1145\/2001858.2002005"},{"issue":"1","key":"9368_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10710-013-9186-9","volume":"15","author":"GL Pappa","year":"2014","unstructured":"Pappa GL, Ochoa G, Hyde MR, Freitas AA, Woodward J, Swan J. Contrasting meta-learning and hyper-heuristic research: the role of evolutionary algorithms. Genet Program Evolvable Mach. 2014;15(1):3\u201335.","journal-title":"Genet Program Evolvable Mach"},{"issue":"3","key":"9368_CR30","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1142\/S0218213008004023","volume":"17","author":"S Petrovic","year":"2008","unstructured":"Petrovic S, Epstein SL. Random subsets support learning a mixture of heuristics. Int J Artif Intell Tools. 2008;17(3):501\u201320.","journal-title":"Int J Artif Intell Tools"},{"key":"9368_CR31","volume-title":"Learning representations by back-propagating errors","author":"DE Rumelhart","year":"1988","unstructured":"Rumelhart DE, Hinton GE, Williams RJ. Learning representations by back-propagating errors. Cambridge: MIT Press; 1988."},{"key":"9368_CR32","unstructured":"Smith BM, Grant SA. Sparse constraint graphs and exceptionally hard problems. In: Proceedings of the international joint conferences on artificial intelligence (IJCAI\u201995); 1995. p. 646\u201351"},{"key":"9368_CR33","doi-asserted-by":"crossref","unstructured":"Soto R, Crawford B, Monfroy E, Bustos V. Using autonomous search for generating good enumeration strategy blends in constraint programming. In: ICCSA (3)\u201912; 2012. p. 607\u201317.","DOI":"10.1007\/978-3-642-31137-6_46"},{"issue":"1","key":"9368_CR34","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/s12559-013-9201-8","volume":"6","author":"J Swan","year":"2014","unstructured":"Swan J, Woodward J, \u00d6zcan E, Kendall G, Burke E. Searching the hyper-heuristic design space. Cogn Comput. 2014;6(1):66\u201373.","journal-title":"Cogn Comput"},{"key":"9368_CR35","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.asoc.2014.01.037","volume":"19","author":"HR Topcuoglu","year":"2014","unstructured":"Topcuoglu HR, Ucar A, Altin L. A hyper-heuristic based framework for dynamic optimization problems. Appl Soft Comput. 2014;19:236\u201351.","journal-title":"Appl Soft Comput"},{"key":"9368_CR36","volume-title":"Foundations of constraint satisfaction","author":"E Tsang","year":"1993","unstructured":"Tsang E. Foundations of constraint satisfaction. New York: Academic Press Limited; 1993."},{"key":"9368_CR37","unstructured":"Tsang E, Kwan A. Mapping constraint satisfaction problems to algorithms and heuristics. Tech. Rep. CSM-198, Department of Computer Sciences, University of Essex (1993)."},{"key":"9368_CR38","doi-asserted-by":"crossref","unstructured":"Wallace R. Analysis of heuristic synergies. In: Hnich B, Carlsson M, Fages F, Rossi F, editors. Recent advances in constraints, vol. 3978, Lecture Notes in Computer Science. Berlin: Springer; 2006. p. 73\u201387.","DOI":"10.1007\/11754602_6"},{"key":"9368_CR39","unstructured":"Williams CP, Hogg T. Using deep structure to locate hard problems. In: Proceedings of AAAI\u201992; 1992. p. 472\u20137."},{"key":"9368_CR40","doi-asserted-by":"crossref","unstructured":"Wu Y, McCall J, Corne D, Regnier-Coudert O. Landscape analysis for hyperheuristic bayesian network structure learning on unseen problems. In: 2012 IEEE congress on evolutionary computation (CEC); 2012. p. 1\u20138.","DOI":"10.1109\/CEC.2012.6252964"}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-015-9368-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12559-015-9368-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-015-9368-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T13:41:55Z","timestamp":1653918115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12559-015-9368-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,23]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9368"],"URL":"https:\/\/doi.org\/10.1007\/s12559-015-9368-2","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"value":"1866-9956","type":"print"},{"value":"1866-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,23]]}}}