CN113330254B - Information processing device, information processing method, and information processing program - Google Patents

Abstract

An information processing apparatus, an information processing method, and an information processing program, which can ensure that a transfer job is performed for a necessary time and that a stirring job is performed for a predetermined time or longer. An information processing device (1) is provided with: a transfer time prediction unit (11) for predicting the time required for a transfer operation for transferring the loaded garbage by a crane; and a scheduling unit (12) that allocates a work time during which the garbage stirring work or the transfer work can be performed to the stirring work and the transfer work.

Description

Information processing device, information processing method, and information processing program

Technical Field

The present invention relates to an information processing apparatus, an information processing method, and an information processing program for generating a schedule of garbage processing.

Background

The refuse incinerator is provided with a refuse pit which temporarily stores refuse carried in by the refuse collection vehicle. The garbage in the garbage pit is stirred by a crane and then sent to an incinerator for incineration. This stirring is performed to homogenize the properties of the refuse fed into the incinerator, and is an important treatment for stabilizing the combustion of the refuse. As a prior art document related to such automatic control of a crane, for example, the following patent document 1 is cited. Patent document 1 below describes a control device that identifies heterogeneous waste in a waste pit based on a waste tone map indicating the tone of waste in the waste pit, and controls a crane to agitate the heterogeneous waste.

Prior art literature

Patent literature

Patent document 1: japanese laid-open patent publication No. 2007-126246 "

Disclosure of Invention

First, the technical problem to be solved

In a refuse incineration facility, in order to receive refuse continuously carried in, it is necessary to transfer refuse in an area (receiving area) in the vicinity of a position immediately below a carry-in port of a refuse pit to another area. However, the technique of patent document 1 does not consider securing transfer time. Therefore, in the technique of patent document 1, the garbage is highly deposited in the receiving area during the automatic operation, and the garbage cannot be received. Therefore, the crane control for a medium or long period cannot be realized by this technique alone.

Further, the main operation using the crane includes an operation of charging garbage into a garbage hopper connected to the incinerator. In general, the cranes used in the garbage pit are large-sized cranes, and at most two cranes are provided in one garbage pit. Further, since there is a risk of contact, even if two cranes are provided, it is not preferable to perform work in a region close to each crane. Therefore, it may be difficult to ensure the working time of the stirring operation in the period of time in which the garbage is continuously carried in.

One aspect of the present invention has been made in view of the above problems, and an object of the present invention is to provide an information processing apparatus or the like capable of ensuring a necessary time for transfer work and ensuring a stirring work for a predetermined time or longer.

(II) technical scheme

In order to solve the above-described problems, an information processing apparatus according to an embodiment of the present invention includes: a transfer time prediction unit that predicts a time required for a transfer operation of transferring the loaded garbage by the crane in a series of time periods including: a time zone in which the amount of refuse carried into the refuse pit is relatively large, and a time zone in which the amount of refuse carried into the refuse pit is small compared with the time zone; and a scheduling unit configured to allocate, to the stirring work and the transfer work, work time in which the garbage stirring work or the transfer work can be performed by the crane in the series of time periods, in such a manner that the conditions (1) and (2) are satisfied, (1) at least the time predicted by the transfer time predicting unit is used to perform the transfer work; (2) And stirring for a predetermined time or longer in the time period in which the amount of the carried-in garbage is relatively large.

In order to solve the above-described problems, an information processing method according to an embodiment of the present invention is performed by an information processing apparatus, and includes the steps of: a step of predicting a time required for a transfer operation of transferring the carried-in garbage by the crane in a series of time periods, wherein the series of time periods includes: a time zone in which the amount of refuse carried into the refuse pit is relatively large, and a time zone in which the amount of refuse carried into the refuse pit is small compared with the time zone; and a step of allocating a work time during which the garbage stirring work or the transferring work can be performed by the crane in the series of time periods to the stirring work and the transferring work so as to satisfy the following conditions (1) and (2), (1) using a time predicted at least in the step for performing the transferring work; (2) And stirring for a predetermined time or longer in the time period in which the amount of the carried-in garbage is relatively large.

(III) beneficial effects

According to one aspect of the present invention, it is possible to ensure that the transfer operation is performed for a necessary time and that the stirring operation is performed for a predetermined time or longer.

Drawings

Fig. 1 is a block diagram showing an example of the main part configuration of an information processing apparatus according to an embodiment of the present invention.

Fig. 2 is a diagram showing an example of assigning a work time to each day of the week.

Fig. 3 is a diagram showing an example of assigning a job time to 6 time periods divided at 4-hour intervals in one day.

Fig. 4 is a flowchart showing an example of processing performed by the information processing apparatus.

Detailed Description

