Hybrid ant colony optimization algorithm for generation unit commitment problem
Year: 2010
Type: article
Abstract: As a hard nondeterministic polynomia(lNP) problem in power system,the unit commitment problem is difficult to find its optimal solution theoretically.This paper presents a hybrid algorithm based on heuristic method and ant colony optimization(ACO)for the contradiction between precision and speed of the optimization algorithm.Firstly,this paper attains the sub-optimal solution by priority list(PL)method,and forms a local area for search.Then,it completes the optimization process in the local area by ant colony algorithm,which reduces the space complexity of the ant colony optimization.Meanwhile,a swarm degree in the artificial fish school algorithm(AFSA)is used in the ant colony optimization.The threshold of a swarm degree varies self-adaptively in the process of iteration,so it enhances the searching ability of the algorithm,and also insures the algorithm to have a quick convergence rate.The simplified gradient method is used for the economical load dispatch problem.Simulation results of 10-units system prove that the algorithm proposed has good search capability and quick convergence rate to solve the unit commitment problem.
Author: Tianqi Liu
Institution: Sichuan University
Language: English
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2374993422
