Unit Commitment Problems: A Comparison of Algorithms and Heuristics
Open Access
Author:
You, Fan
Graduate Program:
Industrial Engineering
Degree:
Master of Science
Document Type:
Master Thesis
Date of Defense:
None
Committee Members:
Mort D Webster, Thesis Advisor/Co-Advisor Jose Antonio Ventura, Thesis Advisor/Co-Advisor
Keywords:
Unit Commitment Dynamic Programming PCA Neural Networks
Abstract:
Unit commitment problems have been an area of research interest for many decades. The general unit commitment problem is a model used to determine when to utilize different energy generation resources in order to minimize the cost of electricity generation while satisfying demand under the presence of a variety of resource constraints. In this work, we compare variant models and algorithms for solving the unit commitment problem. We measure each model by comparing runtimes across a variety of time horizons with a selection of different scenarios.
