GENERATION EXPANSION PLANNING BY A MODIFIED SFL ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JADIDOLESLAM M.; BIJAMI E.; EBRAHIMI A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING) Year:2011 | Volume:2 | Issue:1 Page(s): 27-44

Download Full-Text

Persian Verion

View:

1,566

Download:

Cites:

Information Journal Paper

Title

GENERATION EXPANSION PLANNING BY A MODIFIED SFL ALGORITHM

Author(s)

JADIDOLESLAM M. | BIJAMI E. | EBRAHIMI A. | Issue Writer Certificate

Keywords

SHUFFLED FROG LEAPING ALGORITHMQ3

COMBINATORIAL OPTIMIZATIONQ2

GENERATION EXPANSION PLANNINGQ2

PROBABILISTIC PRODUCTION SIMULATIONQ3

POWER SYSTEM RELIABILITYQ2

Abstract

In this paper, GENERATION EXPANSION PLANNING (GEP), is modeled as an optimization problem in which the objective function is to minimize the total investment, operation, and outage (energy not served) costs of power system as well as salvage value of investment costs. Generation system reliability is assessed and provided by means of EENS and LOLP indices. To solve the GEP problem, a new Modified Shuffled Frog Leaping namely MSFL algorithm is proposed. A new frog leaping rule and a new strategy for frog distribution into memeplexes is introduced to improve the local exploration and performance of the original SFL algorithm. To show the effectiveness of the MSFL algorithm, it is applied to a test system with 15 existing power plants and 5 types of new candidates, for a 12-years and a 24-years planning horizon. The original SFL algorithm and the Genetic Algorithm (GA) are also applied to solve the GEP problem. Simulation results show the advantages of the proposed MSFL algorithm over the original SFL and GA.

Cites

A NEW HYBRID SHUFFLED FROG LEAPING ALGORITHM TO SOLVE NON-CONVEX ECONOMIC LOAD DISPATCH PROBLEM

References

No record.

Cite

APA: Copy

JADIDOLESLAM, M., BIJAMI, E., & EBRAHIMI, A.. (2011). GENERATION EXPANSION PLANNING BY A MODIFIED SFL ALGORITHM. COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING), 2(1), 27-44. SID. https://sid.ir/paper/203101/en

Vancouver: Copy

JADIDOLESLAM M., BIJAMI E., EBRAHIMI A.. GENERATION EXPANSION PLANNING BY A MODIFIED SFL ALGORITHM. COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING)[Internet]. 2011;2(1):27-44. Available from: https://sid.ir/paper/203101/en

IEEE: Copy

M. JADIDOLESLAM, E. BIJAMI, and A. EBRAHIMI, “GENERATION EXPANSION PLANNING BY A MODIFIED SFL ALGORITHM,” COMPUTATIONAL INTELLIGENCE IN ELECTRICAL ENGINEERING (INTELLIGENT SYSTEMS IN ELECTRICAL ENGINEERING), vol. 2, no. 1, pp. 27–44, 2011, [Online]. Available: https://sid.ir/paper/203101/en

Related Journal Papers