Dissertation/Thesis Abstract

Exact solutions to combinatorial optimizations and the traveling baseball fan problem
by Terrell, Neal D., M.S., California State University, Long Beach, 2012, 58; 1521644
Abstract (Summary)

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.

Indexing (document details)
Advisor: Ebert, Todd
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
Subjects: Computer science
Publication Number: 1521644
ISBN: 978-1-267-79073-6
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy