{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:34:11Z","timestamp":1742938451310,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720681"},{"type":"electronic","value":"9783030720698"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72069-8_6","type":"book-chapter","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T18:02:55Z","timestamp":1627495375000},"page":"91-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Cross-Domain Method for Generation of Constructive and Perturbative Heuristics"],"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":[[2021,7,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"J.M. Amig\u00f3, J. G\u00e1lvez, V.M. Villar, A review on molecular topology: applying graph theory to drug discovery and design. Naturwissenschaften (2009)","DOI":"10.1007\/s00114-009-0536-7"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"M. Bader-El-Den, R. Poli, Generating sat local-search heuristics using a gp hyper-heuristic framework, in International Conference on Artificial Evolution (Evolution Artificielle) (Springer, 2007), pp. 37\u201349","DOI":"10.1007\/978-3-540-79305-2_4"},{"key":"6_CR3","unstructured":"T.\u00a0Bogers, Movie recommendation using random walks over the contextual graph, in Proceedings of the 2nd International Workshop on Context-Aware (2010)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"E.K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. \u00d6zcan, R. Qu, Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","DOI":"10.1057\/jors.2013.71"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.asoc.2014.10.030","volume":"26","author":"M Chih","year":"2015","unstructured":"M. Chih, 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":"6_CR6","doi-asserted-by":"crossref","unstructured":"P.C. Chu, J.E. Beasley, A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4(1), 63\u201386 (1998)","DOI":"10.1023\/A:1009642405419"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"P. Cowling, G. Kendall, E. Soubeiga, A hyperheuristic approach to scheduling a sales summit, in International Conference on the Practice and Theory of Automated Timetabling (Springer, 2000), pp. 176\u2013190","DOI":"10.1007\/3-540-44629-X_11"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"G.A. Croes, A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","DOI":"10.1287\/opre.6.6.791"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"O.I. Elgerd, H.H. Happ, Electric Energy Systems Theory: An Introduction. IEEE Transactions on Systems, Man, and (1972)","DOI":"10.1109\/TSMC.1972.4309116"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"M. Fenton, J. McDermott, D. Fagan, S. Forstenlechner, E. Hemberg, M. O\u2019Neill, PonyGE2, in Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO \u201917 (ACM Press, New York, New York, USA, 3 2017), pp. 1194\u20131201","DOI":"10.1145\/3067695.3082469"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"A.\u00a0Gamst, Application of graph theoretical methods to GSM radio network planning, in Circuits and Systems, 1991., IEEE International (1991)","DOI":"10.1109\/ISCAS.1991.176519"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1162\/EVCO_a_00183","volume":"24","author":"E Hart","year":"2016","unstructured":"E. Hart, K. Sim, A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. 24(4), 609\u2013635 (2016)","journal-title":"Evol. Comput."},{"issue":"2\u20133","key":"6_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"K. Helsgaun, General k-opt submoves for the lin-kernighan tsp heuristic. Math. Program. Comput. 1(2\u20133), 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"R.E. Keller, R.\u00a0Poli, Linear genetic programming of parsimonious metaheuristics, in 2007 IEEE Congress on Evolutionary Computation (IEEE, 9 2007), pp. 4508\u20134515","DOI":"10.1109\/CEC.2007.4425062"},{"key":"6_CR15","unstructured":"D.E. Knuth, The Art of Computer Programming: Sorting and Searching, vol.\u00a03 (Pearson Education, 1998)"},{"key":"6_CR16","unstructured":"J.R.\u00a0Koza, Genetic Programming: on the Programming of Computers by Means of Natural Selection (1992)"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1057\/jors.2009.76","volume":"61","author":"G Laporte","year":"2010","unstructured":"G. Laporte, A concise guide to the traveling salesman problem. J. Oper. Res. Soc. 61(1), 35\u201340 (2010)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"F. Mascia, M. L\u00f3pez-Ib\u00e1nez, J. Dubois-Lacoste, T. St\u00fctzle, From grammars to parameters: automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness, in International Conference on Learning and Intelligent Optimization (Springer, 2013), pp. 321\u2013334","DOI":"10.1007\/978-3-642-44973-4_36"},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"M. O\u2019Neill, C. Ryan, Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"M. O\u2019Neill, C. Ryan, Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language (Springer, 2003)","DOI":"10.1007\/978-1-4615-0447-4_2"},{"key":"6_CR21","unstructured":"L.\u00a0Page, S.\u00a0Brin, R.\u00a0Motwani, T.\u00a0Winograd, The PageRank citation ranking: bringing order to the web (1999)"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U Pferschy","year":"2009","unstructured":"U. Pferschy, J. Schauer, The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13(2), 233\u2013249 (2009)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2008.07.023","volume":"197","author":"N Pillay","year":"2009","unstructured":"N. Pillay, W. Banzhaf, A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem. Eur. J. Oper. Res. 197(2), 482\u2013491 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"V. Robu, D.J.A. Somefun, J.A. La\u00a0Poutr\u00e9, Modeling complex multi-issue negotiations using utility graphs, in Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (ACM, 2005), pp. 280\u2013287","DOI":"10.1145\/1082473.1082516"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"N.R. Sabar, M. Ayob, G. Kendall, R. Qu, Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans. Evol. Comput. 17(6), 840\u2013861 (2013)","DOI":"10.1109\/TEVC.2013.2281527"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"K. Sim, E. Hart, A combined generative and selective hyper-heuristic for the vehicle routing problem, in Proceedings of the 2016 on Genetic and Evolutionary Computation Conference (ACM, 2016), pp. 1093\u20131100","DOI":"10.1145\/2908812.2908942"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"K. Sim, E. Hart, B. Paechter, A hyper-heuristic classifier for one dimensional bin packing problems: improving classification accuracy by attribute evolution, in International Conference on Parallel Problem Solving from Nature (Springer, 2012), pp. 348\u2013357","DOI":"10.1007\/978-3-642-32964-7_35"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"C. Stone, E. Hart, B. Paechter, Automatic generation of constructive heuristics for multiple types of combinatorial optimisation problems with grammatical evolution and geometric graphs, in International Conference on the Applications of Evolutionary Computation (EvoStar) (Springer, 2018), pp. 578\u2013593","DOI":"10.1007\/978-3-319-77538-8_40"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"C. Stone, E. Hart, B. Paechter, Automatic generation of constructive heuristics for multiple types of combinatorial optimisation problems with grammatical evolution and geometric graphs, in Applications of Evolutionary Computation, ed. by K. Sim, P. Kaufmann (Springer International Publishing, 2018), pp. 578\u2013593","DOI":"10.1007\/978-3-319-77538-8_40"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"C. Stone, E. Hart, B. Paechter, On the synthesis of perturbative heuristics for multiple combinatorial optimisation domains, in International Conference on Parallel Problem Solving from Nature (Springer, 2018), pp. 170\u2013182","DOI":"10.1007\/978-3-319-99253-2_14"},{"issue":"3","key":"6_CR31","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"JC Tay","year":"2008","unstructured":"J.C. Tay, N.B. Ho, 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":["Natural Computing Series","Automated Design of Machine Learning and Search Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72069-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:54:14Z","timestamp":1725522854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72069-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720681","9783030720698"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72069-8_6","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"29 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}