.png){kind=icon}
返回
Reliability constrained generation expansion planning by a modified shuffled frog leaping algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijepes.2014.07.073.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a modified shuffled frog leaping algorithm (MSFLA) to solve reliability constrained generation expansion planning (GEP) problem. GEP, as a crucial issue in power systems, is a highly constrained non-linear discrete dynamic optimization problem. To solve this complicated problem by MSFLA, a new frog leaping rule, associated with a new strategy for frog distribution into memeplexes, is proposed to improve the local exploration and performance of the SFLA. Furthermore, integer encoding, mapping procedure and penalty factor approach are implemented to improve the efficiency of the proposed methodology. To show the effectiveness of the method, it is applied to a test system for two planning horizon of 12 and 24 years. For the sake of methodology validation, an ordinary SFLA as well as a Genetic Algorithm (GA) are both applied to solve the same problem. Simulation results show the advantages of the proposed MSFLA over the SFLA and GA. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Shuffled frog leaping algorithm
Generation expansion planning
Probabilistic production simulation
Genetic Algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5
论文数:
1.1W
被引数:
3.1W
机构
引用论文
分享收藏Generation expansion planning (GEP) - A long-term approach using system dynamics and genetic algorithms (GAs).png)
ENERGY
ENERGYIF9.4
PREAI
分享收藏Optimization of water distribution network design using the Shuffled Frog Leaping Algorithm基于混合蛙跳算法的供水管网优化设计
PREAI
分享收藏分享收藏
查看更多内容