{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:23:52Z","timestamp":1760646232145},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319107615"},{"type":"electronic","value":"9783319107622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10762-2_10","type":"book-chapter","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T10:58:55Z","timestamp":1410346735000},"page":"100-109","source":"Crossref","is-referenced-by-count":13,"title":["Parameter Prediction Based on Features of Evolved Instances for Ant Colony Optimization and the Traveling Salesperson Problem"],"prefix":"10.1007","author":[{"given":"Samadhi","family":"Nallaperuma","sequence":"first","affiliation":[]},{"given":"Markus","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","first-page":"37","volume":"6","author":"D.W. Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D., Albert, M.K.: Instance-based learning algorithms. Mach. Learn.\u00a06(1), 37\u201366 (1991)","journal-title":"Mach. Learn."},{"issue":"2","key":"10_CR2","first-page":"132","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. Journal on Computing\u00a014(2), 132\u2013143 (2002)","journal-title":"Journal on Computing"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Company (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The weka data mining software: An update. SIGKDD Explororations Newsletter\u00a011(1), 10\u201318 (2009)","journal-title":"SIGKDD Explororations Newsletter"},{"key":"10_CR5","first-page":"37","volume-title":"Autonomous Search","author":"H. Hoos","year":"2012","unstructured":"Hoos, H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2012)"},{"key":"10_CR6","doi-asserted-by":"publisher","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 Intelligence\u00a06, 1\u201321 (2012)","journal-title":"Swarm Intelligence"},{"key":"10_CR7","doi-asserted-by":"crossref","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. In: Annals of Mathematics and Artificial Intelligence, pp. 1\u201332 (2013)","DOI":"10.1007\/s10472-013-9341-2"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-32937-1_23","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"M.A. Mu\u00f1oz","year":"2012","unstructured":"Mu\u00f1oz, M.A., Kirley, M., Halgamuge, S.K.: A meta-learning prediction model of algorithm performance for continuous optimization problems. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol.\u00a07491, pp. 226\u2013235. Springer, Heidelberg (2012)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F.: Ant colony optimisation and the traveling salesperson problem: Hardness, features and parameter settings (extended abstract). In: 15th Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion (GECCO Companion), pp. 13\u201314. ACM (2013)","DOI":"10.1145\/2464576.2464581"},{"key":"10_CR10","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: International Conference on Foundations of Genetic Algorithms, FOGA (2013)","DOI":"10.1145\/2460239.2460253"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11839088_18","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"P. Pellegrini","year":"2006","unstructured":"Pellegrini, P., Favaretto, D., Moretti, E.: On \n                    \n                      \n                    \n                    $\\cal M\\!AX\\!$\n                   \u2013 \n                    \n                      \n                    \n                    $\\cal MI\\!N\\!$\n                   ant system\u2019s parameters. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., St\u00fctzle, T. (eds.) ANTS 2006. LNCS, vol.\u00a04150, pp. 203\u2013214. Springer, Heidelberg (2006)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-15461-4_21","volume-title":"Swarm Intelligence","author":"P. Pellegrini","year":"2010","unstructured":"Pellegrini, P., St\u00fctzle, T., Birattari, M.: Off-line vs. on-line tuning: A study on \n                    \n                      \n                    \n                    $\\mathcal{MAX--MIN}$\n                   ant system for the TSP. 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. 239\u2013250. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR13","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 \u2013 A Traveling Salesman Problem Library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"key":"10_CR14","series-title":"SCI","first-page":"21","volume-title":"Recent Advances in Evol. Comp.","author":"E. Ridge","year":"2008","unstructured":"Ridge, E., Kudenko, D.: Determining Whether a Problem Characteristic Affects Heuristic Performance. In: Cotta, C., van Hemert, J. (eds.) Recent Advances in Evol. Comp. SCI, vol.\u00a0153, pp. 21\u201335. Springer, Heidelberg (2008)"},{"key":"10_CR15","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":"10_CR16","unstructured":"St\u00fctzle, T.: Software package: Acotsp.v1.03.tgz (2012)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Dorigo, M.: A short convergence proof for a class of Ant Colony Optimization algorithms. IEEE Trans. on Evolutionary Computation, 358\u2013365 (2002)","DOI":"10.1109\/TEVC.2002.802444"},{"issue":"9","key":"10_CR18","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN Ant system. Future Generation Computer Systems\u00a016(9), 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., L\u00f3pez-Ib\u00e1\u00f1ez, M., Pellegrini, P., Maur, M., Montes de Oca, M., Birattari, M., Dorigo, M.: Parameter Adaptation in Ant Colony Optimization. In: Autonomous Search, pp. 191\u2013215. Springer (2012)","DOI":"10.1007\/978-3-642-21434-9_8"},{"key":"10_CR20","unstructured":"St\u00fctzle, T., Hoos, H., Merz, P.: An Analysis of the Hardness of TSP Instances for Two High-performance Algorithms. In: 6th Metaheuristics International Conference (MIC), pp. 361\u2013367 (2005)"},{"issue":"6","key":"10_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F. Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual Comparisons by Ranking Methods. Biometrics Bulletin\u00a01(6), 80\u201383 (1945)","journal-title":"Biometrics Bulletin"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10762-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:22:33Z","timestamp":1558977753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10762-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319107615","9783319107622"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10762-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}