{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:47:19Z","timestamp":1742924839644,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306709"},{"type":"electronic","value":"9783642306716"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-30671-6_16","type":"book-chapter","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T09:07:24Z","timestamp":1343725644000},"page":"417-432","source":"Crossref","is-referenced-by-count":8,"title":["Predicting Metaheuristic Performance on Graph Coloring Problems Using Data Mining"],"prefix":"10.1007","author":[{"given":"Kate","family":"Smith-Miles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Wreford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Lopes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nur","family":"Insani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1162\/evco.1998.6.2.109","volume":"6","author":"J. Culberson","year":"1998","unstructured":"Culberson, J.: On the futility of blind search: An algorithmic view of \u2019no free lunch\u2019. Evolutionary Computation\u00a06(2), 109\u2013127 (1998)","journal-title":"Evolutionary Computation"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Blum, C., Roli, A.: Hybrid metaheuristics: An introduction. In: Hybrid Metaheuristics, pp. 1\u201330 (2008)","DOI":"10.1007\/978-3-540-78295-7_1"},{"issue":"5","key":"16_CR4","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E. Talbi","year":"2002","unstructured":"Talbi, E.: A taxonomy of hybrid metaheuristics. Journal of Heuristics\u00a08(5), 541\u2013564 (2002)","journal-title":"Journal of Heuristics"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern search technology. International Series in Operations Research and Management Science, pp. 457\u2013474 (2003)","DOI":"10.1007\/0-306-48056-5_16"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K. Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 556\u2013572. Springer, Heidelberg (2002)"},{"key":"16_CR7","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: International Joint Conference on Artificial Intelligence, vol.\u00a018, pp. 1542\u20131543 (2003)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-540-74970-7_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Xu","year":"2007","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 712\u2013727. Springer, Heidelberg (2007)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J. Hooker","year":"1995","unstructured":"Hooker, J.: Testing heuristics: We have it all wrong. Journal of Heuristics\u00a01(1), 33\u201342 (1995)","journal-title":"Journal of Heuristics"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-15844-5_3","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D.W. Corne","year":"2010","unstructured":"Corne, D.W., Reynolds, A.P.: Optimisation and Generalisation: Footprints in Instance Space. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI, Part I. LNCS, vol.\u00a06238, pp. 22\u201331. Springer, Heidelberg (2010)"},{"issue":"5","key":"16_CR11","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K.A. Smith-Miles","year":"2012","unstructured":"Smith-Miles, K.A., Lopes, L.B.: Measuring instance difficulty for combinatorial optimization problems. Computers and Operations Research\u00a039(5), 875\u2013889 (2012)","journal-title":"Computers and Operations Research"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1002\/cplx.6130010511","volume":"5","author":"W. Macready","year":"1996","unstructured":"Macready, W., Wolpert, D.: What makes an optimization problem hard. Complexity\u00a05, 40\u201346 (1996)","journal-title":"Complexity"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-30217-9_16","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"J. van Hemert","year":"2004","unstructured":"van Hemert, J., Urquhart, N.: Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 151\u2013160. Springer, Heidelberg (2004)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K. Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP Difficulty by Learning from Evolved Instances. In: Blum, C., Battiti, R. (eds.) LION 4. LNCS, vol.\u00a06073, pp. 266\u2013280. Springer, Heidelberg (2010)"},{"key":"16_CR15","unstructured":"Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Annals of Mathematics and Artificial Intelligence (in press)"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation\u00a04(4), 337\u2013352 (2000)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P. Merz","year":"2004","unstructured":"Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation\u00a012(3), 303\u2013325 (2004)","journal-title":"Evolutionary Computation"},{"issue":"7043","key":"16_CR18","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1038\/nature03602","volume":"435","author":"D. Achlioptas","year":"2005","unstructured":"Achlioptas, D., Naor, A., Peres, Y.: Rigorous location of phase transitions in hard optimization problems. Nature\u00a0435(7043), 759\u2013764 (2005)","journal-title":"Nature"},{"key":"16_CR19","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of the 12th IJCAI, pp. 331\u2013337 (1991)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., James, R., Giffin, J., Tu, Y.: Understanding the Relationship between Scheduling Problem Structure and Heuristic Performance using Knowledge Discovery. LNCS (2009) (in press)","DOI":"10.1007\/978-3-642-11169-3_7"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.: Towards insightful algorithm selection for optimisation using meta-learning concepts. In: IEEE International Joint Conference on Neural Networks, IJCNN 2008 (IEEE World Congress on Computational Intelligence), pp. 4118\u20134124 (2008)","DOI":"10.1109\/IJCNN.2008.4634391"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-25566-3_41","volume-title":"Learning and Intelligent Optimization","author":"K. Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., Lopes, L.: Generalising Algorithm Performance in Instance Space: A Timetabling Case Study. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol.\u00a06683, pp. 524\u2013538. Springer, Heidelberg (2011)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Hill, R., Reilly, C.: The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance. Management Science, 302\u2013317 (2000)","DOI":"10.1287\/mnsc.46.2.302.11930"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Pardalos, P., Mavridou, T., Xue, J.: The graph coloring problem: A bibliographic survey, vol.\u00a02. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4613-0303-9_16"},{"issue":"9","key":"16_CR25","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P. Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Computers & Operations Research\u00a033(9), 2547\u20132562 (2006)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"16_CR26","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Communications of the ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"issue":"4","key":"16_CR27","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., Werra, D.: Using tabu search techniques for graph coloring. Computing\u00a039(4), 345\u2013351 (1987)","journal-title":"Computing"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitioning. Operations Research, 378\u2013406 (1991)","DOI":"10.1287\/opre.39.3.378"},{"key":"16_CR29","unstructured":"Chiarandini, M., St\u00fctzle, T., et al.: An application of iterated local search to graph coloring problem. In: Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 7\u20138. Citeseer (2002)"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-46033-0_14","volume-title":"Artificial Evolution","author":"J.-P. Hamiez","year":"2002","unstructured":"Hamiez, J.-P., Hao, J.-K.: Scatter Search for Graph Coloring. In: Collet, P., Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M. (eds.) EA 2001. LNCS, vol.\u00a02310, pp. 168\u2013213. Springer, Heidelberg (2002)"},{"issue":"4","key":"16_CR31","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"16_CR32","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.: Genetic and hybrid algorithms for graph coloring. Annals of Operations Research\u00a063(3), 437\u2013461 (1996)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"16_CR33","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I. Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & Operations Research\u00a035(3), 960\u2013975 (2008)","journal-title":"Computers & Operations Research"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Hooker, J.: Needed: An empirical science of algorithms. Operations Research, 201\u2013212 (1994)","DOI":"10.1287\/opre.42.2.201"},{"key":"16_CR35","unstructured":"Culberson, J.: Graph coloring page (2006), \n                      http:\/\/www.cs.ualberta.ca\/~joe\/Coloring"},{"key":"16_CR36","unstructured":"Culberson, J., Beacham, A., Papp, D.: Hiding our colors. In: CP 1995 Workshop on Studying and Solving Really Hard Problems. Citeseer (1995)"},{"key":"16_CR37","first-page":"871","volume":"2","author":"B. Mohar","year":"1991","unstructured":"Mohar, B.: The laplacian spectrum of graphs. Graph Theory, Combinatorics, and Applications\u00a02, 871\u2013898 (1991)","journal-title":"Graph Theory, Combinatorics, and Applications"},{"key":"16_CR38","unstructured":"Biggs, N.: Algebraic graph theory, vol.\u00a067. Cambridge Univ. Pr. (1993)"},{"key":"16_CR39","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J. Rice","year":"1976","unstructured":"Rice, J.: The Algorithm Selection Problem. Advances in Computers\u00a015, 65\u2013117 (1976)","journal-title":"Advances in Computers"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Computing Surveys\u00a041(1) (2008)","DOI":"10.1145\/1456650.1456656"},{"issue":"1","key":"16_CR41","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF00337288","volume":"43","author":"T. Kohonen","year":"1982","unstructured":"Kohonen, T.: Self-organized formation of topologically correct feature maps. Biological Cybernetics\u00a043(1), 59\u201369 (1982)","journal-title":"Biological Cybernetics"},{"key":"16_CR42","unstructured":"Somine, V.: Eudaptics software Gmbh"},{"key":"16_CR43","unstructured":"Knowles, J., Corne, D.: Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem. Soft Computing Systems: Design, Management and Applications, 271\u2013279 (2002)"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24652-7_3","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"C. Bierwirth","year":"2004","unstructured":"Bierwirth, C., Mattfeld, D.C., Watson, J.-P.: Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.\u00a03004, pp. 21\u201330. Springer, Heidelberg (2004)"},{"issue":"10","key":"16_CR45","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T. Schiavinotto","year":"2007","unstructured":"Schiavinotto, T., St\u00fctzle, T.: A review of metrics on permutations for search landscape analysis. Comput. Oper. Res.\u00a034(10), 3143\u20133153 (2007)","journal-title":"Comput. Oper. Res."},{"key":"16_CR46","unstructured":"Lopes, L., Smith-Miles, K.: Generating applicable synthetic instances for branch problems, under review (2011)"}],"container-title":["Studies in Computational Intelligence","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30671-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T17:29:41Z","timestamp":1675099781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30671-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642306709","9783642306716"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30671-6_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}