Consumer payment minimization under uniform pricing: A mixed-integer linear programming approach

被引:20
|
作者
Fernandez-Blanco, Ricardo [1 ]
Arroyo, Jose M. [1 ]
Alguacil, Natalia [1 ]
机构
[1] Univ Castilla La Mancha, ETSI Ind, Dept Ingn Elect Elect Automat & Comunicac, E-13071 Ciudad Real, Spain
关键词
Consumer payment minimization; Declared social welfare maximization; Inter-temporal constraints; Market-clearing procedure; Mixed-integer linear programming; Uniform pricing; DEREGULATED ELECTRICITY MARKETS; UNIT COMMITMENT; COST MINIMIZATION; POWER; OPTIMIZATION; AUCTION; POOL; SYSTEMS; TERM;
D O I
10.1016/j.apenergy.2013.10.015
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
This paper presents a multi-period auction for a day-ahead pool-based electricity market in which consumer payment for energy is minimized under uniform pricing. This optimization problem has been recently characterized as a non-separable, non-linear, mixed-integer, and combinatorial problem for which exact solution techniques are unavailable. We present a novel approach suitable for existing mixed-integer linear solvers. A major contribution of this paper is the explicit characterization of uniform market-clearing prices as primal decision variables. The proposed methodology allows considering both quadratic and piecewise linear supply offers. In addition, the market-clearing procedure also takes into account inter-temporal operational constraints such as start-ups, ramp rates, and minimum up and down times, which may be part of generation offers. This approach provides the system operator and market agents with a valuable tool to assess consumer payment minimization versus currently used declared social welfare maximization. This conclusion is backed by simulation results obtained with off-the-shelf software. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:676 / 686
页数:11
相关论文
共 50 条
  • [31] Multiobjective Optimization of Mixed-Integer Linear Programming Problems: A Multiparametric Optimization Approach
    Pappas, Iosif
    Avraamidou, Styliani
    Katz, Justin
    Burnak, Baris
    Beykal, Burcu
    Turkay, Metin
    Pistikopoulos, Efstratios N.
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2021, 60 (23) : 8493 - 8503
  • [32] Scheduling of a Consumer Goods Production Plant with Intermediate Buffer by Decomposition and Mixed-integer Linear Programming
    Yfantis, Vassilios
    Corominas, Francesc
    Engell, Sebastian
    IFAC PAPERSONLINE, 2019, 52 (13): : 1837 - 1842
  • [33] A mixed-integer programming approach to the parallel replacement problem under technological change
    Bueyuektahtakin, I. Esra
    Hartman, Joseph C.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (03) : 680 - 695
  • [34] An efficient approach for solving mixed-integer programming problems under the monotonic condition
    Bragin M.A.
    Luh P.B.
    Yan J.H.
    Stern G.A.
    Journal of Control and Decision, 2016, 3 (01): : 44 - 67
  • [35] Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
    Rebennack, Steffen
    Krasko, Vitally
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 507 - 530
  • [36] A Mixed-Integer Programming Approach for the Design of Homogeneous Magnets
    Chan, T.
    Dayarian, I.
    Jaffray, D.
    Stanescu, T.
    MEDICAL PHYSICS, 2017, 44 (06) : 3156 - 3156
  • [37] A mixed-integer programming approach to GRNN parameter estimation
    Lee, G. E.
    Zaknich, A.
    INFORMATION SCIENCES, 2015, 320 : 1 - 11
  • [38] Mixed-integer programming for control
    Richards, A
    How, J
    ACC: PROCEEDINGS OF THE 2005 AMERICAN CONTROL CONFERENCE, VOLS 1-7, 2005, : 2676 - 2683
  • [39] Mixed-time mixed-integer linear programming scheduling model
    Westerlund, Joakim
    Hastbacka, Mattias
    Forssell, Sebastian
    Westerlund, Tapio
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2007, 46 (09) : 2781 - 2796
  • [40] A mixed-integer programming approach to networked control systems
    Zhang, G.
    Chen, X.
    Chen, T.
    INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, 2008, 5 (04) : 590 - 611