© The Institution of Engineering and Technology
A new approach to unit commitment problem is presented using absolutely stochastic simulated annealing method. In every iteration, a solution is taken with a certain probability. Typically in simulated annealing minimisation method, a higher cost feasible solution is accepted with temperature-dependent probability; however, other solutions are accepted deterministically. That may lead to the near optimisation slowly. However, all the solutions of both higher and lower costs, are associated with acceptance probabilities to make an early jump from one local minimum to other so that it can search and compare more local minima within the same time/iteration limit. Besides, the number of bits flipping is decided by the appropriate distribution. Excess units with system-dependent probability distribution handle constraints efficiently. Sensitivity of the distribution parameters is tolerable. To reduce economic load dispatch calculations, a sign bit vector is introduced as well. The proposed method is then tested using the reported problem data set. Simulation results are compared to previous reported results. Numerical results show an improvement in solution cost and time compared to the results obtained from powerful algorithms.
References
-
-
1)
-
F.N. Lee
.
A fuel-constrained unit commitment method.
IEEE Trans. Power Syst.
,
3 ,
1208 -
1218
-
2)
-
A.H. Mantawy ,
Y.L. Abel-Mogid ,
S.Z. Selim
.
A simulated annealing algorithm for unit commitment.
IEEE Trans. Power Syst.
,
1 ,
197 -
204
-
3)
-
C.J. Baldwin ,
K.M. Dale ,
R.F. Dittrich
.
A study of economic shutdown of generating units in daily dispatch.
IEEE Trans. Power Appar. Syst.
,
1272 -
1284
-
4)
-
H.H. Happ ,
R.C. Johnson ,
W.J. Wright
.
Large scale hydro-thermal unit commitment-method and results.
IEEE Trans. Power Appar. Syst.
,
3 ,
1373 -
1384
-
5)
-
A.I. Cohen ,
M. Yoshimura
.
A branch-and-bound algorithm for unit commitment.
IEEE Trans. Power Appar. Syst.
,
444 -
451
-
6)
-
Z. Ouyang ,
S.M. Shahidehpour
.
An intelligent dynamic programming for unit commitment application.
IEEE Trans. Power Syst.
,
3 ,
1203 -
1209
-
7)
-
F. Zhuang ,
F.D. Galiana
.
Toward a more rigorous and practical unit commitment by Lagrangian relaxation.
IEEE Trans. Power Syst.
,
763 -
773
-
8)
-
G.S. Lauer ,
D.P. Bertsekas ,
N.R. Sandell ,
T.A. Posbergh
.
Solution of large-scale optimal unit commitment problems.
IEEE Trans. Power Appar. Syst.
,
79 -
86
-
9)
-
T. Satoh ,
K. Nara
.
Maintenance scheduling by using simulated annealing method [for power plants].
IEEE Trans. Power Syst.
,
2 ,
850 -
857
-
10)
-
H. Mori ,
O. Matsuzaki
.
Application of priority-list-embedded tabu search to unit commitment in power systems.
Inst. Electr. Eng. (Japan)
,
4 ,
535 -
541
-
11)
-
F. Zhuang ,
F.D. Galiana
.
Unit commitment by simulated annealing.
IEEE Trans. Power Syst.
,
1 ,
311 -
318
-
12)
-
S. Virmani ,
E.C. Adrian ,
K. Imhof ,
S. Mukherjee
.
Implementation of a Lagrangian relaxation based unit commitment problem.
IEEE Trans. Power Syst.
,
4 ,
1373 -
1380
-
13)
-
S.Y.W. Wong
.
An enhanced simulated annealing approach to unit commitment’, Electr. Power Energy Syst.,.
-
14)
-
I.G. Damousis ,
A.G. Bakirtzis ,
P.S. Dokopoulos
.
A solution to the unit-commitment problem using integer-coded genetic algorithm.
IEEE Trans. Power Syst.
,
2 ,
1165 -
1172
-
15)
-
A.J. Svoboda ,
C.L. Tseng ,
C.A. Li ,
R.B. Johnson
.
Short-term resource scheduling with ramp constraints [power generation scheduling].
IEEE Trans. Power Syst.
,
1 ,
77 -
83
-
16)
-
K.-Y. Huang ,
H.-T. Yang ,
C.-L. Huang
.
A new thermal unit commitment approach using constraint logic programming.
IEEE Trans. Power Syst.
,
936 -
945
-
17)
-
A.H. Mantawy ,
Y.L. Abel-Mogid ,
S.Z. Selim
.
Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem.
IEEE Trans. Power Syst.
,
3 ,
829 -
836
-
18)
-
C.-P. Cheng ,
C.-W. Liu ,
C.-C. Liu
.
Unit commitment by annealing-genetic algorithms’, Electr. Power Energy Syst.,.
-
19)
-
C.P. Cheng ,
C.W. Liu ,
C.C. Liu
.
Unit commitment by Lagrangian relaxation and genetic algorithms.
IEEE Trans. Power Syst.
,
2 ,
707 -
714
-
20)
-
S.A. Kazarlis ,
A.G. Bakirtzis ,
V. Petridis
.
A genetic algorithm solution to the unit commitment problem.
IEEE Trans. Power Syst.
,
1 ,
83 -
92
-
21)
-
W.L. Peterson ,
S.R. Brammer
.
A capacity based Lagrangian relaxation unit commitment with ramp rate constraints.
IEEE Trans. Power Syst.
,
2 ,
1077 -
1084
-
22)
-
K.A. Juste ,
H. Kita ,
E. Tanaka ,
J. Hasegawa
.
An evolutionary programming solution to the unit commitment problem.
IEEE Trans. Power Syst.
,
4 ,
1452 -
1459
-
23)
-
T. Senjyu ,
K. Shimabukuro ,
K. Uezato ,
T. Funabashi
.
A fast technique for unit commitment problem by extended priority list.
IEEE Trans. Power Syst.
,
2 ,
882 -
888
-
24)
-
G.K. Purushothama ,
L. Jenkins
.
Simulated annealing with local search – a hybrid algorithm for unit commitment.
IEEE Trans. Power Syst.
,
1 ,
273 -
278
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-gtd_20050574
Related content
content/journals/10.1049/iet-gtd_20050574
pub_keyword,iet_inspecKeyword,pub_concept
6
6