Maximizing the Runs Scored by a Team in Cricket using Genetic Algorithm
Open accessAbstract
Batting teams get two resources in cricket to score runs with, viz. wickets and balls. Trying to score as many runs as possible off every ball a team faces risks losing wickets. Trying to preserve wickets comes at the cost of not enough runs being scored. Thus, to maximize the runs scored, teams need to make efficient use of the balls and wickets available to them. To that end, teams primarily employ two types of batsmen-aggressive batsmen who try to score as many runs as possible off the balls they face and defensive batsmen who try to protect their wickets. Having too many aggressive batsmen helps a team score more runs off the balls they face but it stands the risk of a team losing all its wickets before they face all of their allotted balls. Having too many defensive batsmen helps a team face all the balls allotted to them but they may not end up scoring enough runs. Hence, selecting the right combination of defensive and aggressive batsmen is essential to maximize the runs a batting team scores. However, this is a computationally complex problem to solve. This study proposes the use of genetic algorithm to optimize the batting lineup of a team to help it maximize the runs scored in an innings. The test results indicate, by using the genetic algorithm, the number of runs scored batting first by the full member teams in the last five years can be improved by 5.46% on average.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
No references could be resolved yet.
Research works printed but not linked: 15
- H.S. Altham and E.W. Swanton, A History of Cricket. London: Allen & Unwin, 1948, pp. 15-22.
- S. Ray, Management of the Cricketing Ecosystem. Singapore: Springer, 2022, pp. 119-140.
- S. Katoch, S.S. Chauhan and V. Kumar, "A review on genetic algorithm: past, present, and future," Multimedia Tools and Application, vol. 80, no. 5, pp. 8091-8126, 2021. DOI: 10.1007/s11042-020-10139-6. · DOI · Paper page
- D. Whitley, "A genetic algorithm tutorial," Statistics and Computing, vol. 4, pp. 65-85, 1994. DOI: 10.1007/BF00175354. · DOI
- S.M. Burney, N. Mahmood, K. Rizwan and U. Amjad, "A Generic Approach for Team Selection in Multiplayer Games using Genetic Algorithm," International Journal of Computer Applications, vol. 40, no. 17, pp. 11-17, 2012. DOI: 10.5120/5071-7440. · DOI
- I. Kusumsiri and S. Perera, "Optimal One Day International Cricket Team Selection by Genetic Algorithm," International Journal of Sciences: Basic and Applied Research, vol. 36, no. 4, pp. 213-221, 2017.
- G.R. Amin, and S.K. Sharma, "Cricket team selection using data envelopment analysis," European Journal of Sport Science, vol. 14, no. 1, pp. 369-376, 2014. DOI: 10.1080/17461391.2012.705333. · DOI
- S. Chand, H.K. Singh and T. Ray, "Team Selection Using Multi- /Many-Objective Optimization with Integer Linear Programming," 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1-8, 2018. DOI: 10.1109/CEC.2018.8477945. · DOI
- H. Perera, J. Davis, and T.B. Swartz, "Optimal lineups in Twenty20 cricket," Journal of Statistical Computation and Simulation, vol. 86, no. 14, pp. 2888-2900, 2016. DOI: 10.1080/00949655.2015.1136629. · DOI · Paper page
- T.B. Swartz, P.S. Gill, D. Beaudoin and B.M. deSilva, "Optimal batting orders in one-day cricket," Computers and Operations Research, vol. 33, no. 7, pp. 1939-1950, 2006. DOI: 10.1016/j.cor.2004.09.031. · DOI
- F. Ahmed, A. Jindal and K. Deb, "Cricket Team Selection Using Evolutionary Multi-objective Optimization," Swarm, Evolutionary, and Memetic Computing (SEMCCO), pp. 71-78, 2011. DOI: 10.1007/978-3-642-27242-4_9. · DOI
- M. Ovens and B. Bukiet, "A mathematical modelling approach to one- day cricket batting orders," Journal of Sports Science and Medicine, vol. 5, no. 4, pp. 495-502, 2006.
- S. Han, "Batting order optimization by genetic algorithm," Proceedings of the 14th annual conference companion on Genetic and evolutionary computation (GECCO '12), pp. 599-602, 2012. DOI: 10.1145/2330784.2330882. · DOI
- A.R. Joshi, P.P Raut, V. Desai, H. Doshi and K. Shah, "Cricket Team Selection Using Artificial Intelligence," Proceedings of International Conference on Advances in Communication and Computing Technologies (ICACACT), pp. 27, 2013.
- F.A. Fortin, F.M. De Rainville, M.A. Gardner, M. Parizeau and C. Gagné, "DEAP: Evolutionary Algorithms Made Easy," Journal of Machine Learning Research, vol. 18, no. 1, pp. 2171-2175, 2012.
Cited by
Sorted by citations
Position-specific fielding instances and utilisation in professional men’s T20 cricket
Lee, T. A., Novak, A. R., & Pickering Rodriguez, E. C. (2026) · International Journal of Performance Analysis in Sport · doi:10.1080/24748668.2025.2492980 · Cited by 1 · see citing works
“Since being introduced in 2003 (Kitchin, 2008) a short format of limited overs cricket known as T20 has proven to be commercially appealing (Rumford, 2011) and has played a pivotal role in increasing the international popularity of the sport (Krishnamohan, 2023; Rana & Bagchi, 2020; Ray, 2022).”
- Authors
- Krishnamohan, T.
- Affiliations
- University of Moratuwa (LK)
- Corresponding author
- Krishnamohan, Theviyanthan
- Venue
- International Journal of Electrical and Computer Engineering Research
- Published
- 2023-09-15
- Volume
- 3
- Issue
- 3
- Pages
- 7-12
- ISSN
- 2791-6677 (ISSN-L)
- OpenAlex
- W4386783141
- Cited by
- 2
- References
- 0
- Citations by year
- 2025: 1 · 2024: 1
- FWCI
- 0.41
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- Locations
- International Journal of Electrical and Computer Engineering Research (publishedVersion, cc-by-nc-nd)
- Topics
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Sports Analytics and Performance
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
- Keywords
- cricket batting, wickets, genetic algorithm
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
