Rampriya B. Perumal, Mahadevan Krishnan, and Kannan Subramanian


  1. [1] T.S. Dillon, K.W. Edwin, H.D. Kochs, and R.J. Taud, Integer programming approach to the problem of optimal unit commitment with probabilistic reserve determination, IEEE Transactions on Power Apparatus and Systems, 97 (6), 1978, 2154–2166.
  2. [2] A.J. Wood and B. Wollenberg, Power generation operation and control, 2nd ed. (New York, NY: John Wiley and Sons, 2009).
  3. [3] F. Zhuang and F.D. Galiana, Towards a more rigorous and practical unit commitment by Lagrangian relaxation, IEEE Transactions on Power Systems 3 (2), 1988, 763–772.
  4. [4] S.O. Orero and M.R. Irving, A genetic algorithm for generator scheduling in power systems, Electrical Power and Energy Systems, 18 (1), 1996, 19–26.
  5. [5] C.P. Cheng, C.-W. Liu, and C.-C. Liu, Unit commitment by Lagrangian relaxation and genetic algorithms, IEEE Transactions on Power Systems, 15 (2), 2000, 707–714.
  6. [6] K. Mahadevan and P.S. Kannan, Lagrangian relaxation-based particle swarm optimization for unit commitment problem, International Journal of Power and Energy Systems, 27 (4), 2007, 320–329.
  7. [7] K. Bhattacharya, M.H.J. Bollen, and J.E. Daalder, Operation of restructured power systems (Norwell, MA: Kluwer Academic Publishers, 2001).
  8. [8] N.P. Padhy, Unit commitment problem under deregulated environment – A review, Proceeding of IEEE Power Engineering Society General Meeting, Canada, 2, 2003, 1088–1094.
  9. [9] N.P. Padhy, Unit commitment – A bibliographical survey, IEEE Transactions on Power Systems, 19 (2), 2004, 1196–1205.
  10. [10] C.W. Ritcher and G.B. Sheble, A profit based unit commitment GA for the competitive environment, IEEE Transactions on Power Systems, 15 (2), 2000, 715–721.
  11. [11] S.O. Orero and M.R. Irving, A combination of genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem, Electric Power Systems Research, 43, 1997, 149–156.
  12. [12] H.Y. Yamin and S.M. Shahidehpour, Unit commitment using a hybrid model between Lagrangian relaxation and genetic algorithm in competitive electricity markets, Electric Power Systems Research, 68, 2004, 83–92.
  13. [13] P. Attaviriyanupap, H. Kita, and J. Hasegawa, A hybrid LREP for solving new profit based UC problem under competitive environment, IEEE Transactions on Power Systems, 18 (1), 2003, 229–236.
  14. [14] X.-S. Yang, Firefly algorithms for multimodal optimization, Lecture Notes in Computer Sciences, 5792, 2009, 169–178.
  15. [15] M.K. Sayadi, R. Ramezanian, and N. Ghaffari-Nasab, A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problem, International Journal of Industrial Engineering Computations, 1 (1), 2010, 1–10.
  16. [16] E.H. Allen, M.D. Ilic, Reserve markets for power system reliability, IEEE Transactions on Power Systems, 15 (1), 2000, 228–233.
  17. [17] B. Rampriya and K. Mahadevan, Scheduling the units and maximizing the profit of GENCOS using LR-PSO technique, International Journal of Electrical Engineering and Informatics, 2 (2), 2010, 150–158.
  18. [18] S. Lukasik and S. Zak, FA for continuous constrained optimization tasks, Lecture Notes in Computer Science, 5796, (Springer Link, 2009), 97–106.
  19. [19] K. Chandram and N. Subrahmanyam, New approach with Muller method for solving profit based unit commitment, Proc. IEEE Conf. on Electric Utility Deregulation and Restructuring and Power Technologies, China, 2008, 952–957.
  20. [20] T.A.A. Victorie and A.E. Jayakumar, Unit commitment by a Tabu-search-based hybrid-optimization technique, IEE Proc. on Generation, Transmission and Distribution, 152 (4), 2005, 563–574.
  21. [21] Y. Xiaohui, Y. Yanbin, W. Cheng, and Z. Xiaopan, An improved PSO approach for profit based unit commitment in electricity market, Proc. IEEE Conf. on Transmission and Distribution, China, 2005, 1–4. 119

Important Links:

Go Back