Title :
A HCP-net for the unit commitment problem with time-dependent constraints
Author_Institution :
Inst. of Autom., Shanghai Jiao Tong Univ., China
Abstract :
A CP-net (colored Petri net) of an individual unit in dynamic programming approach for the unit commitment problem with time-dependent constraints is proposed. The CP-net is compared with the low-level net for the same problem and advantages for CP-nets in practical applications are obtained. A hierarchical CP-net is used to illustrate the parallel computing of different subnets of units in a group, and the HCP-net model of the problem will improve greatly the efficiency of algorithm for the same problem.
Keywords :
Petri nets; constraint theory; dynamic programming; graph colouring; parallel algorithms; power generation dispatch; power generation scheduling; HCP-net; dynamic programming; hierarchical CP-net; hierarchical colored Petri net; time-dependent constraints; unit commitment problem; Algorithm design and analysis; Assembly; Automation; Costs; Dynamic programming; Modems; Parallel processing; Petri nets; Power system dynamics; Power system modeling;
Conference_Titel :
Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress on
Print_ISBN :
0-7803-7268-9
DOI :
10.1109/WCICA.2002.1020742
