{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:22:26Z","timestamp":1762352546592,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319503486"},{"type":"electronic","value":"9783319503493"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50349-3_11","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T02:12:11Z","timestamp":1480471931000},"page":"157-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-Art Inexact TSP Solvers"],"prefix":"10.1007","author":[{"given":"Zongxu","family":"Mu","sequence":"first","affiliation":[]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-04244-7_14"},{"key":"11_CR2","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The traveling salesman problem, concorde TSP solver (2012). \n                      http:\/\/www.tsp.gatech.edu\/concorde"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-02538-9_13","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"M Birattari","year":"2010","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., St\u00fctzle, T.: F-race and iterated F-race: an overview. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 311\u2013336. Springer, Heidelberg (2010)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Dubois-Lacoste, J., Hoos, H.H., St\u00fctzle, T.: On the empirical scaling behaviour of state-of-the-art local search algorithms for the Euclidean TSP. In: Proceedings of GECCO 2015, pp. 377\u2013384. ACM Press (2015)","DOI":"10.1145\/2739480.2754747"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"2\u20133","key":"11_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1(2\u20133), 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"11_CR7","unstructured":"Hoos, H.H.: A bootstrap approach to analysing the scaling of empirical run-time data with problem size. Technical report, TR-2009-16, Department of Computer Science, University of British Columbia (2009)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2014.03.042","volume":"238","author":"HH Hoos","year":"2014","unstructured":"Hoos, H.H., St\u00fctzle, T.: On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem. Eur. J. Oper. Res. 238(1), 87\u201394 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s11590-014-0828-5","volume":"9","author":"HH Hoos","year":"2015","unstructured":"Hoos, H.H., St\u00fctzle, T.: On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances. Optim. Lett. 9, 1247\u20131257 (2015)","journal-title":"Optim. Lett."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-25566-3_40"},{"issue":"1","key":"11_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"11_CR12","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"DS Johnson","year":"1997","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, pp. 215\u2013310. Wiley, Chichester (1997)"},{"key":"11_CR13","first-page":"369","volume-title":"The Traveling Salesman Problem and Its Variations","author":"DS Johnson","year":"2002","unstructured":"Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 369\u2013443. Kluwer Academic Publishers, New York (2002)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-19084-6_18","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2015","unstructured":"Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202\u2013217. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-19084-6_18"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-44973-4_44","volume-title":"Learning and Intelligent Optimization","author":"F Mascia","year":"2013","unstructured":"Mascia, F., Birattari, M., St\u00fctzle, T.: Tuning algorithms for tackling large instances: an experimental protocol. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 410\u2013422. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-44973-4_44"},{"key":"11_CR16","unstructured":"Mu, Z.: Analysing the empirical time complexity of high-performance algorithms for SAT and TSP. Master\u2019s thesis, University of British Columbia, Vancouver, Canada (2015)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Mu, Z., Hoos, H.H.: Empirical scaling analyser: an automated system for empirical analysis of performance scaling. In: GECCO 2015, Companion, pp. 771\u2013772 (2015)","DOI":"10.1145\/2739482.2764898"},{"key":"11_CR18","unstructured":"Mu, Z., Hoos, H.H.: On the empirical time complexity of random 3-SAT at the phase transition. In: Proceedings of IJCAI 2015, pp. 367\u2013373 (2015)"},{"key":"11_CR19","unstructured":"Nagata, Y.: Edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem. In: Proceedings of ICGA 1997, pp. 450\u2013457 (1997)"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"key":"11_CR21","first-page":"589","volume-title":"Essays and Surveys on Metaheuristics","author":"T St\u00fctzle","year":"2001","unstructured":"St\u00fctzle, T., Hoos, H.H.: Analysing the run-time behaviour of iterated local search for the travelling salesman problem. In: Hansen, P., Ribeiro, C. (eds.) Essays and Surveys on Metaheuristics, pp. 589\u2013611. Kluwer Academic Publishers, New York (2001)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Styles, J., Hoos, H.: Ordered racing protocols for automatically configuring algorithms for scaling performance. In: Proceedings of GECCO 2013, pp. 551\u2013558. ACM (2013)","DOI":"10.1145\/2463372.2463438"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-34413-8_15","volume-title":"Proceedings of LION 2012","author":"J Styles","year":"2012","unstructured":"Styles, J., Hoos, H.H., M\u00fcller, M.: Automatically configuring algorithms for scaling performance. In: Hamadi, Y., Schoenaur, M. (eds.) LION 6. LNCS, vol. 7219, pp. 205\u2013219. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-34413-8_15"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50349-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:39:54Z","timestamp":1558316394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50349-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503486","9783319503493"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50349-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion10.unina.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}