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 unitcommitment with probabilistic reserve determination, IEEETransactions on Power Apparatus and Systems, 97 (6), 1978,2154–2166.
  2. [2] A.J. Wood and B. Wollenberg, Power generation operationand control, 2nd ed. (New York, NY: John Wiley and Sons,2009).
  3. [3] F. Zhuang and F.D. Galiana, Towards a more rigorous andpractical unit commitment by Lagrangian relaxation, IEEETransactions on Power Systems 3 (2), 1988, 763–772.
  4. [4] S.O. Orero and M.R. Irving, A genetic algorithm for generatorscheduling in power systems, Electrical Power and EnergySystems, 18 (1), 1996, 19–26.
  5. [5] C.P. Cheng, C.-W. Liu, and C.-C. Liu, Unit commitment byLagrangian relaxation and genetic algorithms, IEEE Transac-tions on Power Systems, 15 (2), 2000, 707–714.
  6. [6] K. Mahadevan and P.S. Kannan, Lagrangian relaxation-basedparticle 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, Operationof restructured power systems (Norwell, MA: Kluwer AcademicPublishers, 2001).
  8. [8] N.P. Padhy, Unit commitment problem under deregulated en-vironment – A review, Proceeding of IEEE Power EngineeringSociety General Meeting, Canada, 2, 2003, 1088–1094.
  9. [9] N.P. Padhy, Unit commitment – A bibliographical survey, IEEETransactions on Power Systems, 19 (2), 2004, 1196–1205.
  10. [10] C.W. Ritcher and G.B. Sheble, A profit based unit commitmentGA for the competitive environment, IEEE Transactions onPower Systems, 15 (2), 2000, 715–721.
  11. [11] S.O. Orero and M.R. Irving, A combination of genetic algorithmand Lagrangian relaxation decomposition techniques for thegeneration unit commitment problem, Electric Power SystemsResearch, 43, 1997, 149–156.
  12. [12] H.Y. Yamin and S.M. Shahidehpour, Unit commitment usinga hybrid model between Lagrangian relaxation and geneticalgorithm in competitive electricity markets, Electric PowerSystems Research, 68, 2004, 83–92.
  13. [13] P. Attaviriyanupap, H. Kita, and J. Hasegawa, A hybrid LR-EP for solving new profit based UC problem under competitiveenvironment, 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 dis-crete firefly meta-heuristic with local search for makespanminimization 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 systemreliability, IEEE Transactions on Power Systems, 15 (1), 2000,228–233.
  17. [17] B. Rampriya and K. Mahadevan, Scheduling the units andmaximizing the profit of GENCOS using LR-PSO technique,International Journal of Electrical Engineering and Informat-ics, 2 (2), 2010, 150–158.
  18. [18] S. Lukasik and S. Zak, FA for continuous constrainedoptimization tasks, Lecture Notes in Computer Science, 5796,(Springer Link, 2009), 97–106.
  19. [19] K. Chandram and N. Subrahmanyam, New approach withMuller method for solving profit based unit commitment, Proc.IEEE Conf. on Electric Utility Deregulation and Restructuringand Power Technologies, China, 2008, 952–957.
  20. [20] T.A.A. Victorie and A.E. Jayakumar, Unit commitment by aTabu-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, Animproved PSO approach for profit based unit commitment inelectricity market, Proc. IEEE Conf. on Transmission andDistribution, China, 2005, 1–4.119

Important Links:

Go Back