Back to search

Clemson University

A NEW METAHEURISTIC ALGORITHM MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Industrial Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Nemati, Behzad
Contributors dc:contributor
  • Mason, Scott J
  • Ferrell , William G
  • Kurz , Mary Elizabeth

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/1206

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Nemati, Behzad. A NEW METAHEURISTIC ALGORITHM MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS. Thesis thesis, https://open.clemson.edu/all_theses/1206