WO2020230226A1 - Operation plan device, operation plan method, and operation plan program - Google Patents

Abstract

According to the present invention, a period division unit (121) divides an undecided period in which an operation plan is not decided in a plan period into a period to be decided and a period after the period to be decided. A provisional solution determination problem creation unit (122) creates a provisional solution determination problem that is an optimization problem obtained by fixing, to a decision completion value, a value of a determination variable for a decision completion period among a plurality of determination variables included in a reference problem that is an optimization problem for determining operation plans for a plurality of generators. A partial decision unit (123) obtains, as a new decision completion value, a solution of a determination variable for the period to be decided by solving the provisional solution determination problem.

Description

Operation planning device, operation planning method and operation planning program

The present invention relates to a technique for obtaining an operation plan for a plurality of generators.

In order to achieve both the stability of power supply and the economic efficiency of power supply, it is necessary to appropriately create an operation plan for multiple generators. Specifically, it is necessary to create an operation plan so that the power demand and the amount of power generation are matched, the physical constraints of each generator are satisfied, and the generator with good power generation efficiency is operated appropriately. There is.

The problem of determining the operation plan of the generator is called the "operation plan problem".
The operation planning problem, also called the Unit Communication problem, has been widely studied. It is well known that the operation planning problem is formulated as a mixed 01 integer programming problem in which 01 determination variables and continuous determination variables are mixed.

In many studies that formulate the operation planning problem as a mixed 01 integer programming problem, the start state of the generator and the stop state of the generator are represented by the 01 determinants, and the output value of the generator is represented by the continuous determinants. To. Then, the coefficient of determination is added as appropriate according to the type of constraint condition to be considered and the description method of the constraint condition to be considered. The purpose is to minimize the total cost of power generation, which is the sum of the fuel cost and the start-up cost of the generator.
The main constraints are supply and demand balance constraints, reserve capacity constraints, generator operation constraints and fuel constraints. The supply-demand balance constraint is a constraint that matches the power demand and the amount of power generation. The reserve force constraint is a constraint to secure a certain amount of reserve force and a certain amount of adjustment force. The generator operation constraint is a constraint to comply with the generator-specific operation constraint such as the minimum continuous start time, the minimum continuous stop time, the output upper limit value, the output lower limit value, and the output change speed. The fuel constraint is a constraint that the fuel consumption does not exceed the remaining fuel amount.

Since the mixed 01 integer programming problem is a combinatorial optimization problem, it takes time to solve the mixed 01 integer programming problem. In particular, as the scale of the mixed 01 integer programming problem increases, the solution time tends to increase sharply.

The scale of the operation planning problem is determined by the number of generators, the length of the planning period, and the time step.
In the future, it is expected that the number of generators subject to the operation plan will increase due to wide-area cooperation accompanying the liberalization of electricity. In addition, it is expected that the time step width will be set finely in order to formulate a more detailed operation plan.
Therefore, it is expected that the scale of the operation planning problem will increase in the future. Therefore, a means for solving the operation planning problem at high speed is required.

Patent Document 1 discloses a method for solving an operation planning problem at high speed.
In that method, the operation plan at the time when the demand reaches the maximum value or the minimum value is determined first, and then the operation plan at the remaining time is determined.
That is, Patent Document 1 discloses a method of planning an operation planning problem in two stages.

Japanese Unexamined Patent Publication No. 2001-258157

In the method of Patent Document 1, the operation plan at a certain point in time is independently determined at the time of drafting the first stage. Therefore, if the operation plan at a certain point in time cannot be properly made without handling the operation plan for a certain amount of time, the method of Patent Document 1 cannot deal with it.
For example, in a pumped storage power generator, water is pumped up in advance, and power is generated by discharging water at the peak of demand. In other words, it is necessary to prepare in advance for peak demand. Therefore, it is highly possible that an appropriate operation plan cannot be made at the peak of demand unless the operation plan of a certain amount of time until the peak of demand is handled.
In addition, thermal power generators with a slow start-up speed must start up in advance at the peak of demand. In other words, it is necessary to prepare in advance for peak demand. Therefore, it is highly possible that an appropriate operation plan cannot be made at the peak of demand unless the operation plan of a certain amount of time until the peak of demand is handled.
Therefore, it is highly possible that the method of Patent Document 1 cannot make an appropriate operation plan for the pumped storage power generator or the thermal power generator.

