{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:43Z","timestamp":1740099043895,"version":"3.37.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319775371"},{"type":"electronic","value":"9783319775388"}],"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-77538-8_40","type":"book-chapter","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T11:33:17Z","timestamp":1520422397000},"page":"578-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Automatic Generation of Constructive Heuristics for Multiple Types of\u00a0Combinatorial Optimisation Problems with Grammatical Evolution and\u00a0Geometric Graphs"],"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,3,8]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization, vol. 21. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24488-9"},{"key":"40_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88094-0","volume-title":"Representations for Genetic and Evolutionary Algorithms","author":"F Rothlauf","year":"2002","unstructured":"Rothlauf, F., Goldberg, D.E.: Representations for Genetic and Evolutionary Algorithms. Physica-Verlag, Heidelberg (2002)"},{"key":"40_CR3","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 149, pp. 449\u2013468. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_15"},{"key":"40_CR4","volume-title":"Graph Theory 1736\u20131936","author":"N Biggs","year":"1976","unstructured":"Biggs, N., Lloyd, E.K., Wilson, R.J.: Graph Theory 1736\u20131936. Clarendon Press, Oxford (1976)"},{"issue":"4","key":"40_CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10732-007-9066-7","volume":"15","author":"MD Goodman","year":"2007","unstructured":"Goodman, M.D., Dowsland, K.A., Thompson, J.M.: A grasp-knapsack hybrid for a nurse-scheduling problem. J. Heuristics 15(4), 351\u2013379 (2007)","journal-title":"J. Heuristics"},{"key":"40_CR6","unstructured":"Sabar, N., Ayob, M., Qu, R., Kendall, G.: A Graph Coloring Constructive Hyper-Heuristic for Examination Timetabling Problems, cs.nott.ac.uk. http:\/\/www.cs.nott.ac.uk\/~pszrq\/files\/APIN11.pdf"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Kouider, A., Haddadene, H.A., Ourari, S., Oulamara, A.: Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling. In: 2015 IEEE International Conference on Automation Science and Engineering (CASE), pp. 1177\u20131181. IEEE, August 2015","DOI":"10.1109\/CoASE.2015.7294257"},{"key":"40_CR8","unstructured":"Pal, M., Pal, A.: Scheduling algorithm to select $k$ optimal programme slots in television channels: a graph theoretic approach, p. 25, May 2014. http:\/\/arxiv.org\/abs\/1405.2199"},{"key":"40_CR9","doi-asserted-by":"publisher","unstructured":"O\u2019Neil, M., Ryan, C.: Grammatical Evolution. In: Grammatical Evolution, pp. 33\u201347. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/978-1-4615-0447-4_4","DOI":"10.1007\/978-1-4615-0447-4_4"},{"key":"40_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74. John Wiley & Sons, Hoboken (2009)"},{"key":"40_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32444-5","volume-title":"Representations for genetic and evolutionary algorithms","author":"F Rothlauf","year":"2006","unstructured":"Rothlauf, F.: Representations for genetic and evolutionary algorithms. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-32444-5"},{"key":"40_CR12","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of Metaheuristics","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5"},{"key":"40_CR13","unstructured":"Holland, J.: Genetic algorithms. Sci. Am. (1992). http:\/\/www.geos.ed.ac.uk\/~mscgis\/12-13\/s1100074\/Holland.pdf"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Kennedy, J.: Particle swarm optimization. In: Encyclopedia of Machine Learning (2011)","DOI":"10.1007\/978-0-387-30164-8_630"},{"issue":"4","key":"40_CR15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006). http:\/\/ieeexplore.ieee.org\/lpdocs\/epic03\/wrapper.htm?arnumber=4129846","journal-title":"IEEE Comput. Intell. Mag."},{"key":"40_CR16","unstructured":"Hertz, A., Widmer, M.: Guidelines for the use of meta-heuristics in combinatorial optimization. Eur. J. Oper. Res. (2003). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221702008238"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Talbi, E.: Metaheuristics: From Design to Implementation (2009)","DOI":"10.1002\/9780470496916"},{"issue":"2","key":"40_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/09528139008953717","volume":"2","author":"GE Liepins","year":"1990","unstructured":"Liepins, G.E., Vose, M.D.: Representational issues in genetic optimization. J. Exp. Theor. Artif. Intell. 2(2), 101\u2013115 (1990)","journal-title":"J. Exp. Theor. Artif. Intell."},{"issue":"3\u20134","key":"40_CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10710-010-9113-2","volume":"11","author":"M O\u2019Neill","year":"2010","unstructured":"O\u2019Neill, M., Vanneschi, L., Gustafson, S., Banzhaf, W.: Open issues in genetic programming. Genet. Program. Evolvable Mach. 11(3\u20134), 339\u2013363 (2010)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"40_CR20","volume-title":"Graph Theory Applications","author":"LR Foulds","year":"2012","unstructured":"Foulds, L.R.: Graph Theory Applications. Springer Science & Business Media, Berlin (2012)"},{"key":"40_CR21","doi-asserted-by":"crossref","DOI":"10.1201\/9781420057140","volume-title":"Graph Theory and its Applications","author":"JL Gross","year":"2005","unstructured":"Gross, J.L., Yellen, J.: Graph Theory and its Applications. CRC Press, Boca Raton (2005)"},{"key":"40_CR22","unstructured":"Gross, J., Yellen, J., Zhang, P.: Handbook of Graph Theory (2013). http:\/\/wmich.pure.elsevier.com\/en\/publications\/handbook-of-graph-theory-2"},{"issue":"1","key":"40_CR23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ijpe.2009.10.007","volume":"126","author":"SM Wagner","year":"2010","unstructured":"Wagner, S.M., Neshat, N.: Assessing the vulnerability of supply chains using graph theory. Int. J. Prod. Econ. 126(1), 121\u2013129 (2010)","journal-title":"Int. J. Prod. Econ."},{"key":"40_CR24","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global Constraint Catalog (2005). https:\/\/hal.archives-ouvertes.fr\/hal-00485396\/"},{"issue":"4","key":"40_CR25","doi-asserted-by":"crossref","first-page":"B-242","DOI":"10.1287\/mnsc.17.4.B242","volume":"17","author":"J Sepp\u00e4nen","year":"1970","unstructured":"Sepp\u00e4nen, J., Moore, J.M.: Facilities planning with graph theory. Manag. Sci. 17(4), B-242\u2013B-253 (1970). http:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/mnsc.17.4.B242","journal-title":"Manag. Sci."},{"key":"40_CR26","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web (1999). http:\/\/ilpubs.stanford.edu:8090\/422"},{"key":"40_CR27","unstructured":"Bogers, T.: Movie recommendation using random walks over the contextual graph. In: Proceedings of the 2nd International Workshop on Context-Aware (2010). http:\/\/ids.csom.umn.edu\/faculty\/gedas\/cars2010\/bogers-cars-2010.pdf"},{"issue":"7","key":"40_CR28","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/s00114-009-0536-7","volume":"96","author":"J Amig\u00f3","year":"2009","unstructured":"Amig\u00f3, J., G\u00e1lvez, J., Villar, V.: A review on molecular topology: applying graph theory to drug discovery and design. Naturwissenschaften 96(7), 749\u2013761 (2009)","journal-title":"Naturwissenschaften"},{"key":"40_CR29","doi-asserted-by":"crossref","unstructured":"Elgerd, O., Happ, H.: Electric energy systems theory: an introduction. IEEE Trans. Syst. Man Cybern. (1972)","DOI":"10.1109\/TSMC.1972.4309116"},{"key":"40_CR30","doi-asserted-by":"crossref","unstructured":"Gamst, A.: 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":"12","key":"40_CR31","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: 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."},{"issue":"1","key":"40_CR32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10710-013-9186-9","volume":"15","author":"G Pappa","year":"2014","unstructured":"Pappa, G., Ochoa, G., Hyde, M., Freitas, A.: Contrasting meta-learning and hyperheuristic research: the role of evolutionary algorithms. Genet. Program. Evolvable Mach. 15(1), 3\u201335 (2014). http:\/\/link.springer.com\/article\/10.1007\/s10710-013-9186-9","journal-title":"Genet. Program. Evolvable Mach."},{"key":"40_CR33","unstructured":"Koza, J.: Genetic programming: on the programming of computers by means of natural selection (1992)"},{"key":"40_CR34","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 2016 on Genetic and Evolutionary Computation Conference, pp. 1093\u20131100. ACM (2016)","DOI":"10.1145\/2908812.2908942"},{"issue":"4","key":"40_CR35","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1162\/EVCO_a_00183","volume":"24","author":"E Hart","year":"2016","unstructured":"Hart, E., Sim, K.: A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. 24(4), 609\u2013635 (2016)","journal-title":"Evol. Comput."},{"key":"40_CR36","doi-asserted-by":"crossref","unstructured":"Keller, R.E., Poli, R.: Linear genetic programming of parsimonious metaheuristics. In: 2007 IEEE Congress on Evolutionary Computation, pp. 4508\u20134515. IEEE, September 2007. http:\/\/ieeexplore.ieee.org\/document\/4425062\/","DOI":"10.1109\/CEC.2007.4425062"},{"issue":"6","key":"40_CR37","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TEVC.2013.2281527","volume":"17","author":"NR Sabar","year":"2013","unstructured":"Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans. Evol. Comput. 17(6), 840\u2013861 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR38","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Introduction to NP-completeness of knapsack problems. In: Knapsack Problems, pp. 483\u2013493. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_16","DOI":"10.1007\/978-3-540-24777-7_16"},{"key":"40_CR39","doi-asserted-by":"publisher","unstructured":"Fenton, M., McDermott, J., Fagan, D., Forstenlechner, S., Hemberg, E., O\u2019Neill, M.: PonyGE2. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO 2017, pp. 1194\u20131201. ACM Press, New York, March 2017. https:\/\/doi.org\/10.1145\/3067695.3082469","DOI":"10.1145\/3067695.3082469"},{"issue":"4","key":"40_CR40","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIBA traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). http:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."},{"issue":"6","key":"40_CR41","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Labs Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Labs Tech. J."},{"key":"40_CR42","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Pearson Education, Upper Saddle River (1998)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77538-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T20:41:22Z","timestamp":1719866482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77538-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319775371","9783319775388"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77538-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}