.png){kind=icon}
Return
A parallel genetic algorithm approach to solving the unit commitment problem: Implementation on the transputer networks
.png){kind=icon}
PRE
AI
DOI：10.1109/59.589638.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Through a constraint handling technique, this paper proposes a parallel genetic algorithm (GA) approach to solving the thermal unit commitment (UC) problem. The developed algorithm is implemented on an eight-processor transputer network, processors of which are arranged in master-slave and dual-direction ring structures, respectively. The proposed approach has been tested on a 38-unit thermal power system over a 24-hour period. Speed-up and efficiency for each topology with different number of processor are compared to those of the sequential GA approach. The proposed topology of dual-direction ring is shown to be well amenable to parallel implementation of the GA for the UC problem.
Keywords:
unit commitment
combinatorial optimization
parallel genetic algorithm
transputer network
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more