video

sound

Persian Version

View:

175

Download:

0

Cites:

Information Journal Paper

Title

A HEURISTIC APPROACH TO SOLVE THE UNIT COMMITMENT PROBLEM BASED ON THE BAT SEARCH ALGORITHM

Pages

 Start Page 251 | End Page 265

Abstract

 The UNIT COMMITMENT problem is a complex nonlinear optimization problem with large dimensions and linear and nonlinear constraints for which no approach has been yet able to extract the global optimum solution. In this paper, a new HEURISTIC APPROACH is represented which comprises two major stages: 1- Intelligent generation of initial population, 2- THE BAT SEARCH ALGORITHM integrated with repair procedures. In this approach, the initial solutions are generated using a priority list and a new repair procedure for the violations related to minimum up/down time constraint. The solutions generated in this stage are infect initial solutions for the bat intelligent algorithm which performs a local search. To establish spinning reserve and minimum up/down time constraints, new procedures have been designed, which play important roles in the efficiency of the search and decreasing computational times. The proposed approach has been implemented on practical test systems of IEEE 54-unit, the Taiwan power system (Taipower), and the standard 100-unit test system. The results reveal the approach’s success especially in achieving the lowest production cost in the literature for the first two systems.

Cites

  • No record.
  • References

  • No record.
  • Related Journal Papers

    Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    File Not Exists.