Abstract
This paper proposes an enhanced PSO (EPSO) approach to solve the unit commitment (UC) problem in electric power system, which is an integrated improved discrete binary particle swarm optimization (DBPSO) with the Lambda-iteration method. The EPSO is enhanced by priority list based on the unit characteristics and heuristic search strategies to repair the spinning reserve and minimum up/down time constraints. The implementation of EPSO for UC problem consists of three stages. First, the DBPSO based on priority list is applied for unit scheduling when neglecting the minimum up/down time constraints. Second, heuristic search strategies are used to handle the minimum up/down time constraints and decommit excess spinning reserve units. Finally, Lambda-iteration method is adopted to solve economic load dispatch based on the obtained unit schedule. To verify the advantages of the EPSO method, the EPSO is tested and compared to the other methods on the systems with the number of units in the range of 10 to 100. Numerical results demonstrate that the EPSO is superior to other methods reported in the literature in terms of lower production cost and shorter computational time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bakirtzis A, Zoumas C (2000) Lambda of Lagrangian relaxation solution to unit commitment problem. IEE Proc Gener Transm Distrib 147(2):131–136. doi:10.1049/ip-gtd:20000173
Balci H, Valenzuela J (2004) Scheduling Electric Power Generations using Particle Swarm Optimization combined with the Lagrangian Relaxation Method. Int J Appl Math Comput Sci 14(3):411–421
Cheng C, Liu C, Liu C (2000) Unit commitment by Lagrangian relaxation and genetic algorithms. IEEE Trans Power Syst 15(2):707–714. doi:10.1109/59.867163
Clerc M, Kennedy J (2002) The particle swarm: Explosion stability and convergence in a multi-dimensional complex space. IEEE Trans Evol Comput 6(1):58–73. doi:10.1109/4235.985692
Cohen A, Yoshimura M (1983) A branch-and-bound algorithm for unit commitment. IEEE Trans Power Apparatus Syst 102(2):444–451. doi:10.1109/TPAS.1983.317714
Damousis I, Bakirtzis A, Dokopoulos P (2004) A solution to the unit-commitment problem using integer-coded genetic algorithm. IEEE Trans Power Syst 19(2):1165–1172. doi:10.1109/TPWRS.2003.821625
Dieu V, Ongsakul W (2006) Enhanced augmented Lagrangian hopfield network for unit commitment. IEE Proc Gener Transm Distrib 153(6):624–632. doi:10.1049/ip-gtd:20050460
Jorge V, Smith A (2002) A seeded memetic algorithm for large unit commitment problems. J Heuristics 8:173–195. doi:10.1023/A:1017960507177
Juste K, Kita H, Tanaka E (1999) An evolutionary programming solution to the unit commitment problem. IEEE Trans Power Syst 14(4):452–459. doi:10.1109/59.801925
Kazarlis S, Bakirtzis A (1996) A genetic algorithm solution to the unit commitment problem. IEEE Trans Power Syst 11(1):83–92. doi:10.1109/59.485989
Kennedy J, Eberhart RC (1997) A Discrete Binary Version of the Particle Swarm Algorithm. Proceedings of the Conference on Systems, Man, and Cybernetics, Piscataway, N.J, 4104–4108
Khodaverdian E, Brameller A, Dunnitt R (1986) Semi-rigorous thermal unit commitment for large scale electric power systems. Proc Inst Electr Eng 133:157–164
Lee T, Chen C (2007) Unit commitment with probabilistic reserve—an IPSO approach. Energy Convers Manage 48:486–493. doi:10.1016/j.enconman.2006.06.015
Mantawy A, Abdel T, Selim S (1998) Unit commitment by tabu search. IEE Proc Gener Transm Distrib 145(1):56–64. doi:10.1049/ip-gtd:19981681
Ongsakul W, Petcharaks N (2004) Unit commitment by enhanced adaptive Lagrangian relaxation. IEEE Trans Power Syst 19(1):620–628. doi:10.1109/TPWRS.2003.820707
Samer T, John B (2000) Using integer programming to refine Lagrangian-based unit commitment solutions. IEEE Trans Power Syst 15(1):151–156. doi:10.1109/59.852114
Senjyu T, Yamashiro H (2002) Uezato K A unit commitment problem by using genetic algorithm based on characteristic classification. Proc IEEE/Power Eng Soc Winter Meet 1:58–63
Senjyu T, Miyagi T, Saber A (2006) Emerging solution of large-scale unit commitment problem by stochastic priority list. Electr Power Syst Res 76:283–292. doi:10.1016/j.epsr.2005.07.002
Su C, Hsu Y (1991) Fuzzy dynamic programming: an application to unit commitment. IEEE Trans Power Syst 6(3):1231–1237. doi:10.1109/59.119271
Ting T, Rao M, Loo C (2003) Solving unit commitment problem using hybrid particle swarm optimization. J Heuristics 9:507–520. doi:10.1023/B:HEUR.0000012449.84567.1a
Wood A, Wollenberg B (1996) Power Generation, Operation, and Control. Wiley, New York
Zhuang F, Galiana F (1990) Unit commitment by simulated annealing. IEEE Trans Power Syst 5(1):311–317. doi:10.1109/59.49122
Acknowledgments
The authors gratefully acknowledge the financial supports from National Natural Science Foundation of China under Grant No. 40971018, No. 50779020 and No. 40572166.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yuan, X., Su, A., Nie, H. et al. Unit commitment problem using enhanced particle swarm optimization algorithm. Soft Comput 15, 139–148 (2011). https://doi.org/10.1007/s00500-010-0541-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-010-0541-y