A Hybrid Ant Colony Optimization Algorithm Based Lambda-Iteration Method for Unit Commitment Problem

In this paper, we proposed a hybrid algorithm to solve unit commitment optimization problem, which is composed of operation ant colony optimization (ACO) algorithm and Lambda-iteration method. By means of operation encoding, space complexity of ACO algorithm for solving UCP is reduced. Moreover, space complexity can be regulated by adjusting the number of maximum allowable operation in a single time period. The HACO algorithm was tested on a modeled UC problem with the number of units in range 10-60. The simulated results show HACO is more efficiently and effectively implemented for UCP.