抄録
This paper presents a new method to solve the unit commitment problem by using a hybrid ant system/priority list method based probabilistic approach (HASP). The proposed methodology employs ant system (AS) in cooperating with the priority list method to commit generating units probabilistically corresponding to the specific conditions as means of mutually combining the advantages of them in that a flexibility of the priority list method is reinforced, while AS algorithm can gain the benefit of using a set of heuristics for improving its performance during search process under the operating constraints. The proposed methodology including its effective techniques has been tested on a system up to 100 generating units with a scheduling time horizon of 24 hours. The simulation results show that HASP gives better economical saving in total operating cost as well as faster computational time when compared to the earlier literature results.
