Work

Unit commitment solved by multi colony chaotic ant optimization algorithm

Year: 2012
Type: article
Abstract: Unit commitment(UC) has commonly been formulated as a large-scale mixed-integer optimization problem with the characteristic of being high-dimensional,discrete and nonlinear and is known as NP-hard problem in Mathematics.Domestic and international studies show that ant colony algorithm has its unique advantages in solving combination problems.The multi colony chaotic ant optimization algorithm presented in this paper bases on the basic ant optimization algorithm,divides the ant colony into search ant,detect ant and ergate,and brings in the chaotic volume.On one hand the algorithm inherits the superiority of ant colony algorithm in solving combination problems;on the other hand,the new algorithm maximizes the possibility for ant colony algorithm to overcome its slow operation,easy to fall into local optimum and other shortcomings.Finally,we verify the feasibility of the algorithm by the modified IEEE30,and the rationality and effectiveness of the algorithm are analyzed.The results show that the proposed multi colony ant algorithm is reasonable and effective.
Author: Ruipeng Guo
Institution: Zhejiang University
Language: English
Open Access status: diamond
OpenAlex ID: W2373459736
FWCI: 0.18
Cites:
Cited by: 1
Related to: 10