[ operation of Crane in refuse incineration facility ]

The information processing apparatus according to the present embodiment is an apparatus for generating a work schedule of a crane in a garbage incineration facility. Here, the operation of the crane in the garbage incineration facility will be described. The refuse incineration facility is provided with a refuse pit, which is a device for storing refuse carried into the refuse incineration facility. Further, a crane having a grab bucket for grabbing garbage is provided in the garbage pit. The crane is capable of moving the refuse by gripping the refuse in the refuse pit with a gripper, moving the gripper in a state of gripping the refuse, and releasing the gripped refuse at a movement destination. The information processing apparatus according to the present embodiment generates a schedule for causing the crane to perform the following three operations (transfer, stirring, and input).

(1) Transfer work

The transfer operation is an operation of transferring refuse carried into a refuse incineration facility in a refuse pit. Garbage carried into the garbage incineration facility by a garbage collection truck or the like is put into the garbage pit from a predetermined carrying-in port. Therefore, it is necessary to perform a transfer operation for transferring the garbage in the area (receiving area) in the vicinity of the position just below the carry-in port of the garbage pit to an area (stirring area) for performing stirring operation described below. By performing the transfer operation, the refuse pit can be maintained in a state where new refuse can be carried in.

(2) Stirring operation

The stirring operation is an operation of stirring the garbage by releasing (dropping) the garbage caught in the garbage pit into the garbage pit. The stirring operation is performed to homogenize the garbage and perform stable incineration. In particular, when a power generation facility is provided in a garbage incineration facility, for stable power generation, stirring work is important, and the power generation facility generates power by using heat generated by garbage incineration. The stirring operation is basically performed in a stirring area in the refuse pit, but the stirring operation may be performed in a receiving area during a period when no refuse is carried in.

(3) Put into operation

The throw-in operation is an operation of throwing the garbage caught in the garbage pit into the garbage hopper. The garbage hopper is connected to the incinerator, so that garbage charged into the garbage hopper by the charging operation is incinerated after charging. If the remaining amount of garbage in the garbage hopper is reduced, a command to throw in garbage is issued from the garbage hopper, and thus the throw-in operation is performed at any time triggered by the throw-in command. In the loading operation, it is preferable to load the fully stirred garbage into the garbage hopper.

[ Structure of information processing apparatus ]

Fig. 1 is a block diagram showing an example of the constituent elements of an information processing apparatus 1 according to an embodiment of the present invention. As shown in fig. 1, the information processing apparatus 1 includes: a control unit 10 that controls the respective units of the information processing apparatus 1 in a unified manner; and a storage unit 20 that stores various data used by the information processing apparatus 1. The information processing apparatus 1 further includes an input unit 30 that receives an input operation to the information processing apparatus 1.

Further, the control unit 10 includes: a work possible time calculation unit 101, an input time prediction unit 102, a carry-in amount prediction unit 103, a transfer time prediction unit 104, a dispatch unit 105, a garbage state determination unit 106, and a work order determination unit 107. Further, the storage unit 20 stores incinerator information 201, carry-in information 202, and garbage state information 203.

The job possible time calculation section 101 calculates a job possible time in a target period, which is a period that is a target of the generation of the schedule by the information processing apparatus 1. The work possible time is a time during which any one of input, transfer, and stirring can be performed. The period of the subject is not particularly limited, and may be, for example, one day, one week, one month, or one year. Further, the user of the information processing apparatus 1 can specify the target period by the input operation via the input section 30.

The throw-in time prediction unit 102 predicts the throw-in amount of garbage into the garbage hopper and the time required for throw-in work. Specifically, the throw-in time predicting unit 102 performs the above-described prediction based on the incinerator information 201. The amount of input and the time required predicted by the input time predicting unit 102 may be in a range. For example, the input time prediction unit 102 may predict an upper limit and a lower limit of the input amount.

The incinerator information 201 is information on an incinerator provided in a refuse incineration facility. The incinerator information 201 may be information on the amount of garbage charged into the garbage hopper and the time required for the charging operation. In the present embodiment, an example will be described in which the incinerator information 201 is information indicating a plan for incinerating refuse in a refuse incineration facility. The information may be information indicating the amount of refuse scheduled to be incinerated during a prescribed period (for example, a period of one day, one month, one year, or the like). The incinerator information 201 may be information indicating operation histories (operation results) of the incinerator, for example. In this case, the input time prediction unit 102 predicts the amount of garbage input in the target period from the amount of garbage burned in the past.

