This paper proposes an innovative genetic algorithm (GA) approach to solving the thermal unit commitment (UC) problem using a constraint satisfaction technique. Minimum up-time and down-time constraints on the generating units are embedded in the delicately designed binary strings to represent the on-off states of the units. Ramp rate constraints on the units being started up or shut down are tackled in the economic dispatch subprogram by limiting the associated maximum available capacities for generating. Violations of the other constraints are considered by integrating penalty factors into the cost function. The developed algorithm is further paralleled on an 8-processor transputer network, processors of which are arranged in master-slave and dual-direction ring structures, respectively. The proposed approach is tested on the simple 4 thermal units system and the practical Taiwan Power system of 38 thermal units. Speed-up and efficiency for each structure with different number of processors are compared to those of the sequential GA approach. The proposed approach is shown to be well amenable to parallel implementation.
|Number of pages||6|
|Publication status||Published - 1995 Dec 1|
|Event||Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2) - Singapore, Singapore|
Duration: 1995 Nov 21 → 1995 Nov 23
|Other||Proceedings of the 1995 International Conference on Energy Management and Power Delivery, EMPD'95. Part 1 (of 2)|
|Period||95-11-21 → 95-11-23|
All Science Journal Classification (ASJC) codes