This thesis investigates the Tangle Towns Tie-Breaker problem produced by the Los Angeles Times newspaper from the 1960s to the 1980s. The problem is a special case of the multidimensional knapsack problem. A linear programming based approach and a modified genetic algorithm approach are taken in an attempt to surpass the winning scores of the contest. The linear programming based approach leads to optimal solutions that improve on the winners of the newspaper contest. The genetic algorithm approach does not result in an improvement.
Improvements on both approaches are made using a ranking system. Each word is measured by how efficient it is when added to the solution. This results in a shorter runtime for the linear programming approach and higher scores for the genetic algorithm approach.
|Commitee:||Englert, Burkhard, Gittleman, Arthur|
|School:||California State University, Long Beach|
|Department:||Computer Engineering and Computer Science|
|School Location:||United States -- California|
|Source:||MAI 51/05M(E), Masters Abstracts International|
|Subjects:||Operations research, Computer science|
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