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

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 multiple 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 multiple coefficients at least either in an objective function or in a limitation condition.

Description

Operation plan formulation device, operation plan formulation method, and memory medium

Embodiments of the present invention relate to an operation plan formulation device, an operation plan formulation method, and a storage medium.

For the general electrician's power generation department, formulating a generator operation plan is one of the important tasks. As long as a generator-like operation plan that meets the predicted power demand and minimizes the number of operations can be drawn up, the cost of generator operation can be reduced. However, the operation of generators is subject to various constraints in addition to power requirements. For example, when the planned period is a monthly medium-to-long-term operation plan, the storage of bases and the like of fuel used by multiple generators is also a restriction. The greater the number of constraints, the higher the processing load for calculating the operation plan, and there is a problem that it takes more time to prepare the operation plan.

One embodiment of the present invention suppresses the time taken to formulate the operation plan of the generator. An operation plan preparing device according to an embodiment of the present invention is a device that prepares an operation plan of a generator indicating an operating state per unit time, and includes a time period calculation unit, an operation plan candidate calculation unit, a coefficient calculation unit, and an operation plan. Planning Department. The time period calculation unit calculates a time period composed of a plurality of consecutive unit times described above. The operation plan candidate calculation unit calculates a plurality of operation plan candidates of the generator in the above period. The coefficient calculation unit calculates a coefficient corresponding to the candidate of the operation plan based on the initial solution of the operation plan of the generator in the above period. The operation plan preparation unit solves the problem that the above coefficients are used for optimization of at least the objective function or the constraint conditions, and sets one of the plurality of operation plan candidates in the period as the generator in the period. Operation plan. Hereinafter, embodiments of the present invention will be described with reference to the drawings. (Embodiment of the present invention) FIG. 1 is a block diagram showing an example of a schematic configuration of an operation plan preparation device according to an embodiment of the present invention. The operation plan preparation device 1 shown in FIG. 1 includes a memory unit (acquisition unit) 11, an initial solution calculation unit 12, a time period calculation unit 13, an operation plan candidate calculation unit 14, a coefficient calculation unit 15, and an operation plan preparation unit. 16. The operation plan preparation device 1 prepares an operation plan of a generator based on constraints (restrictive expressions) such as predicted power demand, and an objective function representing a specific purpose. In the proposed operation plan, the operation state of the generator per unit time is expressed in a way that can satisfy the constraints and achieve a specific purpose. The unit time is the smallest time unit (period) in the operation plan. Within unit time, the running status of each generator is set to be unique and will not change. Therefore, in a unit time, the power generation amount of a generator or a group including a plurality of generators is fixed. Therefore, for example, when considering a 30-minute supply / demand balance situation, the unit time may be set to 30 minutes. As such, the unit time may also be determined based on the period during which the amount of power generation is calculated. The operation state of the generator is assumed to be two types: "operation (ON)" for outputting power and "OFF (off)" for outputting no power. Furthermore, there may be an operating state that is neither running nor stopped. For example, the type of operation state can be set to 3 by dividing the operation into "normal operation" of the maximum output power of the output generator and "test operation" of several tens% of the maximum output power of the output generator. More than. On the contrary, the operating state of the maximum output power that does not output the generator can be regarded as "stopped". For example, the first generator can be regarded as being stopped until the maximum output power can be output, and the power generated by the first generator is not added to the power generated by the total generator in calculation. The specific purpose can also be arbitrarily set. For example, it is possible to reduce the operating cost which represents the expenses related to the operation of the generator or the group including the generator. It is also possible to run the operation cost close to a specific target value. Specific target values can also be arbitrarily set. As for the constraints to be met in the preparation of the operation plan, the constraints related to the generator unit (unit constraints) may be included. Constraints (group constraints) related to one group with multiple generators can also be included. The unit constraint conditions indicate constraints related to the individual operation of the generator, such as the generator's stop time and start-stop curve. The group constraint indicates constraints related to the input and output of the group as a whole. For example, consider the power generation amount of the entire group, the fuel consumption amount of the group as a whole, and the like. The group is preset. For example, all the generators that are targeted for the plan can be grouped into one group. The generators supplying gas from the same gas base can also be grouped into one group. Alternatively, the generators that supply power to a specific area may be grouped into one group. In addition, one generator may be subordinate to a plurality of groups. In addition, in this embodiment, the operation plan preparation device 1 is supposed to prepare an operation plan across a plurality of generators, and may also prepare an operation plan for one generator. The type of the generator is not particularly limited. It can be a firepower, hydropower or atomic power generator. It can also be a generator using natural energy such as wind, solar energy, geothermal energy, and bioenergy. It can also be a generator such as hydrogen power generation. The types of the generators may be the same or different. The length of the overall period of the proposed operation plan is not particularly limited. It can be an hour or a day, and it can also be a medium or long-term month. In addition, compared with the case of preparing the operation plan of the hour or day unit, the situation of preparing the operation plan of the monthly unit is more affected by the number of constraints, so the time of preparing the operation plan becomes longer. However, even if the operation plan formulation device 1 of this embodiment is a medium-long-term operation plan, it can suppress the time taken to formulate the operation plan. Details will be described later. The constituent elements of the operation plan formulation device 1 will be described. The memory unit (acquisition unit) 11 acquires and memorizes the information prepared for the operation plan as data. The information prepared for the operation plan includes information related to the objective function and information related to the constraints. For example, when the purpose is to reduce the running cost, the running cost per unit time of the generator is stored in the memory unit 11. In addition, as the information related to the constraint conditions, the predicted power demand during the period of the planned operation plan is stored in the memory unit 11. The power demand is the amount of power provided by multiple generators, so it also needs information such as the amount of power generated by each generator per unit of time. Therefore, the information indicating the characteristics of the generator is also stored in the memory section 11. Thereafter, information indicating the characteristics of the generator is described as the characteristics of the generator. In addition, for example, when the running cost is calculated based on the cost of items such as fuel used by each generator, information related to the cost of the item may be stored in the memory section 11. Furthermore, the operation plan formulation device 1 may have a plurality of memory sections. That is, the memory unit 11 may be configured by a plurality of memory units. For example, there may be a plurality of memory sections in the operation plan drawing device 1, and the types of information stored in each memory section may be different. The information stored in the storage section 11 may be stored in the storage section 11 in advance by a user, or may be obtained from an external device or system by the operation plan formulation device 1 and memorized. As shown in the example of FIG. 1, the operation plan preparation device 1 can obtain the power demand from the power demand prediction system 2, the generator characteristics from the generator characteristic acquisition system 3, and the input information from the input / output interface 4. The input information is information input by users and the like. The input information is conceived to be information that changes in value during the period in which the operation plan is planned among the information related to the objective function and constraints. For example, consider the maintenance period of the generator and the cost of fuel. In addition, as shown in the example of FIG. 1, when information is obtained from an external device or system, the operation plan preparation device 1 can be directly or indirectly connected to the external device or system through a communication interface or a device interface, etc. Send and receive information. Information required for sending and receiving data such as an IP (Internet Protocol, Internet Protocol) address is stored in the memory section 11 in advance. In addition, the memory unit 11 can also obtain and memorize the results obtained by processing the constituent elements of the operation plan preparation device 1. For example, the memory unit 11 may also memorize a planned operation plan. In addition, the information stored in the memory section 11 can be output to the input / output interface 4 or can be transmitted to an external device or system. The initial solution calculation unit 12 calculates an initial solution of the operation plan. The so-called initial solution of the operation plan refers to the operation plan that is set based on a part of these constraints without fully considering various constraints. In this embodiment, a part of the constraint conditions is set as the power demand. That is, without considering constraints other than the power demand, an operation plan that satisfies the power demand and minimizes operating costs is taken as an initial solution. In this case, for example, the initial calculation unit 12 may determine the generators that are set to ON (make it run) in order from low to high running costs before the power demand of each unit time is satisfied in each unit time. And calculate the initial solution. In addition, the initial solution can also be calculated by solving the optimization problem of one of the constraints to be considered in use. The period calculation unit 13 calculates one or more periods. The time period is a part of the period in which the operation plan is drawn up, and is composed of a plurality of continuous unit times. The proposed operation plan becomes a collection of operation plans in each period. The length of the period is an integer multiple of the unit time. For example, if the unit time is 30 minutes, the time period is an integral multiple of 30 minutes, such as 300 minutes and 720 minutes. As long as the length of the time period is an integer multiple of the unit time, it can also be arbitrarily set in consideration of the processing load of the operation plan formulation device 1 and the like. The length of the time period can be the same or different in each time period. For example, the length of each period can be unified to 300 minutes, or the length of the first period can be set to 300 minutes, but the length of the second period can be set to 720 minutes. The time period can also be set based on power demand. Moreover, it can also be set based on the range of the value of power demand, and it can also be set based on the shape of the graph of power demand, etc. In the case of a graph shape, for example, a period between a time point when the graph of power demand is maximum and a time point when the graph of power demand is extremely small may be set as a period. The operation plan candidate calculation unit 14 calculates a plurality of operation plan candidates of each generator in each period. FIG. 2 is a diagram illustrating candidates for operation plans. A time period is shown in the upper part of FIG. 2. The period in FIG. 2 is composed of 10 unit times. As described above, for each unit time in the time period, the operating state of each generator is determined. In the middle of FIG. 2, the initial solution of the operation plan of the generator shown as unit u in this period is shown. The blackened unit time within the time period indicates that the operating state of the unit u is ON. The white unit time within the time period indicates that the operating state of the unit u is OFF. The operation plan candidates calculated by the operation plan candidate calculation unit 14 are shown in the middle to the lower part of FIG. 2. The candidate for the operation plan is calculated by changing the operation state in several unit times in the same period. As shown in FIG. 2, when comparing each operation plan candidate with other operation plan candidates in the same period, any one of the operation states of the unit time is different. The number of planned operation plan candidates can also be arbitrarily set in consideration of the processing load of the operation plan preparation device 1 and the like. That is, it is not necessary to prepare all the candidate candidates for the operation plan. The coefficient calculation unit 15 calculates a coefficient corresponding to the operation plan candidate based on the initial solution. The coefficient calculated by the coefficient calculation unit 15 is described as an optimization coefficient. The optimization coefficient indicates the difference between the initial solution and the candidate for the operation plan. For example, an optimization coefficient may be calculated based on the number of different operating states of each unit time in the initial solution and operating states of each unit time in the candidate for the operation plan. When there are two types of operation states of the generator, the coefficient calculation unit 15 can calculate an optimization coefficient in the unit u by the following formula. [Number 1] f _{m → n} (m and n are integers representing the running status) represents the number of unit times in a certain period of time when the running status is m in the initial solution but the running status is n in the running plan candidate. f _{1 → 0} represents the number of unit times in which the running state is "running" in the initial solution, but "stop" in the running plan candidate. f _{0 → 1} represents the number of unit times in which the running state is "stopped" in the initial solution, but "run" in the running plan candidate. α _u and β _u represent positive constants corresponding to the unit u. α _u and β _u may be included in the generator characteristics and stored in the memory unit 11, or may be calculated by the coefficient calculation unit 15. For example, α _u and β _u can also be set as values obtained by dividing the running cost of the unit u by the output power value of the unit u. M represents a constant corresponding to the period. M is set to be equal to or greater than the unit time included in the corresponding period. For example, when the time period contains 5 unit times, M ≧ 5. M may be calculated by the time period calculation unit 13, the operation plan candidate calculation unit 14, or the coefficient calculation unit 15. In this way, an optimization coefficient is calculated based on the difference between the initial solution and the operation plan candidate. In addition, since the operation state of the generator is assumed to be two in the number 1, both f _{1 → 0} and f _{0 → 1} are shown. When the generator's running state is more than 3 kinds, it can also be f _{m → n} except f _{1 → 0} and f _{0 → 1} . Further, in the number 1, the larger the number of f _{1 → 0} is defined, the smaller the optimization coefficient becomes, and the larger the number of f _{0 → 1} the larger the optimization coefficient becomes. The reason is that in order to reduce the running cost, more generators are stopped, and it is difficult to select a running plan candidate for which the unit's operating state is more than the initial solution. As described above, the optimization coefficient is specified in a manner that makes it easy to select candidate candidates for the operation plan. In addition, the coefficient calculation unit 15 may change the proposed optimization coefficient based on specific conditions. For example, when there is a candidate for the operation plan that is the same as the initial solution, the method of the candidate for the same operation plan as the initial solution may be selected, and the optimization coefficient of the candidate for the same operation plan as the initial solution may be changed. value. 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 (-∞). The formula shown on the right side of each operation plan candidate in FIG. 2 represents an optimization coefficient corresponding to each operation plan candidate calculated by the coefficient calculation unit 15 based on the initial solution shown in FIG. 2. In the first candidate of the operation plan, since the operation status per unit time is all OFF, f _{0 → 1} is 0, and the optimization coefficient of the operation plan candidate is -α _u (Mf _{1 → 0} ). The operation plan candidate system f _{1 → 0} after the third from the top is 0, and the optimization coefficient of each operation plan candidate is β _u f _{0 → 1} . In addition, the value of f _{0 → 1} differs among each operation plan candidate. The second running plan candidate from the top is the same as the initial solution, so the optimization coefficient of this running plan candidate is set to -∞. The operation plan preparation unit 16 judges one of a plurality of operation plan candidates as appropriate in each period by solving an optimization problem based on the given objective function and constraints. The candidate for the operation plan is set as the operation plan in the period. The operation plan of the generator is prepared by setting the operation plan in each period. Specifically, the operation plan candidates are combined one by one for each time period of each generator, and the value of the objective function in each combination is used to calculate the combination determined to be the best in the combination. And each operation plan candidate included in the combination determined to be the best is set as the operation plan in each time period of each generator. For example, for the purpose of reducing operating costs, the combination in which the value of the objective function related to operating costs is minimized is determined to be the best. The following formula is an example of an objective function and constraints. [Number 2] Equation (1) of the number 2 represents an objective function. The objective function is for the purpose of reducing the sum of the running costs of a plurality of generators. U ∈ U represents a set of generators (units), and u represents a unit included in U. B of b ∈ B represents a set of time intervals (periods), and b represents a time interval contained in B. S _ub of s ∈ S _ub represents a set of operation plan candidates of unit time interval b, and s represents one operation plan candidate included in S _ub . c _ubs represents the operating cost when the candidate for the operation plan of unit b at time interval b is s. However, in this embodiment, c _ubs uses an optimization coefficient. That is, c _ubs is the absolute value of non-running costs, and is expressed as the relative value of the running cost of the initial solution. y _ubs represents a value corresponding to a case where the candidate for the operation plan of the time interval b of the unit u is s. The expressions (2) to (5) represent constraints. Constraints can be constraints per unit of time, or constraints across multiple periods. In addition, it may include unit constraints or group constraints. Equation (2) represents a constraint condition that y _ubs can take a value of 0 or 1. That is, y _ubs is a binary variable. Here, y _ubs indicates whether or not the operation plan candidate s of the time interval b of the unit u is set as the operation plan. When the operation plan candidate s is set to the operation plan of the time interval b of the unit u, y _ubs is 1, and when it is not set to the operation plan, y _ubs is 0. Therefore, only the operation cost among the operation plan candidates as the operation plan is added to the objective function. In addition, it is conceivable that no running cost is incurred when the running state is stopped, and even if the running state is stopped, the running cost is consumed due to operation, management, and the like. Equation (3) represents a restriction condition that the sum of y _ubs becomes 1. As described above, since y _ubs has two values of 0 and 1, a running plan candidate with y _ubs of one is displayed. Equation (4) is a constraint condition on the power demand, which indicates that the total amount of power generated by the total generator in the time grid (unit time) is more than the power demand required by the time grid. M of m ∈ M represents a set of time lattices, and m represents a time lattice contained in M. Bucket (m) is a function that returns the time interval b to which the time slot m belongs. d _ubsm represents the output power value (dummy output value) output in the time _{slot m} when the operation plan candidate for the time interval b of the unit u is s. Dem (m) represents the required power demand in time grid m. Equation (5) represents a constraint condition that the combination of the operation plan candidates in the two time intervals of the unit u has not become the illegal combination. Violation (u, b) is a function that returns a combination of candidate operation plan violations such as constraint violations, stop time violations, and simultaneous start restrictions in the time interval b of unit u. The combination of candidate sets of illegal operation plans is represented as (V, K). For example, although the last time slot in the time interval b is an operating state in which no power is output, the combination of candidates for the operation plan of the constant output operation state in the first time interval in the next time interval b + 1 may be set as a violation. In addition, for example, when the operation state of the last time division in the time interval b is operation, and the operation state of the first time division in the next time interval b + 1 is stopped, it can also be set as the specified stop time. For violation. Furthermore, in the above, the optimization coefficient is used for the objective function, but the optimization coefficient may also be used for the constraint condition. For example, when the conditions are set to reduce the remaining power (the difference between the total power generation amount of the group and the total power demand required by the group) and the operating cost is controlled within a specific range, the optimization Coefficients are used for constraints. In this way, the operation plan preparation unit 16 solves the optimization problem in which the optimization coefficient is used for at least the objective function or the constraints, and sets one of the plurality of operation plan candidates in each period as each Plan of generator operation during the period. The optimization problem can be handled by a general-purpose solver or the like. Therefore, the operation plan preparation unit 16 can be implemented using a known solver. If there are multiple constraints and it is desired to solve the problem of optimizing the operating state corresponding to each of the multiple unit times, the load on the solver becomes higher and the time before the operation plan is drawn becomes longer. However, in this embodiment, by using the initial solution calculated by considering a part of the constraint conditions, it is set as the optimization problem of the operation plan candidate corresponding to each of the periods determined by the aggregation of unit time, and suppressed The load of the operation plan formulation unit 16 suppresses the time taken to formulate the operation plan of the generator. In addition, the running cost may be the cost for the operation of the generator, and may also include the expenses related to the goods, people, or services required for the operation of the generator. The items required for the operation of the generator can be the power source of the generator such as fuel, or cooling water and catalyst other than the power source. The power source is also not particularly limited. For example, it can be fossil fuel, wood fuel, nuclear fuel. It may also be water stored in a reservoir or the like. Chemical substances such as methylcyclohexane used for hydrogen power generation can also be used. In addition, costs incurred by operating the generator may be included. For example, costs related to limestone and liquid ammonia used to remove chemical substances contained in exhaust gas generated by power generation may be included. In addition, although the above-mentioned objective function is set as the sum of the running costs of each generator, it can also be set as the sum of the running costs of a specific generator. For example, it is also possible to consider generators belonging to a specific group without considering the operating costs of generators not belonging to a specific group. In addition, for example, by multiplying the running cost of each generator by a weighting factor instead of just the running cost of each generator, the importance degree of each generator can be made different. In the number 2, an objective function is shown for the purpose of reducing operating costs, an objective function based on other costs can also be formulated, and an objective function considering multiple costs can also be formulated. The following formula is another example of the objective function and the constraints. [Number 3] The number 3 represents an objective function that minimizes the sum of the running cost and the excess cost. E of E ∈ E represents a set of bases, and e represents a base included in E. p _em is a continuous variable that represents the excess of the target value of the inventory kept by the base e in the grid m and the predicted value of the inventory when the operation plan is executed. a _em represents the coefficient on excess. The excess amount may be a difference between a preset target value and a predicted value when the operation plan is executed. In the number 3, the excess amount of the inventory kept by the base e in the time grid m is set, but it may be the difference between the fuel consumption target and the fuel consumption amount of the operation plan, for example. The excess cost indicates the extent to which the target value exceeds the predicted value. In the above, the excess cost p _{em is} multiplied by the amount of a _em corresponding to the excess amount p _em as the excess cost. The calculation method of the excess cost is not limited to the above, and may be arbitrarily set. For example, a potential function in which the excess amount is a variable may be set in advance, and a value calculated from the potential function may be set. The potential function can also be arbitrarily set. For example, it can also be a third-order function, an exponential function, etc., as the fuel consumption amount approaches the upper and lower limits of the fuel base inventory constraints, and the cost increases sharply. Furthermore, when the objective function is based on a plurality of costs, the importance of each cost can be made different by multiplying each cost by a weighting coefficient instead of just adding up the costs. Furthermore, constraints may be further added. For example, the amount of electricity at each time, the amount of base stock at the base where items needed for operation are stored, the amount of fuel used by the generator or group, the flow rate of fuel injection pipes such as the gas connected to the generator, supply or use The upper limit and lower limit of the value of the power or fuel consumption amount of the user of the power or fuel can be taken as the constraint condition. Regarding the output value of the time slot m in the unit u used at this time, when the operating state is selected, a dummy output value is output, which can be calculated by the following formula. [Number 4] Using this output value, you can calculate the amount of electricity at each time, the amount of base inventory at the base where items needed for operation are stored, the amount of fuel used by the generator or group, the flow rate of the fuel injection pipe of the gas connected to the generator, The amount of electricity or fuel used by users who supply or use electricity or fuel can be added as a constraint. In the calculation using the dummy output value, for example, when the dummy output value is used as the maximum output value of the unit, there may actually be a problem that although the output of the unit is further reduced, only the higher output is used. Perform calculations so that calculation results that do not satisfy the constraints cannot be obtained. In order to prevent this problem, two values of the maximum output value and the minimum output value in each unit, each time interval, each operation state, and each time division are used. For example, by using the value calculated when the dummy output is the minimum output for the constraints on the upper limit of gas usage, etc., the value calculated when the dummy output is the maximum output for the constraints on the lower limit, the value can be avoided. problem. The maximum output value of the time slot m in the unit u can be calculated by the following formula. [Number 5] The minimum output value of the time slot m in the unit u can be calculated by the following formula. [Number 6] The line d _ubsm shown by the number 5 indicates the maximum output value in the unit u, the time interval b, and the time _slot m of the operation plan candidate s. The underlined _dubsm shown by the number 6 represents the minimum output value in the unit u, the time interval b, and the time _slot m of the operation plan candidate s. Next, the processing flow performed by each component will be described. FIG. 3 is a diagram showing an example of a schematic flowchart of the overall processing of the operation plan preparation device 1 according to this embodiment. The storage unit 11 obtains information required for calculation and memorizes it (S101). After the required information is memorized, the initial solution calculation unit calculates an initial solution based on the information memorized by the memory unit 11 (S102). Further, the time period calculation unit 13 calculates a time period based on the information stored in the memory unit 11 (S103), and the operation plan candidate calculation unit 14 calculates an operation plan candidate for each time period among a plurality of units (S104). The coefficient calculation unit 15 calculates an optimization coefficient for each operation plan candidate (S105). After calculating the optimization coefficients for all the operation plan candidates, the operation plan preparation section 16 derives an appropriate combination from the combination of the operation plan candidates selected for each time period of each unit, and calculates the operation plan related to the appropriate combination. The drawing candidate is used as an operation plan for each period of each unit, and an overall operation plan is prepared (S106). The planned operation plan is transferred to the storage unit 11, and the storage unit 11 memorizes the obtained operation plan (S107) and ends the processing. In addition, the flowchart is an example, and the processing order is not limited as long as necessary processing results can be obtained. For example, in FIG. 3, the processing of S102 and the processing of S103 and S104 are described in parallel. However, it is also possible to perform the processing of S103 and S104 after the processing of S102. When the initial solution is not calculated by the initial settlement section 12, but is input by the user, there is no processing in S102. Alternatively, the processing results of each process may be sequentially stored in the storage unit 11, and each constituent element may obtain the processing results by referring to the storage unit 11. As shown above, according to this embodiment, the operation plan candidate of each generator in each period is calculated, and an optimization coefficient corresponding to the operation plan candidate is calculated based on the initial solution, and the optimization coefficient is used to solve the problem. Optimize the problem, and draw up a generator operation plan. By selecting the operation plan for each time period from the candidate of the operation plan, even if there is an optimization problem with multiple constraints, the processing load can be suppressed and the time before the operation plan is formulated can be shortened. In addition, the above embodiment is an example, and a part of the constituent elements of the above embodiment may be located in an external device. For example, the above-mentioned embodiment includes the initial solution calculation unit 12, but the initial solution calculation unit 12 may be located in an external device. In this case, the memory unit 11 (acquisition unit) may obtain an initial solution from an external device and transmit the initial solution to the coefficient calculation unit 15. The initial solution may be stored in the storage unit 11 through the input / output interface 4 after being artificially calculated. In addition, the plan formulation device 1 may be constituted by a plurality of devices capable of transferring data using communication or electrical signals. In other words, the plan formulation device 1 may be a system composed of a plurality of devices. For example, it may be divided into a first device that performs processing before the operation plan candidate calculation unit 14 and a second device that receives an operation state and prepares an operation plan. Each process in the embodiment described above can be realized by software (program). Therefore, the embodiment described above can be realized, for example, by using a general-purpose computer device as basic hardware and causing a processor such as a central processing unit (CPU: Central Processing Unit) mounted on the computer device to execute a program. FIG. 4 is a block diagram showing an example of a hardware configuration of the operation plan preparation device 1 of the present embodiment. The operation plan preparation device 1 includes a processor 51, a main memory device 52, an auxiliary memory device 53, a network interface 54, and a device interface 55, and can be implemented as a computer device 5 that connects these via a bus 56. In addition, the operation plan formulation device 1 may be provided with a general-purpose input device and an output device to realize the input-output interface 4. The operation plan drawing device 1 in this embodiment can be implemented by installing programs executed by each device in the computer device 5 in advance, or by storing the programs in a CD-ROM (Compact Disc Read-Only Memory: Read Only) It can be realized by a storage medium such as a CD-ROM) or distributed via a network and suitably installed in the computer device 5. The processor 51 is an electronic circuit including a computer control device and a computing device. The processor 51 performs arithmetic processing based on data or programs input from various devices and the like configured internally of the computer device 5, and outputs a calculation result or a control signal to each device and the like. Specifically, the processor 51 executes an OS (operating system), an application, or the like of the computer device 5 and controls each device constituting the computer device 5. The processor 51 is not particularly limited as long as it can perform the above processing. The processor 51 may be, for example, a general-purpose target processor, a central processing unit (CPU), a microprocessor, a digital signal processor (DSP), a controller, a microcontroller, a state machine, and the like. In addition, the processor 51 may be a specific-use integrated circuit, a field-programmable gate array (FPGA), a programmable logic circuit (PLD), or the like. The processor 51 may be constituted by a plurality of processing devices. For example, it can be a combination of a DSP and a microprocessor, or it can be one or more microprocessors cooperating with the DSP core. The main memory device 52 is a memory device that stores commands and various data executed by the processor 51. The information stored in the main memory device 52 is directly read by the processor 51. The auxiliary memory device 53 is a memory device other than the main memory device 52. Furthermore, a memory device refers to any electronic component that can store electronic information. As the main memory device 52, RAM (Random Access Memory), DRAM (Dynamic Random Acces Memory), and SRAM (Static Random Access Memory) are mainly used. Such as a volatile memory for temporarily storing information, but in the embodiment of the present invention, the main memory device 52 is not limited to these volatile memories. The memory device used as the main memory device 52 and the auxiliary memory device 53 may be a volatile memory or a non-volatile memory. Non-volatile memory has Programmable Read-Only Memory (PROM), Erasable Programmable Read Only Memory (EPROM), Electronically Programmable Read Only Memory Read-only memory (EEPROM: Electrically-Erasable Programmable Read Only Memory), non-volatile random access memory (NVRAM: Non-Volatile Random Access Memory), flash memory, MRAM (Magnetic Random Access Memory) Access memory) and so on. Also, a magnetic or optical data storage device may be used as the auxiliary memory device 53. As data storage devices, magnetic disks such as video disks, optical disks such as DVDs (Digital Versatile Disk), flash memories such as USB (Universal Serial Bus), and magnetic tapes can be used. Furthermore, if the processor 51 directly or indirectly reads or writes information to or from the main memory device 52 or the auxiliary memory device 53, or both, the memory device may be in electrical communication with the processor. Furthermore, the main memory device 52 may be integrated into the processor. In this case, the main memory device 52 may also be in electrical communication with the processor. The network interface 54 is an interface for connecting to a communication network by wireless or wired. The network interface 54 is only required to be suitable for existing communication standards. Although only one network interface 54 is shown here, a plurality of network interfaces 54 may be mounted. The network interface 54 may also be used to send output results and the like to the external device 7 which is communicatively connected via the communication network 6. The external device 7 may be an external storage medium, a display device, or a storage device such as a database. The device interface 55 is an interface such as a USB connected to an external storage medium for recording and outputting results. External storage media can be HDD (Hard Disk Drive), CD-R (Compact Disc-Recordable: CD-RW), CD-RW (Compact Disc-Rewritable), DVD-RAM ( Digital Versatile Disc-Random Access Memory: Any recording media such as DVD-R (DVD-Recordable) and SAN (Storage Area Network). It may also be connected to a storage device or the like via the device interface 55. In addition, a part or all of the computer device 5, that is, a part or all of the operation plan preparation device 1, may be composed of a dedicated electronic circuit (ie, hardware) such as a semiconductor integrated circuit on which the program 51 and the like are installed. The dedicated hardware may also be composed of a combination with a memory device such as a RAM or a ROM (Read Only Memory). Furthermore, in FIG. 4, one computer device is shown, but software may be installed on a plurality of computer devices. It is also possible to calculate the processing result by causing the plurality of computer devices to separately execute processing of a different part of the software. Although specific embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the invention. In fact, the novel devices, methods, and media described herein may be embodied in various other forms; furthermore, various omissions and replacements may be made to the devices, methods, and media described herein without departing from the spirit of the present invention. And change. The scope of the accompanying patent applications and their equivalents are intended to cover forms or variations within the scope and spirit of the invention.

