Iterated Local Search and Simulated Annealing Hybrid Algorithm for the Timetable Problem of Brazilian Volleyball Superliga Matches.

- 325671
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

This work presents a solution based on the hybrid algorithm Iterated Local Search with Simulated Annealing to address the Schedule Timetabling Problem for Volleyball Games in the Brazilian League. This problem involves finding the best organization of championship games to minimize the distance traveled by teams, thereby reducing transportation costs and increasing the time available for rest and athlete preparation. The proposed method for solving the problem is based on the metaheuristic Iterated Local Search, which, starting from an optimal local solution, undergoes iterative perturbations. The solutions obtained after the disturbance are then sent to Simulated Annealing, which performs the local search. In this work, the proposed approach achieved significantly better results than the current solution used by the Brazilian League, yielding, on average, solutions that are 48.24% better.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal do Espírito Santo (UFES)
Track
  • 12. MH – Metaheurístics
Keywords
Brazilian Volleyball Super league
Game Scheduling
Iterated Local Search
Simulated Annealing
Metaheuristics