An object of the present invention is to be able to solve an operation plan problem at high speed while handling an operation plan for a certain amount of time.

The operation planning device of the present invention
Of the planning periods targeted by the operation plans of multiple generators, the unconfirmed period in which the operation plan has not been finalized is the period in which the operation plan is finalized starting from the start time of the unfixed period. And the period after the period to be confirmed, and the period division part that divides into
Of the plurality of decision variables included in the reference problem, which is an optimization problem for determining the operation plans of the plurality of generators, the value of the decision variable for the confirmed period for which the operation plan has been confirmed has been determined. A provisional solution decision problem generator that generates a provisional solution decision problem, which is an optimization problem obtained by fixing the value,
By solving the provisional solution determination problem, a partial determination unit for obtaining the solution of the determination variable for the determination target period among the plurality of determination variables included in the provisional solution determination problem as a new confirmed value is provided. ..

According to the present invention, a provisional solution determination problem based on an operation plan for a fixed period is generated, and the operation plan for the period to be determined is determined by solving the provisional solution determination problem. In the provisional solution decision problem, the value of the decision variable for the fixed period is fixed. Therefore, the provisional solution determination problem can be solved at a higher speed than the case of solving the optimization problem in which the value of the decision variable for the fixed period is not fixed.
Therefore, it is possible to solve the operation plan problem (provisional solution decision problem) at high speed while handling the operation plan for a certain period of time that has been fixed.

The block diagram of the operation planning system 200 in Embodiment 1. FIG. The block diagram of the operation planning apparatus 100 in Embodiment 1. FIG. The figure which shows each configuration of the operation planning part 120 and the optimization problem part 140 in Embodiment 1. FIG. The flowchart of the operation planning method in Embodiment 1. The flowchart of the reception process (S110) in Embodiment 1. The flowchart of the operation plan processing (S120) in Embodiment 1. The block diagram of the planning period in Embodiment 1. The hardware block diagram of the operation planning apparatus 100 in Embodiment 1. FIG.

In the embodiments and drawings, the same element or the corresponding element is designated by the same reference numeral. Descriptions of elements with the same reference numerals as the described elements will be omitted or simplified as appropriate. The arrows in the figure mainly indicate the flow of data or the flow of processing.

Embodiment 1.
The operation planning system 200 will be described with reference to FIGS. 1 to 7.
The operation planning system 200 is a system for determining a plurality of operation plans.

*** Explanation of configuration ***
The configuration of the operation planning system 200 will be described with reference to FIG.
The operation planning system 200 includes a user terminal 210 and an operation planning device 100.

The user terminal 210 is a computer operated by the user.
The specific user is the person in charge of operating the generator.
Specific examples of the user terminal 210 are a personal computer, a tablet computer, or a smartphone.

The user terminal 210 communicates with the operation planning device 100 via the network.
Specifically, the user terminal 210 transmits the input data 211 to the operation planning device 100.
The input data 211 includes power demand data 212, generator configuration data 213, generator characteristic data 214, and fixed time width data 215.
However, the power demand data 212, the generator configuration data 213, the generator characteristic data 214, and the fixed time width data 215 may be transmitted individually.
The contents of the power demand data 212, the generator configuration data 213, the generator characteristic data 214, and the fixed time width data 215 will be described later.

The operation planning device 100 functions as an operation planning server.
Then, the operation planning device 100 generates the operation planning data 201 based on the input data 211.
The operation plan data 201 is data indicating an operation plan of a plurality of generators.

The configuration of the operation planning device 100 will be described with reference to FIG.
The operation planning device 100 is a computer including hardware such as a processor 101, a memory 102, an auxiliary storage device 103, a communication device 104, and an input / output interface 105. These hardware are connected to each other via signal lines.

The processor 101 is an IC that performs arithmetic processing and controls other hardware. For example, the processor 101 is a CPU, DSP or GPU.
IC is an abbreviation for Integrated Circuit.
CPU is an abbreviation for Central Processing Unit.
DSP is an abbreviation for Digital Signal Processor.
GPU is an abbreviation for Graphics Processing Unit.

