{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:36:29Z","timestamp":1771698989760,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642137990","type":"print"},{"value":"9783642138003","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13800-3_29","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T06:35:53Z","timestamp":1276842953000},"page":"266-280","source":"Crossref","is-referenced-by-count":56,"title":["Understanding TSP Difficulty by Learning from Evolved Instances"],"prefix":"10.1007","author":[{"given":"Kate","family":"Smith-Miles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jano","family":"van Hemert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin Yu","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","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":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H., Devkar, A., Shoham, Y.: Understanding random SAT: Beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"29_CR3","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., 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":"5","key":"29_CR4","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1504\/IJISE.2008.018231","volume":"3","author":"Y. Cho","year":"2008","unstructured":"Cho, Y., Moore, J., Hill, R., Reilly, C.: Exploiting empirical knowledge for bi-dimensional knapsack problem heuristics. International Journal of Industrial and Systems Engineering\u00a03(5), 530\u2013548 (2008)","journal-title":"International Journal of Industrial and Systems Engineering"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1287\/opre.1070.0398","volume":"55","author":"N. Hall","year":"2007","unstructured":"Hall, N., Posner, M.: Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures. Operations Research\u00a055(4), 703 (2007)","journal-title":"Operations Research"},{"key":"29_CR6","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":"29_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Understanding the Relationship between Scheduling Problem Structure and Heuristic Performance using Knowledge Discovery","author":"K. Smith-Miles","year":"2009","unstructured":"Smith-Miles, K., James, R., Giffin, J., Tu, Y.: Understanding the Relationship between Scheduling Problem Structure and Heuristic Performance using Knowledge Discovery, LNCS. Springer, Heidelberg (in press, 2009)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Rice, J.: The Algorithm Selection Problem. Advances in computers\u00a065 (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"issue":"4","key":"29_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1162\/evco.2006.14.4.433","volume":"14","author":"J. Hemert van","year":"2006","unstructured":"van Hemert, J.: Evolving combinatorial problem instances that are difficult to solve. Evolutionary Computation\u00a014(4), 433\u2013462 (2006)","journal-title":"Evolutionary Computation"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Gras, R.: How efficient are genetic algorithms to solve high epistasis deceptive problems? In: IEEE Congress on Evolutionary Computation, CEC 2008. IEEE World Congress on Computational Intelligence, pp. 242\u2013249 (2008)","DOI":"10.1109\/CEC.2008.4630806"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10898-004-9965-1","volume":"31","author":"M. Locatelli","year":"2005","unstructured":"Locatelli, M., Wood, G.: Objective Function Features Providing Barriers to Rapid Global Optimization. Journal of Global Optimization\u00a031(4), 549\u2013565 (2005)","journal-title":"Journal of Global Optimization"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Xin, B., Chen, J., Pan, F.: Problem difficulty analysis for particle swarm optimization: deception and modality. In: Proceedings of the first ACM\/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 623\u2013630 (2009)","DOI":"10.1145\/1543834.1543919"},{"key":"29_CR13","unstructured":"Bachelet, V.: M\u00e9taheuristiques parall\u00e8les hybrides: application au probl\u00e8me d\u2019affectation quadratique. PhD thesis, Universite des Sciences et Technologies de Lille (1999)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1023\/A:1018983524911","volume":"86","author":"C. Reeves","year":"1999","unstructured":"Reeves, C.: Landscapes, operators and heuristic search. Annals of Operations Research\u00a086, 473\u2013490 (1999)","journal-title":"Annals of Operations Research"},{"issue":"10","key":"29_CR15","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":"29_CR16","unstructured":"Smith-Miles, K.A., Lopes, L.B.: Measuring Combinatorial Optimization Problem Difficulty for Algorithm Selection. Annals of Mathematics and Artificial Intelligence (under review, 2009)"},{"key":"29_CR17","first-page":"743","volume-title":"Proceedings of the Seventeenth International Conference on Machine Learning table of contents","author":"B. Pfahringer","year":"2000","unstructured":"Pfahringer, B., Bensusan, H., Giraud-Carrier, C.: Meta-learning by landmarking various learning algorithms. In: Proceedings of the Seventeenth International Conference on Machine Learning table of contents, pp. 743\u2013750. Morgan Kaufmann Publishers Inc., San Francisco (2000)"},{"key":"29_CR18","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"},{"issue":"4","key":"29_CR19","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/72.298224","volume":"5","author":"R. Battiti","year":"1994","unstructured":"Battiti, R.: Using mutual information for selecting features in supervised neural net learning. IEEE Transactions on neural networks\u00a05(4), 537\u2013550 (1994)","journal-title":"IEEE Transactions on neural networks"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Vasconcelos, N.: Feature selection by maximum marginal diversity: optimality and implications for visual recognition. In: Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol.\u00a01 (2003)","DOI":"10.1109\/CVPR.2003.1211430"},{"key":"29_CR21","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of the 12th IJCAI, pp. 331\u2013337 (1991)"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-71615-0_18","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"E. Ridge","year":"2007","unstructured":"Ridge, E., Kudenko, D.: An Analysis of Problem Difficulty for a Class of Optimisation Heuristics. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol.\u00a04446, pp. 198\u2013209. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"29_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0004-3702(95)00054-2","volume":"81","author":"W. Zhang","year":"1996","unstructured":"Zhang, W., Korf, R.: A study of complexity transitions on the asymmetric traveling salesman problem. Artificial Intelligence\u00a081(1-2), 223\u2013239 (1996)","journal-title":"Artificial Intelligence"},{"key":"29_CR24","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.1389","volume":"21","author":"W. Zhang","year":"2004","unstructured":"Zhang, W.: Phase transitions and backbones of the asymmetric traveling salesman problem. Journal of Artificial Intelligence Research\u00a021, 471\u2013497 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1-2","key":"29_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","volume":"88","author":"I. Gent","year":"1996","unstructured":"Gent, I., Walsh, T.: The TSP phase transition. Artificial Intelligence\u00a088(1-2), 349\u2013358 (1996)","journal-title":"Artificial Intelligence"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Thiebaux, S., Slaney, J., Kilby, P.: Estimating the hardness of optimisation. In: ECAI, pp. 123\u2013130 (2000)","DOI":"10.1007\/978-1-4615-4485-2_8"},{"key":"29_CR27","unstructured":"Gaertner, D., Clark, K.: On optimal parameters for ant colony optimization algorithms. In: Proceedings of the 2005 International Conference on Artificial Intelligence, Citeseer, vol.\u00a01, pp. 83\u201389 (2005)"},{"issue":"4","key":"29_CR28","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0375-9601(92)90557-3","volume":"161","author":"P. Stadler","year":"1992","unstructured":"Stadler, P., Schnabl, W.: The landscape of the traveling salesman problem. Phys. Lett. A\u00a0161(4), 337\u2013344 (1992)","journal-title":"Phys. Lett. A"},{"key":"29_CR29","unstructured":"Kilby, P., Slaney, J., Walsh, T.: The backbone of the travelling salesperson. In: International Joint Conference on Artificial Intelligence, vol.\u00a019, p. 175 (2005)"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Lin, S., Kernighan, B.: An efficient heuristic algorithm for the traveling salesman problem. Operations Research\u00a021(2) (1973)","DOI":"10.1287\/opre.21.2.498"},{"key":"29_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-31996-2_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J. Hemert van","year":"2005","unstructured":"van Hemert, J.: Property analysis of symmetric travelling salesman problem instances acquired through evolution. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol.\u00a03448, pp. 122\u2013131. Springer, Heidelberg (2005)"},{"key":"29_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-540-30217-9_16","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"J. Hemert van","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":"29_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-31996-2_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J. Hemert van","year":"2005","unstructured":"van Hemert, J.: Property analysis of symmetric travelling salesman problem instances acquired through evolution. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol.\u00a03448, pp. 122\u2013131. Springer, Heidelberg (2005)"},{"key":"29_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-36605-9_26","volume-title":"Applications of Evolutionary Computing","author":"J. Kratica","year":"2003","unstructured":"Kratica, J., Ljubi\u0107, I., To\u0161ic, D.: A genetic algorithm for the index selection problem. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 281\u2013291. Springer, Heidelberg (2003)"},{"key":"29_CR35","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. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"29_CR36","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large travelling salesman problems (2000), http:\/\/www.citeseer.com\/applegate99chained.html"},{"key":"29_CR37","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D. Johnson","year":"1997","unstructured":"Johnson, D., McGeoch, L.: The traveling salesman problem: a case study. In: Aarts, E., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310. John Wiley & Sons, Inc., Chichester (1997)"},{"issue":"2","key":"29_CR38","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1009745219419","volume":"2","author":"J. Sander","year":"1998","unstructured":"Sander, J., Ester, M., Kriegel, H., Xu, X.: Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data Mining and Knowledge Discovery\u00a02(2), 169\u2013194 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"29_CR39","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1109\/5.58325","volume":"78","author":"T. Kohonen","year":"1990","unstructured":"Kohonen, T.: Self-organization maps. Proc. IEEE\u00a078, 1464\u20131480 (1990)","journal-title":"Proc. IEEE"},{"key":"29_CR40","unstructured":"SOMine, V.: Enterprise Edition Version 3.0, Eudaptics Software Gmbh (1999)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13800-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T19:43:40Z","timestamp":1635536620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13800-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137990","9783642138003"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13800-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}