A Major League team’s goal is to win, and to win they need to score runs. The consensus is it takes 9-10 runs to provide a win over the course of the season. A manager makes many decisions that can affect the outcome of a game. One of the factors that can affect how many runs a team scores is the order in which they hit. The manager can set the batting lineup in any order he wishes. The objective of this study is to determine whether there is a computer algorithm that can maximize the number of runs scored by changing the batting order of a given starting lineup. Two methods will be tested: Simulated Annealing and Genetic Algorithm. The process will be deemed a success if there one of these methods produces a larger increase in wins than a batting order put together with conventional wisdom. If it is a success, then utilizing the algorithm should result in the team scoring more runs, winning more games, and ultimately increasing their chances of playing in the postseason.