{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:23:55Z","timestamp":1772792635563,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319653396","type":"print"},{"value":"9783319653402","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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":[[2017]]},"DOI":"10.1007\/978-3-319-65340-2_31","type":"book-chapter","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T11:49:29Z","timestamp":1502192969000},"page":"369-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Meta-Genetic Algorithm for Hybridizing Metaheuristics"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Hassan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,9]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Adriaensen, S., Brys, T., Now\u00e9, A.: Designing reusable metaheuristic methods: a semi-automated approach. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 2969\u20132976. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900575"},{"key":"31_CR2","volume-title":"Reactive Search and Intelligent Optimization","author":"R Battiti","year":"2008","unstructured":"Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization, vol. 45. Springer Science & Business Media, Heidelebrg (2008)"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.15837\/ijccc.2008.3.2393","volume":"3","author":"SMS Bhanu","year":"2008","unstructured":"Bhanu, S.M.S., Gopalan, N.: A hyper-heuristic approach for efficient resource scheduling in grid. Int. J. Comput. Commun. Control 3(3), 249\u2013258 (2008)","journal-title":"Int. J. Comput. Commun. Control"},{"issue":"6","key":"31_CR4","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"12","key":"31_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."},{"issue":"12","key":"31_CR6","doi-asserted-by":"publisher","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen, S.M., Chien, C.Y.: Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst. Appl. 38(12), 14439\u201314450 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"31_CR7","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"JC Cr\u00e9put","year":"2009","unstructured":"Cr\u00e9put, J.C., Koukam, A.: A memetic neural network for the euclidean traveling salesman problem. Neurocomputing 72(4), 1250\u20131264 (2009)","journal-title":"Neurocomputing"},{"issue":"6","key":"31_CR8","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"10","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","volume":"16","author":"W Deng","year":"2012","unstructured":"Deng, W., Chen, R., He, B., Liu, Y., Yin, L., Guo, J.: A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft. Comput. 16(10), 1707\u20131722 (2012)","journal-title":"Soft. Comput."},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3\u201318 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10710-009-9081-6","volume":"10","author":"L Dio\u015fan","year":"2009","unstructured":"Dio\u015fan, L., Oltean, M.: Evolutionary design of evolutionary algorithms. Genet. Program Evolvable Mach. 10(3), 263\u2013306 (2009)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"7","key":"31_CR12","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964)","journal-title":"Commun. ACM"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-21434-9_2","volume-title":"Autonomous Search","author":"\u00c1E Eiben","year":"2011","unstructured":"Eiben, \u00c1.E., Smit, S.K.: Evolutionary algorithm parameters and methods to tune them. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 15\u201336. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21434-9_2"},{"key":"31_CR14","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","author":"M Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.: Handbook of Metaheuristics. International Series in Operations Research & Management Science. Springer, Heidelberg (2010)"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1), 43\u201362 (2001)","journal-title":"Artif. Intell."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Grobler, J., Engelbrecht, A.P., Kendall, G., Yadavalli, V.: Alternative hyper-heuristic strategies for multi-method global optimization. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5585980"},{"issue":"1","key":"31_CR17","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."},{"key":"31_CR18","first-page":"1152","volume":"7","author":"F Hutter","year":"2007","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. AAAI 7, 1152\u20131157 (2007)","journal-title":"AAAI"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.neucom.2016.04.027","volume":"205","author":"J Kanda","year":"2016","unstructured":"Kanda, J., de Carvalho, A., Hruschka, E., Soares, C., Brazdil, P.: Meta-learning to select the best meta-heuristic for the traveling salesman problem: a comparison of meta-features. Neurocomputing 205, 393\u2013406 (2016)","journal-title":"Neurocomputing"},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","volume":"49","author":"Y Lin","year":"2016","unstructured":"Lin, Y., Bian, Z., Liu, X.: Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing-tabu search algorithm to solve the symmetrical traveling salesman problem. Appl. Soft Comput. 49, 937\u2013952 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"31_CR21","doi-asserted-by":"publisher","first-page":"4475","DOI":"10.1016\/j.eswa.2013.12.050","volume":"41","author":"M Maashi","year":"2014","unstructured":"Maashi, M., \u00d6zcan, E., Kendall, G.: A multi-objective hyper-heuristic based on choice function. Expert Syst. Appl. 41(9), 4475\u20134493 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"31_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H M\u00fchlenbein","year":"1988","unstructured":"M\u00fchlenbein, H., Gorges-Schleuter, M., Kr\u00e4mer, O.: Evolution algorithms in combinatorial optimization. Parallel Comput. 7(1), 65\u201385 (1988)","journal-title":"Parallel Comput."},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba, E., Yang, X.S., Diaz, F., Lopez-Garcia, P., Carballedo, R.: An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng. Appl. Artif. Intell. 48, 59\u201371 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"31_CR24","first-page":"107","volume":"56","author":"N Pillay","year":"2015","unstructured":"Pillay, N.: Intelligent system design using hyper-heuristics. S. Afr. Comput. J. 56(1), 107\u2013119 (2015)","journal-title":"S. Afr. Comput. J."},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.engappai.2014.06.026","volume":"35","author":"T Saenphon","year":"2014","unstructured":"Saenphon, T., Phimoltares, S., Lursinsap, C.: Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem. Eng. Appl. Artif. Intell. 35, 324\u2013334 (2014)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"5","key":"31_CR27","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8(5), 541\u2013564 (2002)","journal-title":"J. Heuristics"},{"issue":"1","key":"31_CR28","doi-asserted-by":"publisher","first-page":"016701","DOI":"10.1103\/PhysRevE.70.016701","volume":"70","author":"C Wu","year":"2004","unstructured":"Wu, C., Liang, Y., Lee, H.P., Lu, C.: Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Phys. Rev. E 70(1), 016701 (2004)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65340-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:51:45Z","timestamp":1772783505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-65340-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319653396","9783319653402"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65340-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"9 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/web.fe.up.pt\/~epia2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}