{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:23:00Z","timestamp":1760170980327,"version":"3.37.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319306674"},{"type":"electronic","value":"9783319306681"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30668-1_19","type":"book-chapter","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T09:26:10Z","timestamp":1458725170000},"page":"294-310","source":"Crossref","is-referenced-by-count":12,"title":["Iterative Cartesian Genetic Programming: Creating General Algorithms for Solving Travelling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Ryser-Welch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian F.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerry","family":"Swan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin A.","family":"Trefzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,24]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/978-3-319-10762-2_38","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"B Alexander","year":"2014","unstructured":"Alexander, B., Zacher, B.: Boosting search for recursive functions using partial call-trees. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 384\u2013393. Springer, Heidelberg (2014)"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00203625","volume":"64","author":"W Banzhaf","year":"1990","unstructured":"Banzhaf, W.: The \u201cmolecular\u201d traveling salesman. Biol. Cybern. 64(1), 7\u201314 (1990)","journal-title":"Biol. Cybern."},{"key":"19_CR3","volume-title":"Evolving Recusive Programs for Tree Search","author":"S Brave","year":"1996","unstructured":"Brave, S.: Evolving Recusive Programs for Tree Search. MIT Press, Cambridge (1996)"},{"doi-asserted-by":"crossref","unstructured":"Brownlee, A.E., Swan, J., \u00d6zcan, E., Parkes, A.J.: Hyperion $$^2$$ : A toolkit for Meta-, Hyper- heuristic research. In: Proceedings of the 2014 Conference Companion on Genetic and Evolutionary Computation Companion, GECCO Comp 2014, NY, USA, pp. 1133\u20131140. ACM, New York (2014)","key":"19_CR4","DOI":"10.1145\/2598394.2605687"},{"issue":"12","key":"19_CR5","doi-asserted-by":"publisher","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."},{"key":"19_CR6","volume-title":"Handbook of Genetic Algorithms","author":"L Davis","year":"1991","unstructured":"Davis, L., et al.: Handbook of Genetic Algorithms, vol. 115. Van Nostrand Reinhold, New York (1991)"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00202901","volume":"60","author":"DB Fogel","year":"1988","unstructured":"Fogel, D.B.: An evolutionary approach to the traveling salesman problem. Biol. Cybern. 60(2), 139\u2013144 (1988)","journal-title":"Biol. Cybern."},{"unstructured":"Goldberg, D.E., Lingle, R.: Alleles, loci, and the traveling salesman problem. In: Proceedings of an International Conference on Genetic Algorithms and Their Applications, vol. 154, Lawrence Erlbaum, Hillsdale, NJ (1985)","key":"19_CR8"},{"key":"19_CR9","first-page":"42","volume":"4","author":"JJ Grefenstette","year":"1987","unstructured":"Grefenstette, J.J.: Incorporating problem specific knowledge into genetic algorithms. Genet. Algorithms Simulated Annealing 4, 42\u201360 (1987)","journal-title":"Genet. Algorithms Simulated Annealing"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. 9(1), 47\u201360 (2010)","journal-title":"Nat. Comput."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos, H.H.: Programming by optimization. Commun. ACM 55(2), 70\u201380 (2012)","journal-title":"Commun. ACM"},{"issue":"11","key":"19_CR13","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1109\/TSE.1985.231884","volume":"SE\u201311","author":"E Kant","year":"1985","unstructured":"Kant, E.: Understanding and automating algorithm design. IEEE Trans. Softw. Eng. SE\u201311(11), 1361\u20131374 (1985)","journal-title":"IEEE Trans. Softw. Eng."},{"unstructured":"Kasturi, E., Narayanan, S.L.: A novel approach to hybrid genetic algorithms to solve symmetric TSP. Int. J. 2(2) (2014)","key":"19_CR14"},{"issue":"10","key":"19_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0895-7177(00)00088-1","volume":"31","author":"K Katayama","year":"2000","unstructured":"Katayama, K., Sakamoto, H., Narihisa, H.: The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Math. Comput. Model. 31(10), 197\u2013203 (2000)","journal-title":"Math. Comput. Model."},{"unstructured":"Koza, J.R., Andre, D.: Evolution of iteration in genetic programming. In: Evolutionary Programming, pp. 469\u2013478 (1996)","key":"19_CR16"},{"unstructured":"Langdon, W.B.: Genetic programming and data structures. Ph.D. thesis, University College London (1996)","key":"19_CR17"},{"doi-asserted-by":"crossref","unstructured":"Larres, J., Zhang, M., Browne, W.N.: Using unrestricted loops in genetic programming for image classification. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2010)","key":"19_CR18","DOI":"10.1109\/CEC.2010.5586305"},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1nez, M., Dubois-Lacoste, J., St\u00fctzle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Technical report, Citeseer (2011)","key":"19_CR20","DOI":"10.32614\/CRAN.package.irace"},{"issue":"6","key":"19_CR21","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"M L\u00f3pez-Ib\u00e1nez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1nez, M., St\u00fctzle, T.: The automatic design of multiobjective ant colony optimization algorithms. IEEE Trans. Evol. Comput. 16(6), 861\u2013875 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"19_CR22","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). http:\/\/dx.doi.org\/10.1016\/j.cor.2014.05.020","journal-title":"Comput. Oper. Res."},{"unstructured":"Miihlenbein, H., Kindermann, J.: The dynamics of evolution and learning-towards genetic neural networks. Connectionism Perspect. pp. 173\u2013197 (1989)","key":"19_CR23"},{"unstructured":"Miller, J.: What bloat? cartesian genetic programming on boolean problems. In: 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, pp. 295\u2013302 (2001)","key":"19_CR24"},{"volume-title":"Cartesian Genetic Programming","year":"2011","unstructured":"Miller, J.F. (ed.): Cartesian Genetic Programming. Springer, Heidelberg (2011)","key":"19_CR25"},{"issue":"10","key":"19_CR26","doi-asserted-by":"publisher","first-page":"8947","DOI":"10.1016\/j.eswa.2012.02.029","volume":"39","author":"Y Nagata","year":"2012","unstructured":"Nagata, Y., Soler, D.: A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst. Appl. 39(10), 8947\u20138953 (2012)","journal-title":"Expert Syst. Appl."},{"unstructured":"Ozcan, E., Erenturk, M.: A brief review of memetic algorithms for solving Euclidean 2D traveling salesrep problem. In: Proceedings of the 13th Turkish Symposium on Artificial Intelligence and Neural Networks, pp. 99\u2013108 (2004)","key":"19_CR27"},{"doi-asserted-by":"crossref","unstructured":"Pillay, N.: A review of hyper-heuristics for educational timetabling. Ann. Oper. Res. pp. 1\u201336 (2014)","key":"19_CR28","DOI":"10.1007\/s10479-014-1688-1"},{"doi-asserted-by":"crossref","unstructured":"Rokbani, N., Abraham, A., Alimil, A.M.: Fuzzy ant supervised by PSO and simplified ant supervised PSO applied to TSP. In: 2013 13th International Conference on Hybrid Intelligent Systems (HIS), pp. 251\u2013255. IEEE (2013)","key":"19_CR29","DOI":"10.1109\/HIS.2013.6920491"},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search Methodologies","author":"P Ross","year":"2005","unstructured":"Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 529\u2013556. Springer, US (2005)"},{"key":"19_CR31","first-page":"611","volume-title":"Search Methodologies","author":"P Ross","year":"2005","unstructured":"Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 611\u2013638. Springer, US (2005)"},{"unstructured":"Ross, P., Schulenburg, S., Mar\u00edn-Bl\u00e1zquez, J.G., Hart, E.: Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In: GECCO 2002, Proceedings of the Genetic and Evolutionary Computation Conference, pp. 942\u2013948. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2002)","key":"19_CR32"},{"unstructured":"Ryser-Welch, P., Miller, J.F.: A review of hyper-heuristic frameworks. In: Proceedings of the 50th Anniversary Convention of the AISB, London, 1\u20134 April 2014","key":"19_CR33"},{"unstructured":"Ryser-Welch, P., Miller, J.F., Asta, S.: Generating human-readable algorithms for the travelling salesman problem using hyper-heuristics. In: GECCO Companion 2015, Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference, pp. 1067\u20131074. ACM, New York, NY, USA (2015). http:\/\/doi.acm.org\/10.1145\/2739482.2768459","key":"19_CR34"},{"doi-asserted-by":"crossref","unstructured":"Shirakawa, S., Nagao, T.: Graph structured program evolution with automatically defined nodes. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 1107\u20131114. ACM (2009)","key":"19_CR35","DOI":"10.1145\/1569901.1570050"},{"issue":"1","key":"19_CR36","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s12559-013-9201-8","volume":"6","author":"J Swan","year":"2014","unstructured":"Swan, J., Woodward, J.R., \u00d6zcan, E., Kendall, G., Burke, E.K.: Searching the hyper-heuristic design space. Cogn. Comput. 6(1), 66\u201373 (2014)","journal-title":"Cogn. Comput."},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-319-16501-1_17","volume-title":"Genetic Programming","author":"J Swan","year":"2015","unstructured":"Swan, J., Burles, N.: Templar - a framework for template-method hyper-heuristics. In: Machado, P., et al. (eds.) Genetic Programming. Lecture Notes in Computer Science, vol. 9025, pp. 205\u2013216. Springer, Switzerland (2015)"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-25566-3_48","volume-title":"Learning and Intelligent Optimization","author":"J Swan","year":"2011","unstructured":"Swan, J., \u00d6zcan, E., Kendall, G.: Hyperion \u2013 a recursive hyper-heuristic framework. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 616\u2013630. Springer, Heidelberg (2011)"},{"key":"19_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-29139-5_18","volume-title":"Genetic Programming","author":"J Tavares","year":"2012","unstructured":"Tavares, J., Pereira, F.B.: Automatic design of ant algorithms with grammatical evolution. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 206\u2013217. Springer, Heidelberg (2012)"},{"issue":"4","key":"19_CR40","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10710-015-9244-6","volume":"16","author":"AJ Turner","year":"2015","unstructured":"Turner, A.J., Miller, J.F.: Neutral genetic drift: an investigation using cartesian genetic programming. Genet. Program. Evolvable Mach. 16(4), 531\u2013558 (2015)","journal-title":"Genet. Program. Evolvable Mach."},{"issue":"4","key":"19_CR41","doi-asserted-by":"publisher","first-page":"32","DOI":"10.4018\/jaras.2012100103","volume":"3","author":"JA Walker","year":"2012","unstructured":"Walker, J.A., Liu, Y., Tempesti, G., Timmis, J., Tyrrell, A.M.: Automatic machine code generation for a transport triggered architecture using cartesian genetic programming. Int. J. Adapt. Resilient Auton. Syst. (IJARAS) 3(4), 32\u201350 (2012)","journal-title":"Int. J. Adapt. Resilient Auton. Syst. (IJARAS)"},{"doi-asserted-by":"crossref","unstructured":"Wijesinghe, G., Ciesielski, V.: Evolving programs with parameters and loops. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2010)","key":"19_CR42","DOI":"10.1109\/CEC.2010.5586018"},{"unstructured":"Yu, T., Clack, C.: Recursion, lambda-abstractions and genetic programming. In: Poli, R., Langdon, W.B., Schoenauer, M., Fogarty, T., Banzhaf, W. (eds.) Late Breaking Papers at EuroGP 1998: The First European Workshop on Genetic Programming, CSRP-98-10, pp. 26\u201330. The University of Birmingham, UK, Paris, France, 14\u201315 April 1998","key":"19_CR43"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30668-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T07:09:55Z","timestamp":1718435395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30668-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319306674","9783319306681"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30668-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}