Award Date

1-1-1993

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Electrical and Computer Engineering

Number of Pages

49

Abstract

The Unit Commitment Problem (UCP) in electric power system problem that consists of finding the startup and shutdown schedule of generating units over a period of time (e.g., 24 hrs) so that the operating cost is minimized; The UCP is often characterized by its prohibitive computational time and memory space requirement. The thesis investigates some computational aspects of the problem in an effort to improve the CPU time as well as the quality of the solution. Two algorithms that show significant improvement over existing methods are presented: One is based on the dynamic programming approach and designed for implementation on high performance computing machines with vector and parallel processing capabilities. The other is based on genetic algorithm techniques and designed for implementation on regular engineering workstations or fast personal computers; Finally, the effect of transmission losses on the quality of the optimal scheduling and the computational time are investigated. Simulation results on 26- and 44-unit power systems are presented to illustrate the effectiveness of the proposed algorithms.

Keywords

Electric; Generating; Optimal; Power; Scheduling; System; Thermal; Units

Controlled Subject

Electrical engineering

File Format

pdf

File Size

1454.08 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.

Identifier

https://doi.org/10.25669/lovr-g2in


Share

COinS