Unit Commitment by Evolving Ant Colony Optimization

K. Vaisakh and L. R. Srinivas
Additional contact information
K. Vaisakh: Andhra University, India
L. R. Srinivas: S.R.K.R. Engineering College, India

International Journal of Swarm Intelligence Research (IJSIR), 2010, vol. 1, issue 3, 67-77

Abstract: Ant Colony Optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem, and multistage decision making of ACO has an edge over other conventional methods. In this paper, the authors propose the Evolving Ant Colony Optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs Genetic Algorithm (GA) for finding optimal set of ACO parameters, while ACO solves the UC problem. Problem formulation takes into consideration the minimum up and down time constraints, start up cost, spinning reserve, and generation limit constraints. The feasibility of the proposed approach is demonstrated on the systems with number of generating units in the range of 10 to 60. The test results are encouraging and compared with those obtained by other methods.

Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jsir.2010070105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jsir00:v:1:y:2010:i:3:p:67-77

Access Statistics for this article

International Journal of Swarm Intelligence Research (IJSIR) is currently edited by Yuhui Shi

More articles in International Journal of Swarm Intelligence Research (IJSIR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().