RAISTTP revisited to solve relaxed travel tournament problem

Elizabeth Montero, María Cristina Riff

Resultado de la investigación: Contribución a los tipos de informe/libroContribución a la conferencia

Resumen

We are interested in methods and strategies that allow us to simplify the code of bio-inspired algorithms without altering their performance. In this paper, we study an artificial immune algorithm specially designed to solve Relaxed Traveling Tournament Problems which has been able to obtain new bounds for some instances of this problem. We use the EvoCa tuner to analyze the components of the algorithm in order to discard some parts of the code. The results show that the filtered algorithm is able to solve the instances as well as does the original algorithm, and with this code we have obtained new bounds for some instances of the problem.

Idioma originalInglés
Título de la publicación alojadaGECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference
EditoresSara Silva
EditorialAssociation for Computing Machinery, Inc
Páginas121-128
Número de páginas8
ISBN (versión digital)9781450334723
DOI
EstadoPublicada - 11 jul 2015
Evento16th Genetic and Evolutionary Computation Conference, GECCO 2015 - Madrid, Espana
Duración: 11 jul 201515 jul 2015

Conferencia

Conferencia16th Genetic and Evolutionary Computation Conference, GECCO 2015
PaísEspana
CiudadMadrid
Período11/07/1515/07/15

Áreas temáticas de ASJC Scopus

  • Teoría computacional y matemáticas
  • Informática aplicada
  • Software

Huella Profundice en los temas de investigación de 'RAIS<sub>TTP</sub> revisited to solve relaxed travel tournament problem'. En conjunto forman una huella única.

  • Citar esto

    Montero, E., & Riff, M. C. (2015). RAISTTP revisited to solve relaxed travel tournament problem. En S. Silva (Ed.), GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference (pp. 121-128). Association for Computing Machinery, Inc. https://doi.org/10.1145/2739480.2754753