 |
General: 663 |
P8: Using Genetic Algorithm to solve the Minimum Labeling Spanning Tree Problem
Author: Oliver Rourke , Advisor: Bruce Golden (BMGT)
Problem Statement Presentation
Project Proposal
Abstract
Genetic Algorithms (GAs) have shown themselves to be very powerful tools for a wide variety of combinatorial optimization problems. Through this project I hope to implement a GA to solve the Minimum Labeling Spanning Tree (MLST) problem (a combinatorial optimization problem). If time permits, I may attempt to modify the code to solve another combinatorial optimization problem. Additionally, I will develop a parallel implementation of the GA, which will involve designing and testing various inter-processor communication schemes. The eventuating parallel GA will be tested on a database of problems, comparing results and running time with other serial heuristics proposed in the literature. Finally, the parallel heuristic will be analyzed to determine how performance scales with the number of processors.
MidYear Progress Report and
Presentation
Final Presentation ,
Final Report