The carry-in amount prediction unit 103 predicts the amount of garbage carried into the garbage pit during the target period. The loading amount predicted by the loading amount predicting unit 103 may have a range. For example, the carry-in amount prediction unit 103 may predict an upper limit value and a lower limit value of the carry-in amount. The loading amount prediction unit 103 may predict the garbage loading amount based on the loading amount predicted by the loading time prediction unit 102. The incineration schedule of garbage is established based on the past garbage loading amount, because the garbage loading amount in a certain target period does not greatly differ from the garbage loading amount in the target period. The carry-in information 202 can also be used for prediction of the carry-in amount.

The carry-in information 202 is information related to carrying in garbage to a garbage incineration facility. The carry-in information 202 may be any information related to the amount of garbage carried in the garbage incineration facility. In the present embodiment, description will be given of an example in which the carry-in information 202 is information indicating a plan for carrying in garbage in a garbage incineration facility. The information may be information indicating the amount of refuse to be carried in a predetermined period (for example, a period of one day, one month, one year, or the like). The loading information 202 may be information indicating a garbage loading history (loading result) in the garbage incineration facility, for example. In this case, the loading amount prediction unit 103 predicts the loading amount of the garbage in the target period based on the amount of the garbage loaded in the past.

The transfer time prediction unit 104 predicts the time required for the transfer operation in the target period. The target period is a series of time periods including a time period in which the amount of refuse carried into the refuse pit is relatively large and a time period in which the amount of refuse carried into the refuse pit is small compared with the time period. Specifically, the transfer time prediction unit 104 predicts the time required for the transfer operation based on the loading amount predicted by the loading amount prediction unit 103. For example, the transfer time prediction unit 104 may calculate, as the time required for the transfer operation, the time required for transferring all the garbage of the loading amount predicted by the loading amount prediction unit 103.

The scheduling unit 105 allocates a work time during which the garbage stirring work or the transfer work can be performed during the target period to the stirring work and the transfer work. The scheduling unit 105 performs the allocation so as to satisfy predetermined conditions, which will be described in detail later. The scheduling unit 105 allocates a predetermined work time to the input work for both a period of time in which the garbage carrying-in amount is relatively large and a period of time in which the garbage carrying-in amount is small, which are included in the target period. In this way, the scheduling unit 105 can generate a schedule indicating the proportion of each time period included in the target period at which each job should be performed. That is, the schedule generated by the scheduling unit 105 is information indicating the execution time of each job in each period included in the target period or the proportion of the execution time of each job.

The garbage state determination unit 106 determines the garbage state in the garbage pit. Examples of the garbage state determined by the garbage state determining unit 106 include (1) the height of garbage at each place in the garbage pit (the height from the bottom of the garbage pit), and (2) the stirring degree, the water content, the type of garbage at each place in the garbage pit. The garbage state determination section 106 can determine the garbage state by referring to the garbage state information 203 indicating such garbage state.

In this embodiment, an example is described in which the garbage state is managed in each place in the garbage pit in units of blocks (for example, blocks having a 1 m-side cube) defined by dividing the garbage pit into equal widths in the longitudinal direction, the transverse direction, and the height direction. In this case, the garbage status information 203 may be information indicating the degree of stirring of garbage in each block and the presence or absence of garbage in each block. The garbage state determination unit 106 can determine the garbage height at each place in the garbage pit from the information indicating whether garbage is present in each block. The method for evaluating the degree of stirring of the refuse is not particularly limited, and for example, the number of stirring times may be used as the degree of stirring, or the degree of stirring calculated based on the appearance of the refuse, the stirring system, the moisture content, the kind of refuse, and the like may be used. The garbage state information 203 is preferably updated at any time so as to include information indicating the garbage state at the time point to be considered when the schedule is generated. The update of the garbage state information 203 may be performed by the information processing apparatus 1 or may be performed by another apparatus.

The job order determining unit 107 determines the execution order of the stirring job, the transfer job, and the input job in the target period based on the result of the job time allocation obtained from the scheduling unit 105. In this way, the execution order can be determined within the time schedule generated by the scheduling unit 105 for the stirring job, the transfer job, and the input job, which are the main jobs performed in the pit.

By using the execution sequence determined in this way, the crane can be automatically controlled while ensuring the following (1) and (2), (1) the necessary time for carrying out the transfer operation; (2) Stirring operation is performed for a predetermined time or longer in a period of time in which the carried-in garbage is relatively large. Accordingly, the control unit 10 of the information processing apparatus 1 may further include a crane control unit that operates the crane in the order determined by the work order determining unit 107. In this case, the information processing apparatus 1 may also be referred to as a crane control apparatus. Of course, it is also possible to construct: the crane control device different from the information processing device 1 is notified of the schedule generated by the information processing device 1, and the crane is controlled. In addition, the job order determining unit 107 may be omitted in the case where it is not necessary to determine the execution order of the jobs.

[ flow of processing ]

