Title :
Discrete particle swarm optimization algorithm for unit commitment
Author_Institution :
Electr. Eng., Kao-Yuan Technol. Inst., Kaohsiung, Taiwan
Abstract :
This paper proposes integrating a discrete binary particle swarm optimization (BPSO) method with the Lambda-iteration method for solving unit commitment (UC) problems. The LJC problem is considered as two linked optimization sub-problems: the unit-scheduled problem that can be solved by the BPSO method for the minimization of the transition cost, and the economic dispatch (ED) problem that can be solved by the Lambda-iteration method for the minimization of the production cost. The feasibility of the proposed method is demonstrated for 10 and 26 unit systems, respectively, and the test results are compared with those obtained by the GA method in terms of solution quality and convergence characteristic. The simulation results show that the proposed method is indeed capable of obtaining higher quality solutions.
Keywords :
cost reduction; genetic algorithms; iterative methods; minimisation; power generation dispatch; power generation economics; power generation scheduling; Lambda-iteration method; convergence characteristic; discrete binary particle swarm optimization algorithm; economic dispatch problem; genetic algorithm; production cost minimization; solution quality; transition cost minimization; two linked optimization subproblems; unit commitment problems; unit-scheduled problem; Computational modeling; Cost function; Degradation; Economic forecasting; Genetic algorithms; Minimization methods; Optimization methods; Particle swarm optimization; Space technology; Spinning;
Conference_Titel :
Power Engineering Society General Meeting, 2003, IEEE
Print_ISBN :
0-7803-7989-6
DOI :
10.1109/PES.2003.1267212