This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2025-212456
If you've NEVER registered a DOI in your Lattes, check our tutorial!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.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper