{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:15:55Z","timestamp":1725988555126},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992525"},{"type":"electronic","value":"9783319992532"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99253-2_14","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T06:14:41Z","timestamp":1534832081000},"page":"170-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Synthesis of Perturbative Heuristics for Multiple Combinatorial Optimisation Domains"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Stone","sequence":"first","affiliation":[]},{"given":"Emma","family":"Hart","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Paechter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-79305-2_4","volume-title":"Artificial Evolution","author":"M Bader-El-Den","year":"2008","unstructured":"Bader-El-Den, M., Poli, R.: Generating SAT local-search heuristics using a GP hyper-heuristic framework. In: Monmarch\u00e9, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol. 4926, pp. 37\u201349. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79305-2_4"},{"issue":"12","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"K Edmund","year":"2013","unstructured":"Edmund, K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.asoc.2014.10.030","volume":"26","author":"M Chih","year":"2015","unstructured":"Chih, M.: Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem. Appl. Soft Comput. 26, 378\u2013389 (2015)","journal-title":"Appl. Soft Comput."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44629-X_11"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Fenton, M., McDermott, J., Fagan, D., Forstenlechner, S., Hemberg, E., O\u2019Neill, M.: PonyGE2: grammatical evolution in python. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1194\u20131201. ACM (2017)","DOI":"10.1145\/3067695.3082469"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:NACO.0000023419.83147.67","volume":"3","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor, N., Gustafson, S.: A study on the use of \u201cself-generation\u201d in memetic algorithms. Nat. Comput. 3(1), 53\u201376 (2004)","journal-title":"Nat. Comput."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-44973-4_36","volume-title":"Learning and Intelligent Optimization","author":"F Mascia","year":"2013","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: From grammars to parameters: automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 321\u2013334. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44973-4_36"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2014.05.020","volume":"51","author":"F Mascia","year":"2014","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. Comput. Oper. Res. 51, 190\u2013199 (2014)","journal-title":"Comput. Oper. Res."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-29124-1_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2012","unstructured":"Ochoa, G., et al.: HyFlex: a benchmark framework for cross-domain heuristic search. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 136\u2013147. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29124-1_12"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"O\u2019Neill, M., Ryan, C.: Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13(2), 233\u2013249 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Robu, V., Somefun, D.J.A., La Poutr\u00e9, J.A.: Modeling complex multi-issue negotiations using utility graphs. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 280\u2013287. ACM (2005)","DOI":"10.1145\/1082473.1082516"},{"key":"14_CR13","first-page":"4","volume":"3","author":"NR Sabar","year":"2012","unstructured":"Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: Grammatical evolution hyper-heuristic for combinatorial optimization problems. Strategies 3, 4 (2012)","journal-title":"Strategies"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Sim, K., Hart, E.: A combined generative and selective hyper-heuristic for the vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 1093\u20131100. ACM (2016)","DOI":"10.1145\/2908812.2908942"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-319-77538-8_40","volume-title":"Applications of Evolutionary Computation","author":"C Stone","year":"2018","unstructured":"Stone, C., Hart, E., Paechter, B.: Automatic generation of constructive heuristics for multiple types of\u00a0combinatorial optimisation problems with grammatical evolution and geometric graphs. In: Sim, K., Kaufmann, P. (eds.) EvoApplications 2018. LNCS, vol. 10784, pp. 578\u2013593. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77538-8_40"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99253-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T13:30:30Z","timestamp":1571751030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99253-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992525","9783319992532"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99253-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}