Unit commitment - a survey and comparison of conventional and nature inspired algorithms

IJBIC(2014)

引用 41|浏览4
暂无评分
摘要
Unit commitment problem UCP which has a significant influence on secure and economic operation of power systems is considered to be one of the most difficult optimisation problems due to the number/type of variables and constraints present. To provide quality solutions to UCP several solution methodologies that include deterministic and stochastic search algorithms have been proposed. Deterministic and stochastic algorithms have their own share of advantages and disadvantages. In this paper, we provide a literature survey on the algorithms developed for UCP and try to compare their performance on some standard benchmark problems by taking the results from the literature. The literature survey along with the performance comparison will be useful for the researchers in the area of power engineering.
更多
查看译文
关键词
differential evolution,evolutionary algorithms,simulated annealing,genetic algorithms,unit commitment,harmony search
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要