Iterated Modified Tabu Search based Equitable Coloring for Scheduling Cricket World Cup Tournament

Abstract

In this article, an Iterated Modified Tabu Search (IMTS) approach is presented by improving certain aspects of general Tabu Search to enhance the approximation of the Equitable coloring problem (ECP) problem for a real-world problem of scheduling the ICC Cricket World Cup tournament. The proposed IMTS introduces new point generation mechanisms and parameter updating rules to achieve this objective of the tournament schedule. The IMTS algorithm defines different k-ECP instances and utilizes the search process to determine the optimal solution for an instance of k-ECP by estimating the minimum k-coloring value. An illustration of resolving the Cricket World Cup tournament scheduling problem using the proposed IMTS algorithm is provided. Also, an assessment of the IMTS is also performed on a commonly used benchmark instance. Both the results illustrate that the IMTS provided comparatively better solutions with high quality and computational efficiency.