{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:36:30Z","timestamp":1771698990899,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458229","type":"print"},{"value":"9783319458236","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_81","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T13:26:31Z","timestamp":1472563591000},"page":"869-879","source":"Crossref","is-referenced-by-count":25,"title":["Feature-Based Diversity Optimization for Problem Instance Classification"],"prefix":"10.1007","author":[{"given":"Wanru","family":"Gao","sequence":"first","affiliation":[]},{"given":"Samadhi","family":"Nallaperuma","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"81_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"issue":"2","key":"81_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R Vilalta","year":"2002","unstructured":"Vilalta, R., Drissi, Y.: A perspective view and survey of meta-learning. Artif. Intell. Rev. 18(2), 77\u201395 (2002)","journal-title":"Artif. Intell. Rev."},{"key":"81_CR3","doi-asserted-by":"crossref","unstructured":"Eggensperger, K., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Efficient benchmarking of hyperparameter optimizers via surrogates. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25\u201330 January 2015, Austin, Texas, USA, pp. 1114\u20131120 (2015)","DOI":"10.1609\/aaai.v29i1.9375"},{"key":"81_CR4","unstructured":"Feurer, M., Springenberg, J.T., Hutter, F.: Initializing bayesian hyperparameter optimization via meta-learning. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 25\u201330 January 2015, Austin, Texas, USA, pp. 1128\u20131135 (2015)"},{"issue":"5","key":"81_CR5","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. Oper. Res. 39(5), 875\u2013889 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"81_CR6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1162\/evco.2006.14.4.433","volume":"14","author":"JI Hemert van","year":"2006","unstructured":"van Hemert, J.I.: Evolving combinatorial problem instances that are difficult to solve. Evol. Comput. 14(4), 433\u2013462 (2006)","journal-title":"Evol. Comput."},{"issue":"2","key":"81_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10472-013-9341-2","volume":"69","author":"O Mersmann","year":"2013","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., Neumann, F.: A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69(2), 151\u2013182 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"81_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6073, pp. 266\u2013280. Springer, Heidelberg (2010)"},{"key":"81_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity, 1st edn. Springer, New York (2010)","edition":"1"},{"issue":"1","key":"81_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11721-011-0059-7","volume":"6","author":"T K\u00f6tzing","year":"2012","unstructured":"K\u00f6tzing, T., Neumann, F., R\u00f6glin, H., Witt, C.: Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. 6(1), 1\u201321 (2012)","journal-title":"Swarm Intell."},{"issue":"1","key":"81_CR11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s00453-013-9801-4","volume":"68","author":"M Englert","year":"2014","unstructured":"Englert, M., R\u00f6glin, H., V\u00f6cking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica 68(1), 190\u2013264 (2014)","journal-title":"Algorithmica"},{"key":"81_CR12","doi-asserted-by":"crossref","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., Trautmann, H.: A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem. In: FOGA 2013, pp. 147\u2013160 (2013)","DOI":"10.1145\/2460239.2460253"},{"key":"81_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-319-10762-2_10","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"S Nallaperuma","year":"2014","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F.: Parameter prediction based on features of evolved instances for ant colony optimization and the traveling salesperson problem. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 100\u2013109. Springer, Heidelberg (2014)"},{"key":"81_CR14","series-title":"Lecture Notes in Computer Science","first-page":"707","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"T Ulrich","year":"2010","unstructured":"Ulrich, T., Bader, J., Thiele, L.: Defining and optimizing indicator-based diversity measures in multiobjective search. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 707\u2013717. Springer, Heidelberg (2010)"},{"key":"81_CR15","doi-asserted-by":"crossref","unstructured":"Ulrich, T., Bader, J., Zitzler, E.: Integrating decision space diversity into hypervolume-based multiobjective search. In: GECCO, pp. 455\u2013462 (2010)","DOI":"10.1145\/1830483.1830569"},{"issue":"6","key":"81_CR16","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."},{"issue":"2","key":"81_CR17","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., 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."},{"key":"81_CR18","unstructured":"Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2015)"},{"issue":"3","key":"81_CR19","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"81_CR20","unstructured":"Meyer, D., Dimitriadou, E., Hornik, K., Weingessel, A., Leisch, F.: e1071: Misc Functions of the Department of Statistics, Probability Theory Group (Formerly: E1071), TU Wien. R package version 1.6-7 (2015)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T11:02:48Z","timestamp":1657191768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}