A maiden application of gravitational search algorithm with wavelet mutation for the solution of economic load dispatch problems

被引:29
|
作者
Chatterjee, A. [3 ]
Ghoshal, S. P. [2 ]
Mukherjee, V. [1 ]
机构
[1] Indian Sch Mines, Dept Elect Engn, Dhanbad 826004, Jharkhand, India
[2] Natl Inst Technol, Dept Elect Engn, Durgapur, W Bengal, India
[3] Asansol Engn Coll, Dept Elect Engn, Asansol, W Bengal, India
关键词
economic dispatch; gravitational search algorithm; GSA; prohibited operating zones; ramp rate limits; valve point effects; wavelet mutation; WM; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION ALGORITHM; GENETIC ALGORITHM;
D O I
10.1504/IJBIC.2012.044934
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Gravitational search algorithm (GSA) is one of the new optimisation algorithms based on the law of gravity and mass interactions. In this algorithm, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws of gravity and motion. In this article, a novel GSA with wavelet mutation (WM) (GSAWM) is proposed. It utilises the wavelet theory to enhance the GSA in exploring the solution space more effectively for a better solution. This algorithm is utilised for the optimal solutions of different economic load dispatch (ELD) problems of power systems. The obtained results are compared with those of the other state-of-the-art heuristic optimisation techniques published in the literature. Both the near-optimality of the solution and the convergence speed of the algorithm are promising.
引用
收藏
页码:33 / 46
页数:14
相关论文
共 50 条
  • [1] Economic load dispatch solution by improved harmony search with wavelet mutation
    Pandi, V. Ravikumar
    Panigrahi, B. K.
    Mohapatra, Ankita
    Mallick, Manas Kumar
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2011, 6 (1-2) : 122 - 131
  • [2] Seeker optimisation algorithm: application to the solution of economic load dispatch problems
    Shaw, B.
    Mukherjee, V.
    Ghoshal, S. P.
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2011, 5 (01) : 81 - 91
  • [3] Economic load dispatch using improved gravitational search algorithm
    Huang Yu
    Wang Jia-rong
    Guo Feng
    2ND ISPRS INTERNATIONAL CONFERENCE ON COMPUTER VISION IN REMOTE SENSING (CVRS 2015), 2016, 9901
  • [4] Gbest Guided Gravitational Search Algorithm for Economic Load Dispatch
    Dubey, Hari Mohan
    Panigrahi, B. K.
    Pandit, Manjaree
    Udgir, Mugdha
    SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, SEMCCO 2014, 2015, 8947 : 706 - 720
  • [5] Application of Gravitational Search Algorithm to Analyse Economic Load Dispatch in Power System Network
    Anumeha
    Paul, Kaushik
    Yadav, K. B.
    Kumar, Niranjan
    2016 IEEE 7TH POWER INDIA INTERNATIONAL CONFERENCE (PIICON), 2016,
  • [6] Gravitational Search Algorithm: A Novel Optimization Approach for Economic Load Dispatch
    Udgir, Mugdha
    Dubey, Hari Mohan
    Pandit, Manjaree
    2013 ANNUAL INTERNATIONAL CONFERENCE ON EMERGING RESEARCH AREAS & 2013 INTERNATIONAL CONFERENCE ON MICROELECTRONICS, COMMUNICATIONS & RENEWABLE ENERGY (AICERA/ICMICR), 2013,
  • [7] Application of Symbiotic Organisms Search Algorithm to Solve Various Economic Load Dispatch Problems
    Guvenc, Ugur
    Duman, Serhat
    Dosoglu, M. Kenan
    Kahraman, H. Tolga
    Sonmez, Yusuf
    Yilmaz, Cemal
    PROCEEDINGS OF THE 2016 INTERNATIONAL SYMPOSIUM ON INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (INISTA), 2016,
  • [8] The application of one rank cuckoo search algorithm for solving economic load dispatch problems
    Thang Trung Nguyen
    Dieu Ngoc Vo
    APPLIED SOFT COMPUTING, 2015, 37 : 763 - 773
  • [9] Combined economic and emission dispatch solution using gravitational search algorithm
    Guvenc, U.
    Sonmez, Y.
    Duman, S.
    Yorukeren, N.
    SCIENTIA IRANICA, 2012, 19 (06) : 1754 - 1762
  • [10] Seeker optimisation algorithm for the solution of economic load dispatch problems
    Shaw, Binod
    Ghoshal, S. P.
    Mukherjee, V.
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2011, 3 (05) : 275 - 285