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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ruiz-Vanoye, J. A., Díaz-Parra, O., & Vanesa Landero, N. (2008). A metric to discriminate the selection of algorithms for the general ATSP problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5177 LNAI, pp. 106–113). Springer Verlag. https://doi.org/10.1007/978-3-540-85563-7_19
Mendeley helps you to discover research relevant for your work.