{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T05:54:50Z","timestamp":1789106090214,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642344121","type":"print"},{"value":"9783642344138","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_9","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:58:57Z","timestamp":1349071137000},"page":"115-129","source":"Crossref","is-referenced-by-count":23,"title":["Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Mersmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Bischl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakob","family":"Bossek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heike","family":"Trautmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1287\/ijoc.14.2.132.118","volume":"14","author":"D. Applegate","year":"2002","unstructured":"Applegate, D., Cook, W.J., Dash, S., Rohe, A.: Solution of a min-max vehicle routing problem. Informs Journal on Computing\u00a014(2), 132\u2013143 (2002)","journal-title":"Informs Journal on Computing"},{"issue":"5","key":"9_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"9_CR3","volume-title":"Classification and Regression Trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)"},{"issue":"6","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1998","DOI":"10.1137\/S0097539793251244","volume":"28","author":"B. Chandra","year":"1999","unstructured":"Chandra, B., Karloff, H.J., Tovey, C.A.: New results on the old k-Opt algorithm for the traveling salesman problem. SIAM J. Comput.\u00a028(6), 1998\u20132029 (1999)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Operations Research\u00a06(6), 791\u2013812 (1958)","journal-title":"Operations Research"},{"key":"9_CR6","unstructured":"Englert, M., R\u00f6glin, H., V\u00f6cking, B.: Worst case and probabilistic analysis of the 2-opt algorithm for the tsp: extended abstract. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 1295\u20131304. SIAM (2007)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/aos\/1176347963","volume":"19","author":"J.H. Friedman","year":"1991","unstructured":"Friedman, J.H.: Multivariate adaptive regression splines. Annals of Statistics\u00a019(1), 1\u201367 (1991)","journal-title":"Annals of Statistics"},{"issue":"1-3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics\u00a065(1-3), 223\u2013253 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR9","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization. Wiley (1997)"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/HIS-2011-0133","volume":"8","author":"J. Kanda","year":"2011","unstructured":"Kanda, J., Carvalho, A., Hruschka, E., Soares, C.: Selection of algorithms to solve traveling salesman problems using meta-learning. Hybrid Intelligent Systems\u00a08, 117\u2013128 (2011)","journal-title":"Hybrid Intelligent Systems"},{"key":"9_CR11","first-page":"175","volume-title":"Proc, of the 19th International Joint Conference on Artificial intelligence, IJCAI 2005","author":"P. Kilby","year":"2005","unstructured":"Kilby, P., Slaney, J., Walsh, T.: The backbone of the travelling salesperson. In: Proc, of the 19th International Joint Conference on Artificial intelligence, IJCAI 2005, pp. 175\u2013180. Morgan Kaufmann Publishers Inc., San Francisco (2005)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-15461-4_28","volume-title":"Swarm Intelligence","author":"T. K\u00f6tzing","year":"2010","unstructured":"K\u00f6tzing, T., Neumann, F., R\u00f6glin, H., Witt, C.: Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Gro\u00df, R., \u015eahin, E., Sayama, H., St\u00fctzle, T. (eds.) ANTS 2010. LNCS, vol.\u00a06234, pp. 324\u2013335. Springer, Heidelberg (2010)"},{"key":"9_CR13","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"},{"issue":"10","key":"9_CR14","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the travelling salesman problem. Bell Systems Technical Journal\u00a044(10), 2245\u20132269 (1965)","journal-title":"Bell Systems Technical Journal"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1145\/2001576.2001690","volume-title":"Proc. of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011","author":"O. Mersmann","year":"2011","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proc. of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, pp. 829\u2013836. ACM, New York (2011)"},{"issue":"4","key":"9_CR16","first-page":"297","volume":"13","author":"P. Merz","year":"2001","unstructured":"Merz, P., Freisleben, B.: Memetic algorithms for the traveling salesman problem. Complex Systems\u00a013(4), 297\u2013345 (2001)","journal-title":"Complex Systems"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAMR\u00a033(1), 60\u2013100 (1991)","journal-title":"SIAMR"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib - a traveling salesman problem library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"9_CR19","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":"9_CR20","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Annals of Mathematics and Artificial Intelligence (2011) (forthcoming)","DOI":"10.1007\/s10472-011-9230-5"},{"key":"9_CR21","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":"9_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0375-9601(92)90557-3","volume":"161","author":"P.F. Stadler","year":"1992","unstructured":"Stadler, P.F., Schnabl, W.: The Landscape of the Traveling Salesman Problem. Physics Letters A\u00a0161, 337\u2013344 (1992)","journal-title":"Physics Letters A"},{"key":"9_CR23","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer (2001)"}],"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-34413-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T21:06:56Z","timestamp":1643490416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}