{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T08:32:25Z","timestamp":1790757145727,"version":"4.1.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T00:00:00Z","timestamp":1364428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10472-013-9341-2","type":"journal-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T06:27:48Z","timestamp":1364365668000},"page":"151-182","source":"Crossref","is-referenced-by-count":79,"title":["A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem"],"prefix":"10.1007","volume":"69","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":"Heike","family":"Trautmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakob","family":"Bossek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,3,28]]},"reference":[{"issue":"2","key":"9341_CR1","doi-asserted-by":"crossref","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 J. Comput. 14(2), 132\u2013143 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"9341_CR2","doi-asserted-by":"crossref","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 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"9341_CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/2330163.2330209","volume-title":"Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201912","author":"B Bischl","year":"2012","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preuss, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201912, pp. 313\u2013320. ACM, New York, NY, USA (2012)"},{"issue":"2","key":"9341_CR4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1162\/EVCO_a_00069","volume":"20","author":"B Bischl","year":"2012","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Weihs, C.: Resampling methods in model validation. Evol. Comput. J. 20(2), 249\u2013275 (2012)","journal-title":"Evol. Comput. J."},{"issue":"1","key":"9341_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"9341_CR6","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont, CA (1984)"},{"issue":"6","key":"9341_CR7","doi-asserted-by":"crossref","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. 28(6), 1998\u20132029 (1999)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9341_CR8","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"9341_CR9","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press (2004)","DOI":"10.1007\/b99492"},{"key":"9341_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9341_CR11","unstructured":"Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Springer (2007)"},{"key":"9341_CR12","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":"9341_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1176347963","volume":"19","author":"JH Friedman","year":"1991","unstructured":"Friedman, J.H.: Multivariate adaptive regression splines. Ann. Stat. 19(1), 1\u201367 (1991)","journal-title":"Ann. Stat."},{"issue":"1\u20133","key":"9341_CR14","doi-asserted-by":"crossref","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 Appl. Math. 65(1\u20133), 223\u2013253 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9341_CR15","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations & Applications. Elsevier\/Morgan Kaufmann (2004)"},{"key":"9341_CR16","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)"},{"issue":"3","key":"9341_CR17","first-page":"117","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. IJHIS 8(3), 117\u2013128 (2011)","journal-title":"IJHIS"},{"key":"9341_CR18","first-page":"175","volume-title":"Proc, of the 19th International Joint Conference on Artificial Intelligence, IJCAI\u201905","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\u201905, pp. 175\u2013180. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2005)"},{"issue":"1\u20132","key":"9341_CR19","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artif. Intell. 97(1\u20132), 273\u2013324 (1997)","journal-title":"Artif. Intell."},{"key":"9341_CR20","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Neumann, F., R\u00f6glin, H., Witt, C.: Theoretical properties of two ACO approaches for the traveling salesman problem. In: Proc. of ANTS 2010, LNCS, vol. 6234, pp. 324\u2013335 (2010). Extended journal version appears in Swarm Intelligence","DOI":"10.1007\/978-3-642-15461-4_28"},{"key":"9341_CR21","unstructured":"Kov\u00e1rik, O., M\u00e1lek, R.: Meta-learning and meta-optimization. Tech. rep., CTU Technical Report KJB2012010501 003, Prague (2012). http:\/\/cig.felk.cvut.cz\/research\/publications\/Meta-learning_and_meta-optimization.pdf"},{"key":"9341_CR22","unstructured":"van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications. Springer (1997)"},{"issue":"10","key":"9341_CR23","doi-asserted-by":"crossref","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 Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"9341_CR24","doi-asserted-by":"crossref","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. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9341_CR25","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., Neumann, F.: Local search and the traveling salesman problem: A feature-based characterization of problem hardness. In: Hamadi, Y., Schoenauer, M. (eds.) Learning and Intelligent Optimization. Lecture Notes in Computer Science, pp. 115\u2013129. Springer Berlin Heidelberg (2012)","DOI":"10.1007\/978-3-642-34413-8_9"},{"key":"9341_CR26","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 \u201911","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 \u201911, pp. 829\u2013836. ACM, New York, NY, USA (2011)"},{"issue":"4","key":"9341_CR27","first-page":"297","volume":"13","author":"P Merz","year":"2001","unstructured":"Merz, P., Freisleben, B.: Memetic algorithms for the traveling salesman problem. Complex Syst. 13(4), 297\u2013345 (2001)","journal-title":"Complex Syst."},{"issue":"2","key":"9341_CR28","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00453-007-9134-2","volume":"54","author":"F Neumann","year":"2009","unstructured":"Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. Algorithmica 54(2), 243\u2013255 (2009)","journal-title":"Algorithmica"},{"key":"9341_CR29","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization \u2013 Algorithms and Their Computational Complexity. Springer (2010)","DOI":"10.1007\/978-3-642-16544-3"},{"issue":"1","key":"9341_CR30","doi-asserted-by":"crossref","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 33(1), 60\u2013100 (1991)","journal-title":"SIAMR"},{"key":"9341_CR31","unstructured":"R Development Core Team: R: R Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2011). http:\/\/www.R-project.org . ISBN 3-900051-07-0"},{"issue":"2","key":"9341_CR32","doi-asserted-by":"crossref","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 Knowl. Discov. 2(2), 169\u2013194 (1998)","journal-title":"Data Mining Knowl. Discov."},{"issue":"2","key":"9341_CR33","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann. Math. Artif. Intell. 61(2), 87\u2013104 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9341_CR34","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., van Hemert, J.I., Lim, X.Y.: Understanding tsp difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION, vol. 6073, pp. 266\u2013280. Lecture Notes in Computer Science. Springer (2010)","DOI":"10.1007\/978-3-642-13800-3_29"},{"issue":"5","key":"9341_CR35","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. OR 39(5), 875\u2013889 (2012)","journal-title":"Comput. OR"},{"key":"9341_CR36","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0375-9601(92)90557-3","volume":"A161","author":"PF Stadler","year":"1992","unstructured":"Stadler, P.F., Schnabl, W.: The landscape of the traveling salesman problem. Phys. Lett. A161, 337\u2013344 (1992)","journal-title":"Phys. Lett."},{"key":"9341_CR37","unstructured":"Sutton, A.M., Neumann, F.: A parameterized runtime analysis of evolutionary algorithms for the euclidean traveling salesperson problem. In: Hoffmann, J., Selman, B. (eds.) AAAI. AAAI Press (2012)"},{"key":"9341_CR38","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer (2001)"},{"key":"9341_CR39","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Simulated annealing beats Metropolis in combinatorial optimization. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP\u00a0\u201905), vol. 3580, pp. 589\u2013601. Lecture Notes on Computer Science. Springer (2005)","DOI":"10.1007\/11523468_48"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9341-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9341-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9341-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T13:28:18Z","timestamp":1644672498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9341-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,28]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9341"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9341-2","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,28]]}}}