Systems and methods of determining optimal scheduling and dispatch of power resources

• US 9,865,024 B2
• Filed: 03/17/2014
• Issued: 01/09/2018
• Est. Priority Date: 03/15/2013
• Status: Active Grant

• Current Assignee: Open Access Technology International
• Original Assignee: Open Access Technology International
• Inventors: Mokhtari, Sasan, Ipakchi, Ali, Rahimi, Abdolhossein, Irisarri, Guillermo, Medina Palomo, Jose, Danai, Behnam, Muller, Nelson, Albuyeh, Farrokh
• Primary Examiner(s): Ali, Mohammad
• Assistant Examiner(s): Booker, Kelvin
• Application Number:
  US14/216,138
• Publication Number:
  US 20140277797A1
• Time in Patent Office: 1,394 Days
• Field of Search: None
• CPC Class Codes: G06Q 30/0202 Market predictions or forecasting for commercial activities
• CPC Class Codes: G06Q 50/06 Energy or water supply
• CPC Class Codes: Y04S 10/50 Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
• CPC Class Codes: Y04S 50/14 Marketing, i.e. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards

Abstract

A system and process/method is provided, which economically optimizes the dispatch of various electrical energy resources. The disclosed process/method is linked to and communicates with various sources of input data, including but not limited to, EMS/SCADA legacy Energy Management Systems (EMS), legacy Supervisory Control and Data Acquisition (SCADA) Systems, Demand Response (DR) and Distributed Energy Resources (DER) monitor, control, schedule, and lifecycle management systems (DR/DER Management System), and Energy Markets, electrical energy commodity trading systems (Trading Systems), and Operations System (OPS) in order to compute optimal day-ahead, day-of, and real-time schedules of various durational length for generation, demand response and storage resources while taking into account bilateral contracts and market-based trade opportunities.

Claims

1. A system for determining optimal scheduling and dispatch of power resources comprising:

a computer program for use with a computer having a memory;

a database;

the computer program running in the memory and for the input of data, which is stored in the database, and for calculation, organization, and reporting of power resource dispatch schedules to meet forecasted short-term demand, while minimizing both operating costs and interchange imbalances;

a application interface;

in which the computer program is configured to;

receive power resource input data comprised of energy management system data, supervisory control and data acquisition data, demand response/distributed energy resources availability parameter data, energy market data, trading system data and operation systems data;

organize the input data according to result characteristics;

allow for the creation of or import of a process execution trigger;

calculate power resource dispatch schedules which minimize imbalances and operation costs, upon the occurrence of the process execution trigger;

format dispatch schedule information for a particular use;

send dispatch schedules to second system, and

facilitate the generation of a report utilizing dispatch schedule information wherein the computer program dynamically optimizes resources in accordance with the formula;

Minimize Σ

^T_t=1Σ

^N+1_i=1C^P_i(p_i(t))

where C^P_i(p_i(t)) is the operating cost for resource i at time step t;

p_i(t) is the power amount (MW) of the resource i at time step t and constitutes the result or output of this function;

T is the number of steps in horizon, and

N is the number of dispatchable resources.

2. The system of claim 1 wherein the cost function is:

c_i^P(t)=a_i+b_ip_i(t)+c_ip_i²(t)

where the coefficients ai, bi, and ci are given, and pi(t) is the amount of generation, purchase/sale, or load of power resource at time step t.

3. The system of claim 1 wherein the minimization equation is subject to demand and reserve constraints:

Σ

_i=1^N+1p_i(t)=D(t);

Σ

_i=1^N+1R_i(t)≧

R(t);

Σ

_i=1^N+1IE_i(t)≧

IE(t);

R_i(t)≦

10*MSR_i;

p_i(t)+R_i(t)+IE_i(t)≦

P_i,

where;

D (t) Total demand at time t;

R(t) Reserve requirement at time t;

IE (t) Imbalance Energy requirement at time t;

R_i(t) Spinning reserve capacity from resource i at time step t;

IE_i(t) Imbalance Energy capacity from resource i at time step t;

P_i Upper capacity for resource i (accounting for any derates), and

