Abstract
This paper concerns a computer system which has been devised to timetable the county cricket matches in England. The context of the work is discussed and the many constraints and objectives described. Details of the solution method are given; it involves tabu search with a form of diversification dependent on the solution subcosts as well as the overall cost. Experiments are described which suggest that this type of diversification may have wide applicability to large, complex, multi-objective combinatorial problems.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wright, M. Timetabling County Cricket Fixtures Using a Form of Tabu Search. J Oper Res Soc 45, 758–770 (1994). https://doi.org/10.1057/jors.1994.120
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1994.120