The Parallel Interior Point for Solving the Continuous Optimization Problem of Unit Commitment

被引:0
|
作者
Hu, Guili [1 ]
Yang, Linfeng [1 ,2 ]
机构
[1] Guangxi Univ, Sch Comp Elect & Informat, Nanning, Peoples R China
[2] Guangxi Univ, Guangxi Key Lab Power Syst Optimizat & Energy Tec, Nanning, Peoples R China
关键词
interior point method; parallel computing; unit commitment; electric power system;
D O I
暂无
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
The main objective of safe and economical operation of electric power systems is to arrange the generator set to put into operation and finally minimize the total cost while meeting certain load demand. The objective of this paper is to minimize the sum of the cost of power generation and the cost of start-up. The primal dual interior point method (PD-IPM) can effectively solve the continuous optimization problem. However the unit commitment problem is a combinatorial optimization problem of large-scale, non-convex, complex and high dimension. Therefore, by processing the problem model, we can make full use of the PD-IPM to solve the model, and design an algorithm to solve the model in parallel, so as to improve the efficiency of the calculation. Using the PD-IPM, this paper tends to explore the solution of unit commitment optimization problem with continuous relaxation.
引用
收藏
页码:1333 / 1338
页数:6
相关论文
共 50 条
  • [1] Unit commitment optimization based on priority list and interior point methods
    Wang, Jian
    Liu, Tian-Qi
    Liu, Xue-Ping
    [J]. Dianli Xitong Baohu yu Kongzhi/Power System Protection and Control, 2010, 38 (13): : 55 - 60
  • [2] A floating-point genetic algorithm for solving the unit commitment problem
    Dang, Chuangyin
    Li, Minqiang
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) : 1370 - 1395
  • [3] Solving the continuous nonlinear resource allocation problem with an interior point method
    Wright, Stephen E.
    Rohal, James J.
    [J]. OPERATIONS RESEARCH LETTERS, 2014, 42 (6-7) : 404 - 408
  • [4] Solving Unit Commitment problem using Hybrid Particle Swarm Optimization
    Ting, TO
    Rao, MVC
    Loo, CK
    Ngu, SS
    [J]. JOURNAL OF HEURISTICS, 2003, 9 (06) : 507 - 520
  • [5] Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization
    Tiew-On Ting
    M.V.C. Rao
    C.K. Loo
    S.S. Ngu
    [J]. Journal of Heuristics, 2003, 9 : 507 - 520
  • [6] Solving the Unit Commitment Problem with Improving Binary Particle Swarm Optimization
    Liu, Jianhua
    Wang, Zihang
    Chen, Yuxiang
    Zhu, Jian
    [J]. ADVANCES IN SWARM INTELLIGENCE, ICSI 2022, PT I, 2022, : 176 - 189
  • [7] An interior-point algorithm for solving inverse linear optimization problem
    Akbari, Z.
    Peyghami, M. Reza
    [J]. OPTIMIZATION, 2012, 61 (04) : 373 - 386
  • [8] Solving unit commitment problem by combining of continuous relaxation method and genetic algorithm
    Tokoro, Ken-ichi
    Masuda, Yasushi
    Nishino, Hisakazu
    [J]. 2008 PROCEEDINGS OF SICE ANNUAL CONFERENCE, VOLS 1-7, 2008, : 3323 - +
  • [9] Solving the Unit Commitment Problem by a Unit Decommitment Method
    C. L. Tseng
    C. A. Li
    S. S. Oren
    [J]. Journal of Optimization Theory and Applications, 2000, 105 : 707 - 730
  • [10] Solving the unit commitment problem by a unit decommitment method
    Tseng, CL
    Li, CA
    Oren, SS
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 105 (03) : 707 - 730