{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:15:42Z","timestamp":1725704142244},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/cec.2010.5586388","type":"proceedings-article","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T15:54:29Z","timestamp":1285775669000},"page":"1-8","source":"Crossref","is-referenced-by-count":6,"title":["Providing a memory mechanism to enhance the evolutionary design of heuristics"],"prefix":"10.1109","author":[{"given":"Edmund K.","family":"Burke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew R.","family":"Hyde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28356-0_17"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1665-5_15","article-title":"A classification of hyper-heuristic approaches","author":"burke","year":"2010","journal-title":"Handbook of Meta-Heuristics"},{"key":"ref14","first-page":"177","article-title":"Exploring hyper-heuristic methodologies with genetic programming","author":"burke","year":"2009","journal-title":"Computational Intelligence Collaboration Fusion and Emergence"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.1.31"},{"key":"ref16","first-page":"37","article-title":"Generating SAT local-search heuristics using a gp hyper-heuristic framework","author":"bader-ei-din","year":"2007","journal-title":"Proc 8th Int Conf Artificial Evol"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5591-8"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1007\/11844297_87","article-title":"Evolving bin packing heuristics with genetic programming","author":"burke","year":"2006","journal-title":"Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN'06)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2041061"},{"key":"ref4","first-page":"151","article-title":"Bin packing approximation algorithms: Combinatorial analysis","author":"coffman","year":"1998","journal-title":"Handbook of Combinatorial Optimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90094-S"},{"journal-title":"Genetic Programming On the Programming of Computers by Means of Natural Selection","year":"1992","author":"koza","key":"ref27"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.2.438"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref5"},{"key":"ref8","first-page":"359","article-title":"Best-fit bin-packing with random order","author":"kenyon","year":"1996","journal-title":"Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"journal-title":"Knapsack Problems Algorithms and Computer Implementations","year":"1990","author":"martello","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277273"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424789"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570029"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144102"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068115"},{"key":"ref24","article-title":"Generalized hyper-heuristics for solving 2d regular and irregular packing problems","author":"terashima-marin","year":"2008","journal-title":"Annals of Operations Research"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277377"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1007\/3-540-45110-2_5","article-title":"Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyperheurstics","author":"ross","year":"2003","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference 2003 (GECCO '03)"},{"key":"ref25","first-page":"942","article-title":"Hyper heuristics: learning to combine simple heuristics in bin packing problems","author":"ross","year":"2002","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference 2002 (GECCO '02)"}],"event":{"name":"2010 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2010,7,18]]},"location":"Barcelona, Spain","end":{"date-parts":[[2010,7,23]]}},"container-title":["IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5573635\/5585910\/05586388.pdf?arnumber=5586388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:26:36Z","timestamp":1559694396000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5586388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/cec.2010.5586388","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}