AU2017248557A1 - Operation plan creating apparatus, operation plan creating method, and program - Google Patents

Operation plan creating apparatus, operation plan creating method, and program Download PDF

Info

Publication number
AU2017248557A1
AU2017248557A1 AU2017248557A AU2017248557A AU2017248557A1 AU 2017248557 A1 AU2017248557 A1 AU 2017248557A1 AU 2017248557 A AU2017248557 A AU 2017248557A AU 2017248557 A AU2017248557 A AU 2017248557A AU 2017248557 A1 AU2017248557 A1 AU 2017248557A1
Authority
AU
Australia
Prior art keywords
operation plan
generator
time frame
candidates
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
AU2017248557A
Inventor
Atsushi Hashimoto
Jin Murata
Shizu Sakakibara
Shotaro Yamane
Takufumi Yoshida
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Toshiba Corp
Original Assignee
Toshiba Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Toshiba Corp filed Critical Toshiba Corp
Publication of AU2017248557A1 publication Critical patent/AU2017248557A1/en
Priority to AU2020200492A priority Critical patent/AU2020200492A1/en
Abandoned legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

In one embodiment, an operation plan creating apparatus creating an operation plan for a generator which indicates operational state in a unit time. The apparatus includes a first, a 5 second and a third calculator, and an operation plan creator. The first calculator calculates a time frame constituted by a successive multiple unit times. The second calculator calculates multiple operation plan candidates for the generator in the time frame. The third calculator calculates coefficients associated with the 10 operation plan candidates on the basis of an initial solution of the operation plan of the generator in the time frame. The operation plan creator identifies one of the operation plan candidates in the time frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the 15 coefficients at least either in an objective function or in a limitation condition. (Fig. 1) S101 OBTAINER OBTAINES AND STORES INFORMATION NECESSARY FOR CALCULATION TIME FRAME CALCULATOR CALCULATES TIME FRAME IT TIME FRAMES, UNITS INITIAL SOLUTION CALCULATES INITIAL OPERATION PLAN CANDIDATE SOLUTION* CALCULATOR CALCULATES OPERATION PLAN CANDIDATES OPERATION PLAN CANDIDATES S 1 0 5 COEFFICIENT CALCULATOR CALCULATES COEFFICIENTS ASSOCIATED WITH OPERATION PLAN CANDIDATES 810 OPERATION PLAN CREATOR CREATES OPERATION PLAN S107 STORAGE STORES OPERATION PLAN ( END

Description

BACKGROUND
Any discussion of the prior art throughout the specification should in no way be considered as an admission that such prior art is widely known or forms part of common general knowledge in the field.
Creation of an operation plan for a generator is one of the important tasks for a power generation department or the like of a general electric utility corporation. The costs associated with the operation of generators can be reduced if it is possible to create an operation plan that accommodates a predicted power demand and at the same time minimizes the number of generators to be operated.
However, a lot of limitations other than power demand are imposed upon the operation of generators. For example, when a operation plan during mid or long time period extending for a time period of several months is to be created, the stock and the like of the bases where fuels used by the generators are stored will also constitute limitation. The greater the number of limitations, the higher the load on the process of calculation of the operation plan, thereby takes time to create the operation plan.
SUMMARY
One embodiment provides an operation plan creating apparatus creating an operation plan of a generator which indicates operational state in a unit time, the apparatus com prising:
a time frame calculator configured to calculate a time frame constituted by a successive multiple unit times;
an operation plan candidate calculator configured to
2017248557 20 Oct 2017 calculate multiple operation plan candidates for the generator in the time frame;
a coefficient calculator configured to calculate coefficients associated with the operation plan candidates on the basis of an initial solution of the operation plan of the generator in the time frame; and an operation plan creator configured to identify one of the operation plan candidates in the time frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the coefficients at least either in an objective function or in a limitation condition.
One embodiment provides an operation plan creating method for creating an operation plan of a generator which indicates operational state in a unit time, the method comprising:
calculating a time frame constituted by a successive multiple unit times;
calculating multiple operation plan candidates for the generator in the time frame;
calculating coefficients associated with the operation plan 20 candidates on the basis of an initial solution of the operation plan of the generator in the time frame; and identifying one of the operation plan candidates in the time frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the coefficients at least either in an objective function or in a limitation condition.
One embodiment provides a program for creating an operation plan of a generator which indicates operational state in a unit time, the program causing a computer to execute:
calculating a time frame constituted by a successive 30 multiple unit times;
calculating multiple operation plan candidates for the generator in the time frame;
calculating coefficients associated with the operation plan candidates on the basis of an initial solution of the operation plan of the generator in the time frame; and identifying one of the operation plan candidates in the time
2017248557 20 Oct 2017 frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the coefficients at least either in an objective function or in a limitation condition.
Unless the context clearly requires otherwise, throughout 5 the description and the claims, the words “comprise”, “comprising”, and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to”.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram illustrating an example of a schematic configuration of an operation plan creating apparatus in accordance with an embodiment of the present invention.
FIG. 2 is a diagram for explanation of operation plan 15 candidates.
FIG. 3 is a diagram illustrating an example of a schematic flowchart of overall processing of the operation plan creating apparatus in accordance with this embodiment.
FIG. 4 is a block diagram illustrating an example of a 20 hardware configuration of the operation plan creating apparatus in accordance with this embodiment.
DETAILED DESCRIPTION
An embodiment of the present invention reduces the time 25 taken to create an operation plan for a generator.
An operation plan creating apparatus in accordance with an embodiment of the present invention is an apparatus that creates an operation plan for a generator which indicates operational state in a unit time. The operation plan creating apparatus includes a time frame calculator, an operation plan candidate calculator, a coefficient calculator, and an operation plan creator. The time frame calculator is configured to calculate a time frame constituted by a successive multiple unit times. The operation plan candidate calculator is configured to calculate multiple operation plan candidates for the generator in the time frame. The coefficient calculator is configured to calculate coefficients
2017248557 20 Oct 2017 associated with the operation plan candidates on the basis of an initial solution of the operation plan of the generator in the time frame. The operation plan creator is configured to identify one of the operation plan candidates in the time frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the coefficients at least either in an objective function or in a limitation condition.
An embodiment of the present invention will be described below with reference to the drawings.
(Embodiment ofthe Present Invention)
FIG. 1 is a block diagram that illustrates an example of a schematic configuration of an operation plan creating apparatus in accordance with an embodiment of the present invention. The operation plan creating apparatus 1 illustrated in FIG. 1 includes a storage (obtainer) 11, an initial solution calculator 12, a time frame calculator 13, an operation plan candidate calculator 14, a coefficient calculator 15, and an operation plan creator 16.
The operation plan creating apparatus 1 is configured to create an operation plan for a generator on the basis of a limitation condition (limitation expressions) and an objective function, the limitation condition being for a power demand or the like to be predicted, and the objective function being indicative of a predetermined objective. An operational state of a generator in a unit time is indicated in the created operation plan such that the predetermined objective can be realized while satisfying the limitation conditions.
The unit time is the minimum unit of time (or time period) in an operation plan. It is assumed here that operational states of generators in the unit time are uniquely defined and do not change during the same unit time. Hence, the amount of power generation in the unit time by a generator or one single group including multiple generators becomes constant. Accordingly, for example, if simultaneous balancing (the consistency between the power demand and the amount of power generation) for 30 minutes is considered, then the unit time may be defined as 30 minutes. In this manner, the unit time may be defined based on
2017248557 20 Oct 2017 a time period for which the amount of power generation is to be measured.
In the following discussions on the operational states of generators, two operational states are considered, i.e., an
OPERATING (ON) state in which an electrical power is output and a STOPPING (OFF) state in which an electrical power is not output. It should be noted that an operational state that is not OPERATING or STOPPING may be provided as well. For example, the operation of a generator may be divided into a
NORMAL OPERATI NG in which the maximum output power of the generator is output, and TEST OPERATING in which several tens of percent of the maximum output power of the generator is output, and thus three or more types of the operational states may be provided. In contrast, the operational state in which the electrical power is output but the electrical power that is output is less than the maximum output power of the generator may be handled as being the STOPPING. For example, the operational state where a first generator has been activated but is not yet to be ready for outputting its maximum output power may he regarded as STOPPING and insofar as calculation is concerned, the amount of power generation of the first generator may not be added to the total amount of power generation of all the generators.
The predetermined objective may be defined as appropriate. For exam pie, the objective m ay be reduction of the operation cost that indicates the costs associated with the operation of a generator or a group including generators. The objective may be to make the operation cost close to a predetermined objective value. The predetermined objective value may also be defined as appropriate.
The limitation conditions imposed in creation of the operation plan may include a limitation condition associated with one single generator (unit limitation condition). A limitation condition associated with one single group including multiple generators (group limitation condition) may be included as well.
The unit limitation condition is a limitation condition regarding the
2017248557 20 Oct 2017 operations of the individual generators such as a stop time period and activation and stop curve of the generator. The group limitation condition is a limitation condition regarding the input and output of the group as a whole. For exam pie, a total amount of power generation of the group as a whole and a total fuel consumption of the group as a whole may be considered.
It is assumed here that the group is defined. For example, all of the generators for creating the plan should be performed may be handled as belonging to one single group. Alternatively, generators to which gas is supplied from the same gas base may be handled as belonging to one single group. Still alternatively, generators that supply electrical power to a particular area may be handled as belonging to one single group. Also, one generator may belong to two or more groups.
Although this embodiment considers a case where the operation plan creating apparatus 1 is supposed to create an operation plan applicable to multiple generators, the operation plan creating apparatus 1 may create an operation plan that is only applicable to one single generator. Also, the types of generators are not limited to particular ones. The generators may include a generator of thermal, hydraulic, or nuclear power generation. The generators may also include a generator that utilizes renewable energy, including wind, photovoltaic, geothermal, and biomass energies, or any other form of energy.
The generators may further include a generator of hydrogen power generation. Also, the types of the generators may be the same or different from each other.
The length of the whole time period of the operation plan to be created is not limited to any particular length of time. It may be created for each hour, each day, or other mid or long time periods in the order of several months. It should be noted that the number of limitation conditions imposed on the monthly operation plan becomes larger than in a case where hourly or daily operation plan or plans are created. As a result, the time required to complete the creation of the operation plan will be prolonged. However, the operation plan creating apparatus 1 in
2017248557 20 Oct 2017 accordance with this embodiment can reduce the time required to complete creation of the operation plan even when it is an operation plan during mid or long time period. Details will be described later.
The constituent components of the operation plan creating apparatus 1 will be described in detail below.
The storage (obtainer) 11 is configured to obtain, as data, information for use in creation of the operation plan and store the information that has been obtained. The information for use in creation of the operation plan includes information regarding the objective function and information regarding the limitation conditions. For example, when the objective is to reduce the operation cost, then the operation cost of the generator per unit time is stored in the storage 11. Also, as the information regarding the limitation conditions, a power demand predicted in the time period of the operation plan to be created is stored in the storage 11. Since the power demand is the amount of electrical power to be supplied by multiple generators, it is necessary to provide information such as amount of power generation per unit time of the respective generators. Hence, the information indicative of the characteristics of the generator is also stored in the storage 11. The information indicative of the characteristics of the generators is hereinafter referred to as generator characteristics. Also, for example, if the operation cost is calculated from the costs of the items such as fuel used by the respective generators, the information regarding the costs of the items may also be stored in the storage 11.
It should be noted that the operation plan creating apparatus 1 may have multiple storages. In other words, the storage 11 may be configured by multiple storages. For example multiple storages may exist in the operation plan creating apparatus 1 and the types of the pieces of information to be stored in the respective storages may differ from each other.
The information stored in the storage 11 may be stored in the storage 11 by the user prior to actual creation of the operation plan or may be obtained from an external device or system by the
2017248557 20 Oct 2017 operation plan creating apparatus 1 to store it in the storage 11. As in the case of the example of FIG. 1, the operation plan creating apparatus 1 may obtain the power demand from the power demand prediction system 2, obtain generator characteristics from the generator characteristics obtaining system 3, and obtain input information from the input/output interface 4. The input information is information entered by a user, etc. The input information considered here may be information whose value varies within the time period for which the operation plan is created, amongst the pieces of information regarding the objective function and the limitation condition. For example, maintenance intervals of the generators and their fuel costs may be considered.
It should be noted that if the information is obtained from an external device or system as illustrated in FI G. 1, the operation plan creating apparatus 1 is directly connected or indirectly connected to the external device or system via a communication interface or a device interface so that transmission and reception of data can be performed. The information necessary for transmission and reception of data such as an IPaddress and the like is stored in the storage 11 prior to the creation of the operation plan.
Also, the storage 11 may obtain the results of the processing by the respective constituent components of the operation plan creating apparatus 1 to store the obtained results. For example, the storage 11 may store the created operation plan. Also, the information stored in the storage 11 may be output on the input/output interface 4 or may be sent to the external device or system .
The initial solution calculator 12 is configured to calculate an initial solution of the operation plan. The initial solution of the operation plan refers to an operation plan that does not consider all of the various limitation conditions and is defined based on only part of the limitation conditions.
In accordance with this embodiment, a power demand is included as a part of the limitation conditions. That is, an
2017248557 20 Oct 2017 operation plan that does not taken into account the limitation other than the power demand but meets the power demand and at the same time guarantees the minimum operation cost is defined as the initial solution. In this case, for example, the initial solution calculator 12 may determine the generators in an ascending order of the operation cost that should be ON (to be operated) in each unit time until the power demand for each unit time is satisfied, and then the initial solution may be calculated. Also, the initial solution may be calculated by solving an optimization problem that uses some of the limitation conditions to be considered.
The time frame calculator 13 is configured to calculate one or more time frames. The time frame is part of the time period for which the operation plan is created, and constituted by successive unit times. The operation plan to be created will be a set of the operation plans of the individual time frames. The length of the time frame will be the integral multiple of the unit time. For example, if the unit time is 30 minutes, then the time framewill beatimeperiod oftimeequaltotheintegral multipleof
30 minutes such as 300 minutes and 720 minutes.
The length of the time frame may be defined as appropriate taking into account the processing load of the operation plan creating apparatus 1 or the like as long as it is an integral multiple of the unit time. The lengths of the time frames may be the same or different from each other. For example, the lengths of the respective time frames may be uniformly 300 minutes. Alternatively, the length of a first time frame may be defined as 300 minutes while the length of a second time frame may be defined as 720 minutes.
The time frame may be defined based on the power demand. It should be noted that the time frame may be defined based on the range of the value of the power demand or may be defined based on the shape or the like of the graph of the power demand. In the case where the time frame is defined based on the shape of the graph, the time frame may be defined, for ex ample, as the time period of time from the time point where the
2017248557 20 Oct 2017 graph of the power demand shows the local maximum valuetothe time point where the graph of the power demand has the local minimum value.
The operation plan candidate calculator 14 is configured to 5 calculate multiple operation plan candidates for each generator in each time frame. FIG. 2 is a diagram that illustrates the operation plan candidates. The time frame is illustrated in the upper area of FIG. 2. The time frame of FIG. 2 is constituted by ten unit times. As mentioned above, the operational states of the generators are determined for each unit time within the time fram e.
The initial solution of the operation plan of the generator indicated as a unit u in the time frame is illustrated in the middle area of FIG. 2. The black unit time in the time frame indicates the operational state of the unit u is ON.
The white unit time in the time frame indicates the operational state of the unit u is OFF.
The operation plan candidates that have been calculated by the operation plan candidate calculator 14 are illustrated in the middle to lower area of FIG. 2. The operation plan candidates are calculated such that different operational states appear in some of the unit times of the same time frame. As illustrated in FIG. 2, any one of the operational states in the unit times of the respective operation plan candidates differ from those of the other operation plan candidates in the same time frame.
The number of the operation plan candidates to be created may be defined as appropriate considering the processing load and the like of the operation plan creating apparatus 1. In other words, it is not necessary to create all the operation plan candidates that can be created.
The coefficient calculator 15 is configured to calculate coefficients that correspond to the operation plan candidates on the basis of the initial solution. The coefficient calculated by the coefficient calculator 15 is referred to as optimization coefficient. The optimization coefficient represents the difference between the initial solution and one operation plan
2017248557 20 Oct 2017 candidate. For example, the optimization coefficient may be calculated on the basis of the number of the operational states of the respective unit times in the initial solution being different from the operational states of the respective unit times in the operation plan candidate. If two types of the operational states of the generator are given, then the coefficient calculator 15 can calculate the optimization coefficient for the unit u according to the following expression.
[Equation 1]
Here, fm >n (where m and n are integers that indicate the operational states) represents the number of unit times, in a certain time frame, in which the operational state in the initial solution is m but the operational state in the operation plan candidate is n. Thus, fi^o represents the number of unit times in which the operational state of the initial solution is an OPERATING but the operational state of the operation plan candidate is a STOPPI NG. Also, fo->i represents the number of unit times in which the operational state of the initial solution is a
STOPPING but the operational state of the operation plan candidate is an OPERATING.
The symbols au and βυ each represent a positive constant associated with the unit u. The symbols otu and βυ may be included in the generator characteristics and stored in the storage 11 or may be calculated by the coefficient calculator 15. For example, au and βυ may be defined as a value obtained by dividing the operation cost of the unit u by the output power value of the unit u.
M represents a constant associated with the time frame.
The value M is defined as being equal to or larger than the num ber of the unit times included in the corresponding tim e fram e
For example, if the time frame includes five unit times, then M >
holds. The value M may be calculated by the time frame calculator 13, the operation plan candidate calculator 14, or the
2017248557 20 Oct 2017 coefficient calculator 15. In this manner, the optimization coefficient is calculated on the basis of the difference between the initial solution and the operation plan candidate.
It should be noted that since Equation 1 assumes that two types of the operational states are given to the generator, two cases of fi_»o and fo->i are indicated. If three or more types of operational states are given to the generator, there may exist any fm->n that is different than fi_»o and f0_»i.
It should also be noted that, Equation 1 is defined such that the larger number of the fi^o leads to a smaller optimization coefficient while the larger number of the fo->i leads to a larger optimization coefficient. This is, in view of the objective of the operation cost reduction, for the purpose of ensuring that the number of the operation plan candidates having a unit time in which the operational state of the generator is OPERATING is larger than that in the initial solution will be less likely to be chosen such that the number of the stopped generators becomes large. In this manner, the optimization coefficient is defined such that the purposeful operation plan candidates are likely to be chosen.
It should be noted that the coefficient calculator 15 may change the created optimization coefficient on the basis of a predetermined condition. For example, when the same operation plan candidates as the initial solution exists, then the value of the optimization coefficient for the operation plan candidate that is the same as the initial solution may be changed such that the same operation plan candidate as the initial solution is chosen. For example, the value of the optimization coefficient for the operation plan candidate that is the same as the initial solution may be set to negative infinity (-co).
The expressions indicated on the right side of the respective operation plan candidates in FIG. 2 indicate optimization coefficients that correspond, respectively, to the operation plan candidates that are calculated on the basis of the initial solution illustrated in FIG. 2 by the coefficient calculator 15. In the uppermost operation plan candidate, the operational states
2017248557 20 Oct 2017 in the unit time all indicate OFF, so that the fo->i will be 0, and the optimization coefficient of the operation plan candidate will be -«□(M-fi^o). In the third and subsequent operation plan candidates from the top, the fi_»o will be 0, so that the optimization coefficients of the respective operation plan candidates will be pufo-»i· It should be noted that the values of f0^i of the respective operation plan candidates are different from each other. The second operation plan candidate from the top is the same as the initial solution, so that the optimization coefficient of the operation plan candidate is defined as -oo.
The operation plan creator 16 is configured to determine that one of the operation plan candidates is an appropriate one in each time frame by solving the optimization problem in accordance with the given objective function and limitation conditions, and is configured to identify the operation plan candidate that has been determined as being appropriate as the operation plan in the time frame. When the operation plans for the respective time frames are identified, the operation plan for the generator is created. Specifically, from among combinations each combining one each of the operation plan candidates for each time frame of each generator, the combination determined as being optimal is calculated based on the values of the objective functions in the respective combinations. In addition, the respective operation plan candidates included in the combination determined as being optimal are defined as the operation plan in each time frame of each generator. For example, if the objective is the operation cost reduction, then a combination that ensures that the value of the objective function associated with the operation cost becomes the smallest is determined as being optimal.
The following expression represents an example of the objective function and its limitation conditions.
[Eq uation 2] sub. to. yubs e {0,1}, (u e U, b e B, s g Su), (2)
2017248557 20 Oct 2017 min:
Σ uEU,bEB,sESub cubsyubs (1) yUbs = i. (u G u, b e β), (3) ' du Bucket(m) s m Vu Bucket(m) s — Dem(m), (m G Λί), ( 4 )
U€zU,SESub ^Vubs + ^yub+ls<l,{uEU,bEB, (V, K) E Violation^, h)). ( 5 ) sev sek
The expression (1) of Equation 2 represents the objective function. The objective function indicates that the objective is to reduce the sum of the operation costs of the generators. The symbol U as in u e U represents a set of the generators (units), where u represents one unit included in U. The symbol B as in b e B represents a set of buckets (time frames), where b represents one bucket included in B. The symbol SUb as in s e Sub represents a set of operation plan candidates of the bucket b of the unit u, where s represents one operation plan candidate included in SUb· The symbol cUbs represents the operation cost in the case where the operation plan candidate of the bucket b of the unit u is s. Meanwhile, in accordance with this embodiment, the optimization coefficient is used as
Cubs· In other words, cUbs is not an absolute value of the operation cost but is represented by a relative value of the operation cost in the initial solution. The symbol yUbs represents a value that corresponds to a case where the operation plan candidate of the bucket b of the unit u is s.
The expressions (2) to (5) represent limitation conditions.
The limitation conditions may include a limitation condition per unit time and a limitation condition imposed on multiple time frames. Also, the limitation conditions may include a unit limitation condition and a group limitation condition.
The expression (2) is a limitation condition that the value
2017248557 20 Oct 2017 which yUbs can take must be either 0 or 1. I n other words, yUbs must be a binary variable. It is assumed here that yUbs indicates whether or not the operation plan candidate s of the bucket b for the unit u is adopted as the operation plan.
When the operation plan candidate s is adopted as the operation plan of the bucket b for the unit u, then yUbs will be 1. If it is not adopted as the operation plan, then yUbs will be 0. Hence, only the operation cost according to the operation plan candidate adopted as the operation plan is added in the objective function.
It may be assumed that no operation cost is incurred when the operational state is a STOPPING. Alternatively, it may be assumed that the operational cost is incurred because of costs related to operation, management, etc. even when the operational state is a STOPPING.
The expression (3) is a limitation condition that the sum of yUbs must become 1. As described above, since yUbs only takes either of two values of 0 and 1, the expression (3) indicates that there must be only one operation plan candidate that causes yUbs to become 1. The expression (4) is a limitation condition regarding the power demand. It indicates that the total amount of power generation of all the generators in a mesh (unit time) must be equal to or larger than the power demand required in this mesh. The M in m e M represents a set of meshes, and m represents one mesh included in M. In the expression (4),
Bucket(m) is a function that returns the bucket b to which the mesh m belongs. dUbsm represents the output power value (virtual output value) assumed to be output in the mesh m in a case where the operation plan candidate of the bucket b for the unit u is s. Dem(m) represents the power demand required in the mesh m.
The expression (5) is a limitation condition that the combination of the operation plan candidates in the two buckets for the unit u must not be a combination that is identified as a violating combination. Violation(u, b) is a function that returns a combination of sets of the operation plan candidates identified as being violating combination in the bucket b for the unit u.
2017248557 20 Oct 2017
Violations may include mesh connect limitation violation, stop time period violation, and simultaneous activation limitation. The combination of the sets of the operation plan candidates identified as a violating combination is represented by (V, K).
For example, a combination of the operation plan candidates according to which an operational state where no electrical power is output is entered in the last mesh in the bucket b but an operational state of steady output is entered in the first mesh in the next bucket b + 1 may be identified as a violating combination. Also, for example, when the operational state of the last mesh in the bucket b is an OPERATING but the operational state of the first mesh in the next bucket b + 1 is a STOPPING, then this situation may be handled as violation because it does not satisfy a predetermined stop time period.
Although the optimization coefficient is used in the objective function in the above-described embodiment, the optimization coefficient may also be used as a limitation condition. For example, the optimization coefficient is used as a limitation condition if the objective is to reduce the surplus power (the difference between the total amount of power generation of the whole generator group and the power demand the generators need to accommodate as a generator group as a whole) and the limitation condition indicates that the operation cost must be confined to a predetermined range.
In this manner, the operation plan creator 16 solves the optimization problem in which the optimization coefficient is used at least either as an objective function or as a limitation condition, and thereby one of the operation plan candidates in each time frame will be identified as the operation plan of the generator in each time frame. The optimization problem can be processed by a general-purpose solver or the like. Hence, the operation plan creator 16 can be implemented using a known solver.
When an attempt is made to solve an optimization problem subject to numerous limitation conditions to determine the operational states for numerous unit times, then the load upon the solver increases and the time required to complete the creation of
2017248557 20 Oct 2017 the operation plan is prolonged. However, in accordance with this embodiment, it is made possible to reduce the load on the operation plan creator 16 and shorten the time required to complete the creation of the operation plan of the generator by providing an optimization problem that determines the operation plan candidates for the respective time frames that aggregates the unit times using the initial solution that has been calculated with some of the limitation conditions taken into account.
It should be noted that it suffices that the operation cost is 10 a cost associated with the operation of the generator, and costs associated with the items, persons, or services necessary for the operation of the generator may be included therein. The items necessary for the operation of the generator may include power source for power generation such as fuel and cooling water, catalyst, and the like other than the power source. The power source is not limited to a particular one. For example, the power source may include fossil fuel, wood fuel, nuclear fuel, and the like It may include pumped-up water stored in a dam or the like. It may further include chemical substances such as methylcyclohexane used in hydrogen power generation. Also, costs incurred by operation of the generator may also be included. For example, the cost related to limestone and liquid ammonia for use in removing chemical substances contained in the exhaust gas generated by power generation may be included in the operation cost.
Although the above-described objective function is the sum of the operation costs of the respective generators, the objective function may be the sum of the operation costs of some of the particular generators. For example, a generator that belongs to a particular group may be taken into account whilst the operation costs of generators that do not belong to this particular group are not taken into account. Also, instead of simple aggregation of the operation costs of the respective generators, operation costs of the respective generators may be multiplied, for example, by weighting factors and then aggregated, and thus weighting of the generators may be provided.
2017248557 20 Oct 2017
With regard to Equation 2, the objective functions have been illustrated that is intended for reducing the operation cost. Meanwhile, it is also possible to create objective functions based on other costs or objective function that take into account multiple costs. The following expression is an expression that indicates another example of the objective function and its limitation conditions.
[Equation 3] mm:
' CubsVubs + ’ aemPem ueU,bEB,seSub eEE.mEM
Equation 3 represents an objective function that minimizes the sum of the operation costs and the deviation costs. E in e e E represents a set of bases, and e represents a base included in the base set E. pem is a continuous variable and represents the amount of deviation between the target value of the stock stored in the base e of the mesh m and the predicted value of the stock in the case where the operation plan is carried out. Also, aem represents a coefficient associated with the amount of deviation.
It suffices that the amount of deviation is adapted to indicate the difference between the preset target value and the predicted value when the operation plan is carried out. With regard to Equation 3, the amount of deviation is given as that of the stock stored in the base e of the mesh m . Meanwhile, for example, it may be a difference between the target fuel consumption and the fuel consumption according to the operation plan. The deviation cost indicates the degree of deviation between the target value and the predicted value. In the foregoing description, the deviation cost is given as an amount obtained by multiplying the amount of deviation pem by aem corresponding to the amount of deviation pem.
The method of calculation of the deviation cost is not limited to the above described ones and may be defined as appropriate. For example, a potential function whose parameter is the amount of deviation may be defined in advance, and the
2017248557 20 Oct 2017 deviation cost may be given as the value calculated by the potential function. The potential function as well may be defined as appropriate and, for example, defined as a cubic function, exponential function, or the like according to which the deviation cost sharply increases as the fuel consumption approaches the upper or lower threshold of the fuel base stock limitation.
If the objective function is based on multiple costs, then the respective costs may be multiplied by weighting factors such that weighting of the costs is provided, instead of simple aggregation of the respective costs.
Also, additional limitation conditions may be introduced as well. For example, the range in which the values can fall, i.e., the upper and lower thresholds of the values such as an amount of electrical power for each mesh, the amount of stock of the base that stores the items necessary for operation of the generators, the fuel use of the generators or the group of generators, flow rates of fuel inlet pipes for gas or the like connected to the generators, and the amount of use of the electrical power or fuel of utility customers that supply or use the electrical power or the fuel may be defined as the limitation conditions.
The output value of the mesh m for the unit u used at this point can be calculated by the following expression, assuming that a virtual output value is output if the operational state is selected:
[Equation 4] t du Bucket(m) s m Yu Bucket(m) s seSub
By using this output value, the amount of electrical power for each mesh, the amount of stock of the base that stores the items necessary for the operation of the generators, the fuel use of the generators or the group of generators, the flow rates of the fuel inlet pipes for gas or the like connected to the generators, and the amount of use of the electrical power or fuel of the utility customers that supply or use the electrical power or the fuel can be calculated, and the range in which the value can falls may be
2017248557 20 Oct 2017 added as the limitation condition.
In the calculation using the virtual output value, for example, in a case where the virtual output value is given as the maximum output value of the unit, the following problem may arise. Specifically, it may not be possible to obtain the calculation result that satisfies the limitations because of the calculation being carried out assuming that only a higher output is allowed to be output in spite of the fact that the output of the unit can be actually further lowered. In order to prevent this problem, two values are used, i.e., the maximum output value and the minimum output value for each unit, each bucket, each operational state, and each mesh. For example, a value that has been calculated assuming that the virtual output is given as the minimum output is used as the limitation condition regarding the upper threshold of the gas consumption or the like, a value that has been calculated assuming that the virtual output is given as the maximum output is used as the limitation condition regarding the lower threshold, and thus this problem can be avoided. The maximum output value of the mesh m for the unit u can be calculated by the following expression:
[Equation 5] ’ du Bucket(m) smYu Bucket(m) s s6Suj,
The minimum output value of the mesh m for the unit u can be calculated by the following expression:
[Equation 6] ’ {fu. Bucket(m) sm/u Bucket(m) s
The symbol dUbsm with the upper line indicated in Equation 5 represents the maximum output value with the unit u, the bucket b, and the mesh m of the operation plan candidate s. The symbol dUbsm with the lower line indicated in Equation 6 represents the minimum output value with the unit u, the bucket b, and the mesh m of the operation plan
2017248557 20 Oct 2017 candidate s.
Next, the processing flow of the constituent components will be described below.
FIG. 3 is a diagram that illustrates an example of a 5 schem atic flowchart of the overall processing of the operation plan creating apparatus 1 in accordance with this embodiment. The storage 11 obtains information necessary for the calculation and stores the information that has been obtained (S101). After the necessary information has been stored, the initial solution calculator 12 calculates the initial solution on the basis of the information stored in the storage 11 (S102). Also, the time frame calculator 13 calculates the time frame (S103) on the basis of the information stored in the storage 11, and the operation plan candidate calculator 14 calculates the operation plan candidates in the time frame for each unit (S104).
The coefficient calculator 15 calculates the optimization coefficient for the respective operation plan candidates (S105). After the optimization coefficients have been calculated for all the operation plan candidates, the operation plan creator 16 derives, from the combinations of the operation plan candidates that have been selected for each time frame for each unit, the appropriate combination, and the operation plan candidates pertaining to the combination that has been determined as being appropriate are defined as the operation plans for the respective time frames for each unit, and thus the whole operation plan is created (S106).
The operation plan that has been created is sent to the storage 11, the storage 11 stores the operation plan that has been obtained (S107), and then the process is completed.
It should be noted that this flowchart is merely an example and the order and the like of the processing are not limited to particular ones as long as the necessary processing results are allowed to be obtained. For example, referring to FIG. 3, the process of the step S102 and the processes of the steps S103, S104 are illustrated as being processed in parallel with each other.
Nevertheless, the process of the step S102 m ay be perform ed and then the processes of the steps S103 and S104 m ay be perform ed.
2017248557 20 Oct 2017
Also, if the initial solution is not calculated by the initial solution calculator 12 but input by a user, then the process of the step S102 will not be provided. Also, the processing result of the respective processes may be successively stored in the storage 11 and the individual constituent components may refer to the storage 11 to obtain the processing results.
As has been described in the foregoing, according to this embodiment, the operation plan candidates of each generator in each time frame are calculated, and the optimization coefficients that correspond to the operation plan candidates are calculated based on the initial solution, and the optimization problem is solved by using the optimization coefficients to create the generator operation plan. By selecting the operation plan for each time frame from the operation plan candidates, it is made possible to reduce the load on the processing even when the optimization problem has numerous limitation conditions, and to shorten the time required for completion of the creation of the operation plan.
It should be noted that the above-described embodiment is merely an example and some of the constituent components of the above-described embodiment may be provided in an external device. For example, the above-described embodiment includes the initial solution calculator 12 but the initial solution calculator 12 may be provided in an external device. In that case, the storage 11 (obtainer) may obtain the initial solution from the external device, and deliver the initial solution that has been obtained to the coefficient calculator 15. Also, the initial solution may be manually calculated and stored in the storage 11 via the input/output interface 4.
Also, the operation plan creating apparatus 1 may be configured by multiple apparatuses that are capable of exchanging data by communications or electrical signals. In other words, the operation plan creating apparatus 1 may be a system that is configured by multiple apparatuses. For example, it may be divided into a first apparatus configured to carry out the processes up to that of the operation plan candidate calculator 14
2017248557 20 Oct 2017 and a second apparatus configured to receive the operational state and create the operation plan.
Also, the individual processes in accordance with the above-described embodiment can be implemented by software (program). Hence, the above-described embodiment can be implemented, for example, by using a general-purpose computer as its basic hardware and causing a processor such as a central processing unit (CPU) incorporated in the computer to execute the program .
FIG. 4 is a block diagram that illustrates an example of the hardware configuration of the operation plan creating apparatus 1 in accordance with this embodiment. The operation plan creating apparatus 1 includes a processor 51, a main storage apparatus 52, an auxiliary storage apparatus 53, a network interface 54, and a device interface 55. The operation plan creating apparatus 1 can be implemented as a computer 5 in which these components are interconnected via a bus 56. Also, the operation plan creating apparatus 1 may include a general-purpose input apparatus and output apparatus for the implementation of the input/output interface 4.
The operation plan creating apparatus 1 in accordance with this embodiment may be implemented by installing programs executed by the individual apparatuses onto the computer 5 in advance, storing the programs in a storage medium such as CD-ROM, or distributing the programs via the network to install them on the computer 5 as appropriate.
The processor 51 is an electronic circuit that includes a control apparatus and an arithmetic apparatus of a processor. The processor 51 carries out arithmetic processing on the basis of data input from the individual internal apparatuses provided inside of the computer 5 and on the basis of the programs, and outputs the calculation results and control signals to the respective apparatuses and the like. More specifically, the processor 51 executes the operating system (OS) of the computer 5 and applications, and control the individual apparatuses constituting the computer 5.
2017248557 20 Oct 2017
The processor 51 is not limited to a specific one as long as it is capable of performing the above-described processing. The processor 51 may be, and not limited to, a general-purpose processor, a central processing unit (CPU), a microprocessor, a digital signal processor (DSP), a controller, a microcontroller, a state machine, and the like. Also, the processor 51 may be an application specific integrated circuit, a field programmable gate array (FPGA), a programmable logic apparatus (PLD), and the like Also, the processor 51 may be configured by multiple processing apparatuses. For example, the processor 51 may be configured by the combination of a DSP and a microprocessor or may be one or more microprocessors that operate in cooperation with a DSP core.
The main storage apparatus 52 is a storage apparatus that stores instructions executed by the processor 51 and various pieces of data and the like, and information stored in the main storage apparatus 52 is directly read by the processor 51. The auxiliary storage apparatus 53 is a storage apparatus that is different than the main storage apparatus 52. It should be noted that the storage apparatus refers to any appropriate electronic component that is capable of storing electronic information. A volatile memory apparatus used in temporarily storing information such as RAM, DRAM, and SRAM, is mainly used as the storage apparatus 52, but the main storage apparatus 52 in accordance with the embodiment of the present invention is not limited to such volatile memory apparatuses. The storage apparatuses used as the main storage apparatus 52 and the auxiliary storage apparatus 53 may be a volatile memory apparatus or a non-volatile memory apparatus. The non-volatile memory apparatus includes programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable PROM (EEPROM), non-volatile random-access memory (NVRAM), flash memory, MRAM, and the like. Also, a magnetic or optical data storage apparatus may be used as the auxiliary storage apparatus 53. The data storage may be configured by a magnetic disk such as a hard disk, an optical disk
2017248557 20 Oct 2017 such as DVD, flash memory such as a USB memory apparatus, a magnetic tape, and the like.
It can be said the storage apparatus electrically communicates with the processor if the processor 51 directly or indirectly writes and/or reads information to and/or from the main storage apparatus 52 or the auxiliary storage apparatus 53. It should also be noted that the main storage apparatus 52 may be integrated into the processor. In this case as well, it can be said that the main storage apparatus 52 electrically communicates with the processor.
The network interface 54 is an interface for wired or wireless connection to a communication network. The network interface 54 may be configured by any interface that is compliant with any existing communication standard. Although one single network interface 54 is described in this embodiment, more than one network interface 54 may be provided. The output result and the like may be transmitted by the network interface 54 to the external device 7 communicatively connected thereto via the communication network 6. The external device 7 may be an external storage medium, a display apparatus, or a storage device as a database system.
The device interface 55 is an interface such as a USB interface for connection to an external storage medium that stores the output result and the like. The external storage medium may be any appropriate storage medium such as HDD, CD-R, CD-RW, DVD-RAM, DVD-R, SAN (Storage area network), etc. Connection to a storage apparatus may be established via the device interface 55.
Also, all or part of the computer 5, i.e., all or part of the operation plan creating apparatus 1 may be configured by a dedicated electronic circuit (i.e., hardware) such as a semiconductor integrated circuit incorporating the processor 51, etc. The dedicated hardware may be configured in combination with a storage device as RAM and ROM.
Although one single computer is illustrated in FIG. 4, the software program may be installed on multiple computers. The
2017248557 20 Oct 2017 individual computers may carry out different portions of the part of the software program to calculate the processing result.
While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions. Indeed, the novel embodiments described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes in the form of the embodiments described herein may be made without departing from the spirit of the inventions. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the inventions.
2017248557 20 Oct 2017

Claims (7)

1. An operation plan creating apparatus creating an operation plan of a generator which indicates operational state in a unit time, the apparatus comprising:
a time frame calculator configured to calculate a time frame constituted by a successive multiple unit times;
an operation plan candidate calculator configured to calculate multiple operation plan candidates for the generator in the time frame;
a coefficient calculator configured to calculate coefficients associated with the operation plan candidates on the basis of an initial solution of the operation plan of the generator in the time frame; and an operation plan creator configured to identify one of the operation plan candidates in the time frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the coefficients at least either in an objective function or in a limitation condition.
2. The operation plan creating apparatus according to claim 1, wherein the time frame calculator calculates multiple time frames, and the operation plan creator calculates a combination determined as being optimal from combinations each including one of the operation plan candidates for each of the time frames in order to create the operation plan of the generator.
3. The operation plan creating apparatus according to claim 1 or 2, wherein the coefficient is determined on the basis of a count of the operational states for the respective unit times differing between the initial solution and the operation plan candidate.
4. The operation plan creating apparatus according to any one of claims 1 to 3, wherein the objective function is defined as minimizing an operation cost of the generator or a group including the generator.
2017248557 20 Oct 2017
5. The operation plan creating apparatus according to any one of claims 1 to 4, further comprising an initial solution calculator configured to calculate the initial solution on the basis of a part of the limitation conditions.
6. An operation plan creating method for creating an operation plan of a generator which indicates operational state in a unit time, the method comprising:
calculating a time frame constituted by a successive multiple unit times;
calculating multiple operation plan candidates for the generator in the time frame;
calculating coefficients associated with the operation plan candidates on the basis of an initial solution of the operation plan of the generator in the time frame; and identifying one of the operation plan candidates in the time frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the coefficients at least either in an objective function or in a limitation condition.
7. A program for creating an operation plan of a generator which indicates operational state in a unit time, the program causing a computer to execute:
calculating a time frame constituted by a successive multiple unit times;
calculating multiple operation plan candidates for the generator in the time frame;
calculating coefficients associated with the operation plan candidates on the basis of an initial solution of the operation plan of the generator in the time frame; and identifying one of the operation plan candidates in the time frame as the operation plan of the generator in the time frame by solving an optimization problem that uses the coefficients at least either in an objective function or in a limitation condition.
2017248557 20 Oct 2017
174
2017248557 20 Oct 2017
2/4
UNIT TIME
Ο-
ΤΙ ME FRAME
OPERATION PLAN CANDIDATES OF UNIT u
INITIAL SOLUTION OF OPERATION PLAN OF UNIT u — oo
MW
FIG. 2
2017248557 20 Oct 2017
3/4
FIG. 3
4X4
2017248557 20 Oct 2017
FIG. 4
AU2017248557A 2016-10-28 2017-10-20 Operation plan creating apparatus, operation plan creating method, and program Abandoned AU2017248557A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2020200492A AU2020200492A1 (en) 2016-10-28 2020-01-23 Operation plan creating apparatus, operation plan creating method, and program

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2016-212044 2016-10-28
JP2016212044A JP6751006B2 (en) 2016-10-28 2016-10-28 Operation plan preparation device, operation plan preparation method and program

Related Child Applications (1)

Application Number Title Priority Date Filing Date
AU2020200492A Division AU2020200492A1 (en) 2016-10-28 2020-01-23 Operation plan creating apparatus, operation plan creating method, and program

Publications (1)

Publication Number Publication Date
AU2017248557A1 true AU2017248557A1 (en) 2018-05-17

Family

ID=62114311

Family Applications (2)

Application Number Title Priority Date Filing Date
AU2017248557A Abandoned AU2017248557A1 (en) 2016-10-28 2017-10-20 Operation plan creating apparatus, operation plan creating method, and program
AU2020200492A Abandoned AU2020200492A1 (en) 2016-10-28 2020-01-23 Operation plan creating apparatus, operation plan creating method, and program

Family Applications After (1)

Application Number Title Priority Date Filing Date
AU2020200492A Abandoned AU2020200492A1 (en) 2016-10-28 2020-01-23 Operation plan creating apparatus, operation plan creating method, and program

Country Status (3)

Country Link
JP (1) JP6751006B2 (en)
AU (2) AU2017248557A1 (en)
TW (1) TWI652591B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2019295206A1 (en) * 2018-06-26 2021-02-11 Ihi Corporation Energy system optimization program, energy system optimization method, and energy system optimization device

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5412332B2 (en) * 2010-03-05 2014-02-12 株式会社日立製作所 Generator operation plan determination device, generator operation plan determination method, and generator operation plan determination program
EP3016229B1 (en) * 2013-06-27 2017-08-09 Panasonic Corporation Power adjustment device, power adjustment method, power adjustment system, power storage device, server, program

Also Published As

Publication number Publication date
TWI652591B (en) 2019-03-01
JP6751006B2 (en) 2020-09-02
TW201824044A (en) 2018-07-01
AU2020200492A1 (en) 2020-02-13
JP2018073118A (en) 2018-05-10

Similar Documents

Publication Publication Date Title
Zhou et al. Framework for capacity credit assessment of electrical energy storage and demand response
US20210081022A1 (en) Data Center Total Resource Utilization Efficiency (TRUE) System And Method
WO2019196427A1 (en) Method and device for optimizing backup on the basis of supporting fault event constrained unit commitment
Ge et al. Multiple-cut benders decomposition for wind-hydro-thermal optimal scheduling with quantifying various types of reserves
CN115313519A (en) Power distribution network energy storage optimal configuration method, device, equipment and storage medium
AU2020200488A1 (en) Operation plan creating apparatus, operation plan creating method, and program
AU2020200492A1 (en) Operation plan creating apparatus, operation plan creating method, and program
Zhou et al. Variation-aware task allocation and scheduling for improving reliability of real-time MPSoCs
US11847007B2 (en) Data center total resource utilization efficiency (TRUE) system and method
Gebrekiros et al. Assessment of PTDF based power system aggregation schemes
JP7198376B2 (en) Instruments and methods for dynamic prediction, aggregation and validation
CN114696328A (en) Power line loss analysis method, system and storage medium
CN111127082B (en) Data processing system, method and device for energy supply system
US11544801B2 (en) Dynamic pricing of energy consumed from a shared battery using real-time consumption data
Zheng et al. Data-Adaptive Robust Transmission Network Planning Incorporating Post-Contingency Demand Response
CN117220419B (en) Power scheduling method, system and storage medium
CN113689033B (en) Method and device for checking and determining capacity generation price, computer equipment and storage medium
JP7226581B2 (en) Control device, control method and program
CN115063255B (en) Operation and maintenance resource optimal allocation method, device and system for offshore wind farm
CN114498637B (en) Method for analyzing influence of new energy field configuration energy storage on utilization rate
CN118336771A (en) Method, device, equipment and medium for measuring and calculating newly-added energy storage installed capacity
CN116131296A (en) Power supply system configuration method, device, computer equipment, storage medium and product
US10320190B2 (en) Load profile selection in adaptive dynamic islanding using batteries
CN117744985A (en) Bypass job data processing method, device, computer equipment and storage medium
CN116470590A (en) Reliability-based target capacity demand determining method and medium

Legal Events

Date Code Title Description
MK5 Application lapsed section 142(2)(e) - patent request and compl. specification not accepted