TITLE

A New Heuristic Algorithm for Solving Non-convex Economic Power Dispatch

AUTHOR(S)
Rabii, A.; Mobaieen, S.; Mohamady, B.; Suroody, A.
PUB. DATE
December 2011
SOURCE
Journal of Applied Sciences;2011, Vol. 11 Issue 23, p3791
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Valve-points effects and prohibited operation zones (POZ) make the generating units' cost functions non-linear and non-smooth. Hence, the Economic Dispatch (ED) problem is a highly non-convex optimization problem. The consideration of the transmission losses makes the ED problem even more complicated. This study presents a novel and heuristic algorithm for solving ED problems, by employing a new heuristic method, called Imperialist Competition Algorithm (ICA). The effectiveness of the proposed method is examined and validated by carrying out extensive tests on two different test systems. The valve-point effects, POZs, ramp-rate constraints and transmission losses are considered in the analysis. The numerical results show that the ICA method has good convergence property. Furthermore, the generation costs of the ICA approach are lower than other optimization algorithms reported in recent literature.
ACCESSION #
71727064

 

Related Articles

  • BIG BANG-BIG CRUNCH OPTIMIZATION ALGORITHM FOR ECONOMIC DISPATCH WITH VALVE-POINT EFFECT. LABBI, Y.; ATTOUS, D. BEN // Journal of Theoretical & Applied Information Technology;6/1/2010, Vol. 16 Issue 1/2, p48 

    The Big Bang-Big Crunch (BB-BC) optimization algorithm is a new optimization method that relies on the Big Bang and Big Crunch theory, one of the theories of the evolution of the universe. In this paper, a Big Bang-Big Crunch algorithm is presented for solving optimal power flow (OPF) problems...

  • A bi-objective model for emergency services location-allocation problem with maximum distance constraint. Hosseini, Mansoureh Haj Mohammad; Ameli, Mohammad Saeed Jabal // Management Science Letters;2011, Vol. 1 Issue 2, p115 

    In this paper, a bi-objective mathematical model for emergency services location-allocation problem on a tree network considering maximum distance constraint is presented. The first objective function called centdian is a weighted mean of a minisum and a minimax criterion and the second one is a...

  • Genetic Cuckoo Optimization Algorithm (GCOA). Rashad, M. Z.; Keshk, A. E.; El-Dosuky, M. A.; Kamal, M. M. // International Journal of Computer Applications;Mar2014, Vol. 90, p7 

    In this paper, Optimization is considered as the main impact of insight problem and heuristic methods. A proposed method is represented by using two optimization algorithms; cuckoo optimization; is heuristic method and Genetic algorithm; is meta-heuristic method in order to increase the...

  • A Summary of the Study on Quantum Evolutionary Algorithm. Ming Shao; Liang Zhou // Advances in Information Sciences & Service Sciences;Jul2012, Vol. 4 Issue 13, p62 

    Quantum computation combines quantum mechanics with information science, and it has the characteristics of high parallelism, exponential storage capacity and acceleration effect for classical heuristic algorithm, which make it become the focus of various scientific research people. Meanwhile, as...

  • Continuous variable neighbourhood search with modified Nelder-Mead for non-differentiable optimization. DRAŽIĆ, MILAN; DRAŽIĆ, ZORICA; MLADENOVIĆ, NENAD; UROŠEVIĆ, DRAGAN; QIU HONG ZHAO // IMA Journal of Management Mathematics;Jan2016, Vol. 27 Issue 1, p75 

    Several variants of variable neighbourhood search (VNS) for solving unconstrained and constrained continuous optimization problems have been proposed in the literature. In this paper, we suggest two new variants, one of which uses the recent modified Nelder-Mead (MNM) direct search method as a...

  • Cuckoo Search Algorithm using Lèvy Flight: A Review. Roy, Sangita; Chaudhuri, Sheli Sinha // International Journal of Modern Education & Computer Science;Dec2013, Vol. 5 Issue 12, p10 

    Cuckoo Search (CS) is a new met heuristic algorithm. It is being used for solving optimization problem. It was developed in 2009 by Xin- She Yang and Susah Deb. Uniqueness of this algorithm is the obligatory brood parasitism behavior of some cuckoo species along with the Levy Flight behavior of...

  • Graph Coloring Heuristics for Solving Examination Timetabling Problem at Universiti Utara Malaysia. Abdul-Rahman, Syariza; Sobri, Nur Suriani; Omar, Mohd Faizal; Benjamin, Aida Mauziah; Ramli, Razamin // AIP Conference Proceedings;2014, Vol. 1635, p491 

    Examination timetabling is a well-studied combinatorial optimization problem involving scheduling a set of examinations into a restricted number of time-slots while satisfying a defined set of constraints. This paper presents a real-world, capacitated examination timetabling problem from...

  • Implementation of an AC model for transmission expansion planning considering reliability constraints. MAHMOUDABADI, Amin; RASHIDINEJAD, Masoud; ZEINADDINI-MEYMAND, Majid; RAHMANI, Mohsen // Turkish Journal of Electrical Engineering & Computer Sciences;2013, Vol. 21 Issue 4, p1120 

    In this paper, a hybrid heuristic methodology that employs fuzzy logic for solving the AC transmission network expansion planning (AC-TEP) problem is presented. An enhanced constructive heuristic algorithm aimed at obtaining a significant quality solution for such complicated problems...

  • An Efficient Approach for Solving Mesh Optimization Problems Using Newton's Method. Jibum Kim // Mathematical Problems in Engineering;2014, p1 

    We present an efficient approach for solving various mesh optimization problems. Our approach is based on Newton's method, which uses both first-order (gradient) and second-order (Hessian) derivatives of the nonlinear objective function. The volume and surface mesh optimization algorithms are...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics