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.
Original language | English |
---|---|
Title of host publication | GECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference |
Editors | Sara Silva |
Publisher | Association for Computing Machinery, Inc |
Pages | 121-128 |
Number of pages | 8 |
ISBN (Electronic) | 9781450334723 |
DOIs | |
Publication status | Published - 11 Jul 2015 |
Event | 16th Genetic and Evolutionary Computation Conference, GECCO 2015 - Madrid, Spain Duration: 11 Jul 2015 → 15 Jul 2015 |
Conference
Conference | 16th Genetic and Evolutionary Computation Conference, GECCO 2015 |
---|---|
Country/Territory | Spain |
City | Madrid |
Period | 11/07/15 → 15/07/15 |
Keywords
- Code refining
- Immune algorithms
- Tuning
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Science Applications
- Software