Publication: Ant colony search algorithm for unit commitment
0
0
Issued Date
2003
Resource Type
File Type
application/pdf
Other identifier(s)
2-s2.0-19844381046
Rights Holder(s)
Scopus
Bibliographic Citation
Proceedings of the IEEE International Conference on Industrial Technology. Vol 1, No. (2003), p.72-77
Suggested Citation
Sum-Im T., Ongsakul W. Ant colony search algorithm for unit commitment. Proceedings of the IEEE International Conference on Industrial Technology. Vol 1, No. (2003), p.72-77. Retrieved from: https://hdl.handle.net/20.500.14740/6507
Author(s)
Abstract
In this paper, ant colony search algorithm (ACSA) is proposed to solve thermal unit commitment problem. ACSA is a new cooperative agents approach, which is inspired by the observation of the behaviors of real ant colonies on the topic of ant trial formation and foraging methods. In the ACSA, a set of cooperating agents called "ants" cooperates to find good solution for unit commitment problem of thermal units. The merits of ACSA are parallel search and optimization capabilities. The problem is decomposed in two sub-problems. The unit commitment sub-problem is solved by the ant colony search algorithm method and the economic dispatch sub-problem is solved by the lambda-iteration method. The unit commitment problem is formulated as the minimization of the performance index, which is the sum of objectives (fuel cost, start-up cost) and some constraints (power balance, generation limits, spinning reserve, minimum up time and minimum down time). This proposed approach is tested and compared to conventional Lagrangian relaxation (LR), genetic algorithm (GA), evolutionary programming (EP), Lagrangian relaxation and genetic algorithm (LRGA) on the 10 unit system. ©2003 IEEE.