The memory 102 is a volatile storage device. The memory 102 is also called a main storage device or a main memory. For example, the memory 102 is a RAM. The data stored in the memory 102 is stored in the auxiliary storage device 103 as needed.
RAM is an abbreviation for Random Access Memory.

The auxiliary storage device 103 is a non-volatile storage device. For example, the auxiliary storage device 103 is a ROM, HDD, or flash memory. The data stored in the auxiliary storage device 103 is loaded into the memory 102 as needed.
ROM is an abbreviation for Read Only Memory.
HDD is an abbreviation for Hard Disk Drive.

The communication device 104 is a receiver and a transmitter. For example, the communication device 104 is a communication chip or NIC.
NIC is an abbreviation for Network Interface Card.

The input / output interface 105 is a port to which an input device and an output device are connected. For example, the input / output interface 105 is a USB terminal, the input device is a keyboard and a mouse, and the output device is a display.
USB is an abbreviation for Universal Serial Bus.

The operation planning device 100 includes elements such as a reception unit 110, an operation planning unit 120, an output unit 130, and an optimization problem unit 140. These elements are realized in software.

The auxiliary storage device 103 stores an operation planning program for operating the computer as a reception unit 110, an operation planning unit 120, an output unit 130, and an optimization problem unit 140. The operation planning program is loaded into the memory 102 and executed by the processor 101.
The OS is further stored in the auxiliary storage device 103. At least a portion of the OS is loaded into memory 102 and executed by processor 101.
The processor 101 executes the operation planning program while executing the OS.
OS is an abbreviation for Operating System.

The input / output data of the operation planning program is stored in the storage unit 190.
The memory 102 functions as a storage unit 190. However, a storage device such as an auxiliary storage device 103, a register in the processor 101, and a cache memory in the processor 101 may function as a storage unit 190 instead of the memory 102 or together with the memory 102.

The operation planning device 100 may include a plurality of processors that replace the processor 101. The plurality of processors share the role of the processor 101.

The operation plan program can be recorded (stored) in a computer-readable manner on a non-volatile recording medium such as an optical disk or a flash memory.

The configurations of the operation planning unit 120 and the optimization problem unit 140 will be described with reference to FIG.
The operation planning unit 120 includes elements such as a period division unit 121, a provisional solution determination problem generation unit 122, and a partial determination unit 123. The functions of each element provided in the operation planning unit 120 will be described later.
The optimization problem unit 140 includes elements such as a reference problem generation unit 141 and an optimization problem calculation unit 142. The function of each element provided in the optimization problem unit 140 will be described later.

*** Explanation of operation ***
The operation procedure of the operation planning device 100 corresponds to the operation planning method. Further, the operation procedure of the operation planning device 100 corresponds to the processing procedure by the operation planning program.

The operation planning method will be described with reference to FIG.
In step S110, the reception unit 110 receives the input data 211.

The reception process (S110) will be described with reference to FIG.
In step S111, the reception unit 110 receives the input data 211 transmitted from the user terminal 210.

In step S112, the reception unit 110 stores the received input data 211 in the storage unit 190.

Returning to FIG. 4, the description continues from step S120.
In step S120, the operation planning unit 120 generates the operation plan data 201 based on the input data 211.
The details of the operation planning process (S120) will be described later.

In step S130, the output unit 130 outputs the operation plan data 201.
For example, the output unit 130 transmits the operation plan data 201 to the user terminal 210.

The operation planning process (S120) will be described with reference to FIG.
In step S121, the reference problem generation unit 141 generates a reference problem based on the input data 211.
The reference problem is an optimization problem for determining the operation plan of a plurality of generators.

The input data 211 includes power demand data 212, generator configuration data 213, generator characteristic data 214, and fixed time width data 215.