Next, a process flow executed by the information processing apparatus 1 according to the present embodiment will be described with reference to fig. 4. Fig. 4 is a flowchart showing an example of processing (information processing method) performed by the information processing apparatus 1 according to the present embodiment. Fig. 2 and 3 will also be described below, wherein fig. 2 shows an example of assigning a job to each day of the week, and fig. 3 shows an example of assigning a job to 6 time slots divided at 4-hour intervals in the day.

In S1, the job possible time calculation part 101 calculates the job possible time in the target period. If the job can be performed for 24 hours a day, the job possible time a in the target period T is obtained by, for example, the following expression 1.

Work possible time a=60 minutes×24 hours×t days ·· (expression 1)

For example, when the target period T is one week (7 days), the work possible time a is 10080 minutes by the expression 1.

In S2, the input time prediction unit 102 determines the garbage input amount in the target period T. The garbage input amount in the target period T is obtained by the following expression 2.

Garbage input in target period T = average one day input x T days ·· (expression 2)

The input time prediction unit 102 can determine the average daily input amount based on the incineration schedule of the garbage contained in the incinerator information 201. For example, if it is planned to burn 240 tons of garbage per day, the input time prediction unit 102 determines the average daily input amount to be 240 tons, and calculates the garbage input amount in the target period T to be 1680 tons by the above equation 2.

In S3, the carry-in amount prediction unit 103 predicts the amount of garbage carried in the garbage pit in the target period T. Specifically, the carry-in amount prediction unit 103 predicts a lower limit value and an upper limit value of the garbage carrying-in amount. The prediction can be performed based on the amount of garbage input in the target period T. For example, the loading amount prediction unit 103 may predict that half (50%) of the garbage loading amount in the target period T is the lower limit value of the garbage loading amount, and may predict that twice (200%) of the garbage loading amount in the target period T is the lower limit value of the garbage loading amount. In this case, if the input amount of the refuse is estimated to be 1680 tons in S2, the lower limit value of the estimated refuse carry-in amount is 840 tons and the upper limit value is 3360 tons. The carry-in amount prediction unit 103 may predict the carry-in amount based on the carry-in information 202.

In S4, the throw-in time prediction unit 102 predicts the time required for the throw-in operation in the target period T. The time B required for the input operation in the target period T is obtained by the following expression 3.

Time required for the input operation b=operation time for one input operation×number of inputs per hour×24 hours×t days (expression 3)

The time for one input operation is predetermined. The number of inputs per hour is calculated from the input amount calculated in S2. For example, if the work time for one time of the input work is set to 5 minutes and the input amount calculated in S2 is 1680 tons, the required time for the input work in the target period T is calculated to be 3360 minutes by the expression 3. The proportion of the time B required for the work to be put into operation to the work possible time A is about 33%.

In S5, the transfer time prediction unit 104 predicts the time required for the transfer operation in the target period T. Specifically, the carry-in amount prediction unit 103 predicts a lower limit value C1 and an upper limit value C2 of the time required for the transfer operation in the target period T. This prediction can be performed using, for example, the following expressions 4 and 5. The lower limit value and the upper limit value of the carry-in amount are the values predicted in S3. The amount of garbage transferred at one transfer operation and the operation time of one transfer operation are predetermined.

The lower limit value c1= (lower limit value of carry-in amount +.amount of garbage transferred once of transfer operation) ×operation time of transfer operation once · (expression 4)

The upper limit value c2= (the upper limit value of the carry-in amount +.the amount of garbage transferred once by the transfer operation) ×the operation time of once by the transfer operation (expression 5)

For example, the amount of refuse transferred at one transfer operation may be 2.5 tons, and the operation time for one transfer operation may be 2.5 minutes. In this case, if the lower limit value and the upper limit value of the carry-in amount are 840 tons and 3360 tons, respectively, the lower limit value C1 and the upper limit value C2 of the time required for the transfer work are predicted to be 840 minutes (about 9% of the work possible time a) and 3360 minutes (about 33% of the work possible time a), respectively.

As is clear from the above-described processing, it is necessary to perform the input work for about 33% of the work possible time a, and to perform the transfer work for about 9 to 33% of the remaining work time of about 67%. And it is found that about 34 to 58% of the work possible time a can be subjected to the stirring work.

In S6, the garbage state determination unit 106 determines the garbage state in the garbage pit at the start of the target period T, which is the start of the job. The garbage state at the start of the job can be determined by referring to the garbage state information 203.

In S7, the scheduling unit 105 allocates the job time in the target period T to the stirring job and the transfer job. For example, when the target period T is one week, the scheduling unit 105 may first allocate the work time for each day of the week. An example of the assignment of the working time to each day of the week is described below.