MSR_i Maximum sustained ramp rate of resource i (MW/min).

4. The system of claim 1 wherein the minimization equation is subject to ramp constraints:

p_i(t)−

p_i(t−

1)≦

RU_i

p_i(t)−

p_i(t−

1)≧

−

RD_i

where RUi is the ramp-up limit (ramp up rate times dispatch interval) and RDi is the ramp-down limit (ramp down rate times dispatch interval) for Power Resource i.

5. The system of claim 1 wherein the minimization equation is subject to operating limit constraints:

p_i(t)≦

p_i(t)≦

p_i(t);

P_i≦

p_i(t)≦

P_i;

P_i≦

p_i(t)≦

P_i;

where;

P_i Lower capacity for resource i;

P_i Upper capacity for resource i.

6. The system of claim 1 wherein the minimization equation is subject to emission constraints:

Σ

_t=1^TΣ

_i=1^NgE_i(p_i(t))

where the function E_i(p_i(t)) is a non-negative linear function of p_i(t).

7. The system of claim 1 wherein the minimization equation is subject to ramp constraints.

8. A method for the determination, optimal scheduling and dispatch of power resources comprising the steps of:

receiving power resource input data comprised of energy management system data, supervisory control and data acquisition data, demand response/distributed energy resources availability parameter data, energy market data, trading system data and operation systems data;

organizing the input data according to result characteristics;

defining or importing a process execution trigger;

calculating power resource dispatch schedules which minimize operation costs, upon the occurrence of the process execution trigger;

formatting dispatch schedule information for a particular use;

sending dispatch schedules to a second system, and

facilitating the generation of a report utilizing dispatch schedule information,

wherein the computer program dynamically optimizes resources in accordance with the formula;

Minimize Σ

^T_t=1Σ

^N+1_i=1C^P_i(p_i(t))

where C^P_i(p_i(t)) is the operating cost for resource i at time step t;

p_i(t) is the power amount (MW) of the resource i at time step t and constitutes the result or output of this function;

T is the number of steps in horizon, and

N is the number of dispatchable resources.

9. The method of claim 8 wherein the cost function is:

c_i^P(t)=a_i+b_ip_i(t)+c_ip_i²(t)

where the coefficients ai, bi, and ci are given, and pi(t) is the amount of generation, purchase/sale, or load of power resource at time step t.

10. The method of claim 8 wherein the minimization equation is subject to demand and reserve constraints:

Σ

_i=1^N+1p_i(t)=D(t);

Σ

_i=1^N+1R_i(t)≧

R(t);

Σ

_i=1^N+1IE_i(t)≧

IE(t);

R_i(t)≦

10*MSR_i;

p_i(t)+R_i(t)+IE_i(t)≦

P_i,

where;

D(t) Total demand at time t;

R(t) Reserve requirement at time t;

IE(t) Imbalance Energy requirement at time t;

R_i(t) Spinning reserve capacity from resource i at time step t;

IE_i(t) Imbalance Energy capacity from resource i at time step t;

P_i Upper capacity for resource i (accounting for any derates), and

MSR_i Maximum sustained ramp rate of resource i (MW/min).

11. The method of claim 8 wherein the minimization equation is subject to ramp constraints:

p_i(t)−

p_i(t−

1)≦

RU_i

p_i(t)−

p_i(t−

1)≧

−

RD_i

where RUi is the ramp-up limit (ramp up rate times dispatch interval) and RDi is the ramp-down limit (ramp down rate times dispatch interval) for Power Resource i.

12. The method of claim 8 wherein the minimization equation is subject to ramp constraints.

13. The method of claim 8 wherein the minimization equation is subject to operating limit constraints:

p_i(t)≦

p_i(t)≦

p_i(t);

P_i≦

p_i(t)≦

P_i;

P_i≦

P_i(t)≦

P_i;

where;

P_i Lower capacity for resource i;

P_i Upper capacity for resource i.

14. The method of claim 8 wherein the minimization equation is subject to emission constraints:

Σ

_t=1^TΣ

_i=1^NgE_i(p_i(t))

where the function E_i(p_i(t)) is a non-negative linear function of p_i(t).