Application of Shuffled Frog Leaping Algorithm to Long Term Generation Expansion Planning

Jadidoleslam, M.; Bijami, E.; Amiri, N.; Ebrahimi, A.; Askari, J.
April 2012
International Journal of Computer & Electrical Engineering;Apr2012, Vol. 4 Issue 2, p115
Academic Journal
This paper presents the application of an efficient shuffled frog leaping algorithm (SFLA) to solve the optimal generation expansion planning (GEP) problem. The SFLA is a meta-heuristic search method inspired by natural memetics. It combines the advantages of both genetic-based memetic algorithms and social behavior based algorithm of particle swarm optimization. Least-cost GEP is concerned with a highly constrained non-linear discrete dynamic optimization problem. In this paper the proposed formulation of problem, determines the optimal investment plan for adding power plants over a planning horizon to meet the demand criteria, fuel mix ratio, and the reliability criteria. To test the proposed SFLA method, it is simulated for two test systems in a time horizon of 10 and 20 years respectively. The obtained results show that compared to the traditional methods, the SFLA method can provide better solutions for the GEP problem, especially for a longer time horizon.


Related Articles

  • An Evolutionary Non-Linear Great Deluge Approach for Solving Course Timetabling Problems. Henry Obit, Joe; Ouelhadj, Djamila; Landa-Silva, Dario; Alfred, Rayner // International Journal of Computer Science Issues (IJCSI);Jul2012, Vol. 9 Issue 4, p1 

    The aim of this paper is to extend our non-linear great deluge algorithm into an evolutionary approach by incorporating a population and a mutation operator to solve the university course timetabling problems. This approach might be seen as a variation of memetic algorithms. The popularity of...

  • An Improved Memetic Search in Artificial Bee Colony Algorithm. Kumar, Sandeep; Kumar Sharma, Vivek; Kumari, Rajani // International Journal of Computer Science & Information Technolo;2014, Vol. 5 Issue 2, p1237 

    Artificial Bee Colony (ABC) is a swarm optimization technique. This algorithm generally used to solve nonlinear and complex problems. ABC is one of the simplest and up to date population based probabilistic strategy for global optimization. Analogous to other population based algorithms, ABC...

  • Parallelization of Memetic Algorithms and Electromagnetism Metaheuristics for the Problem of Scheduling in the production Systems of HFS type. Zerrouki, Kadda; Belkadi, Khaled // International Journal of Computer Science Issues (IJCSI);Jan2013, Vol. 10 Issue 1, p639 

    The metaheuristics are approximation methods which deal with difficult optimization problems. The Work that we present in this paper has primarily as an objective the adaptation and the implementation of two advanced metaheuristics which are the Memetic Algorithms (MA) and the Electromagnetism...

  • Determining Optimum Queue Length in Computer Networks by Using Memetic Algorithms. Ayanzadeh, R.; Shahamatnia, E.; Setayeshi, S. // Journal of Applied Sciences;2009, Vol. 9 Issue 15, p2847 

    Making the choice of optimal queue length in manufacturing network equipments is one of the most significant fields of network researches. This study addresses the multi-objective problem of determining optimal queue length in computer networks which aims to trade off between cost and...

  • The Application of Memetic Algorithms for Forearm Crutch Design: A Case Study. Wu, Teresa; Som Soni; Hu, Mengqi; Fan Li; Badiru, Adedeji // Mathematical Problems in Engineering;2011, Vol. 2011, Special section p1 

    Product design has normally been performed by teams, each with expertise in a specific discipline such as material, structural, and electrical systems. Traditionally, each team would use its member's experience and knowledge to develop the design sequentially. Collaborative design decisions...

  • Moving Clusters within a Memetic Algorithm for Graph Partitioning. Hwang, Inwook; Kim, Yong-Hyuk; Yoon, Yourim // Mathematical Problems in Engineering;9/20/2015, Vol. 2015, p1 

    Most memetic algorithms (MAs) for graph partitioning reduce the cut size of partitions using iterative improvement. But this local process considers one vertex at a time and fails to move clusters between subsets when the movement of any single vertex increases cut size, even though moving the...

  • A Memetic Differential Evolution Algorithm Based on Dynamic Preference for Constrained Optimization Problems. Ning Dong; Yuping Wang // Journal of Applied Mathematics;2014, p1 

    The constrained optimization problem (COP) is converted into a biobjective optimization problem first, and then a new memetic differential evolution algorithm with dynamic preference is proposed for solving the converted problem. In the memetic algorithm, the global search, which uses...

  • METAHEURISTICS AND LARGE-SCALE OPTIMIZATION. Sakalauskas, Leonidas // Technological & Economic Development of Economy;2006, Vol. 12 Issue 1, p3 

    Reports on the 5th EU/ME Workshop with the theme "Metaheuristics and Large Scale Optimization," held in Vilnius, Lithuania. Topics of the workshop; Countries that participated in the event; Speakers.

  • Portfolio Optimization, Heuristics and The 'Butterfly Effect'. Nawrocki, David N. // Journal of Financial Planning;Feb2000, Vol. 13 Issue 2, p68 

    According to the author of this article, a phenomenon called the "butterfly effect" applies to portfolio optimizers just as much as it does to the global weather system. In this article, he discusses the drawbacks of portfolio optimizers and presents heuristic algorithms as a possible solution.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics