Evaluation of Traveling Salesman Problem Instance Hardness by Clustering

Traveling salesman problem (TSP) is a well-known NP-hard combinatorial optimization problem. It has been solved by a number of exact and approximate algorithms and serves as a testbed for new heuristic and metaheuristic optimization algorithms. However, it is often not easy to evaluate the hardness (complexity) of a TSP instance. Simple measures such as the number of cities or the minimum (maximum) route length do not capture the internal structure of a TSP instance sufficiently. In this work, we propose a new method for the assessment of TSP instance complexity based on clustering. The new approach is evaluated on a set of randomized TSP instances with different structure and its relation to the performance of a selected metaheuristic TSP solver is studied.

[1]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[2]  Alexander Mendiburu,et al.  A study on the complexity of TSP instances under the 2-exchange neighbor system , 2011, 2011 IEEE Symposium on Foundations of Computational Intelligence (FOCI).

[3]  Thomas Stützle,et al.  Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem , 2002 .

[4]  Václav Snásel,et al.  Traditional and self-adaptive differential evolution for the p-median problem , 2015, 2015 IEEE 2nd International Conference on Cybernetics (CYBCONF).

[5]  Neil Salkind.  Encyclopedia of Measurement and Statistics , 2006 .

[6]  Sanjeev Arora.  Approximation Algorithms for Geometric TSP , 2007 .

[7]  Sanghamitra Bandyopadhyay,et al.  Unsupervised Classification: Similarity Measures, Classical and Metaheuristic Approaches, and Applications , 2012 .

[8]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[9]  Adel M. Alimi,et al.  Ant supervised by PSO and 2-Opt algorithm, AS-PSO-2Opt, applied to Traveling Salesman Problem , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[10]  Matús Mihalák,et al.  On the Complexity of the Metric TSP under Stability Considerations , 2011, SOFSEM.

[11]  Matteo Fischetti,et al.  Exact Methods for the Asymmetric Traveling Salesman Problem , 2007 .

[12]  Plamen Angelov,et al.  Data density based clustering , 2014, 2014 14th UK Workshop on Computational Intelligence (UKCI).

[13]  Thomas Stützle,et al.  A Comparison of Nature Inspired Heuristics on the Traveling Salesman Problem , 2000, PPSN.

[14]  Hans-Peter Kriegel,et al.  Density‐based clustering , 2011, WIREs Data Mining Knowl. Discov..

[15]  B. Everitt,et al.  Cluster Analysis: Everitt/Cluster Analysis , 2011 .

[16]  Abraham P. Punnen,et al.  The Traveling Salesman Problem: Applications, Formulations and Variations , 2007 .