Distribution of working time for each day

First, the scheduling unit 105 allocates a job time to an input job every day. The operation of the incinerator needs to be performed stably at all times during the operation of the incinerator. Therefore, the scheduling unit 105 calculates the ratio of the required time B for the input job predicted in S4 to the job possible time a calculated in S1, and uses the calculated ratio as the ratio of the input job to the job time per day. For example, if the ratio is 33%, the scheduling unit 105 sets the ratio of the input work to 33% in the work time per day.

Next, the scheduling unit 105 allocates the remaining time (time when the input work is not performed) per day to the stirring work and the transfer work. In this allocation, for example, a solution to the scheduling problem such as a simulated annealing algorithm, a mixed integer linear programming method, a genetic algorithm, or a neural network can be applied.

In the above-described allocation, it is preferable to consider the constraint condition of the refuse pit in operation and the evaluation value for the allocation result. The constraint condition may be, for example, a condition that the height of the refuse (the height of the refuse in the receiving area or the height of the refuse in the stirring area) does not exceed a threshold value. In addition, the garbage status determined in S6 is taken into account in the allocation. That is, the scheduling unit 105 performs appropriate allocation (allocation to increase the evaluation value) by evaluating what state the garbage in the state determined in S6 is in when the stirring job and the transfer job are performed according to the allocation result.

The evaluation value may be a value calculated by evaluating the garbage state in the target period and at least one of the end time of the target period when the stirring operation and the transfer operation are performed according to the result of the allocation. For example, the scheduling unit 105 may calculate, as the evaluation value, an average value of the garbage agitation degree of each block in the target period when the agitation job and the transfer job are performed according to the distribution result. For example, the scheduling unit 105 may calculate, as the evaluation value, an average value of the garbage flatness in the target period when the stirring operation and the transfer operation are performed according to the distribution result. The flatness is an index value indicating how much the surface of the garbage in the garbage pit is flattened, and the dispersion of the garbage height in a predetermined range (for example, a range of 3×3 blocks) may be used as the flatness.

The scheduling unit 105 performs allocation so as to satisfy the following conditions. This ensures that the transfer operation is performed for at least a necessary time, and the stirring operation is performed for a predetermined time or longer in a period of time in which the carried-in garbage is relatively large.

(1) At least the time of the lower limit value C1 predicted in S5 is used for carrying out the transfer operation.

(2) Stirring operation is performed for a predetermined time or longer on a day when the amount of carried-in garbage is relatively large.

In addition, these conditions may be one of the above-mentioned constraint conditions. Further, in the case where these conditions are not satisfied, allocation satisfying these conditions may be achieved by lowering the evaluation value.

The scheduling unit 105 may allocate the job time to the stirring job and the transfer job so that the predetermined condition related to the height of the pit at the end time of the job at the target time is satisfied in addition to the conditions (1) and (2). In this way, the transfer operation can be performed for a necessary time, and the stirring operation can be performed for a predetermined time or longer for a relatively large amount of the carried-in refuse, and the predetermined condition related to the refuse height of the refuse pit can be satisfied.

The predetermined conditions include, for example, the following conditions.

(A) The height of the waste in the receiving area is below a threshold.

(B) The height difference above the specified height does not exist in the garbage pit.

(C) The flatness is equal to or higher than a threshold value.

Distribution based on genetic algorithm

When the genetic algorithm is used for the above-described allocation, the dispatch unit 105 generates a plurality of genes, which represent the pattern of the allocation of the remaining time of day to the stirring work and the transfer work, as the genome of the first generation. Then, the scheduling unit 105 selects a gene with improved fitness by a genetic algorithm that repeatedly evaluates fitness of an evaluation function based on each gene included in the generated genome and updates the genome based on the evaluation.

In this evaluation, by using the above-described conditions (1) and (2), the constraint conditions, and the evaluation values, it is possible to perform the stirring operation for a predetermined time or longer in a period of time in which the carried-in garbage is relatively large while securing at least a necessary time for the transfer operation. Further, by selecting a gene based on the evaluation value of the stirring degree or the flatness, a schedule in which the state of garbage can be brought into a desired state from the viewpoint of the stirring degree or the flatness can be generated.

Examples of dispensing results

The scheduling unit 105 can generate a job schedule shown in fig. 2, for example, by the processing described above. Fig. 2 (a) shows an example of fluctuation of the carrying-in amount and the input amount of the garbage per day and the remaining amount of the garbage remaining in the garbage pit, and fig. 2 (b) shows the height of the garbage at each place in the garbage pit. Fig. 2 (c) shows an example of the allocation of the working time per day of the week.

