A Metric to Discriminate the Selection of Algorithms for the General ATSP Problem

  • Authors:

  • Jorge A. Ruiz-Vanoye;Ocotlán Díaz-Parra;Vanesa Landero N.

  • Affiliations:

  • Centro Nacional de Investigación y Desarrollo Tecnológico, Interior internado Palmira s/n., Col. Palmira, Cuernavaca, Mexico;CIICAp, Universidad Autonóma del Estado de Morelos, Cuernavaca, Mexico 62209;Centro Nacional de Investigación y Desarrollo Tecnológico, Interior internado Palmira s/n., Col. Palmira, Cuernavaca, Mexico

  • Venue:
  • KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.