RAISTTP revisited to solve relaxed travel tournament problem

Elizabeth Montero, María Cristina Riff

Resultado de la investigación: Conference contribution

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 originalEnglish
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
EstadoPublished - 11 jul 2015
Evento16th Genetic and Evolutionary Computation Conference, GECCO 2015 - Madrid, Spain
Duración: 11 jul 201515 jul 2015

Conference

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

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
Montero, Elizabeth ; Riff, María Cristina. / RAISTTP revisited to solve relaxed travel tournament problem. GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference. editor / Sara Silva. Association for Computing Machinery, Inc, 2015. pp. 121-128
@inproceedings{688c53af44ae44cf97a6f90396145362,
title = "RAISTTP revisited to solve relaxed travel tournament problem",
abstract = "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.",
keywords = "Code refining, Immune algorithms, Tuning",
author = "Elizabeth Montero and Riff, {Mar{\'i}a Cristina}",
year = "2015",
month = "7",
day = "11",
doi = "10.1145/2739480.2754753",
language = "English",
pages = "121--128",
editor = "Sara Silva",
booktitle = "GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference",
publisher = "Association for Computing Machinery, Inc",

}

Montero, E & Riff, MC 2015, RAISTTP revisited to solve relaxed travel tournament problem. En S Silva (ed.), GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, Inc, pp. 121-128, 16th Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, 11/07/15. https://doi.org/10.1145/2739480.2754753

RAISTTP revisited to solve relaxed travel tournament problem. / Montero, Elizabeth; Riff, María Cristina.

GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference. ed. / Sara Silva. Association for Computing Machinery, Inc, 2015. p. 121-128.

Resultado de la investigación: Conference contribution

TY - GEN

T1 - RAISTTP revisited to solve relaxed travel tournament problem

AU - Montero, Elizabeth

AU - Riff, María Cristina

PY - 2015/7/11

Y1 - 2015/7/11

N2 - 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.

AB - 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.

KW - Code refining

KW - Immune algorithms

KW - Tuning

UR - http://www.scopus.com/inward/record.url?scp=84963652844&partnerID=8YFLogxK

U2 - 10.1145/2739480.2754753

DO - 10.1145/2739480.2754753

M3 - Conference contribution

SP - 121

EP - 128

BT - GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference

A2 - Silva, Sara

PB - Association for Computing Machinery, Inc

ER -

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