{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:06:15Z","timestamp":1773702375357,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T00:00:00Z","timestamp":1259712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10732-009-9119-1","type":"journal-article","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T19:37:20Z","timestamp":1259696240000},"page":"911-930","source":"Crossref","is-referenced-by-count":16,"title":["Generating meta-heuristic optimization code using ADATE"],"prefix":"10.1007","volume":"16","author":[{"given":"Arne","family":"L\u00f8kketangen","sequence":"first","affiliation":[]},{"given":"Roland","family":"Olsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,2]]},"reference":[{"key":"9119_CR1","series-title":"LNCS","first-page":"37","volume-title":"Proceedings of the 8th International Conference on Artificial Evolution","author":"M.B. Bader-El-Din","year":"2007","unstructured":"Bader-El-Din, M.B., Poli, R.: Generating sat local-search heuristics using a gp hyper-heuristic framework. In: Proceedings of the 8th International Conference on Artificial Evolution. LNCS, vol. 4926, pp.\u00a037\u201349. Springer, Berlin (2007)"},{"key":"9119_CR2","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Kendall, G., Hart, J., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Glover, F., Kochenbergerm, G. (eds.) Handbook of Meta-Heuristics, Chap. 16, pp. 457\u2013474 (2003)","DOI":"10.1007\/0-306-48056-5_16"},{"key":"9119_CR3","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.: Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. In: Proceedings of the 9th ACM Genetic and Evolutionary Computation Conference (GECCO\u201907), London, UK, pp. 1559\u20131565 (2007)","DOI":"10.1145\/1276958.1277273"},{"key":"9119_CR4","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.: A classification of hyper-heuristics approaches. Computer Science Technical Report No. NOTTCS-TR-SUB-0907061259-5808, School of Computer Science and Information Technology, University of Nottingham (2009a)"},{"key":"9119_CR5","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: A survey of hyper-heuristics. Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham (2009b)"},{"key":"9119_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"9119_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1023717307746","volume":"9","author":"T. Davoine","year":"2001","unstructured":"Davoine, T., Hammer, P.L., Vizv\u00e1ri, B.: A heuristic for Boolean optimization problems. J. Heuristics 9, 229\u2013247 (2001)","journal-title":"J. Heuristics"},{"key":"9119_CR8","doi-asserted-by":"crossref","unstructured":"Du, D., Gu, J., Pardalos, P.: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35 (1997)","DOI":"10.1090\/dimacs\/035"},{"issue":"1","key":"9119_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1162\/evco.2008.16.1.31","volume":"16","author":"A.S. Fukunaga","year":"2008","unstructured":"Fukunaga, A.S.: Automated discovery of local search heuristics for satisfiability testing. Evol. Comput. 16(1), 31\u201361 (2008)","journal-title":"Evol. Comput."},{"issue":"1","key":"9119_CR10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10951-006-5591-8","volume":"9","author":"C.D. Geiger","year":"2006","unstructured":"Geiger, C.D., Uzsoy, R., Aytug, H.: Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. J. Sched. 9(1), 7\u201334 (2006)","journal-title":"J. Sched."},{"key":"9119_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.dam.2003.06.006","volume":"142","author":"L.M. Hvattum","year":"2004","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Glover, F.: Adaptative memory search for Boolean optimization problems. Discrete Appl. Math. 142, 99\u2013109 (2004). Special issue on Boolean and pseudo-Boolean functions","journal-title":"Discrete Appl. Math."},{"key":"9119_CR12","first-page":"1","volume-title":"Integer Programming: Theory and Practice","author":"L.M. Hvattum","year":"2006","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Glover, F.: New heuristics and adaptive memory procedures for Boolean optimization problems. In: Karlof, J. (ed.) Integer Programming: Theory and Practice, pp.\u00a01\u201318. CRC Press, Boca Raton (2006)"},{"key":"9119_CR13","doi-asserted-by":"crossref","unstructured":"Geard, N., Wiles, J., Hallinan, J., Tonkes, B., Skellett, B.: A comparison of neutral landscapes\u2014nk, nkp and nkq. In: Proceedings of the 2002 Congress on Evolutionary Computation (2002)","DOI":"10.1109\/CEC.2002.1006234"},{"key":"9119_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Springer, Berlin (1997)"},{"key":"9119_CR15","unstructured":"Hoos, H.: On the run-time behaviour of stochastic local search methods for SAT. In: Proceedings of AAAI, pp. 661\u2013666 (1969)"},{"key":"9119_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623486","volume-title":"The Neutral Theory of Molecular Evolution","author":"M. Kimura","year":"1983","unstructured":"Kimura, M.: The Neutral Theory of Molecular Evolution. Cambridge University Press, Cambridge (1983)"},{"key":"9119_CR17","volume-title":"Systema Naturae per Regna Tria Naturae, Secundum Classes, Ordines, Genera, Species Cum Caracteribus, Differentiis, Synonymis, Locis","author":"C. Linnaeus","year":"1758","unstructured":"Linnaeus, C.: Systema Naturae per Regna Tria Naturae, Secundum Classes, Ordines, Genera, Species Cum Caracteribus, Differentiis, Synonymis, Locis, 10th edn. Laurentii Salvii, Stockholm (1758)","edition":"10"},{"key":"9119_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1037\/h0043158","volume":"63","author":"G.A. Miller","year":"1956","unstructured":"Miller, G.A.: The magical number 7, plus or minus 2. Psychol. Rev. 63, 81\u201397 (1956)","journal-title":"Psychol. Rev."},{"key":"9119_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML","author":"R. Milner","year":"1997","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML. MIT Press, Cambridge (1997). (Revised)"},{"key":"9119_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0004-3702(94)00042-Y","volume":"1","author":"R. Olsson","year":"1995","unstructured":"Olsson, R.: Inductive functional programming using incremental program transformation. Artif. Intell. 1, 55\u201383 (1995)","journal-title":"Artif. Intell."},{"key":"9119_CR21","doi-asserted-by":"crossref","unstructured":"Riedmiller, M., Braun, H.: A direct adaptive method for faster backpropagation learning: the rprop algorithm. In: International Conference on Neural Networks, San Francisco (1993)","DOI":"10.1109\/ICNN.1993.298623"},{"key":"9119_CR22","volume-title":"Evolution and Optimum Seeking","author":"H.-P. Schwefel","year":"1995","unstructured":"Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)"},{"key":"9119_CR23","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local Search Strategies for Satisfiability Testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26 (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"issue":"3","key":"9119_CR24","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"J.C. Tay","year":"2008","unstructured":"Tay, J.C., Ho, N.B.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput. Ind. Eng. 54(3), 453\u2013473 (2008)","journal-title":"Comput. Ind. Eng."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-009-9119-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-009-9119-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-009-9119-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:30Z","timestamp":1559256870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-009-9119-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,2]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9119"],"URL":"https:\/\/doi.org\/10.1007\/s10732-009-9119-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,2]]}}}