<![CDATA[Sports scheduling is a branch of optimization in operations research. sports scheduling has various constraints that are challenging for researchers to solve. International Timetabling Competition (ITC) 2021 is an optimization competition that provides sports scheduling problems. The main problem at ITC 2021 is determining the right schedule for a match. A schedule is feasible if it does not violate the existing hard constraints. The construction of a feasible initial solution can now be done using a constraint programming algorithm or an integer programming algorithm. However, both algorithms are quite complicated to implement. This research focuses on establishing a feasible initial solution in a way that is easy to implement. The method used is by optimizing hard constraint violations using the Late Acceptance Hill Climbing (LAHC) algorithm and Tabu Search with a Hyper-Heuristic framework that involves low level heuristics (LLH). The algorithm is run maximum with a time limit of 6 hours for each data. The results of the optimization of hard constraint violations using the LAHC algorithm and tabu search can produce a feasible initial solution of 44.44% or 24 of the 54 total datasets.]]>
Copyrights © 2021
