The traveling baseball fan problem is an extension of the classic traveling salesman problem, in which a sports fan wishes to travel to the stadium of every team in Major League Baseball and arrive there on a day when the team has a game scheduled. The fan's goal is to complete such a trip in the fewest total days possible, similar to the traveling salesman's goal of completing a trip of minimal total distance.
In this thesis we explore the background of the traveling salesman problem and how it can be extended with time windows for each destination. After researching others' attempts at solving similar problems, we develop a mathematical model and choose algorithms for solving an instance of the traveling baseball fan problem. We present results from our algorithms along with ideas for further research into the problem.
|Commitee:||Englert, Burkhard, Lam, Shui|
|School:||California State University, Long Beach|
|Department:||Computer Engineering and Computer Science|
|School Location:||United States -- California|
|Source:||MAI 51/04M(E), Masters Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be