IDEAS home Printed from https://ideas.repec.org/a/ids/ijetpo/v5y2007i4p489-508.html
   My bibliography  Save this article

Neural-based Tabu Search method for solving unit commitment problem for utility system

Author

Listed:
  • C. Christober Asir Rajan
  • M.R. Mohan

Abstract

This paper presents a new approach to solving short-term Unit Commitment Problem (UCP) using Neural-Based Tabu Search (NBTS) for utility system. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimised, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for next H hours. A 66-bus utility power system with 12 generating units in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consisting of 24, 57 and 175 buses. Numerical results are shown to compare the superiority of the cost solutions obtained using the Tabu Search method, Dynamic Programming and Lagrangian Relaxation methods in reaching the proper unit commitment.

Suggested Citation

  • C. Christober Asir Rajan & M.R. Mohan, 2007. "Neural-based Tabu Search method for solving unit commitment problem for utility system," International Journal of Energy Technology and Policy, Inderscience Enterprises Ltd, vol. 5(4), pages 489-508.
    • Handle: RePEc:ids:ijetpo:v:5:y:2007:i:4:p:489-508
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=14889
    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:ijetpo:v:5:y:2007:i:4:p:489-508. 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=12 .

    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.