994-2013 China Academie Jo 22(2018)04-0077-06 a : sto0so, 2, : PA 2 TMB2L 6 5) Application of a Heuristic Ant Colony Optimization Algorithm in Unit Commitment LAI Yuyang!, FAN Ying’. BAI Yan China Southern Power Grid Research I 2, North China Electric Power University, Bejing uc - MMAS MMAS Abstract, Unit commitment (UC) isa complicated program- ‘ming problem including both integral number and real num ber progeamming. In this paper, Quadeatic Programming is ‘used 10 find the optimal load distribution for different unit commitment under different periods, and the unit commit~ ment with minimum fuel cost in exch period is used as hei ristic initial solution, And solution space is reduced greetly by a kind of method that eliminates unreasonable candidate ‘operation combination according 10 information from solu tion, Maxmin ant system (MMAS) algorithm is used t0 search the best strategy of unit commitment in solution space, In order 10 improve the efficieney of MMAS local searching is introduced after algorithm finishes iteration. In order 10 reduce startup fuel cost, operation unit number factor and penalty term of startup fuel cost are added in probability formula of ant transferring and information up- dating expresses 10 reduce the selection probability of combi- nation with high fuel cost, therefore to optimize operation ‘unit number at each period. Simulation results show that =~ ove improvement can accelerate solution speed of algo- sol aos 8 Mode Electric Power stitute, Guangzhou 510080, China, 16, China rithm, hich bas strong global optimization ability. Key words system fuel cost; heuristic factor ‘unit commitments local setsehs maxmin ant 0 Cunit commitment, UC) uc uc (quadratic programming) ) Vol 30 Aug Nad 201s, All rights reserved, _http://www.enkinetuc 10 : 1 uc ming = SY 8 Cu CP) Fa 1 Si] @ ' Tt 1 ioe 1 ° LP, bor ho @ @ bar ve o © w 1 © 2 uc, 90% uc oO. DP.) = Dar phe be ste SP. = Pan Pow © 994-2013 China Aca nal Electronic Publishing Hi 6) D © uc : uc MMAS(Max-min ant system) : « ) MMAS al : ue . inf) = YY mink CP,» o Vink) ®) tux (1 — YOOS) /(CCavg —1) YS) o a0) «aD, a2) > 43 sae a2 + oy All rights reserved, http://www.enki.net79 a3 tp 6) h S$.) * Hr SDs x Gy. d-pr ab (a2) Aries . %, : : Hy wu GH H G Py BB Sy th er) Frat > Fra + S.. (2) — To 0 0 1 0 0 5 0 0 0 lb 0 0 0 Hoo oo 2 0 0 0 Iso 0 0 M0 0 0 bo 0 0 wb 0 0 0 7 0 0 0 Iso 0 0 Iso 0 0 2 9 0 2% 0 0 I 1 cou Mea Q 1 Hor Sua ‘ «s) > Fat WS Ts a) Tt Pada aa Paani aa Paani aa or tt aa ort ta aa Pio rida oto ta at oto tia ooo raat ooo ta a at ooo raat ooo raat ooo raat ooo ta a at ooo raat ooo raat ooo raat oro aad oto tia Pio rida Paani aa Paani aa Piatra a & —» > Fan > Fo + San (Le) a k80 2o1s Far > Bat SIS) -Sud D1 ay : “ [10] ® 4 3-01 16 HD as) ® sh —DILQE a . 1xto™, . + Su (an /ar - 4a a» : ' “ (TST) > 14 5 . Lhe 8 . . 4 Ts. 8. 7, 8, 9, 10], S.)=S, 1 x Gor . v t , . k . 43 SEs.) — as) : : Fur + ISG) > . . > Fart DUS. Ss" . . fea. 0 Hw . . ao) we as), a7) a : r 1 hoot wor . Sits'M-s'r—v] 2 1 5B Ante 4 " ' 17 . COILS. WIS, : : : 1 A Briers SD + Fan A= pa as) 994-2013 China Academic Journal Electronic Publishing House. All rightsl 5 UC © ® oO @ 41 ® MMAS . @ . ® acy . oO ® : a ® av ® : a2), cs) . ® . 6 ant num B 9, o=03, pHa, q=l0, matlab 7, 0 . 300 . 78 9601, 1 . 130 . 2 MMAS: : 79.080 t, 250 a) 994-2013 China Academic Joumal Electronic Publishing H 0159 B vss ivssof 19159 eos ans ao 6 " Is 19 20 2 22 2s 2 1D a 6 8S 106 — musi ME OR 1 169100 211 232253 74295 sate 1 MMas — usin MERU (7 WS 108127 148 109 1907 sath 2 MMAS 2 T 7 e oT 7 oT TO ooo 1 to boo 1 to boo 1 to boo 1 to ooo 1 to boo 1 to bo oo 1 oO oo oo 1 oO oo oo to bo oo to ooo 1 to boo 1 to ooo 1 to ee)82 2o1s 3 r r "= ACOBPSO 7 t 0785 79807 79 035) 7010 Tis 78970 78960 seateh, 2007, 181(3); 1870-1995, 7 [7] Stutele T, Hoos HH, MAX-MIN Ant System [1]. Future Generation Computer Systems, 2000, 168); 899914, : Suneim T, Ongsslul W. Ant colony search algo~ : uc + MMAS rithm for unit commitment (C] // 2008 IEEE In . ternational Conference on Industri! Technology, MMAS. 2008; 72-77 cy 994-2013 China Ac Aiying Rong. Henri Hskonen, Risto Lihdelma, A. variant of the dynamie programming algorithm for u- nit commitment of combined hest and power systems cH. 2008, 5 European Journal of Operational Research, 190(3): 741-755, Thorin, Heike Brand, Christoph Weber, Long- term optimization of cogeneration systems in « com petitive market environment [J] 2005, 81(2): 152-168, Weinun Ge, Rat Applied Energy, Rate Consttained Unit Commit- ot by Improved Priority List and Enhanced Parti le Swatm Optimization (C]_// 2010 International Conference on Computational Intelligence and Soft- ware Engineering (CiSE) , 2016, Wang Lingleng, Sing Chanan, Unit commitment considering generator outages through a mixed-inte- ger particle swarm optimization slgorithm [C] // Region 261-266, Swarup KS, Yamnashito $, Unit commitment solu- U2. 1 way Conference, 2006 IEEE: tion methodology using genetic algorihs Transuetions on Power Systems, 20 87-91, Chuangyin Dang, Mingiang Li, A floating-point ge- etic algorithm for solving the unit commitment problem [J], European Journal of Operational Re- [9] (0) oy ts) oy Ls) Marco Dorigo, Thoms Stutale, + 2007, + 1997, 21 1), AL, Ul. + 2004, 24 (Hy, 2428, tn, + 1999, Is aa: OU. 2008, 32 Hopfield 2. 2008, 27 (2): 41-4, on 2001, 24 (7); 24-245, sil, askye0407@ 163, com asi asst), HERE, HAL)