遗传算法以及机组调度问题.ppt

A Genetic Algorithm(GA) Solution To The Unit Commitment Problem 目录 Introduction Simulation Results Standard Genetic Algorithm Enhanced Genetic Algorithm The Unit Commitment（UC）Problem In A Power System Objective: to minimize total production costs with operating constraints Basic UC methods: Priority List (PL); Dynamic Programming (DP); Lagrangian Relaxation (LR); Branch-and-Bound; Benders Decomposition. Improved UC methods: Simulated Annealing; Hopfield Neural Networks; Expert Systems; Genetic Algorithm. Contributions of this paper This paper presented a Genetic Algorithm solution to the Unit Commitment problem. It enhanced a standard GA implementation with the addition of problem specific operators and the Varying Quality Function technique in order to obtain satisfactory unit commitment solutions. The Total Costs The Constraints a) System power balance (demand+losses+exports); b) System reserve requirements; c) Unit initial conditions; d) Unit high and low MW limits (economic, operating); e) Unit minimum-up time; f) Unit minimum-down time; g) Unit status restrictions (must-run, fixed-MW, unavailable, available); h) Unit rate limiits; i) Unit start-up ramps; j) Unit shut-down ramps; k) Unit flame stabilization fuel mix; l) Unit dual or alternate fuel usage; m) Unit or Plant fuel availability; Fuel costs Start-up costs Shut-down costs The Total Costs The Constraints System Constraints Local Constraints Local Constraints n) Plant crew constraints. Basic Solution Methods decomposing in time; optimal link-back pointer (backtracking); the curse of dimensionality (main problem); difficulty in treating time-depen