{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:48:12Z","timestamp":1648590492642},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0004-3702(95)00058-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:20:41Z","timestamp":1027596041000},"page":"327-347","source":"Crossref","is-referenced-by-count":11,"title":["Problem structure heuristics and scaling behavior for genetic algorithms"],"prefix":"10.1016","volume":"81","author":[{"given":"Scott H.","family":"Clearwater","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tad","family":"Hogg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00058-5_BIB1","series-title":"Genetic Algorithms and Simulated Annealing","first-page":"170","article-title":"An empirical study of bit vector function optimization","author":"Ackley","year":"1987"},{"key":"10.1016\/0004-3702(95)00058-5_BIB2","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0004-3702(95)00058-5_BIB3","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1126\/science.253.5025.1227","article-title":"New approaches to robotics","volume":"253","author":"Brooks","year":"1991","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00058-5_BIB4","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/0004-3702(95)00058-5_BIB5","series-title":"Proceedings AAAI-94","first-page":"1310","article-title":"Exploiting problem structure in genetic algorithms","author":"Clearwater","year":"1994"},{"key":"10.1016\/0004-3702(95)00058-5_BIB6","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1126\/science.254.5035.1181","article-title":"Cooperative solution of constraint satisfaction problems","volume":"254","author":"Clearwater","year":"1991","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00058-5_BIB7","series-title":"Percolation Structures and Processes","volume":"5","year":"1983"},{"key":"10.1016\/0004-3702(95)00058-5_BIB8","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1126\/science.8346439","article-title":"Genetic algorithms: principles of natural selection applied to computation","volume":"261","author":"Forrest","year":"1993","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00058-5_BIB9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022626114466","article-title":"What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation","volume":"13","author":"Forrest","year":"1993","journal-title":"Mach. Learning"},{"key":"10.1016\/0004-3702(95)00058-5_BIB10","series-title":"Proceedings ECAI-94","article-title":"Extracting constraint satisfaction subproblems","author":"Freuder","year":"1994"},{"key":"10.1016\/0004-3702(95)00058-5_BIB11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","article-title":"Partial constraint satisfaction","volume":"58","author":"Freuder","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00058-5_BIB12","author":"Garey","year":"1979"},{"key":"10.1016\/0004-3702(95)00058-5_BIB13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","article-title":"Easy problems are sometimes hard","volume":"70","author":"Gent","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00058-5_BIB14","author":"Goldberg","year":"1989"},{"key":"10.1016\/0004-3702(95)00058-5_BIB15","author":"Grefenstette","year":"1990"},{"key":"10.1016\/0004-3702(95)00058-5_BIB16","series-title":"Phase transitions in constraint satisfaction search","author":"Hogg","year":"1994"},{"key":"10.1016\/0004-3702(95)00058-5_BIB17","series-title":"Proceedings AAAI-93","first-page":"231","article-title":"Solving the really hard problems with cooperative search","author":"Hogg","year":"1993"},{"key":"10.1016\/0004-3702(95)00058-5_BIB18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","article-title":"The hardest constraint problems: a double phase transition","volume":"69","author":"Hogg","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00058-5_BIB19","author":"Holland","year":"1975"},{"key":"10.1016\/0004-3702(95)00058-5_BIB20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","article-title":"Phase transitions in artificial intelligence systems","volume":"33","author":"Huberman","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00058-5_BIB21","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00058-5_BIB22","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behavior in the satisfiability of random Boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00058-5_BIB23","series-title":"Proceedings IJCAI-81","first-page":"575","article-title":"The use of parallelism to implement a heuristic search","author":"Kornfeld","year":"1981"},{"issue":"1","key":"10.1016\/0004-3702(95)00058-5_BIB24","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/01969729308961696","article-title":"Genetic algorithms: what fitness scaling is optimal?","volume":"24","author":"Kreinovich","year":"1993","journal-title":"Cybern. Syst."},{"key":"10.1016\/0004-3702(95)00058-5_BIB25","series-title":"Encyclopedia of AI","first-page":"205","article-title":"Constraint satisfaction","author":"Mackworth","year":"1987"},{"key":"10.1016\/0004-3702(95)00058-5_BIB26","series-title":"Proceedings AAAI-90","first-page":"17","article-title":"Solving large-scale constraint satisfaction and scheduling problems using a heursitic repair method","author":"Minton","year":"1990"},{"key":"10.1016\/0004-3702(95)00058-5_BIB27","series-title":"Proceedings AAAI-92","first-page":"205","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0004-3702(95)00058-5_BIB28","author":"Press","year":"1986"},{"issue":"3","key":"10.1016\/0004-3702(95)00058-5_BIB29","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid algorithms for the constraint satisfaction problem","volume":"9","author":"Prosser","year":"1993","journal-title":"Comput. Intell."},{"key":"10.1016\/0004-3702(95)00058-5_BIB30","article-title":"On the efficiency of parallel backtracking","author":"Rao","year":"1992","journal-title":"IEEE Trans. Parallel Distrib. Comput."},{"key":"10.1016\/0004-3702(95)00058-5_BIB31","series-title":"Proceedings AAAI-92","first-page":"472","article-title":"Using deep structure to locate hard problems","author":"Williams","year":"1992"},{"key":"10.1016\/0004-3702(95)00058-5_BIB32","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","volume":"70","author":"Williams","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00058-5_BIB33","series-title":"Proceedings AAAI-92","first-page":"545","article-title":"An average-case analysis of branch-and-bound with applications: summary of results","author":"Zhang","year":"1992"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000585?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000585?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:58:31Z","timestamp":1556755111000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000585"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00058-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}