{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:44:57Z","timestamp":1759178697081,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_7","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"100-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dancing to\u00a0the\u00a0State of\u00a0the\u00a0Art?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3571-667X","authenticated-orcid":false,"given":"Jonathan","family":"Heins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3929-7465","authenticated-orcid":false,"given":"Lennart","family":"Sch\u00e4permeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2862-1418","authenticated-orcid":false,"given":"Pascal","family":"Kerschke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2752-6534","authenticated-orcid":false,"given":"Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"7_CR1","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study, vol.\u00a017. Princeton University Press, Princeton (2011)"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., Trautmann, H.: Evolving diverse TSP instances by means of novel and creative mutation operators. In: Friedrich, T., Doerr, C., Arnold, D.V. (eds.) Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA), pp. 58\u201371. ACM (2019). https:\/\/doi.org\/10.1145\/3299904.3340307","DOI":"10.1145\/3299904.3340307"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958). https:\/\/www.jstor.org\/stable\/167074","DOI":"10.1287\/opre.6.6.791"},{"key":"7_CR4","doi-asserted-by":"publisher","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: Silva, S., Esparcia-Alc\u00e1zar, A.I. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 377\u2013384. ACM (2015). https:\/\/doi.org\/10.1145\/2739480.2754747","DOI":"10.1145\/2739480.2754747"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., Kerschke, P.: On the potential of normalized TSP features for automated algorithm selection. In: Proceedings of the 16th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA), pp. 1\u201315. ACM (2021). https:\/\/doi.org\/10.1145\/3450218.3477308","DOI":"10.1145\/3450218.3477308"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tcs.2022.10.019","volume":"940","author":"J Heins","year":"2023","unstructured":"Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., Kerschke, P.: A study on the effects of normalized TSP features for automated algorithm selection. Theoret. Comput. Sci. 940, 123\u2013145 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.10.019","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970). https:\/\/doi.org\/10.1287\/opre.18.6.1138","journal-title":"Oper. Res."},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: part II. Math. Program. 1(1), 6\u201325 (1971). https:\/\/doi.org\/10.1007\/BF01584070","journal-title":"Math. Program."},{"issue":"1","key":"7_CR9","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). https:\/\/doi.org\/10.1016\/S0377-2217(99)00284-2","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR10","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, 119\u2013163 (2009). https:\/\/doi.org\/10.1007\/s12532-009-0004-6","journal-title":"Math. Program. Comput."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Bossek, J., Trautmann, H.: Parameterization of state-of-the-art performance indicators: a robustness study based on inexact TSP solvers. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) Companion, pp. 1737\u20131744. ACM (2018). https:\/\/doi.org\/10.1145\/3205651.3208233","DOI":"10.1145\/3205651.3208233"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1162\/evco_a_00215","volume":"26","author":"P Kerschke","year":"2018","unstructured":"Kerschke, P., Kotthoff, L., Bossek, J., Hoos, H.H., Trautmann, H.: Leveraging TSP solver complementarity through machine learning. Evol. Comput. 26(4), 597\u2013620 (2018). https:\/\/doi.org\/10.1162\/evco_a_00215","journal-title":"Evol. Comput."},{"key":"7_CR13","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19084-6_18"},{"issue":"2","key":"7_CR14","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.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Re. 21(2), 498\u2013516 (1973). https:\/\/doi.org\/10.1287\/opre.21.2.498","journal-title":"Oper. Re."},{"key":"7_CR15","unstructured":"Nagata, Y., Kobayashi, S.: Edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem. In: Proceedings of the 7th International Conference on Genetic Algorithms (ICGA), pp. 450\u2013457 (1997)"},{"issue":"2","key":"7_CR16","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). https:\/\/doi.org\/10.1287\/IJOC.1120.0506","journal-title":"INFORMS J. Comput."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4","volume-title":"Essays and Surveys in Metaheuristics","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Hansen, P., Taillard, E.D., Voss, S.: POPMUSIC - partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Springer, New York (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Seiler, M.V., Rook, J., Heins, J., Preu\u00df, O.L., Bossek, J., Trautmann, H.: Using reinforcement learning for per-instance algorithm configuration on the TSP. In: IEEE Symposium Series on Computational Intelligence (SSCI), pp. 361\u2013368. IEEE (2023). https:\/\/doi.org\/10.1109\/SSCI52147.2023.10372008","DOI":"10.1109\/SSCI52147.2023.10372008"},{"issue":"8","key":"7_CR19","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard, \u00c9.: Parallel iterative search methods for vehicle routing problems. Networks 23(8), 661\u2013673 (1993). https:\/\/doi.org\/10.1002\/net.3230230804","journal-title":"Networks"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/J.EJOR.2018.06.039","volume":"272","author":"\u00c9D Taillard","year":"2019","unstructured":"Taillard, \u00c9.D., Helsgaun, K.: POPMUSIC for the travelling salesman problem. Eur. J. Oper. Res. 272(2), 420\u2013429 (2019). https:\/\/doi.org\/10.1016\/J.EJOR.2018.06.039","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Varadarajan, S., Whitley, L.D.: The massively parallel mixing genetic algorithm for the traveling salesman problem. In: Auger, A., St\u00fctzle, T. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 872\u2013879. ACM (2019). https:\/\/doi.org\/10.1145\/3321707.3321772","DOI":"10.1145\/3321707.3321772"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Xie, X.F., Liu, J.: Multiagent optimization system for solving the traveling salesman problem (TSP). IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 39(2), 489\u2013502 (2008). https:\/\/doi.org\/10.1109\/TSMCB.2008.2006910","DOI":"10.1109\/TSMCB.2008.2006910"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:03:45Z","timestamp":1725649425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_7"}},"subtitle":["How Candidate Lists Influence LKH for Solving the Traveling Salesperson Problem"],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}