{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:26:40Z","timestamp":1775143600416,"version":"3.50.1"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/tevc.2011.2160401","type":"journal-article","created":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T00:51:21Z","timestamp":1317775881000},"page":"406-417","source":"Crossref","is-referenced-by-count":83,"title":["Grammatical Evolution of Local Search Heuristics"],"prefix":"10.1109","volume":"16","author":[{"given":"Edmund K.","family":"Burke","sequence":"first","affiliation":[]},{"given":"Matthew R.","family":"Hyde","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"martello","year":"1990","journal-title":"Knapsack Problems Algorithms and Computer Implementations"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01181-8_17"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631224"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389216"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79305-2_2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4425062"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-009-0011-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023419.83147.67"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1023\/B:GENP.0000023687.41210.d7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631313"},{"key":"ref60","article-title":"Solving knapsack problems with attribute grammars","author":"o'neill","year":"2004","journal-title":"Proc 3rd GEWS"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9007-7"},{"key":"ref61","first-page":"34","article-title":"An attribute grammar decode for the 0\/1 multiconstrained knapsack problem","volume":"lncs 3448","author":"cleary","year":"2005","journal-title":"Proc EvoCOP"},{"key":"ref63","first-page":"617","article-title":"<formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\pi\\vert$<\/tex><\/formula>-grammatical evolution","volume":"lncs 3103","author":"o'neill","year":"2004","journal-title":"Proc Genet Evol Computat Conf"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-31989-4_26","article-title":"Extending particle swarm optimisation via genetic programming","author":"poli","year":"2005","journal-title":"Proc 8th Eur Conf Genet Program"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/4235.942529"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068036"},{"key":"ref65","author":"o'neill","year":"2003","journal-title":"Grammatical Evolution Evolutionary Automatic Programming in an Arbitrary Language"},{"key":"ref66","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00314-1","author":"dempsey","year":"2009","journal-title":"Foundations in Grammatical Evolution for Dynamic Environments"},{"key":"ref29","first-page":"955","article-title":"GP-rush: Using genetic programming to evolve solvers for the rush hour puzzle","author":"hauptman","year":"2007","journal-title":"Proc 9th ACM GECCO"},{"key":"ref67","first-page":"127","article-title":"Automatic generation of caching algorithms","author":"o'neill","year":"1999","journal-title":"Proc EUROGEN Short Course Evol Algorithms Eng Comput Sci"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-010-9109-y"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90094-S"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","author":"burke","year":"2003","journal-title":"Handbook of Meta-Heuristics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144102"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0475-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277377"},{"key":"ref24","first-page":"1295","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":"Proc GECCO"},{"key":"ref23","first-page":"942","article-title":"Hyper heuristics: Learning to combine simple heuristics in bin packing problems","author":"ross","year":"2002","journal-title":"Proc GECCO"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-009-9081-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1162\/1063656054794815"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.6.1092"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90293-5"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(94)90077-9"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/BF02283751"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.2307\/3010270"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013733421344"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018346107246"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(96)00082-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.08.008"},{"key":"ref11","first-page":"860","article-title":"Evolving bin packing heuristics with genetic programming","volume":"lncs 4193","author":"burke","year":"2006","journal-title":"Proc 9th Int Conf PPSN"},{"key":"ref40","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277273"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424789"},{"key":"ref14","first-page":"359","article-title":"Best-fit bin-packing with random order","author":"kenyon","year":"1996","journal-title":"Proc 7th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389335"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586388"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570029"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2041061"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068115"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","author":"burke","year":"2010","journal-title":"Handbook of Meta-Heuristics"},{"key":"ref3","first-page":"529","author":"ross","year":"2005","journal-title":"Search Methodologies Introductory Tutorials in Optimization and Decision Support Techniques"},{"key":"ref6","first-page":"37","article-title":"Generating SAT local-search heuristics using a GP hyper-heuristic framework","volume":"lncs 4926","author":"bader-el-den","year":"2007","journal-title":"Proc 8th Int Conf Artif Evol"},{"key":"ref5","first-page":"177","author":"burke","year":"2009","journal-title":"Computational Intelligence - Collaboration Fusion and Emergence"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5591-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.1.31"},{"key":"ref49","first-page":"51","article-title":"An improved linear programming model for one-dimensional cutting stock problem","author":"afshar","year":"2008","journal-title":"Proc 1st ICCIDC-I"},{"key":"ref9","first-page":"2848","article-title":"Evolving dispatching rules for solving the flexible job-shop problem","author":"ho","year":"2005","journal-title":"Proc IEEE CEC"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702412908"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(91)90087-D"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.863"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"key":"ref41","first-page":"151","author":"coffman","year":"1998","journal-title":"Handbook of Combinatorial Optimization"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197325936"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.18.2.438","article-title":"On line bin packing with items of random size","volume":"18","author":"rhee","year":"1993","journal-title":"Math Oper Res"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/6204221\/06029980.pdf?arnumber=6029980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:53:03Z","timestamp":1642006383000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6029980\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":69,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2011.2160401","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}