Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

A New Approach for Solving the Unit Commitment Problem by Cuckoo Search Algorithm


Affiliations
1 Shahindezh Branch, Islamic Azad University, Shahindezh, Iran, Islamic Republic of
 

In this paper, a new approach to solving the issue of optimal production planning (Unit Commitment or UC) has been presented by using Cuckoo Search Algorithm. Results of testing this paper indicate that not only this algorithm includes all limits of issue well, but it has also the benefits all such as the most appropriate convergence in the response, high computational speed and high accuracy. A sample power system with 10 power plant units has been used in this study in order to test this new algorithm. Optimal planning in generation of power units of this system is also obtained from the results of experiment and they will be inferable given the establishment and observation of the constraints in the target function of issue. Numerical results of this paper indicate that the performance of Cuckoo Search Algorithm has had significant improvement than other algorithms and it results in the minimum production cost.

Keywords

Cuckoo Search Algorithm, Power Systems, Optimal Production Planning, System Constraints, System Limitations
User

  • Wood A F, and Wollenberg B F (1966). Power generation operation and control, 2nd Edn., Chapter 5, New York: Wiley, 131–170.

  • Burns R M, and Gibson C A (1975). Optimization of priority lists for a unit commitment program, Proceedings of IEEE/Power Engineering Society Summer Meeting, Paper A 75, 453–1.

  • Sheble G B (1990). Solution of the unit commitment problem by the method of unit periods, IEEE Transactions on Power Systems, vol 5, No. 1, 257–260.

  • Dillon T S, Edwin K W et al. (1978). Integer programming approach to the problem of optimal unit commitment with probabilistic reserve determination, IEEE Transactions on Power Apparatus and Systems, vol PAS-97(6), 2154–2166.

  • Garver L L (1963). Power generation scheduling by integer programming development of theory, IEEE Transactions on Power App. Systems, vol PAS-18, 730–735.

  • Snyder W L Jr., Powell H D Jr. et al. (1987). Dynamic programming approach to unit commitment, IEEE Transactions on Power Systems, vol PAS-2(2), 339–350.

  • Ouyang Z, and Shahidehpour S M (1991). An intelligent dynamic programming for unit commitment application, IEEE Transactions on Power Systems, vol 6(3), 1203–1209.

  • Muckstadt J A, and Wilson R C (1968). An application of mixed-integer programming duality to scheduling thermal generating systems, IEEE Transactions on Power Apparatus and Systems, vol PAS-87(12), 1968–1978.

  • Cohen A I, and Yoshimura M (1983). A branch-and-bound algorithm for unit commitment, IEEE Transactions on Power Apparatus and Systems, vol PAS-102(2), 444–451.

  • Merlin A, and Sandrin P (1983). A new method for unit commitment at Electricite de France, IEEE Transact-ions on Power Apparatus and Systems, vol PAS-102(5), 1218–1255.

  • Zhuang F, and Galiana F D (1988). Toward a more rigorous and practical unit commitment by Lagrangian relaxation, IEEE Transactions on Power Systems, vol 3(2), 763–770.

  • Ouyang Z, and Shahidehpour S M (1992). A hybrid artificial neural network/dynamic programming approach to unit commitment, IEEE Transactions on Power Systems, vol 7(1), 236–242.

  • Sasaki H, Watabable M et al. (1992). A solution method of unit commitment by artificial neural networks, IEEE Transactions on Power Systems, vol 7, No. 1, 974–985.

  • Zhuang F, and Galiana F D (1990). Unit commitment by simulated annealing, IEEE Transactions on Power Systems, vol 5(1), 311–317.

  • Dasgupta D, and McGregor D R (1994). Thermal unit commitment using genetic algorithms, IEE Proceedings Generation, Transmission and Distribution, vol 141(5), 459–465.

  • Kazarlis S A, Bakirtzis A G et al. (1996). A genetic algorithm solution to the unit commitment problem, IEEE Transactions on Power Systems, vol 11(1), 83–92.


Abstract Views: 452

PDF Views: 0




  • A New Approach for Solving the Unit Commitment Problem by Cuckoo Search Algorithm

Abstract Views: 452  |  PDF Views: 0

Authors

Alireza Gharegozi
Shahindezh Branch, Islamic Azad University, Shahindezh, Iran, Islamic Republic of
Rozbeh Jahani
Shahindezh Branch, Islamic Azad University, Shahindezh, Iran, Islamic Republic of

Abstract


In this paper, a new approach to solving the issue of optimal production planning (Unit Commitment or UC) has been presented by using Cuckoo Search Algorithm. Results of testing this paper indicate that not only this algorithm includes all limits of issue well, but it has also the benefits all such as the most appropriate convergence in the response, high computational speed and high accuracy. A sample power system with 10 power plant units has been used in this study in order to test this new algorithm. Optimal planning in generation of power units of this system is also obtained from the results of experiment and they will be inferable given the establishment and observation of the constraints in the target function of issue. Numerical results of this paper indicate that the performance of Cuckoo Search Algorithm has had significant improvement than other algorithms and it results in the minimum production cost.

Keywords


Cuckoo Search Algorithm, Power Systems, Optimal Production Planning, System Constraints, System Limitations

References





DOI: https://doi.org/10.17485/ijst%2F2013%2Fv6i9%2F37138