Date of Award

5-2012

Document Type

Thesis

Degree Name

Master of Science (MS)

Legacy Department

Industrial Engineering

Advisor

Mason, Scott J

Committee Member

Ferrell , William G

Committee Member

Kurz , Mary Elizabeth

Abstract

In this thesis, we present a new metaheuristic algorithm for analyzing challenging optimization problems. Initial testing reveals the potential for the algorithm, which is based on the rooting phenomena found in plants in nature, to quickly produce effective solutions to challenging combinatorial optimization problems in the class NP. We present computational results describing the proposed metaheuristic's efficacy for an important class of scheduling problems and discuss areas of future work and application.

Share

COinS