.png){kind=icon}
Return
Parallel micro genetic algorithm for constrained economic dispatch
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2002.800948.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a parallel micro genetic algorithm (PMGA) for solving ramp rate constrained economic dispatch (ED) problems for generating units with nonmonotonically and monotonically increasing incremental cost (IC) functions. The developed PMGA algorithm is implemented on the thirty-two-processor Beowulf cluster with ethernet switches network on the systems with the number of generating units ranging from 10 to 80 over the entire dispatch periods. The PMGA algorithm carefully schedules its processors, computational loads, and synchronization overhead for the best performance. The speedup upper bounds and the synchronization overheads on the Beowulf cluster are shown on different system sizes and different migration frequencies. The proposed PMGA is shown to be viable to the online implementation of the constrained ED due to substantial generator fuel cost savings and high speedup upper bounds.
Keywords:
Beowulf cluster
economic dispatch
parallel micro genetic algorithm
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}
ShareSaveShareSaveShareSaveEmbodied emotion concepts: How generating words about pride and disappointment influences posture
PREAI
ShareSave no more
no more