Population-based simulated annealing for traveling tournaments

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 267-272

  Van Hentenryck, Pascal ^a   Vergados, Yannis ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MACRO-INTENSIFICATION; POPULATION-BASED SIMULATED ANNEALING; SPORT-SCHEDULING APPLICATION;

ALGORITHMS; BENCHMARKING; COMPUTER SIMULATION; SCHEDULING; SIMULATED ANNEALING;

ARTIFICIAL INTELLIGENCE;

EID: 36348984990     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Anagnostopoulos, A.; Michel, L.; Van Hentenryck, P.; and Vergados, Y. 2003. A Simulated Annealing Approach to the Traveling Tournament Problem. In CP-AI-OR'03.
2. Anagnostopoulos, A.; Michel, L.; Van Hentenryck, P.; and Vergados, Y. 2006. A Simulated Annealing Approach to the Traveling Tournament Problem. Journal of Scheduling 9:177-193.
3. Asahiro, Y; Ishibashi, M.; and Yamashita, M. 2003. Independent and cooperative parallel search methods. Independent and Cooperative Parallel Search Methods 18(2):129-141.
4. Benoist, T.; Laburthe, F.; and Rottembourg, B. 2001. Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In CPAIOR 2001, 15-26.
5. Di Gaspero, L., and Schaerf, A. 2006. A composite-neighborhood tabu search approach to the traveling tournament problem. Journal of Heuristics. To appear.
6. Easton, K.; Nemhauser, G.; and Trick, M. 2001. The Traveling Tournament Problem Description and Benchmarks. In CP'01, 580-589. Springer-Verlag.
7. Janaki Ram, D.; Sreenivas, T. H.; and Ganapathy Subramaniam, K. 1996. Parallel simulated annealing algorithms. J. Parallel Distrib. Comput. 37(2):207-212.
8. Laguna, M., and Marti, R. 2003. Scatter Search. Kluwer Academic Publishers.
9. Lim, A.; Rodrigues, B.; and Zhang, X. 2006. A simulated annealing and hill-climbing algorithm for the traveling tournament problem. European Journal of Operational Research 174(3):1459-1478.
10. Norman, M., and Moscato, P. 1991. A competitive and cooperative approach to complex combinatorial search. In 20th Informatics and Operations Research Meeting.
11. Onbaşoǧlu, E., and Özdamar, L. 2001. Parallel simulated annealing algorithms in global optimization. J. of Global Optimization 19(1):27-50.
12. Ribeiro, C., and Urrutia, S. 2007. Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research 179(3):775-787.
13. Trick, M. 2002-2006. Challenge traveling tournament problems. http://mat.gsia.cmu.edu/TOURN/.
14. Van Hentenryck, P., and Vergados, Y. 2006. Traveling tournament scheduling: A systematic evaluation of simulated annealling. In CPAIOR 2006, 228-243. Springer.