In the example of fig. 2 (a), the loading amounts of friday and sunday are zero, that is, no loading is performed, and loading is performed from friday to friday. That is, when the target period is one week, the period in which the amount of carried-in garbage is relatively large is monday to friday, and the period in which the amount of carried-in garbage is small compared to this period is friday to sunday. On the other hand, the amount of the additive is constant over a period of one week. Therefore, the remaining amount of garbage increases greatly on monday, and on weekdays, the amount of garbage is generally increased at a high level, and on Saturday, the amount of garbage is decreased.

In the example of fig. 2 (b), there is a band-like region where the height of the refuse is low along the traverse direction of the crane that carries the refuse. This area is the receiving area. During the Saturday period in which no load is carried in, the transfer operation is performed in advance before the receiving area is in a state where the height of the garbage is low as in FIG. 2 (b), whereby the proportion of the transfer operation to the operation time on the weekday can be suppressed to the minimum necessary, and the time for the stirring operation can be ensured.

Specifically, the scheduling unit 105 allocates the stirring operation so as to satisfy the above condition (2), thereby securing the stirring operation time on a weekday. In the example of fig. 2 (c), 30% of the working time is allocated to the input work, 20% of the working time is allocated to the transfer work, and the remaining 50% of the working time is allocated to the stirring work for the six days without carrying in. Further, for sunday, 30% of the work time is allocated to the input work, 60% of the work time is allocated to the transfer work, and the remaining 10% of the work time is allocated to the stirring work. By increasing the proportion of the transfer work on weekdays in this way, the amount of garbage in the receiving area at the time of carrying in can be reduced as much as possible.

In the example of fig. 2 (c), at least 30% of the total working time is allocated to the stirring operation in the loaded monday to friday. Therefore, by operating the crane in accordance with the allocation, even on a weekday when the amount of the carried-in refuse is relatively large, the stirred refuse can be used for incineration, and the refuse can be burned stably.

The scheduling unit 105 may allocate the job time based on the upper limit value C2 of the predicted value of the required time for the transfer job predicted in S5. The scheduling unit 105 may allocate the job time using each of the predicted values (the lower limit value C1 and the upper limit value C2) of the time required for the transfer job predicted in S5. In this case, two kinds of distribution results are obtained.

By performing a plurality of distributions in this way, a plurality of schedules are generated, and flexible crane operation can be performed according to the actual amount of garbage carried in. For example, in one schedule, the stirring job is 30%, and in another schedule, the stirring job is 40%. In this case, if the amount of garbage carried in is larger than expected and the transfer operation requires much time, the stirring operation can be suppressed to about 30%. In addition, if the amount of garbage carried in is smaller than the expected amount of garbage carried in, the time required for the transfer operation can be reduced, and the stirring operation can be controlled to be about 40%. This is also true in the distribution of the working time for each time zone of the day described below.

Distribution of working time for each time period of day

The scheduling unit 105 may generate a job schedule in which the target period T is further shortened, based on the job schedule generated as described above. For example, the scheduling unit 105 may divide the target period T into a plurality of time slots by dividing the day into one day, and allocate the work time in each time slot.

For example, in the example of fig. 2 (c), 30% of the job time of Saturday is allocated to the input job, 20% is allocated to the transfer job, and 50% is allocated to the stirring job. Therefore, the scheduling unit 105 allocates the jobs for each time slot so that the ratio of the jobs when the job times of the jobs from the start to the end of the job on the day of Saturday are combined satisfies the allocation. The same applies to other days. In this allocation, various scheduling solutions can be applied similarly to the above-described allocation of jobs to each day.

Then, the scheduling section 105 allocates a job time to satisfy the following conditions: (1) carrying out transfer operation according to the proportion distributed every day; and (2) stirring operation for a predetermined time or longer in a period of time in which the amount of carried-in garbage is relatively large. In addition to satisfying the above-described conditions, the scheduling unit 105 preferably satisfies: (3) A predetermined condition associated with a refuse height of a refuse pit at an end time of each day of work. The predetermined condition may be, for example, the conditions (a) to (C) described above.

Examples of dispensing results

Fig. 3 shows an example of performing an allocation job for 6 time periods divided at 4-hour intervals in one day. More specifically, fig. 3 (a) shows an example of the garbage carrying-in amount for each time slot of each day (weekday) in which garbage is carried in, and fig. 3 (b) shows an example of the work time allocation for each time slot of each weekday.

In the daily period shown in fig. 3 (a), the loading starts from 8 hours, the loading amount reaches the peak value at 9 hours, the loading amount decreases at 12 hours, then the loading amount increases again at 13 hours, the loading amount decreases again after 14 hours, and the loading ends at 16 hours. In such a daily period, it is important to secure as much working time as possible for the stirring operation in the period (about 8 to 11 and 13) in which the amount of the carried-in refuse is relatively large. Therefore, the scheduling unit 105 performs allocation so as to satisfy the above-described condition (2).

