參考文獻(xiàn)
[1] XAVIER Á S, QIU F, AHMED S.Learning to solve large-scale security-constrained unit commitment problems[J].INFORMS Journal on Computing，2021，33(2) ：739-756.
[2] SHOULTS R R, CHANG S K, HELMICK S, et al.A practical approach to unit commitment, economic dispatch and savings allocation for multiple-area pool operation with import/export constraints[J].IEEE Transactions on Power Apparatus and Systems,1980，PAS-99(2) ：625-635.
[3] BURNS R M, GIBSON C A.Optimization of priority lists for a unit commitment program[C]//Proceeding IEEE Power Engineering Society Summer Meeting，1975，453-461.
[4] LEE F N . The application of commitment utilization factor (CUF) to thermal unit commitment[J].IEEE Transactions on Power Systems，1991，6(2) ：691-698.
[5] PANG C K, CHEN H C.Optimal short-term thermal unit commitment[J].IEEE Transactions on Power Apparatus and Systems，1976，95(4) ：1336-1346.
[6] PANG C K, SHEBLÉ G B, ALBUYEH F.Evaluation of dynamic programming based methods and multiple area representation for thermal unit commitments[J].IEEE Transactions on Power Apparatus and Systems，1981，PAS-100(3) ：1212-1218.
[7] COHEN A I, YOSHIMURA M.A branch-and-bound algorithm for unit commitment [J] . IEEE Transactions on Power Apparatus and Systems，1983，PAS-102(2) ：444-451.
[8] 謝國(guó)輝，張粒子，舒雋，等. 基于分層分枝定界算法的機(jī)組組合[J] . 電力自動(dòng)化設(shè)備，2009，29(12) ：29-32.
[9] HABIBOLLAHZADEH H, BUBENKO J A.Application of decomposition techniques to short-term operation planning of hydrothermal power system[J].IEEE Transactions on Power Systems，1986，1(1)：41-47.
[10] SASAK H, WATANAB M, KUBOKAWA J, et al.A solution method of unit commitment by artificial neural networks[J].IEEE Transactions on Power Systems，1992，7(3) ：974-981.
[11] LIANGL R H, KANG F C.Thermal generating unit commitment using an extended mean field annealing neural network[J].IEE Proceedings-Generation, Transmission and Distribution，2000，147(3)：164-170.
[12] JUSTE K A, KITA H, TANAKA E, et al.An evolutionary programming solution to the unit commitment problem[J].IEEE Transactions on Power Systems，1999，14(4) ：1452-1459.
[13] KAZARLIS S A, BAKIRTZIS A G, PETRIDIS V.A genetic algorithm solution to the unit commitment problem[J].IEEE Transactions on Power Systems，1996，11(1) ：83-92.
[14] LIN X, HOU Z J, REN H, et al.Approximate mixedinteger programming solution with machine learning technique and linear programming relaxation[C]//2019 3rd International Conference on Smart Grid and Smart Cities(ICSGSC).IEEE，2019 ：101-107.
[15] 張麗華. 基于內(nèi)點(diǎn)—分支定界法的最優(yōu)機(jī)組投入研究[D].南寧：廣西大學(xué)，2006.
[16] LINDEROTH J T, SAVELSBERGH M W P.A computational study of search strategies for mixed integer programming[J].INFORMS Journal on Computing，1999，11(2) ：173-187.
[17] APPLEGATE D, BIXBY R, CHVÁTAL V, et al.Finding cuts in the TSP (A preliminary report)[M].New Jersey: Rutgers University, New Brunswick, USA，1995 ：95-105.
[18] HE H, DAUME Ⅲ H, EISNER J M.Learning to search in branch and bound algorithms[J].Advances in Neural Information Processing Systems，2014，27 ：3293-3301.
[19] GASSE M, CHÉTELAT D, FERRONI N, et al.Exact combinatorial optimization with graph convolutional neural networks[J].Advances in Neural Information Processing Systems，2019，32 ：15554-15566.
