An optimisation model to determine batting order in baseball

Paul Sugrue, Anuj Mehrotra

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Baseball teams face the problem of choosing a set of nine players to start in each game and of determining a sequence in which these nine players bat. The objective is typically to maximise the offensive capability of the team. In baseball, the payoffs associated with a slight statistical advantage can be huge. While these are difficult to quantify exactly, the multimillion dollar contracts with the players and the managers suggest that even a few more wins every year are significant. We model this problem of choosing the players and of determining their batting order as a problem of finding the longest simple cycle in a graph and demonstrate our methodology by proposing batting orders for the Florida Marlins. We also explain how our model can also be useful in quantifying the benefits of trading players and for predicting the outcome.

Original languageEnglish (US)
Pages (from-to)39-46
Number of pages8
JournalInternational Journal of Operational Research
Volume2
Issue number1
DOIs
StatePublished - Jan 15 2007

Fingerprint

Baseball
Optimization model
Graph
Methodology
Managers

Keywords

  • Batting order
  • Integer programming
  • Longest cycle
  • Optimisation

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

An optimisation model to determine batting order in baseball. / Sugrue, Paul; Mehrotra, Anuj.

In: International Journal of Operational Research, Vol. 2, No. 1, 15.01.2007, p. 39-46.

Research output: Contribution to journalArticle

@article{c35d10e7e4624e1e92f9ac314e42f033,
title = "An optimisation model to determine batting order in baseball",
abstract = "Baseball teams face the problem of choosing a set of nine players to start in each game and of determining a sequence in which these nine players bat. The objective is typically to maximise the offensive capability of the team. In baseball, the payoffs associated with a slight statistical advantage can be huge. While these are difficult to quantify exactly, the multimillion dollar contracts with the players and the managers suggest that even a few more wins every year are significant. We model this problem of choosing the players and of determining their batting order as a problem of finding the longest simple cycle in a graph and demonstrate our methodology by proposing batting orders for the Florida Marlins. We also explain how our model can also be useful in quantifying the benefits of trading players and for predicting the outcome.",
keywords = "Batting order, Integer programming, Longest cycle, Optimisation",
author = "Paul Sugrue and Anuj Mehrotra",
year = "2007",
month = "1",
day = "15",
doi = "10.1504/IJOR.2007.011442",
language = "English (US)",
volume = "2",
pages = "39--46",
journal = "International Journal of Operational Research",
issn = "1745-7645",
publisher = "Inderscience Enterprises Ltd",
number = "1",

}

TY - JOUR

T1 - An optimisation model to determine batting order in baseball

AU - Sugrue, Paul

AU - Mehrotra, Anuj

PY - 2007/1/15

Y1 - 2007/1/15

N2 - Baseball teams face the problem of choosing a set of nine players to start in each game and of determining a sequence in which these nine players bat. The objective is typically to maximise the offensive capability of the team. In baseball, the payoffs associated with a slight statistical advantage can be huge. While these are difficult to quantify exactly, the multimillion dollar contracts with the players and the managers suggest that even a few more wins every year are significant. We model this problem of choosing the players and of determining their batting order as a problem of finding the longest simple cycle in a graph and demonstrate our methodology by proposing batting orders for the Florida Marlins. We also explain how our model can also be useful in quantifying the benefits of trading players and for predicting the outcome.

AB - Baseball teams face the problem of choosing a set of nine players to start in each game and of determining a sequence in which these nine players bat. The objective is typically to maximise the offensive capability of the team. In baseball, the payoffs associated with a slight statistical advantage can be huge. While these are difficult to quantify exactly, the multimillion dollar contracts with the players and the managers suggest that even a few more wins every year are significant. We model this problem of choosing the players and of determining their batting order as a problem of finding the longest simple cycle in a graph and demonstrate our methodology by proposing batting orders for the Florida Marlins. We also explain how our model can also be useful in quantifying the benefits of trading players and for predicting the outcome.

KW - Batting order

KW - Integer programming

KW - Longest cycle

KW - Optimisation

UR - http://www.scopus.com/inward/record.url?scp=33846073633&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846073633&partnerID=8YFLogxK

U2 - 10.1504/IJOR.2007.011442

DO - 10.1504/IJOR.2007.011442

M3 - Article

AN - SCOPUS:33846073633

VL - 2

SP - 39

EP - 46

JO - International Journal of Operational Research

JF - International Journal of Operational Research

SN - 1745-7645

IS - 1

ER -