A Metric to Discriminate the Selection of Algorithms for the General ATSP Problem
- Cite this paper as:
- Ruiz-Vanoye J.A., Díaz-Parra O., N. V.L. (2008) A Metric to Discriminate the Selection of Algorithms for the General ATSP Problem. In: Lovrek I., Howlett R.J., Jain L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science, vol 5177. Springer, Berlin, Heidelberg
In this paper we propose: (1) the use of discriminant analysis as a means for predictive learning (data-mining techniques) aiming at selecting metaheuristic algorithms and (2) the use of a metric for improving the selection of the algorithms that best solve a given instance of the Asymmetric Traveling Salesman Problem (ATSP). The only metric that had existed so far to determine the best algorithm for solving an ATSP instance is based on the number of cities; nevertheless, it is not sufficiently adequate for discriminating the best algorithm for solving an ATSP instance, thus the necessity for devising a new metric through the use of data-mining techniques.
KeywordsInductive learning genetic algorithm discriminant analysis data-mining techniques machine learning
Unable to display preview. Download preview PDF.