In the example of fig. 3 (b), 30% of the working time is allocated to the input work, 40% of the working time is allocated to the transfer work, and the remaining 30% of the working time is allocated to the stirring work in the period of 0 to 4 hours of the period in which no load is carried. Further, in the period of time in which no loading is performed, 30% of the work time is allocated to the input work, 60% of the work time is allocated to the transfer work, and the remaining 10% of the work time is allocated to the stirring work in the period of time 4 to 8 hours before the loading start time, that is, 8 hours. In this way, by increasing the proportion of the transfer operation in the period of time before the start of loading, the amount of garbage in the receiving area at the start of loading can be reduced as much as possible, and the time for the stirring operation can be ensured after the start of loading.

For example, in the example of fig. 3 (b), even in the period of time 8 to 12 which is the period of time with the largest carry-in amount, 30% of the work time is allocated to the stirring work. Further, in the period of time 12 to 16 which is the second largest carrying-in amount, 40% of the work time is also allocated to the stirring work. In this way, in the example of fig. 3 (b), at least 30% of the working time is ensured in the whole of the period in which the amount of the carried-in garbage is relatively large (carried-in is present) in one day. Therefore, by operating the crane in accordance with the allocation, even in a period of time in which the amount of the carried-in refuse is relatively large, the stirred refuse can be used for incineration, and the refuse can be burned stably.

In the example of fig. 3 (b), 50% and 30% of the working time are allocated to the stirring work in the period of 16 hours, that is, the period of 16 hours to 20 hours and the period of 20 hours to 24 hours, respectively, after 16 hours as the carry-in end time. Thus, even in a period of time in which a large amount of load has to be carried in, which has to be allocated to the transfer operation, the fully stirred refuse can be used for incineration on the next day.

[ determination of the order of the jobs ]

The job order determining unit 107 determines the execution order of each job in the target time while satisfying the condition that the stirring job and the transfer job are performed only in the time allocated by the scheduling unit 105 as described above. For example, the job order determining unit 107 may determine an order in which a predetermined evaluation value is to be increased while satisfying a predetermined constraint condition by using the above-described method for solving the scheduling problem.

For example, the job order determining unit 107 may determine an order in which the following conditions are satisfied. In addition, it is not necessarily required to use all the following conditions, and the necessary conditions may be used.

(a) The stirring work and the transfer work are performed only in the time allocated by the scheduling unit 105.

(b) When a location where the maximum height of the garbage is equal to or greater than the threshold value is present in the receiving area, the next operation is set as a transfer operation from the location.

(c) When a garbage input command is issued from the garbage hopper, the next job is set as an input job.

The evaluation value may be a value calculated by evaluating the following matters, for example. The evaluation values do not need to be all the evaluation values described below, and only the necessary evaluation values may be used.

(d) The evaluation value of the stirring degree was evaluated (high if the garbage stirred a predetermined number of times or more was present on the surface layer of the garbage pit, and low if not present).

(e) The evaluation value of the flatness was evaluated (low if the dispersion of the height of the refuse in the predetermined range in the refuse pit was equal to or greater than the threshold value, and high if it was lower than the threshold value).

As described above, the job order determining unit 107 determines the execution order of the stirring job, the transfer job, and the input job in the target period while satisfying the conditions for performing the stirring job and the transfer job at the time allocated by the scheduling unit 105. Thus, the execution order of the stirring operation, the transfer operation, and the input operation, which are main operations performed in the pit, can be determined within the time schedule generated by the scheduling unit 105.

[ example implemented by software ]

The control modules of the information processing apparatus 1 (in particular, the respective sections included in the control section 10) may be realized by logic circuits (hardware) formed in an integrated circuit (IC chip) or the like, or may be realized by software.

In the latter case, the information processing apparatus 1 is provided with a computer that executes a command of a program, which is software that realizes each function. The computer has, for example, one or more processors, and has a computer-readable recording medium storing the program. In the computer, the processor reads the program from the recording medium and executes the program, thereby achieving the object of the present invention. As the processor, for example, a CPU (Central Processing Unit: central processing unit) is used. As the recording medium, a "non-transitory tangible medium" may be used, and for example, a magnetic tape, a magnetic disk, a card, a semiconductor Memory, a programmable logic circuit, or the like may be used in addition to a ROM (Read Only Memory) or the like. Further, a RAM (Random Access Memory: random access memory) or the like for expanding the program may be provided. Further, the program may be provided to the computer via any transmission medium (communication network, radio wave, or the like) capable of transmitting the program. The present invention can also be implemented as a data signal embedded in a carrier wave, which is embodied by electronically transmitting the program.

