Date of Award
2020
Document Type
Thesis
Degree Name
Master of Science (MS)
Department
Computer Science
Committee Chair
Huaming Zhang
Committee Member
Grant Zhang
Committee Member
Joshua Booth
Subject(s)
Graph theory, Metaheuristics, Ants--Behavior--Mathematical models
Abstract
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.
Recommended Citation
Volz, Michael, "Application of metaheuristics to a subset selection graph problem" (2020). Theses. 322.
https://louis.uah.edu/uah-theses/322