{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:36:49Z","timestamp":1761597409451},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642372063"},{"type":"electronic","value":"9783642372070"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37207-0_3","type":"book-chapter","created":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T23:04:49Z","timestamp":1362438289000},"page":"25-36","source":"Crossref","is-referenced-by-count":19,"title":["Generation of VNS Components with Grammatical Evolution for Vehicle Routing"],"prefix":"10.1007","author":[{"given":"John H.","family":"Drake","sequence":"first","affiliation":[]},{"given":"Nikolaos","family":"Kililis","sequence":"additional","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Augerat, P., Rinaldi, G., Belenguer, J., Benavent, E., Corberan, A., Naddef, D.: Computational results with a branch and cut code for the capacitated vehicle routing problem. Tech. rep., RR 949-M, Universite Joseph Fourier, Grenoble (1995)"},{"key":"3_CR2","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.\u00a04926, pp. 37\u201349. Springer, Heidelberg (2008)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Science\u00a039(1), 119\u2013139 (2005)","journal-title":"Transportation Science"},{"key":"3_CR4","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: Hyper-heuristics: A survey of the state of the art. Tech. Rep. No. NOTTCS-TR-SUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham (2010)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.: A Classification of Hyper-heuristics Approaches. In: Handbook of Metaheuristics, 2nd edn., pp. 449\u2013468. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"3_CR6","series-title":"ISRL","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-01799-5_6","volume-title":"Computational Intelligence","author":"E.K. Burke","year":"2009","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring Hyper-heuristic Methodologies with Genetic Programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence. ISRL, vol.\u00a01, pp. 177\u2013201. Springer, Heidelberg (2009)"},{"issue":"6","key":"3_CR7","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1109\/TEVC.2010.2041061","volume":"14","author":"E.K. Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Woodward, J.: A genetic programming hyper-heuristic approach for evolving 2-d strip packing heuristics. IEEE Transactions on Evolutionary Computation\u00a014(6), 942\u2013958 (2010)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1162\/EVCO_a_00044","volume":"20","author":"E.K. Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Woodward, J.: Automating the packing heuristic design process with genetic programming. Evolutionary Computation\u00a020(1), 63\u201389 (2012)","journal-title":"Evolutionary Computation"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/11844297_87","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"E.K. Burke","year":"2006","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Evolving Bin Packing Heuristics with Genetic Programming. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol.\u00a04193, pp. 860\u2013869. Springer, Heidelberg (2006)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TEVC.2011.2160401","volume":"16","author":"E.K. Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Transactions on Evolutionary Computation\u00a016(3), 406\u2013417 (2012)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Woodward, J., Hyde, M., Kendall, G.: Automatic heuristic generation with genetic programming: Evolving a jack-of-alltrades or a master of one. In: GECCO 2007, pp. 1559\u20131565 (2007)","DOI":"10.1145\/1276958.1277273"},{"key":"3_CR12","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.I. Cowling","year":"2001","unstructured":"Cowling, P.I., Kendall, G., Soubeiga, E.: A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"3_CR13","unstructured":"Fisher, M., Thompson, G.: Probabilistic learning combinations of local job-shop scheduling rules. In: Factory Scheduling Conference (1961)"},{"key":"3_CR14","unstructured":"Fukunaga, A.S.: Automated discovery of composite sat variable-selection heuristics. In: Artificial Intelligence, pp. 641\u2013648 (2002)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-24855-2_59","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"A.S. Fukunaga","year":"2004","unstructured":"Fukunaga, A.S.: Evolving Local Search Heuristics for SAT Using Genetic Programming. In: Deb, K., Tari, Z. (eds.) GECCO 2004. LNCS, vol.\u00a03103, pp. 483\u2013494. Springer, Heidelberg (2004)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","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. Evolutionary Computation\u00a016(1), 31\u201361 (2008)","journal-title":"Evolutionary Computation"},{"key":"3_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","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. Journal of Scheduling\u00a09(1), 7\u201334 (2006)","journal-title":"Journal of Scheduling"},{"issue":"5","key":"3_CR19","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J.-F. Cordeau","year":"2002","unstructured":"Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F.: A guide to vehicle routing heuristics. The Journal of the Operational Research Society\u00a053(5), 512\u2013522 (2002)","journal-title":"The Journal of the Operational Research Society"},{"key":"3_CR20","unstructured":"Drake, J.H., Hyde, M., Ibrahim, K., \u00d6zcan, E.: A genetic programming hyper-heuristic for the multidimensional knapsack problem. In: CIS 2012, pp. 76\u201380 (2012)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Keller, R.E., Poli, R.: Linear genetic programming of metaheuristics. In: GECCO 2007, p. 1753. ACM (2007)","DOI":"10.1109\/CEC.2007.4425062"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Keller, R.E., Poli, R.: Linear genetic programming of parsimonious metaheuristics. In: CEC 2007, pp. 4508\u20134515 (2007)","DOI":"10.1109\/CEC.2007.4425062"},{"key":"3_CR23","volume-title":"Genetic programming: on the programming of computers by means of natural selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic programming: on the programming of computers by means of natural selection. The MIT Press, Cambridge (1992)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Kumar, R., Joshi, A.H., Banka, K.K., Rockett, P.I.: Evolution of hyperheuristics for the biobjective 0\/1 knapsack problem by multiobjective genetic programming. In: GECCO 2008, pp. 1227\u20131234. ACM (2008)","DOI":"10.1145\/1389095.1389335"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research\u00a059(3), 345\u2013358 (1992)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research\u00a024(1), 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"key":"3_CR27","unstructured":"O\u2019Neill, M., Ryan, C.: Grammatical Evolution: Evolutionary Automatic Programming in a Arbitrary Language, Genetic programming, vol.\u00a04. Kluwer Academic Publishers (2003)"},{"issue":"8","key":"3_CR28","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers and Operations Research\u00a034(8), 2403\u20132435 (2007)","journal-title":"Computers and Operations Research"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"T. Ralphs","year":"2003","unstructured":"Ralphs, T., Kopman, L., Pulleyblank, W., Trotter Jr., L.: On the capacitated vehicle routing problem. Mathematical Programming Series B\u00a094, 343\u2013359 (2003)","journal-title":"Mathematical Programming Series B"},{"issue":"4","key":"3_CR30","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science\u00a040(4), 455\u2013472 (2006)","journal-title":"Transportation Science"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Intrd. Tut. in Optimization and Decision Support Tec., ch. 17, pp. 529\u2013556. Springer (2005)","DOI":"10.1007\/0-387-28356-0_17"},{"issue":"2","key":"3_CR32","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035(2), 254\u2013265 (1987)","journal-title":"Operations Research"},{"issue":"1-3","key":"3_CR33","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","volume":"123","author":"P. Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics\u00a0123(1-3), 487\u2013512 (2002)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37207-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T14:31:22Z","timestamp":1557585082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37207-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642372063","9783642372070"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37207-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}