[ additional record item ]

An information processing device according to an embodiment of the present invention includes: a transfer time prediction unit that predicts a time required for a transfer operation of transferring the loaded garbage by the crane in a series of time periods including: a time zone in which the amount of refuse carried into the refuse pit is relatively large, and a time zone in which the amount of refuse carried into the refuse pit is small compared with the time zone; and a scheduling unit configured to allocate, to the stirring work and the transfer work, work time in which the garbage stirring work or the transfer work can be performed by the crane in the series of time periods, in such a manner that the conditions (1) and (2) are satisfied, (1) at least the time predicted by the transfer time predicting unit is used to perform the transfer work; (2) And stirring for a predetermined time or longer in the time period in which the amount of the carried-in garbage is relatively large.

In the information processing apparatus, the scheduling unit may allocate the job time to the stirring job and the transfer job so that a predetermined condition associated with a height of the pit at a time when the job ends in the series of time periods is satisfied in addition to the conditions (1) and (2).

The information processing apparatus may further include a job order determining unit that determines an execution order of the stirring job, the transfer job, and the loading job for loading the garbage into the hopper in the series of time periods while satisfying the conditions for performing the stirring job and the transfer job for the time allocated by the scheduling unit.

An information processing method according to an embodiment of the present invention includes the steps of: a step of predicting a time required for a transfer operation of transferring the carried-in garbage by the crane in a series of time periods, wherein the series of time periods includes: a time zone in which the amount of refuse carried into the refuse pit is relatively large, and a time zone in which the amount of refuse carried into the refuse pit is small compared with the time zone; and a step of allocating a work time during which the garbage stirring work or the transferring work can be performed by the crane in the series of time periods to the stirring work and the transferring work so as to satisfy the following conditions (1) and (2), (1) using a time predicted at least in the step for performing the transferring work; (2) And stirring for a predetermined time or longer in the time period in which the amount of the carried-in garbage is relatively large.

An information processing program for causing a computer to function as the information processing apparatus and causing a computer to function as the transfer time prediction unit and the scheduling unit is included in the scope of the present invention.

The present invention is not limited to the above-described embodiments, and various modifications can be made within the scope of the claims, and embodiments in which technical means disclosed in the different embodiments are appropriately combined are also included in the technical scope of the present invention.

Description of the reference numerals

1-an information processing device; 104-a transfer time prediction unit; 105-a scheduling section; 107-job order determination section.

Claims (5)

1. An information processing apparatus, comprising:

a transfer time prediction unit that predicts a time required for a transfer operation of transferring the loaded garbage by the crane in a series of time periods including: a time zone in which the amount of refuse carried into the refuse pit is relatively large, and a time zone in which the amount of refuse carried into the refuse pit is small compared with the time zone; and

a scheduling unit that allocates a work time during which the garbage stirring work or the transferring work can be performed by the crane in the series of time periods to the stirring work and the transferring work so as to satisfy the following conditions (1) and (2),

(1) At least the time predicted by the transfer time predicting unit is used for carrying out the transfer operation;

(2) And stirring for a predetermined time or longer in the time period in which the amount of the carried-in garbage is relatively large.

2. The information processing apparatus according to claim 1, wherein,

the scheduling unit allocates the job time to the stirring job and the transfer job so that a predetermined condition related to a refuse height of the refuse pit at a job end time of the series of time periods is satisfied in addition to the conditions (1) and (2).

3. The information processing apparatus according to claim 1 or 2, wherein,

the apparatus includes a job order determining unit that determines an execution order of the stirring job, the transfer job, and the loading job for loading the garbage into the hopper in the series of time periods while satisfying conditions for performing the stirring job and the transfer job for the time allocated by the scheduling unit.

4. An information processing method, which is executed by an information processing apparatus, characterized by comprising the steps of:

a step of predicting a time required for a transfer operation of transferring the carried-in garbage by the crane in a series of time periods, wherein the series of time periods includes: a time zone in which the amount of refuse carried into the refuse pit is relatively large, and a time zone in which the amount of refuse carried into the refuse pit is small compared with the time zone; and

a step of distributing the work time during which the garbage stirring work or the transferring work can be performed by the crane in the series of time periods to the stirring work and the transferring work so as to satisfy the following conditions (1) and (2),

(1) At least the time predicted in the step is used for carrying out the transfer operation;

(2) And stirring for a predetermined time or longer in the time period in which the amount of the carried-in garbage is relatively large.

5. A computer-readable recording medium storing an information processing program for causing a computer to function as the information processing apparatus according to claim 1,

the information processing program causes a computer to function as the transfer time prediction unit and the dispatch unit.