{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:29:58Z","timestamp":1762522198153},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"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-07124-4_16","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"3-21","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive and Multilevel Metaheuristics"],"prefix":"10.1007","author":[{"given":"Marc","family":"Sevaux","sequence":"first","affiliation":[]},{"given":"Kenneth","family":"S\u00f6rensen","sequence":"additional","affiliation":[]},{"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Adenso-D\u00edaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54(1):99\u2013114. https:\/\/doi.org\/10.1287\/opre.1050.0243","DOI":"10.1287\/opre.1050.0243"},{"key":"16_CR2","unstructured":"Battiti R (1996) Reactive search: toward self-tuning heuristics. In: Modern heuristic search methods. Wiley, Chichester, pp 61\u201383"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Birattari M (2009) Tuning metaheuristics. Springer, Berlin\/Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-00483-4","DOI":"10.1007\/978-3-642-00483-4"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6lte A, Thonemann UW (1996) Optimizing simulated annealing schedules with genetic programming. Eur J Oper Res 92(2):402\u2013416. https:\/\/doi.org\/10.1016\/0377-2217(94)00350-5","DOI":"10.1016\/0377-2217(94)00350-5"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Boutillon E, Roland C, Sevaux M (2008) Probability-driven simulated annealing for optimizing digital FIR filters. In: Studies in computational intelligence. Springer Science & Business Media, pp 77\u201393. https:\/\/doi.org\/10.1007\/978-3-540-79438-7_4","DOI":"10.1007\/978-3-540-79438-7_4"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Burke EK, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyper-heuristics: an emerging direction in modern search technology. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. International series in operations research & management science, vol 57. Springer, pp 457\u2013474. https:\/\/doi.org\/10.1007\/0-306-48056-5_16","DOI":"10.1007\/0-306-48056-5_16"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde MR, Kendall G, Woodward J (2007) Automatic heuristic generation with genetic programming. In: Proceedings of the 9th annual conference on Genetic and evolutionary computation \u2013 GECCO\u201907. Association for Computing Machinery (ACM). https:\/\/doi.org\/10.1145\/1276958.1277273","DOI":"10.1145\/1276958.1277273"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde MR, Kendall G, Ochoa G, Ozcan E, Woodward JR (2009) Exploring hyper-heuristic methodologies with genetic programming. In: Intelligent systems reference library. Springer Science & Business Media, pp 177\u2013201. https:\/\/doi.org\/10.1007\/978-3-642-01799-5_6.","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Burke EK, Gendreau M, Hyde MR, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64(12):1695\u20131724. https:\/\/doi.org\/10.1057\/jors.2013.71","DOI":"10.1057\/jors.2013.71"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Dean A, Voss D (eds) (1999) Design and analysis of experiments. Springer, Berlin. https:\/\/doi.org\/10.1007\/b97673","DOI":"10.1007\/b97673"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Delorme X, Gandibleux X, Rodriguez J (2004) GRASP for set packing problems. Eur J Oper Res 153(3):564\u2013580. https:\/\/doi.org\/10.1016\/s0377-2217(03)00263-7","DOI":"10.1016\/S0377-2217(03)00263-7"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Dio\u015fan L, Oltean M (2006) Evolving crossover operators for function optimization. In: Genetic programming. Springer Science & Business Media, pp 97\u2013108. https:\/\/doi.org\/10.1007\/11729976_9","DOI":"10.1007\/11729976_9"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Dio\u015fan L, Oltean M (2009) Evolutionary design of evolutionary algorithms. Genet Program Evolvable Mach 10(3):263\u2013306. https:\/\/doi.org\/10.1007\/s10710-009-9081-6","DOI":"10.1007\/s10710-009-9081-6"},{"key":"16_CR14","unstructured":"Dobslaw F (2010) A parameter tuning framework for metaheuristics based on design of experiments and artificial neural networks. In: Proceedings of the international conference on computer mathematics and natural computing 2010. WASET"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Drake JH, Kililis N, Ozcan E (2013) Generation of VNS components with grammatical evolution for vehicle routing. In: Genetic programming. Springer Science & Business Media, pp 25\u201336. https:\/\/doi.org\/10.1007\/978-3-642-37207-0_3","DOI":"10.1007\/978-3-642-37207-0_3"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Eiben AE, Smit SK (2011) Evolutionary algorithm parameters and methods to tune them. In: Autonomous search. Springer, Berlin\/Heidelberg, pp 15\u201336. https:\/\/doi.org\/10.1007\/978-3-642-21434-9_2","DOI":"10.1007\/978-3-642-21434-9_2"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3(2):124\u2013141. https:\/\/doi.org\/10.1109\/4235.771166","DOI":"10.1109\/4235.771166"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Hong L, Woodward J, Li J, Ozcan E (2013) Automated design of probability distributions as mutation operators for evolutionary programming using genetic programming. In: Proceedings of the 16th European conference on genetic programming \u2013 EuroGP 2013, vol 7831, pp 85\u201396","DOI":"10.1007\/978-3-642-37207-0_8"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Hooker JN (1995) Testing heuristics: we have it all wrong. J Heuristics 1(1):33\u201342. https:\/\/doi.org\/10.1007\/bf02430364","DOI":"10.1007\/BF02430364"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"L\u00f8kketangen A, Olsson R (2009) Generating meta-heuristic optimization code using ADATE. J Heuristics 16(6):911\u2013930. https:\/\/doi.org\/10.1007\/s10732-009-9119-1","DOI":"10.1007\/s10732-009-9119-1"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o N, Pereira FB, Costa E (2012) Evolving evolutionary algorithms. In: Proceedings of the fourteenth international conference on genetic and evolutionary computation conference companion \u2013 GECCO 2012. ACM Press. https:\/\/doi.org\/10.1145\/2330784.2330794","DOI":"10.1145\/2330784.2330794"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o N, Pereira FB, Costa E (2013) The importance of the learning conditions in hyper-heuristics. In: Proceedings of the fifteenth annual conference on genetic and evolutionary computation conference \u2013 GECCO 2013. ACM Press. https:\/\/doi.org\/10.1145\/2463372.2463558","DOI":"10.1145\/2463372.2463558"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Oltean M (2005) Evolving evolutionary algorithms using linear genetic programming. Evol Comput 13(3):387\u2013410. https:\/\/doi.org\/10.1162\/1063656054794815","DOI":"10.1162\/1063656054794815"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Oltean M, Gro\u015fan C (2003) Evolving evolutionary algorithms using multi expression programming. In: Advances in artificial life. Springer Science & Business Media, pp 651\u2013658. https:\/\/doi.org\/10.1007\/978-3-540-39432-7_70","DOI":"10.1007\/978-3-540-39432-7_70"},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Prais M, Ribeiro CC (2000) Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J Comput 12(3):164\u2013176. https:\/\/doi.org\/10.1287\/ijoc.12.3.164.12639","DOI":"10.1287\/ijoc.12.3.164.12639"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985\u20132002. https:\/\/doi.org\/10.1016\/s0305-0548(03)00158-8","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Qu R, Burke EK, McCollum B, Merlot LTG, Lee SY (2008) A survey of search methodologies and automated system development for examination timetabling. J Sched 12(1):55\u201389. https:\/\/doi.org\/10.1007\/s10951-008-0077-5","DOI":"10.1007\/s10951-008-0077-5"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Ross P (2005) Hyper-heuristics. In: Search methodologies. Springer Science & Business Media, pp 529\u2013556. https:\/\/doi.org\/10.1007\/0-387-28356-0_17","DOI":"10.1007\/0-387-28356-0_17"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2013) Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans Evol Comput 17(6):840\u2013861. https:\/\/doi.org\/10.1109\/tevc.2013.2281527","DOI":"10.1109\/tevc.2013.2281527"},{"key":"16_CR30","unstructured":"Sevaux M, Thomin P (2001) Heuristics and metaheuristics for parallel machine scheduling: a computational evaluation. In: Proceedings of 4th metaheuristics international conference, MIC 2001, Porto, pp 411\u2013415"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"S\u00f6rensen K, Sevaux M (2006) MA|PM: memetic algorithms with population management. Comput Oper Res 33(5):1214\u20131225. https:\/\/doi.org\/10.1016\/j.cor.2004.09.011","DOI":"10.1016\/j.cor.2004.09.011"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Talbi E-G (2009) Metaheuristics: from design to implementation. Wiley & Sons, Hoboken. ISBN:978-0-470-27858-1","DOI":"10.1002\/9780470496916"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Tavares J, Pereira FB (2012) Automatic design of ant algorithms with grammatical evolution. In: Genetic programming. Springer Science & Business Media, pp 206\u2013217. https:\/\/doi.org\/10.1007\/978-3-642-29139-5_18","DOI":"10.1007\/978-3-642-29139-5_18"},{"issue":"3","key":"16_CR34","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/0377-2217(94)00064-J","volume":"86","author":"A Breedam Van","year":"1995","unstructured":"Van Breedam A (1995) Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur J Oper Res 86(3):480\u2013490. https:\/\/doi.org\/10.1016\/0377-2217(94)00064-J","journal-title":"Eur J Oper Res"},{"issue":"1","key":"16_CR35","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Woodward JR, Swan J (2011) Automatically designing selection heuristics. In: Proceedings of the 13th annual conference companion on genetic and evolutionary computation \u2013 GECCO 2011. ACM Press. https:\/\/doi.org\/10.1145\/2001858.2002052","DOI":"10.1145\/2001858.2002052"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Woodward JR, Swan J (2012) The automatic generation of mutation operators for genetic algorithms. In: Proceedings of the fourteenth international conference on genetic and evolutionary computation conference companion \u2013 GECCO 2012. ACM Press. https:\/\/doi.org\/10.1145\/2330784.2330796","DOI":"10.1145\/2330784.2330796"},{"issue":"4","key":"16_CR38","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1287\/trsc.30.4.379","volume":"30","author":"J Xu","year":"1996","unstructured":"Xu J, Kelly JP (1996) A network flow-based tabu search heuristic for the vehicle routing problem. Transp Sci 30(4):379\u2013393. https:\/\/doi.org\/10.1287\/trsc.30.4.379","journal-title":"Transp Sci"},{"issue":"3","key":"16_CR39","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1111\/j.1475-3995.1998.tb00117.x","volume":"5","author":"J Xu","year":"1998","unstructured":"Xu J, Chiu SY, Glover F (1998) Fine-tuning a tabu search algorithm with statistical tests. Int Trans Oper Res 5(3):233\u2013244. https:\/\/doi.org\/10.1111\/j.1475-3995.1998.tb00117.x","journal-title":"Int Trans Oper Res"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:10:19Z","timestamp":1534187419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_16","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}