{"type":"conference","publication":"Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219","status":"public","abstract":[{"text":"With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem TSP. Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt.","lang":"eng"}],"series_title":"LION 6","user_id":"102979","department":[{"_id":"819"}],"_id":"48890","extern":"1","language":[{"iso":"eng"}],"keyword":["2-opt","Classification","Feature Selection","MARS","TSP"],"publication_identifier":{"isbn":["978-3-642-34412-1"]},"citation":{"chicago":"Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 115–129. LION 6. Berlin, Heidelberg: Springer-Verlag, 2012.","ieee":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 2012, pp. 115–129.","ama":"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: <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>. LION 6. Springer-Verlag; 2012:115–129.","bibtex":"@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin, Heidelberg}, series={LION 6}, title={Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness}, booktitle={Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219}, publisher={Springer-Verlag}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank}, year={2012}, pages={115–129}, collection={LION 6} }","short":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann, in: Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219, Springer-Verlag, Berlin, Heidelberg, 2012, pp. 115–129.","mla":"Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, Springer-Verlag, 2012, pp. 115–129.","apa":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., &#38; Neumann, F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 115–129."},"page":"115–129","year":"2012","place":"Berlin, Heidelberg","author":[{"full_name":"Mersmann, Olaf","last_name":"Mersmann","first_name":"Olaf"},{"first_name":"Bernd","last_name":"Bischl","full_name":"Bischl, Bernd"},{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"},{"full_name":"Wagner, Markus","last_name":"Wagner","first_name":"Markus"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"date_created":"2023-11-14T15:58:59Z","date_updated":"2023-12-13T10:48:58Z","publisher":"Springer-Verlag","title":"Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness"}