AISTTP: An artificial immune algorithm to solve Traveling Tournament Problems
暂无分享,去创建一个
[1] Hans W. Guesgen,et al. DFS* and the Traveling Tournament Problem , 2009, CPAIOR.
[2] María Cristina Riff,et al. On-the-fly calibrating strategies for evolutionary algorithms , 2011, Inf. Sci..
[3] Hans W. Guesgen,et al. An ant colony optimization approach to the traveling tournament problem , 2009, GECCO.
[4] Jonathan Timmis,et al. Artificial immune systems - a new computational intelligence paradigm , 2002 .
[5] Luca Di Gaspero,et al. A composite-neighborhood tabu search approach to the traveling tournament problem , 2007, J. Heuristics.
[6] Fernando José Von Zuben,et al. Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..
[7] Luiz Antonio Nogueira Lorena,et al. Clustering Search Approach for the Traveling Tournament Problem , 2007, MICAI.
[8] Pascal Van Hentenryck,et al. A simulated annealing approach to the traveling tournament problem , 2006, J. Sched..
[9] Katja Verbeeck,et al. A New Learning Hyper-heuristic for the Traveling Tournament Problem , 2009 .
[10] Celso C. Ribeiro,et al. Heuristics for the mirrored traveling tournament problem , 2007, Eur. J. Oper. Res..
[11] X. Zhang,et al. A simulated annealing and hill-climbing algorithm for the traveling tournament problem , 2006, Eur. J. Oper. Res..
[12] George L. Nemhauser,et al. The Traveling Tournament Problem Description and Benchmarks , 2001, CP.
[13] Graham Kendall,et al. An Ant Based Hyper-heuristic for the Travelling Tournament Problem , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.
[14] María Cristina Riff,et al. A graph-based immune-inspired constraint satisfaction search , 2010, Neural Computing and Applications.
[15] Pascal Van Hentenryck,et al. Population-Based Simulated Annealing for Traveling Tournaments , 2007, AAAI.