{"title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem","abstract":[{"text":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson 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"}],"publication":"Annals of Mathematics and Artificial Intelligence","language":[{"iso":"eng"}],"intvolume":"        69","page":"151–182","date_updated":"2023-10-16T13:48:14Z","type":"journal_article","volume":69,"citation":{"mla":"Mersmann, O., et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, 2013, pp. 151–182.","chicago":"Mersmann, O, B Bischl, Heike Trautmann, M Wagner, J Bossek, and F Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i> 69 (2013): 151–182.","apa":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., &#38; Neumann, F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>69</i>, 151–182.","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals of Mathematics and Artificial Intelligence 69 (2013) 151–182.","bibtex":"@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem}, volume={69}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann, O and Bischl, B and Trautmann, Heike and Wagner, M and Bossek, J and Neumann, F}, year={2013}, pages={151–182} }","ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, pp. 151–182, 2013.","ama":"Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>. 2013;69:151–182."},"department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:48:57Z","status":"public","_id":"46394","user_id":"15504","author":[{"last_name":"Mersmann","full_name":"Mersmann, O","first_name":"O"},{"first_name":"B","last_name":"Bischl","full_name":"Bischl, B"},{"id":"100740","first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"},{"first_name":"M","last_name":"Wagner","full_name":"Wagner, M"},{"last_name":"Bossek","full_name":"Bossek, J","first_name":"J"},{"first_name":"F","last_name":"Neumann","full_name":"Neumann, F"}],"year":"2013"}