IDEAS home Printed from https://ideas.repec.org/a/ids/injleg/v2y2010i4p390-402.html
   My bibliography  Save this article

Application of simulated annealing and genetic algorithm for solving optimum power flow problems

Author

Listed:
  • H. Vennila
  • T. Ruban Deva Prakash
  • B.G. Malini
  • M.S. Birundha
  • L. Sumi
  • V. Evangelin Jeba

Abstract

Well established conventional algorithms are available for solving the optimum power flow (OPF) problem. But the recent trend is to use the tools such as genetic algorithms (GAs) evolutionary programming technique, etc., because of some of their superior qualities. Simulated annealing (SA) is one such tool which can be used for solving optimisation problems. In this paper, SA technique has been applied for solving OPF problem which is simultaneously composed by economic dispatch (ED) and load flow problems (LFP). This technique is compared with GA, which represents a class of general purpose stochastic search techniques which simulate natural inheritance by genetics, illustrated by considering a three bus system.

Suggested Citation

  • H. Vennila & T. Ruban Deva Prakash & B.G. Malini & M.S. Birundha & L. Sumi & V. Evangelin Jeba, 2010. "Application of simulated annealing and genetic algorithm for solving optimum power flow problems," International Journal of Logistics Economics and Globalisation, Inderscience Enterprises Ltd, vol. 2(4), pages 390-402.
  • Handle: RePEc:ids:injleg:v:2:y:2010:i:4:p:390-402
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=37523
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:injleg:v:2:y:2010:i:4:p:390-402. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=64 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.