RAIS<inf>TTP</inf> revisited to solve relaxed travel tournament problem. Montero, E. and Riff Rojas, M. C. In pages 121-128, 2015.
doi  abstract   bibtex   
© 2015 ACM.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.
@inproceedings{10.1145/2739480.2754753,
    abstract = "© 2015 ACM.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.",
    year = "2015",
    title = "RAIS<inf>TTP</inf> revisited to solve relaxed travel tournament problem",
    keywords = "Code refining , Immune algorithms , Tuning",
    pages = "121-128",
    doi = "10.1145/2739480.2754753",
    journal = "GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference",
    author = "Montero, Elizabeth and Riff Rojas, Maria Cristina"
}
Downloads: 0