In this paper, we apply the ant colony optimization meta-heuristic to the Single Round Robin Maximum Value Problem, a problem from sports scheduling. This problem contains both feasibility constraints and an optimization goal. We approach this problem using a combination of the metaheuristic with backtracking search. We show how using constraint satisfaction techniques can improve the hybrid's performance. We also show that our approach performs comparably to integer programming and better than tabu search when applied to the Single Round Robin Maximum Value Problem.
展开▼
