Date of Award
Master of Science in Computer Science
School of Computer Science and Engineering
Schubert, Keith Evan
Yu, Tong Lai
This research explores the idea that for certain optimization problems there is a way to parallelize the algorithm such that the parallel efficiency can exceed one hundred percent. Specifically, a parallel compiler, PC, is used to apply shortcutting techniquest to a metaheuristic Ant Colony Optimization (ACO), to solve the well-known Traveling Salesman Problem (TSP) on a cluster running Message Passing Interface (MPI). The results of both serial and parallel execution are compared using test datasets from the TSPLIB.
D'Souza, Sammy Raymond, "Parallelizing a nondeterministic optimization algorithm" (2007). Theses Digitization Project. 3084.