Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Neural-based tabu search method for solving unit commitment problem

Neural-based tabu search method for solving unit commitment problem

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Generation, Transmission and Distribution — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An approach to solving the short-term unit commitment problem (UCP) using a neural-based tabu search (NBTS) is presented. The solution of the unit commitment problem is a complex optimisation problem. The exact solution of the UCP can be obtained by a complete enumeration of all feasible combinations of generating units, which could be a huge number. The unit commitment has commonly been formulated as a nonlinear, large-scale, mixed-integer combinational optimisation problem. The objective 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 the next H hours. Tabu search is a powerful optimisation procedure that has been successfully applied to a number of combinatorial optimisation problems. It has the ability to avoid entrapment in local minima by employing a flexible memory system. The neural network combines good solution quality for tabu search with rapid convergence for an artificial neural network. The neural based tabu search method is used to find the unit commitment. By doing so, it gives the optimum solution rapidly and efficiently. The Neyveli Thermal Power Station (NTPS) Unit – II in India has been considered as a case study and extensive studies have also been performed for different power systems consisting of 10, 26, and 34 generating units. The data collected has been used for implementation in the above methods. Numerical results are shown, comparing the cost solutions and computation time obtained by using the intelligent techniques with the conventional methods like dynamic programming and Lagrangian relaxation to reach proper unit commitment.

References

    1. 1)
      • M.R. Mohan , K. Kuppusamy , M. Abdullah Khan . Optimal short-term hydro-thermal scheduling using decomposition approach and linear programming method. Int. J. Electr. Power Energy Syst. , 1 , 39 - 44
    2. 2)
      • T. Kohonen . An introduction to neural computing. Neural Netw. , 1 , 3 - 16
    3. 3)
    4. 4)
      • .Y.Y. Hsu , C.C. Su , C.C. Liang , C.J. Lin , C.T. Huang . Dynamic security constrained multi-area unit commitment. IEEE Trans. Power Syst. , 3 , 1049 - 1055
    5. 5)
      • N.P. Padhy . Unit commitment using hybrid models: a comparative study for dynamic programming, expert systems, fuzzy system and genetic algorithms. Int. J. Electr. Power Energy Syst. , 1 , 827 - 836
    6. 6)
    7. 7)
    8. 8)
      • R. Nieva , A. Inda , I. Guillen . Lagrangian reduction of search range for large-scale unit commitment. IEEE Trans. Power Syst. , 465 - 473
    9. 9)
      • A. Maren , C. Harston , R. Pap . (1990) Handbook of neural computing applications.
    10. 10)
      • S. Kirkpatrick , C.D. Gelatt Jr , M.P. Vecehi . Optimisation by SA. Science , 4598 , 671 - 680
    11. 11)
      • A.I. Cohen , M. Yoshimura . A branch and bound algorithm for unitcommitment. IEEE Trans. Power Appar. Syst. , 2 , 444 - 451
    12. 12)
      • P.D. Wasserman . (1989) Neural computing theory and practice.
    13. 13)
      • A.H. Mantawy , Y.L. Abdel-Magid , S.Z. Selim . A unit commitment by tabu search. IEE Proc., Gener., Transm. Distrib. , 1 , 56 - 64
    14. 14)
      • S.Z. Selim , K. Alsultan . A simulated annealing algorithm for the clustering problem. Pattern Recognit. , 10 , 1003 - 1008
    15. 15)
    16. 16)
      • C.-P. Chang , C.-W. Liu , C.-C. Liu . Unit commitment by a Lagrangian relaxation and genetic algorithms. IEEE Trans. Power Syst. , 2 , 707 - 714
    17. 17)
      • Z. Ouyang , S.M. Shahiderpour . Short-term unit commitment expert system. Electr. Power Syst. Res. , 1 , 1 - 13
    18. 18)
      • E. Arts , J. Korst . (1989) Simulated annealing and Bolzman Machines: a stochastic approach to combinatorial optimisation and neural computing.
    19. 19)
    20. 20)
    21. 21)
    22. 22)
    23. 23)
      • S. Takriti , J.R. Birge . Using integer programming to refine Lagrangian-based unit commitment solutions. IEEE Trans. Power Syst. , 1 , 151 - 156
    24. 24)
      • A.J. Wood , B.F. Woolenberg . (1996) Power Generation and control.
    25. 25)
      • W.L. Snyder , H.D. Powell , J.C. Rayburn . Dynamic programming approach to unit commitment. IEEE Trans. Power Syst. , 2 , 339 - 350
    26. 26)
      • J.M. Ngundam , F. Kenfack , T.T. Tatietse . Optimal scheduling of large-scale hydrothermal power systems using the Lagrangian relaxation technique. Int. J. Electr. Power Energy Syst. , 1 , 237 - 245
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-gtd_20030244
Loading

Related content

content/journals/10.1049/ip-gtd_20030244
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address