Optimal batting orders in one-day cricket

Authors:
Tim B. Swartz;Paramjit S. Gill;David Beaudoin;Basil M. deSilva
Affiliations:
Department of Statistics and Actuarial Science, Simon Fraser University, Burnaby, BC, Canada;Department of Mathematics and Statistics, Okanagan University College, Kelowna, BC, Canada;Départment de mathématiques et de statistique, Cité universitaire, Québec, QC, Canada;Department of Mathematics and Statistics, RMIT University, Melbourne, Victoria, Australia
Venue:
Computers and Operations Research
Year:
2006

Citing 1
Cited 1

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Cricket team selection using evolutionary multi-objective optimization

SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper concerns the search for optimal or nearly optimal batting orders in one-day cricket. A search is conducted over the space of permutations of batting orders where simulated annealing is used to explore the space. A non-standard aspect of the optimization is that the objective function (which is the mean number of runs per innings) is unavailable and is approximated via simulation. The simulation component generates runs ball by ball during an innings taking into account the state of the match and estimated characteristics of individual batsmen. The methods developed in the paper are applied to the national team of India based on their performance in one-day intemational cricket matches.