A Solution to Unit Commitment Problem by ACO and PSO Hybrid Algorithm

To solve the mixed-integer nonlinear programming problem of unit commitment in electric power system, the problem was separated into two subordinate optimization problems with integral and continuous variables first, then a new hybrid algorithm based on ant colony optimization (ACO) and particle swarm optimization (PSO) was proposed. The first step is to realize unit-scheduled problem using ACO; the second step is to solve economic dispatch (ED) in these units using PSO. In addition, some criterions are used to prevent ants from searching invalid unit status, which enhance speed and efficiency of the algorithm. Two generation scheduling systems with 5 or 10 units are tested. The simulation results demonstrate the feasibility and effectiveness of the proposed algorithm in solving unit commitment

[1]  Tomonobu Senjyu,et al.  A fast technique for unit commitment problem by extended priority list , 2003 .

[2]  Anastasios G. Bakirtzis,et al.  A genetic algorithm solution to the unit commitment problem , 1996 .

[3]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[4]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[5]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).