Modern heuristic techniques for combinatorial problems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Lamarckian Evolution, The Baldwin Effect and Function Optimization
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Solving the Sports League Scheduling Problem with Tabu Search
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
A Schedule-Then-Break Approach to Sports Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
The Traveling Tournament Problem Description and Benchmarks
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling a Major College Basketball Conference
Operations Research
Clustering search approach for the traveling tournament problem
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
| Hi-index | 0.01 |
The Mirrored Traveling Tournament Problem (mTTP) is an optimization problem that represents certain types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of hybrid heuristic to solve the mTTP, using an evolutionary algorithm in association with the metaheuristic Simulated Annealing. It suggests the use of Genetic Algorithm with a compact genetic codification in conjunction with an algorithm to expand the code. The validation of the results will be done in benchmark problems available in literature and real benchmark problems, e.g. Brazilian Soccer Championship.