Michael Volz

Date of Award


Document Type


Degree Name

Master of Science (MS)


Computer Science

Committee Chair

Huaming Zhang

Committee Member

Grant Zhang

Committee Member

Joshua Booth


Graph theory., Metaheuristics., Ants--Behavior--Mathematical models.


A graph problem is presented in which the objective is to remove links from a graph while maintaining path length and redundancy requirements. A branch-and-bound solution is presented, which is able to deterministically solve the problem for smaller inputs but fails to scale with graph size. An ant colony optimization approach is then presented, which is able to solve the problem stochastically with high probability and low runtime.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.