Hyper-heuristics Reversed: Learning to Combine Solvers by Evolving Instances
作者： Ivan Amaya , Jose Carlos Ortiz-Bayliss , Santiago Conant-Pablos , Hugo Terashima-Marin
关键词:
摘要: … , and examples include machine learning [4] and … hyperheuristics [7], [8]. The base idea of such an approach is to expand conflicting regions in the feature domain so that hyperheuristics …
sci-hub.se 参考文章(18)
Kate Smith-Miles, Jano van Hemert, Xin Yu Lim, Understanding TSP difficulty by learning from evolved instances learning and intelligent optimization. pp. 266- 280 ,(2010) , 10.1007/978-3-642-13800-3_29
José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos, Learning vector quantization for variable ordering in constraint satisfaction problems Pattern Recognition Letters. ,vol. 34, pp. 423- 432 ,(2013) , 10.1016/J.PATREC.2012.09.009
J. E. Beasley, OR-Library: Distributing Test Problems by Electronic Mail Journal of the Operational Research Society. ,vol. 41, pp. 1069- 1072 ,(1990) , 10.1057/JORS.1990.166
Kate Smith-Miles, Jano van Hemert, Discovering the suitability of optimisation algorithms by learning from evolved instances Annals of Mathematics and Artificial Intelligence. ,vol. 61, pp. 87- 104 ,(2011) , 10.1007/S10472-011-9230-5
Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, Rong Qu, Hyper-heuristics: a survey of the state of the art Journal of the Operational Research Society. ,vol. 64, pp. 1695- 1724 ,(2013) , 10.1057/JORS.2013.71
Jano I. van Hemert, Evolving combinatorial problem instances that are difficult to solve Evolutionary Computation. ,vol. 14, pp. 433- 462 ,(2006) , 10.1162/EVCO.2006.14.4.433
Silvano Martello, David Pisinger, Daniele Vigo, The Three-Dimensional Bin Packing Problem Operations Research. ,vol. 48, pp. 256- 267 ,(2000) , 10.1287/OPRE.48.2.256.12386
Isabelle Guyon, André Elisseeff, An introduction to variable and feature selection Journal of Machine Learning Research. ,vol. 3, pp. 1157- 1182 ,(2003) , 10.1162/153244303322753616
David Pisinger, Where are the hard knapsack problems Computers & Operations Research. ,vol. 32, pp. 2271- 2284 ,(2005) , 10.1016/J.COR.2004.03.002
L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown, SATzilla: portfolio-based algorithm selection for SAT Journal of Artificial Intelligence Research. ,vol. 32, pp. 565- 606 ,(2008) , 10.1613/JAIR.2490