1‧‧‧ Device for planning operation

2‧‧‧ Electricity Demand Forecasting System

3‧‧‧Generator characteristics acquisition system

4‧‧‧ input and output interface

5‧‧‧Computer device

6‧‧‧Communication Network

7‧‧‧ external device

11‧‧‧Memory Department

12‧‧‧ Initial Solution Division

13‧‧‧time calculation department

14‧‧‧ Operation plan candidate calculation unit

15‧‧‧ Coefficient calculation section

16‧‧‧ Drafting Department

51‧‧‧ processor

52‧‧‧Master memory device

53‧‧‧ auxiliary memory device

54‧‧‧Interface

55‧‧‧device interface

56‧‧‧Bus

S101 ～ S107‧‧‧step

FIG. 1 is a block diagram showing an example of a schematic configuration of an operation plan preparation device according to an embodiment of the present invention. FIG. 2 is a diagram illustrating candidates for operation plans. FIG. 3 is a diagram showing an example of a schematic flowchart of the overall processing of the operation plan preparation device of the present embodiment. FIG. 4 is a block diagram showing an example of the hardware configuration of the operation plan preparation device of this embodiment.

Claims (7)

An operation plan drawing device is a planner for drawing out an operation plan of a generator indicating an operation state in a unit time; and it includes: a time period calculating unit that calculates a time period composed of a plurality of consecutive unit time periods; an operation plan The candidate calculation unit calculates a plurality of candidates for the operation plan of the generator in the above period; the coefficient calculation unit calculates candidates for the operation plan based on the initial solution of the operation plan of the generator in the above period. Corresponding coefficients; and an operation plan formulation unit that sets one of the plurality of operation plan candidates in the above-mentioned period to the above by solving the above-mentioned optimization of at least the objective function or the optimization of constraints. The operation plan of the above-mentioned generator during the period. For example, the operation plan drawing device of claim 1, wherein the time period calculation unit calculates a plurality of the above-mentioned time periods; and the operation time plan preparation unit is selected from a combination obtained by combining the operation plan candidates one by one according to the above time periods The best combination is judged, and the operation plan of the generator is drawn up. For example, the operation plan formulation device of claim 1 or 2, wherein the coefficient is based on a number of different operation states of the unit time in the initial solution and a number of different operation states of the unit time in the candidate of the operation plan Decide. For example, the operation plan drawing device of claim 1, wherein the above-mentioned objective function is to minimize the running cost of the generator or a group including the generator. For example, the operation plan formulation device of claim 1 further includes an initial solution calculation unit that calculates the initial solution based on one of the constraints. A method for formulating an operation plan, which is a method for formulating an operation plan for a generator that indicates an operating state in a unit time; and includes: a period calculation step for calculating a period composed of a plurality of consecutive unit times; A drawing candidate calculation step that calculates a plurality of operation plan candidates for the generator in the above period; a coefficient calculation step that calculates the operation plan based on the initial solution of the generator operation plan in the above period Candidate corresponding coefficients; and an operation plan formulation step that sets one of the plurality of operation plan candidates in the above period to one of the plurality of operation plan candidates by solving the above-mentioned coefficients for at least the optimization of the objective function or the constraints. The operation plan of the generator during the above period. A memory medium having a program stored therein for formulating a running plan of a generator indicating a running state in a unit time, and causing a computer to execute the following steps: A period calculation step, which calculates a continuous number of the above units A time-constrained period; an operation plan candidate calculation step that calculates a plurality of operation plan candidates for the generator in the above-mentioned period; a coefficient calculation step that is based on the initial solution of the above-mentioned generator operation plan in the above-mentioned period, And calculate the coefficients corresponding to the candidates for the above-mentioned operation plan; and the steps for preparing the operation plan, which solve the problem that the above-mentioned coefficients are used at least for the optimization of the objective function or the constraint conditions, and the plurality of operation plans in the above-mentioned period One of the candidates is set as the operation plan of the above-mentioned generator during the above-mentioned period.