Dynamic economic load dispatch by applying dynamic programming to a genetic algorithm
First Claim
Patent Images
1. A process comprising:
- receiving at a computer processor a dynamic constraint on a genetic algorithm;
applying dynamic programming to the genetic algorithm in the computer processor such that the genetic algorithm accommodates the dynamic constraint; and
allocating load demand using the computer processor over a finite number of time intervals among a number of power generating units as a function of the constraint on the genetic algorithm and the dynamic programming of the genetic algorithm;
wherein the receiving the dynamic constraint and the applying the dynamic programming to the genetic algorithm comprises modifying one or more initialization, crossover, and mutation operators, thereby maintaining load dispatch solutions evolving freely near a feasible region; and
wherein the modifying of the mutation operator comprises heuristically maintaining locations of possible mutation points, and providing a positive mutation operator to reduce fuel cost and a negative mutation operator to achieve load equality.
2 Assignments
0 Petitions
Accused Products
Abstract
In an embodiment, a system and method provide a constraint on a genetic algorithm, and further provide dynamic programming capability to the genetic algorithm. The system and method then allocate load demand over a finite number of time intervals among a number of power generating units as a function of the constraint on the genetic algorithm and the dynamic programming capability of the genetic algorithm.
12 Citations
16 Claims
-
1. A process comprising:
-
receiving at a computer processor a dynamic constraint on a genetic algorithm; applying dynamic programming to the genetic algorithm in the computer processor such that the genetic algorithm accommodates the dynamic constraint; and allocating load demand using the computer processor over a finite number of time intervals among a number of power generating units as a function of the constraint on the genetic algorithm and the dynamic programming of the genetic algorithm; wherein the receiving the dynamic constraint and the applying the dynamic programming to the genetic algorithm comprises modifying one or more initialization, crossover, and mutation operators, thereby maintaining load dispatch solutions evolving freely near a feasible region; and wherein the modifying of the mutation operator comprises heuristically maintaining locations of possible mutation points, and providing a positive mutation operator to reduce fuel cost and a negative mutation operator to achieve load equality. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A machine readable medium storing instructions, which when executed by a processor, cause the processor to perform a process comprising:
-
receiving a dynamic constraint on a genetic algorithm; applying dynamic programming to the genetic algorithm such that the genetic algorithm accommodates the dynamic constraint; and allocating load demand over a finite number of time intervals among a number of power generating units as a function of the constraint on the genetic algorithm and the dynamic programming of the genetic algorithm; wherein the receiving a dynamic constraint and the applying dynamic programming to the genetic algorithm comprises modifying one or more initialization, crossover, and mutation operators, thereby maintaining load dispatch solutions evolving freely near a feasible region; and wherein the modifying of the mutation operator comprises heuristically maintaining locations of possible mutation points, and providing a positive mutation operator to reduce fuel cost and a negative mutation operator to achieve load equality. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A system comprising:
-
a computer processor configured to receive a dynamic constraint on a genetic algorithm; a computer processor configured to apply dynamic programming to the genetic algorithm, such that the genetic algorithm accommodates the dynamic constraint; and a computer processor configured to allocate load demand over a finite number of time intervals among a number of power generating units as a function of the constraint on the genetic algorithm and the dynamic programming of the genetic algorithm; wherein the reception of a dynamic constraint and the application of dynamic programming to the genetic algorithm comprises modifying one or more initialization, crossover, and mutation operators, thereby maintaining load dispatch solutions evolving freely near a feasible region; and wherein the modifying of the mutation operator comprises heuristically maintaining locations of possible mutation points, and providing a positive mutation operator to reduce fuel cost and a negative mutation operator to achieve load equality. - View Dependent Claims (16)
-
Specification