An Improved Binary Particle Swarm Optimization for Unit Commitment Problem
This paper proposed a new approach combining priority list (PL) with binary particle swarm optimization (BPSO) to solve unit commitment (UC) problem.At first,PL method was used to determine the initial UC,and then the optimization window was determined according to the results,at last the BPSO method was adopted to solve the UC problem within the window.The window is to reduce the computing time and improve the optimization accuracy.In each iteration,the adjustment heuristic strategy was applied to revise the particle to meet the generators constraints.This paper adopted Lambdaiteration method combining with dichotomy algorithm to solve the economic dispatch (ED) problem.The simulation results showed that the proposed method is indeed capable of obtaining higher quality solutions.
unit commitment:priority list:binary particle swarm optimization:heuristic adjustment
Peng Li Peng Xi Liqiang Fei Jiang Qian2 Jianjie Chen
School of Electrical and Electronic Engineering,North China Electric Power University Baoding 071003 School of Electrical and Electronic Engineering,North China Electric Power University Baoding 071003 Shanxi Yuncheng Electric Power Supply Company Yuncheng 044000,China
国际会议
威海
英文
1306-1310
2011-07-06(万方平台首次上网日期,不代表论文的发表时间)