The electric power demand data 212 is data indicating the electric power demand.
Specifically, the power demand data 212 shows the expected power demand value for the planning period. The planning period is the period covered by the operation plan. The expected power demand value represents the amount of power to be generated by a plurality of generators, and is given every unit time.
If you want to determine the operation plan for the week from April 1st to April 7th on an hourly basis, the power demand data 212 is available at 24 points (0:00) on each day from April 1st to April 7th. The expected power demand value (1 o'clock, ..., 23:00) is shown.

The generator configuration data 213 is data showing the configurations of a plurality of generators.
Specifically, the generator configuration data 213 shows information such as the number of generators and the relationship between the generators. The relationship between generators is, for example, information such as sharing a fuel tank, sharing a reservoir in a pumping generator, and configuring a combined cycle generator with two or more generators. is there. The relationship between generators is the basis of constraints that span two or more generators.

The generator characteristic data 214 is data indicating the characteristics of each generator.
Specifically, the generator characteristic data 214 shows information such as a generator type, power generation efficiency, minimum continuous operation time, minimum continuous stop time, output upper limit value, output lower limit value, and output change speed. Power generation efficiency is expressed as a function of power generation and fuel consumption.

The fixed time width data 215 is data indicating a fixed time width.
The fixed time width is the time width in which the operation plan is fixed at one time. The time width corresponds to the length of time. The unit of the fixed time width is equal to the unit of determining the operation plan.
The operation plans of multiple generators are fixed for each fixed time width.

The standard problem can be generated by using the existing technology for generating the optimization problem. The procedure for generating the reference problem will be omitted.

In step S122, the period division unit 121 divides the undetermined period of the planning period into the determination target period and the relaxation target period.
The undetermined period is the period during which the operation plan has not been finalized.
The confirmation target period is a period starting from the first time of the undetermined period and then the operation plan is confirmed. The length of the confirmation target period is determined based on the confirmation time width data 215.
The mitigation target period is the period after the definite target period.

The period division unit 121 divides the undetermined period as follows.
First, the period division unit 121 divides the planning period into a fixed period and an undetermined period. The fixed period is the period for which the operation plan has been finalized. In the first step S122, there is no fixed period, and the entire planned period becomes an unfixed period.
Next, the period division unit 121 calculates the time when the time having the fixed time width elapses from the start time of the unfixed period. The calculated time is called the confirmation target time. However, when the calculated time is a time after the final time of the undetermined period, the period division unit 121 sets the final time of the undetermined period as the determination target time. The final time of the undetermined period is the same as the final time of the planned period.
Then, the period division unit 121 determines the period from the start time of the undetermined period to the confirmation target time as the confirmation target period.
In addition, the period division unit 121 determines the remaining period of the undetermined period as the relaxation target period. The remaining period of the undetermined period is the period obtained by subtracting the confirmed period from the undetermined period.
When the fixed target time is the final time of the unfixed period, the entire unfixed period is the fixed target period. In this case, there is no mitigation period.

In step S123, the provisional solution determination problem generation unit 122 generates the provisional solution determination problem based on the reference problem.
The provisional solution determination problem is an optimization problem for determining the operation plans of a plurality of generators in the period to be determined.
The details of the provisional solution determination problem generation process (S123) will be described later.

In step S124, the partial determination unit 123 solves the provisional solution determination problem and determines the operation plan for the determination target period.
In other words, the partial decision unit 123 finds the solution of the decision variable for the decision target period among the plurality of decision variables included in the provisional solution decision problem as a new fixed value by solving the provisional solution decision problem.
Therefore, the operation plan is updated to the fixed state by the fixed time width in the order of the earliest time.

Specifically, the partial determination unit 123 operates as follows.
First, the partial determination unit 123 acquires the provisional solution by solving the provisional solution determination problem. The tentative solution represents the operation plan of multiple generators during the planning period.
Next, the partial determination unit 123 extracts the solution of the decision variable for the determination target period from the provisional solution.
Then, the partial determination unit 123 stores the solution of the determination variable for the determination target period as a determined value in the storage unit 190.

Specifically, the partial determination unit 123 acquires a provisional solution as follows.
The partial determination unit 123 passes the provisional solution determination problem to the optimization problem calculation unit 142, and receives the provisional solution from the optimization problem calculation unit 142. The optimization problem calculation unit 142 receives the provisional solution determination problem from the partial determination unit 123, solves the provisional solution determination problem, and passes the provisional solution to the partial determination unit 123.

As a method of solving the provisional solution decision problem, any existing technique for solving the optimization problem can be used.
For example, there is a method of using software called a mathematical programming solver. Much software is known as a commercial mathematical programming solver or a free mathematical programming solver. An example of a commercial numerical planning solver is the Gurobi Optimizer. Each mathematical programming solver has a class of optimization problems that can be solved. When the optimization problem calculation unit 142 uses an existing mathematical plan solver, the reference problem generation unit 141 generates an optimization problem (reference problem) of a class that can be solved by the mathematical plan solver used.

In step S125, the period division unit 121 determines whether or not an undetermined period remains. If there is a mitigation target period in step S122, an undetermined period remains.
If the undetermined period remains, the process proceeds to step S122.
If there is no undetermined period left, the process ends.

The details of the provisional solution determination problem generation process (S123) will be described below.
The provisional solution determination problem generation unit 122 edits the reference problem by the fixed process (1) and the mitigation process (2). The edited standard problem becomes a provisional solution decision problem. However, the provisional solution determination problem generation unit 122 may generate the provisional solution determination problem without performing the relaxation process (2).
(1) The provisional solution decision problem generation unit 122 selects a decision variable for the fixed period from a plurality of decision variables included in the reference problem, and fixes the value of the decision variable for the fixed period to the fixed value. As a result, the value of the decision variable for the fixed period becomes one of the constraints.
(2) The provisional solution determination problem generation unit 122 selects the constraint condition for the relaxation target period from the plurality of constraint conditions included in the reference problem, and relaxes the constraint condition for the relaxation target period.

The details of the fixing process (1) will be described.
The provisional solution determination problem generation unit 122 fixes the respective values of all the decision variables for the fixed period to the fixed values.

However, the provisional solution determination problem generation unit 122 may fix the respective values of some decision variables with respect to the fixed period to the fixed values.
In this case, the provisional solution decision problem generation unit 122 selects all the decision variables for the fixed period from the plurality of decision variables included in the reference problem, and selects some decision variables from all the decision variables for the fixed period. To do. Then, the provisional solution determination problem generation unit 122 fixes the respective values of some of the selected decision variables to the confirmed values.

A specific example of some determinants is the first coefficient of determination variables.
The first determinant group is a determinant variable group indicating whether or not each generator is operating (operating or stopping) during the fixed period. A set of determinants is one or more determinants.
That is, the value of each decision variable included in the second decision variable group is not fixed.
The second determinant group is all the determinants that are not included in the first determinant group in the plurality of determinants for the fixed period. For example, the second coefficient of determination variable group indicates the output value of each generator in the fixed period. The second decision variable group is the decision target in the provisional solution decision problem.

The more determinants whose values are fixed, the faster the solution, but the lower the approximation accuracy. In other words, there is a trade-off between the solution speed and the approximation system.
By fixing the value of the decision variable, which is generally judged to be difficult to determine in the optimization problem, the solution speed can be effectively improved.
For example, discrete variables are generally found to be difficult to determine in optimization problems. A discrete variable is a determinant for which a discrete value is set. In addition, it is generally judged that it is difficult to determine a decision variable that is affected by many constraints in an optimization problem.

The description of the fixing process (1) will be continued.
The provisional solution determination problem generation unit 122 does not fix the respective values of all the decision variables for the undetermined period.

However, when the unique decision variable is included in all the decision variables for the undetermined period, the provisional solution determination problem generation unit 122 may fix the value of the unique decision variable for the undetermined period to the unique decision value.
The unique decision variable is a decision variable whose value is uniquely determined according to the operation plan of the fixed period. The unique determination value is a value that is uniquely determined according to the operation plan of the fixed period.
In this case, the provisional solution decision problem generation unit 122 selects all the decision variables for the undetermined period from the plurality of decision variables included in the reference problem, and selects the unique decision variables from all the decision variables for the undetermined period. Then, the provisional solution determination problem generation unit 122 fixes the value of the selected unique determination variable to the unique determination value.

An example of the unique decision variable will be described.
The generator characteristic data 214 indicates the minimum continuous down time of each generator. The minimum continuous downtime for a generator is 6 hours. If the generator is shut down one hour before the last time of the fixed period, the generator must be shut down for at least five hours from the beginning of the unfixed period. Therefore, among the determinants indicating whether or not the generator is operating, the determinants for 5 hours starting from the start time of the undetermined period are the unique determinants. In addition, the value meaning stop is the unique determination value. The same can be said for the minimum continuous operation time.

Another example of the unique decision variable will be described.
At least one of the plurality of generators has a plurality of activation patterns. Generator characteristic data 214 shows a plurality of activation patterns of these generators. The startup pattern depends on the length of the downtime before startup. In general, the longer the stop time before startup, the slower the startup speed in the startup pattern. When making an operation plan considering the start-up pattern, the reference problem has a coefficient of determination for determining the start-up pattern. When a generator is stopped for a certain period of time in a fixed period and then started in an undetermined period, the start pattern is fixed. Therefore, the decision variable indicating the start pattern of this generator is the unique decision variable. Further, a value that identifies a start-up pattern corresponding to the length of time that the generator has stopped is a unique determination value.

Another example of the unique decision variable will be described.
The generator characteristic data 214 shows a plurality of output bands of each generator. Each output band is an output range from the lower limit of the output band to the upper limit of the output band. The lower limit of the output band is the lower limit of the output value in the output band, and the upper limit of the output band is the upper limit of the output value in the output band. A plurality of output bands are continuous, and two consecutive output bands do not overlap except for a boundary value. In order to shift the output value from one output band to the next, the size of the output value must be kept at the same size as the boundary value for a certain period of time. When making an operation plan in consideration of such constraints, the reference problem has a decision variable indicating the output band to which the output value belongs at each time. On the other hand, each generator has an output change rate constraint. The generator characteristic data 214 shows the output change rate constraint of each generator. Once the output value at a certain time is determined, the output value can be changed only within the range of the output change speed constraint. Therefore, the output band that cannot be reached may be determined for each time. Therefore, the decision variable indicating the output band to which the output value belongs at each time becomes the unique decision variable. Further, a value that identifies an output band that the output value can reach at each time is a unique determination value.

The details of the mitigation process (2) will be described.
In step S122, the undetermined period is divided into a fixed period and a mitigation target period.
In step S124, the provisional solution for the confirmation target period becomes the final operation plan in the confirmation target period. The provisional solution is a solution obtained by solving the provisional solution decision problem.
Therefore, in step S123, the provisional solution determination problem generation unit 122 does not relax all the constraints on the determination target period. This ensures the feasibility of the final operation plan. On the other hand, the provisional solution determination problem generation unit 122 relaxes the constraint condition for the period after the determination target period (relaxation target period). For example, the provisional solution determination problem generation unit 122 ignores some constraints.

However, the constraints on the relaxation target period may include constraints over a long period of time.
For example, the constraints over a long period of time include a constraint based on the minimum continuous operation time, a constraint based on the minimum continuous stop time, an output retention constraint at the time of transition to the output band, and a constraint on a start pattern based on the stop time.
When there are constraints over a long period of time, the output value of each generator at each time cannot be adjusted to a desired value unless the operation plan is appropriately determined at an early stage. As a result, the final operation plan may violate the supply-demand balance constraint.

Therefore, the provisional solution determination problem generation unit 122 may make the degree of relaxation of the constraint condition for the first half of the relaxation target period smaller than the degree of relaxation of the constraint condition for the latter half of the relaxation target period. For example, the provisional solution determination problem generation unit 122 relaxes the constraint condition for the latter half of the relaxation target period, but does not relax the constraint condition for the first half of the relaxation target period.
As a result, the constraints over a long period of time can be appropriately considered.

Therefore, the provisional solution determination problem generation unit 122 operates as follows.
First, the provisional solution determination problem generation unit 122 divides the relaxation target period into a first relaxation target period and a second relaxation target period.
The first mitigation target period is a period starting from the beginning time of the mitigation target period.
The second mitigation target period is the period after the first mitigation target period.
Then, the provisional solution determination problem generation unit 122 sets the degree of relaxation of the constraint condition for the first relaxation target period to be lower than the degree of relaxation of the constraint condition for the second relaxation target period.
For example, the provisional solution determination problem generation unit 122 does not relax the constraint condition for the first relaxation target period over a long period of time, and relaxes the constraint condition for the second relaxation target period over a long period of time. To do. A long time is a time longer than a predetermined reference time.
For example, the provisional solution determination problem generation unit 122 sets the degree of relaxation of the constraint condition to the first relaxation target period to zero.

A method of determining the length of the first mitigation target period, that is, a method of dividing the first mitigation target period and the second mitigation target period will be described.
For example, the provisional solution determination problem generation unit 122 determines the length of time in the constraint condition over the longest time among the constraints over a long time as the length of the first relaxation target period.
If the constraint condition over a long period of time is a constraint related to the minimum continuous operating time, the minimum continuous operating time is a candidate for the length of the first relaxation target period.
If the constraint condition over a long period of time is a constraint related to the minimum continuous stop time, the minimum continuous stop time is a candidate for the length of the first relaxation target period.
If the constraint condition over a long period of time is the output retention constraint at the time of transition to the output band, the required output retention period is a candidate for the length of the first relaxation target period.
If the constraint condition over a long period of time is a constraint related to the start pattern, the longest generator stop time for determining the start pattern is a candidate for the length of the first relaxation target period.
By determining the length of the first relaxation target period in this way, it is possible to derive a provisional solution by correctly considering all the constraints over a long period of time.

That is, the provisional solution determination problem generation unit 122 determines the length of the first relaxation target period based on the time length defined by the time constraint among the plurality of constraint conditions included in the reference problem.
The time constraint is a constraint condition for the time spanning the fixed period and the relaxed period.
Specifically, the provisional solution determination problem generation unit 122 determines the length of the first relaxation target period based on the longest time length among the plurality of time lengths defined by the plurality of time constraints.

FIG. 7 shows the structure of the planning period.
The planning period is divided into a fixed period and an unfixed period.
The undetermined period is divided into a fixed period and a mitigation period.
The mitigation target period is divided into a first mitigation target period and a second mitigation target period.

*** Explanation of Examples ***
The operation planning system 200 may include a plurality of user terminals 210.
The operation planning device 100 may also serve as the user terminal 210.
The input data 211 may be automatically input from another system to the operation planning device 100.

*** Effect of Embodiment 1 ***
According to the first embodiment, the operation plans of a plurality of generators can be sequentially determined in the order of earliest time. Furthermore, the degree of relaxation of each constraint can be changed in consideration of the time of the constraint imposed over a long period of time. As a result, it is possible to obtain an operation plan at high speed while considering the constraints imposed over a long period of time.

*** Supplement to Embodiment 1 ***
The hardware configuration of the operation planning device 100 will be described with reference to FIG.
The operation planning device 100 includes a processing circuit 109.
The processing circuit 109 is hardware that realizes the reception unit 110, the operation planning unit 120, the output unit 130, and the optimization problem unit 140.
The processing circuit 109 may be dedicated hardware or a processor 101 that executes a program stored in the memory 102.

When the processing circuit 109 is dedicated hardware, the processing circuit 109 is, for example, a single circuit, a composite circuit, a programmed processor, a parallel programmed processor, an ASIC, an FPGA, or a combination thereof.
ASIC is an abbreviation for Application Specific Integrated Circuit.
FPGA is an abbreviation for Field Programmable Gate Array.

The operation planning device 100 may include a plurality of processing circuits that replace the processing circuit 109. The plurality of processing circuits share the role of the processing circuit 109.

In the operation planning device 100, some functions may be realized by dedicated hardware, and the remaining functions may be realized by software or firmware.

In this way, the processing circuit 109 can be realized by hardware, software, firmware, or a combination thereof.

The embodiments are examples of preferred embodiments and are not intended to limit the technical scope of the present invention. The embodiment may be partially implemented or may be implemented in combination with other embodiments. The procedure described using the flowchart or the like may be appropriately changed.

The operation planning device 100 may be realized by a plurality of devices.
The "part" which is an element of the operation planning device 100 may be read as "processing" or "process".

100 operation planning device, 101 processor, 102 memory, 103 auxiliary storage device, 104 communication device, 105 input / output interface, 109 processing circuit, 110 reception unit, 120 operation planning unit, 121 period division unit, 122 provisional solution determination problem generation unit , 123 partial determination unit, 130 output unit, 140 optimization problem unit, 141 standard problem generation unit, 142 optimization problem calculation unit, 190 storage unit, 200 operation planning system, 201 operation plan data, 210 user terminal, 211 input Data, 212 power demand data, 213 generator configuration data, 214 generator characteristic data, 215 fixed time width data.

Claims (11)

1. Of the planning periods targeted by the operation plans of multiple generators, the unconfirmed period in which the operation plan has not been finalized is the period in which the operation plan is finalized starting from the start time of the unfixed period. And the period after the period to be confirmed, and the period division part that divides into
   Of the plurality of decision variables included in the reference problem, which is an optimization problem for determining the operation plans of the plurality of generators, the value of the decision variable for the confirmed period for which the operation plan has been confirmed has been determined. A provisional solution decision problem generator that generates a provisional solution decision problem, which is an optimization problem obtained by fixing the value,
   By solving the provisional solution decision problem, a partial decision unit for obtaining the solution of the decision variable for the decision target period among the plurality of decision variables included in the provisional solution decision problem as a new fixed value, and
   An operation planning device equipped with.
2. The provisional solution decision problem generation unit selects some decision variables from all the decision variables for the fixed period among the plurality of decision variables included in the reference problem, and each of the selected decision variables. The operation planning apparatus according to claim 1, wherein the value of is fixed to a fixed value.
3. The provisional solution decision problem generation unit determines a decision variable whose value is uniquely determined according to the operation plan of the fixed period from all the decision variables for the undetermined period among the plurality of decision variables included in the reference problem. The operation planning apparatus according to claim 1 or 2, wherein the value of the selected decision variable is fixed to a uniquely determined value.
4. The provisional solution determination problem generation unit is claimed to generate the provisional solution determination problem by relaxing the constraint condition for the relaxation target period, which is the period after the confirmation target period, among the plurality of constraint conditions included in the reference problem. The operation planning device according to any one of claims 1 to 3.
5. The provisional solution determination problem generation unit divides the relaxation target period into a first relaxation target period starting from the start time of the relaxation target period and a second relaxation target period after the first relaxation target period. 1. The operation planning device according to claim 4, wherein the degree of relaxation of the constraint condition for the relaxation target period is lower than the degree of relaxation of the constraint condition for the second relaxation target period.
6. The provisional solution determination problem generation unit does not relax the constraint condition for the first relaxation target period over a time longer than the reference time, and is more than the reference time among the constraint conditions for the second relaxation target period. The operation planning device according to claim 5, wherein the constraint condition over a long period of time is relaxed.
7. The operation planning device according to claim 5, wherein the provisional solution determination problem generation unit sets the degree of relaxation of the constraint condition to zero with respect to the first relaxation target period.
8. The provisional solution determination problem generation unit is based on the time length defined by the time constraint, which is a constraint condition for the time spanning the fixed period and the relaxation target period among the plurality of constraints included in the reference problem. The operation planning device according to any one of claims 5 to 7, which determines the length of the first relaxation target period.
9. The operation according to claim 8, wherein the provisional solution determination problem generation unit determines the length of the first relaxation target period based on the longest time length among the plurality of time lengths defined by the plurality of time constraints. Planning equipment.
10. The period division section starts the undetermined period in which the operation plan is not finalized among the planning periods targeted by the operation plans of multiple generators from the beginning time of the undetermined period, and then the period in which the operation plan is finalized. It is divided into a period to be confirmed and a period after the period to be confirmed.
    For the fixed period in which the operation plan of the plurality of decision variables included in the reference problem, which is the optimization problem for determining the operation plans of the plurality of generators, is fixed by the provisional solution decision problem generation unit. Generate a provisional solution decision problem, which is an optimization problem obtained by fixing the value of the decision variable to a fixed value.
    An operation plan in which the partial decision unit solves the provisional solution decision problem to obtain the solution of the decision variable for the decision target period among the plurality of decision variables included in the provisional solution decision problem as a new confirmed value. Method.
11. Of the planning periods targeted by the operation plans of multiple generators, the unconfirmed period in which the operation plan has not been finalized is the period in which the operation plan is finalized starting from the start time of the unfixed period. And the period division process that divides into the period after the determination target period, and
    Of the plurality of decision variables included in the reference problem, which is an optimization problem for determining the operation plans of the plurality of generators, the value of the decision variable for the confirmed period for which the operation plan has been confirmed has been determined. A provisional solution decision problem generation process that generates a provisional solution decision problem, which is an optimization problem obtained by fixing the value, and
    By solving the provisional solution decision problem, a partial decision process for obtaining the solution of the decision variable for the decision target period among the plurality of decision variables included in the provisional solution decision problem as a new fixed value, and
    An operation planning program for a computer to execute.

Images