CN113330254A

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

Info

Publication number: CN113330254A
Application number: CN202080010234.8A
Authority: CN
Inventors: 戴英达; 川端馨
Original assignee: Hitachi Zosen Corp
Current assignee: Hitachi Zosen Corp
Priority date: 2019-01-25
Filing date: 2020-01-24
Publication date: 2021-08-31
Anticipated expiration: 2040-01-24
Also published as: EP3916300B1; EP3916300A4; CN113330254B; WO2020153470A1; EP3916300A1; JP7201458B2; JP2020118402A

Abstract

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

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 disposal.

Background

The refuse incineration facility is provided with a refuse pit for temporarily storing refuse carried in by a 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 make the properties of the waste fed into the incinerator uniform, and is an important treatment for stably burning the waste. As a prior art document relating to such automatic control of a crane, for example, the following patent document 1 can be cited. Patent document 1 discloses a control device for identifying heterogeneous waste in a refuse pit based on a refuse tone map indicating tones of refuse in the refuse pit and controlling a crane to stir the heterogeneous waste.

Documents of the prior art

Patent document

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

Disclosure of Invention

Technical problem to be solved

In order to receive the garbage continuously loaded into the garbage incineration facility, it is necessary to transfer the garbage in an area (receiving area) near a position just below a loading port of the garbage pit to another area. However, in the technique of patent document 1, it is not considered to secure the transfer time. Therefore, in the technique of patent document 1, the garbage is highly accumulated in the receiving area during the automatic operation, and the garbage cannot be received. Therefore, the crane control for medium and long periods cannot be realized by this technique alone.

In addition, the main work using the crane includes a work of feeding garbage into a garbage hopper connected to the incinerator. In general, the cranes used in the refuse dump are large cranes, and the number of cranes installed in one refuse dump is at most two. Further, since there is a risk of contact, even if two cranes are provided, it is not preferable to perform work in an area close to each crane. Therefore, it is sometimes difficult to ensure the operation time of the stirring operation in a time zone in which the waste is continuously carried in.

One aspect of the present invention has been made to solve the above-described problems, and an object of the present invention is to provide an information processing apparatus and the like capable of performing transfer work while ensuring a necessary time and performing stirring work for a predetermined time or more.

(II) technical scheme

In order to solve the above problem, an information processing apparatus according to an aspect of the present invention includes: a transfer time prediction unit that predicts a time required for a transfer operation for transferring the loaded refuse by a crane in a series of time periods, the series of time periods including: a time zone in which the amount of garbage carried into the garbage pit is relatively large and a time zone in which the amount of garbage carried into the garbage pit is small compared to the time zone; and a scheduling unit that allocates, to the stirring operation and the transfer operation, an operation time during which the garbage stirring operation or the transfer operation can be performed by the crane in the series of time periods so as to satisfy the following conditions (1) and (2), wherein (1) at least the time predicted by the transfer time prediction unit is used for performing the transfer operation; (2) the stirring operation is performed for a predetermined time or more in the time zone in which the amount of the garbage carried in is relatively large.

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

(III) advantageous effects

According to one embodiment of the present invention, the transfer work can be performed with a required time secured, and the stirring work can be performed with a predetermined time or more secured.

Drawings

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

Fig. 2 is a diagram showing an example of assignment of the work hours to the days of the week.

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

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

Detailed Description

[ operation of crane in refuse incineration facility ]

The information processing device of the present embodiment is a device that generates a work schedule of a crane in a waste incineration facility. Here, the operation of the crane in the waste incineration facility will be described. The waste incineration facility includes a waste pit for storing the waste carried into the waste incineration facility. In addition, a crane having a grab bucket for grabbing the refuse is provided in the refuse pit. The crane can move the garbage by gripping the garbage in the garbage pit with the grab bucket, moving the grab bucket in a state of gripping the garbage, and releasing the gripped garbage at a moving destination. The information processing apparatus of the present embodiment generates a schedule for causing the crane to perform the following three operations (transfer, agitation, and input).

(1) Transfer operation

The transfer operation is an operation of transferring the garbage carried into the garbage incineration facility in the garbage pit. The garbage carried into the garbage incineration facility by a garbage collection vehicle or the like is thrown into the garbage pit from a predetermined carrying-in port. Therefore, it is necessary to perform a transfer operation for transferring the garbage in an area (receiving area) near a position just below the loading port of the garbage pit to an area (stirring area) for performing a stirring operation described below. By performing the transfer operation, the refuse receptacle can be maintained in a state in which it can receive the new refuse.

(2) Stirring operation

The stirring work is a work 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 to stably incinerate the garbage. Particularly, when a power generation facility is installed in a waste incineration facility, a stirring operation is important for stable power generation, and the power generation facility generates power by using heat generated by waste incineration. The stirring work is basically performed in the stirring area in the refuse pit, but the stirring work may be performed in the receiving area during a time period when no refuse is carried in.

(3) Putting into operation

The loading operation is an operation of loading the garbage caught in the garbage pit into the garbage hopper. Since the garbage hopper is connected to the incinerator, garbage charged into the garbage hopper by the charging operation is incinerated after being charged. Since a command for loading garbage is issued from the garbage hopper if the remaining amount of garbage in the garbage hopper decreases, the loading operation is performed at any time triggered by the loading command. In the charging operation, it is preferable to charge the garbage hopper with the garbage sufficiently stirred.

[ Structure of information processing apparatus ]

Fig. 1 is a block diagram showing an example of components 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 possible work time calculation unit 101, a loading time prediction unit 102, a loading amount prediction unit 103, a transfer time prediction unit 104, a scheduling unit 105, a garbage state determination unit 106, and a work order determination unit 107. The storage unit 20 stores incinerator information 201, loading information 202, and garbage state information 203.

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

The input time prediction unit 102 predicts the input amount of garbage into the garbage hopper and the time required for the input operation. Specifically, the charging time prediction unit 102 performs the prediction based on the incinerator information 201. The input amount and the required time predicted by the input time prediction unit 102 may have a range. For example, the input time prediction unit 102 may predict the upper limit and the lower limit of the input amount.

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

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

The loading information 202 is information related to loading of refuse into the refuse incineration facility. The loading information 202 may be information related to the loading amount of waste in the waste incineration facility. In the present embodiment, an example will be described in which the loading information 202 is information indicating a loading plan of refuse in a refuse incineration facility. The information may be information indicating the amount of garbage scheduled to be carried in during a predetermined period (for example, during one day, one month, one year, or the like). The loading information 202 may be information indicating a garbage loading history (loading performance) in the garbage incineration facility, for example. In this case, the load amount prediction unit 103 predicts the garbage load amount in the target period from the amount of 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 garbage carried into the garbage pit is relatively large and a time period in which the amount of garbage carried into the garbage pit is small compared to the time period. Specifically, the transfer time prediction unit 104 predicts the time required for the transfer operation based on the load amount predicted by the load amount prediction unit 103. For example, the transfer time prediction unit 104 may calculate the time required for transferring all the garbage of the load amount predicted by the load amount prediction unit 103 as the time required for the transfer operation.

The scheduling unit 105 allocates the operation time during which the garbage stirring operation or the transferring operation can be performed during the target period to the stirring operation and the transferring operation. The scheduling unit 105 performs the assignment so as to satisfy a predetermined condition, which will be described in detail later. The scheduling unit 105 allocates a fixed operation time to the input operation for both a time slot in which the amount of garbage carried in is relatively large and a time slot in which the amount of garbage carried in is small compared to the time slot included in the target period. In this way, the scheduling unit 105 can generate a schedule indicating at what ratio each job should be executed in each time slot included in the target period. That is, the schedule generated by the scheduling unit 105 is information indicating the execution time of each job in each time slot included in the target period or the ratio of the execution times of each job.

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

In the present embodiment, an example is described in which the garbage state at each position in the garbage pit is managed in units of blocks (for example, cubic blocks having 1m sides) defined by dividing the garbage pit into blocks having uniform widths in the vertical direction, the horizontal direction, and the height direction. In this case, the garbage state 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 trash state identifying unit 106 can identify the trash height at each location in the trash pit based on the information indicating the presence or absence of trash in each block. The method of evaluating the degree of stirring of the waste is not particularly limited, and for example, the degree of stirring may be set to the number of times of stirring as it is, or the degree of stirring calculated based on the appearance of the waste, the mode of stirring, the amount of water, the type of waste, and the like may be used. The spam status information 203 is preferably updated as needed so as to include information indicating the spam status at the time that should be considered when generating the schedule. The update of the trash state information 203 may be performed by the information processing apparatus 1 or may be performed by another apparatus.

The job order determination unit 107 determines the execution order of the mixing 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. This makes it possible to determine the execution sequence within the time table created by the scheduling unit 105 for the mixing operation, the transfer operation, and the input operation, which are main operations performed in the refuse dump.

By using the execution sequence determined in this way, automatic control of the crane can be performed in which (1) the necessary time for performing the transfer work is secured; (2) the stirring operation is performed for a predetermined time or more in a time zone where relatively much garbage is carried in. Therefore, the control unit 10 of the information processing device 1 may further include a crane control unit that operates the crane in the order determined by the work order determination unit 107. In this case, the information processing apparatus 1 may also be referred to as a crane control apparatus. Of course, the following configuration is also possible: 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, when it is not necessary to determine the execution order of the jobs, the job order determination unit 107 may be omitted.

[ procedure of treatment ]

Next, a flow of processing executed by the information processing device 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) executed by the information processing apparatus 1 according to the present embodiment. In addition, fig. 2 and 3 will also be described below, where fig. 2 shows an example of assignment of jobs to each day in a week, and fig. 3 shows an example of assignment of jobs to 6 time periods divided at 4-hour intervals in a day.

In S1, the possible job time calculation unit 101 calculates a possible job time in the target period. Assuming that the work can be performed for 24 hours a day, the working possible time a in the target period T is obtained by, for example, the following equation 1.

The possible operation time A is 60 minutes × 24 hours × T days · (equation 1)

For example, when the target period T is one week (7 days), the possible operation time a is 10080 minutes as calculated by equation 1.

In S2, the input time prediction unit 102 specifies the amount of garbage input in the target period T. The amount of garbage input in the target period T is determined by the following equation 2.

The garbage input amount in the target period T is equal to the average daily input amount X T day (equation 2)

The input time prediction unit 102 can determine the average daily input amount based on the incineration schedule of the garbage included in the incineration furnace information 201. For example, if 240 tons of garbage are planned to be incinerated 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 by the above equation 2 to be 1680 tons.

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

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

The required time for putting into operation B is the operation time for one time of putting into operation x the number of times of putting into operation per hour x 24 hours x T days (equation 3)

The operation time for putting the work once is predetermined. The number of times of charging per hour is calculated from the charging amount calculated in S2. For example, if the operation time for one input operation is set to 5 minutes and the input amount calculated in S2 is 1680 tons, the time required for the input operation in the target period T is calculated by equation 3 to be 3360 minutes. The ratio of the required time B for putting into operation to the possible operation 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 load amount prediction unit 103 predicts the lower limit C1 and the upper limit C2 of the time required for the transfer operation in the target period T. This prediction can be performed using, for example, equations 4 and 5 below. The lower limit value and the upper limit value of the carry-in amount are values predicted in S3. The amount of waste transferred at a time of the transfer operation and the operation time for a time of the transfer operation are predetermined.

The lower limit value C1 of the time required for the transfer operation is (lower limit value of the amount of carried-in garbage divided by the amount of garbage transferred in one transfer operation) x the operation time of one transfer operation (equation 4)

The upper limit of the time required for the transfer operation C2 (upper limit of the amount of carried-in/the amount of garbage transferred in one transfer operation) x the operation time of one transfer operation (equation 5)

For example, the amount of the garbage transferred at one time of the transfer operation may be 2.5 tons, and the operation time at one time of the transfer operation may be 2.5 minutes. In this case, if the lower limit value and the upper limit value of the carrying-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 possible work time a) and 3360 minutes (about 33% of the possible work time a), respectively.

As can be seen from the above processing, the loading operation needs to be performed for about 33% of the possible operation time a, and the transfer operation needs to be performed for about 9 to 33% of the remaining operation time of about 67%. From this, it is found that the stirring operation can be performed in about 34 to 58% of the possible operation time a.

At S6, the trash state determination unit 106 determines the trash state in the trash pit at the time of the start of the job, that is, at the time of the start of the target period T. 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 hours for each day of the week. An example of assignment of the work time to each day of the week is described below.

Assignment of work hours to Each day

First, the scheduling unit 105 allocates a working time to the input work for each day. The charging operation 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 of the putting work predicted in S4 to the possible work time a calculated in S1, and sets the calculated ratio as the ratio of the putting work to the work time per day. For example, if the ratio is 33%, the scheduling unit 105 sets the ratio of the input job to 33% in the daily job time.

Next, the scheduling unit 105 allocates the remaining time of each day (the time during which the input operation is not performed) to the stirring operation and the transfer operation. In this assignment, a solution to a 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 allocation, it is preferable to consider a restriction condition of the operation of the refuse pit and an evaluation value of the allocation result. The constraint condition may be, for example, a condition that the height of the waste (the height of the waste in the receiving area or the height of the waste in the stirring area) does not exceed a threshold value. In addition, the garbage state determined in S6 is considered in this allocation. That is, the scheduling unit 105 evaluates what state the refuse in the state determined in S6 is in when the stirring operation and the transferring operation are performed according to the result of the allocation, and performs appropriate allocation (allocation that increases the evaluation value).

The evaluation value may be a value calculated by evaluating the state of refuse at least at any one of the target period and the target period end time when the stirring operation and the transferring operation are performed according to the result of the allocation in the target period. For example, the scheduling unit 105 may calculate, as the evaluation value, an average value of the garbage agitation degrees of the respective blocks in the target period when the agitation operation and the transfer operation 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 transferring operation are performed according to the result of the allocation. The flatness is an index value indicating how flat the surface of the refuse in the refuse pit is, and dispersion of refuse heights 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. Thus, the transfer operation can be performed for at least a required time, and the stirring operation can be performed for a predetermined time or longer in a time zone in which relatively much garbage is carried in.

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

(2) The stirring operation is performed for a predetermined time or more on a day when a relatively large amount of garbage is carried in.

These conditions may be one of the restriction conditions. In addition, when these conditions are not satisfied, assignment that satisfies these conditions may be realized by lowering the evaluation value.

The scheduling unit 105 may assign the job time to the stirring job and the transfer job so as to satisfy the predetermined conditions associated with the trash height of the trash pit at the job end time of the target time in addition to the conditions (1) and (2). Thus, the transfer work can be performed for a required time, the stirring work can be performed for a predetermined time or more in a time zone where the amount of the garbage carried in is relatively large, and the predetermined condition relating to the height of the garbage in the garbage pit can be satisfied.

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

(A) The height of the refuse in the reception area is below a threshold value.

(B) There is no height difference above the specified height in the garbage pit.

(C) The flatness is not less than a threshold value.

Allocation based on genetic Algorithm

When the genetic algorithm is used for the assignment, the scheduling unit 105 generates a plurality of genes representing the patterns of assignment to the stirring work and the transfer work for the remaining time of each day as the first generation genome. Then, the adjustment unit 105 selects a gene whose fitness is improved by a genetic algorithm that repeats the evaluation of fitness based on the evaluation function of each gene included in the generated genome and the update of the genome based on the evaluation.

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

Example of distribution 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 the daily garbage carrying amount and the daily garbage input amount and the variation of the remaining amount of the garbage remaining in the garbage pit, and fig. 2 (b) shows the garbage height at each position in the garbage pit. Fig. 2 (c) shows an example of assignment of the work hours per day of the week.

In the example of fig. 2 (a), the carry-in amount for saturday and sunday is zero, that is, there is no carry-in, and there are carry-ins for monday through friday. That is, when the target period is one week, a time period during which the amount of garbage carried in is relatively large is monday to friday, and a time period during which the amount of garbage carried in is smaller than this time period is saturday to sunday. On the other hand, the amount of the charge is constant during one week. Therefore, the remaining amount of garbage increases greatly on monday, and gradually goes to a higher level on weekdays, and decreases on saturday.

In the example of fig. 2 (b), a belt-like region having a low height of the garbage is present along the transverse direction of the crane for transporting the garbage. This area is the reception area. During the period of saturday in which the garbage is not carried in, the transfer operation is performed in advance before the receiving area is in a state in which the height of the garbage is low as shown in fig. 2 (b), and thus the ratio of the transfer operation to the operation time on weekdays can be suppressed to the minimum necessary, and the time for the stirring operation can be ensured.

Specifically, the scheduling unit 105 allocates the mixing job so as to satisfy the condition (2) described above, thereby ensuring the time for the mixing job on weekdays. In the example of fig. 2 (c), for saturday on which no loading is performed, 30% of the operation time is allocated to the input operation, 20% of the operation time is allocated to the transfer operation, and the remaining 50% of the operation time is allocated to the stirring operation. In addition, 30% of the operation time is allocated to the input operation, 60% of the operation time is allocated to the transfer operation, and the remaining 10% of the operation time is allocated to the stirring operation on the weekday. In this way, by increasing the rate of the transfer work on a weekday, the amount of garbage in the receiving area on the weekday on which the load is performed can be reduced as much as possible.

In the example of fig. 2 (c), at least 30% of the total operation time is allocated to the stirring operation in monday through friday with the carry-in. Therefore, by operating the crane in accordance with the distribution, even on weekdays in which a relatively large amount of garbage is carried in, the garbage that has been stirred can be used for incineration, and the garbage can be stably burned.

The scheduling unit 105 may allocate the job time based on the upper limit value C2 of the predicted values of the required time for transferring the 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 allocation results are obtained.

By performing the multiple allocation in this manner, a plurality of schedules are generated, and flexible crane operation can be performed according to the actual garbage carrying amount and the like. For example, in one schedule, the stirring operation is 30%, and in the other schedule, the stirring operation is 40%. In this case, if the amount of garbage carried in is larger than expected and the transfer work takes more time, the stirring work 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 and the time required for the transfer operation is short, the stirring operation can be controlled to about 40%. This is also the same for the assignment of the work hours for each time slot of one day described below.

Assignment of work hours to time periods 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 set the target period T to one day, divide the one day into a plurality of time periods, and allocate the work time in each time period.

For example, in the example shown in fig. 2 (c), 30% of the operation time on saturday is allocated to the input operation, 20% to the transfer operation, and 50% to the stirring operation. Therefore, the scheduling unit 105 allocates the jobs for each time slot so that the ratio of each job in which the job time of each job from the start to the end of the job on the saturday is counted satisfies the allocation. The same applies to other days. In this assignment, as in the assignment of jobs to each day, various methods for solving scheduling problems can be applied.

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

Example of distribution 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 amount in each time slot per day (weekday) in which garbage is carried in, and fig. 3 (b) shows an example of the work time allocation in each time slot per weekday.

In each day shown in fig. 3 (a), the carry-in is started from 8 hours, the carry-in amount reaches a peak at 9 hours, the carry-in amount decreases at 12 hours, the carry-in amount increases again at 13 hours, the carry-in amount decreases again at 14 hours, and the carry-in ends at 16 hours. On such a day, it is important to secure the operation time of the stirring operation as long as possible in the time zone (about 8 th to 11 th and 13 th) in which the amount of garbage is relatively large. Therefore, the scheduling unit 105 performs allocation so as to satisfy the above condition (2).

In the example of fig. 3 (b), in the time period from 0 to 4 of the time period in which no loading is performed, 30% of the operation time is allocated to the input operation, 40% of the operation time is allocated to the transfer operation, and the remaining 30% of the operation time is allocated to the stirring operation. Further, in the time zone in which the mixing operation is not carried in, 30% of the operation time is allocated to the input operation, 60% of the operation time is allocated to the transfer operation, and the remaining 10% of the operation time is allocated to the mixing operation in the time zone from 4 hours to 8 hours before 8 hours, which is the time point at which the mixing operation is started. In this way, by increasing the ratio of the transfer work in the time period before the start time of the carrying-in, the amount of the garbage in the receiving area at the start time of the carrying-in can be reduced as much as possible, and the time for the stirring work can be secured after the start of the carrying-in.

For example, in the example of fig. 3 (b), 30% of the operation time is allocated to the stirring operation even in the time zone from 8 hours to 12 hours, which is the time zone in which the carrying-in amount is the largest. In addition, in the second plurality of time slots, i.e., the time slots from 12 to 16, 40% of the operation time is allocated to the stirring operation. As described above, in the example of fig. 3 (b), at least 30% of the working time is secured in the whole of the time zone (where the garbage is carried in) in which the amount of garbage is relatively large in one day. Therefore, by operating the crane in accordance with the distribution, even in a time zone in which the amount of garbage carried in is relatively large, the garbage that has been stirred can be used for incineration, and the garbage can be stably incinerated.

In the example of fig. 3 (b), 50% and 30% of the operation time is allocated to the stirring operation in the time periods from 16 hours to 20 hours and from 20 hours to 24 hours, which are time periods after 16 hours, which is the loading end time. Thus, on the next day, even in a time zone where the carrying-in amount is large and the time has to be allocated to the transfer work, the garbage after being sufficiently stirred can be used for incineration.

[ determination of work order ]

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

For example, the work order determination unit 107 may determine an order satisfying the following conditions. All the conditions described below are not necessarily used, and may be used as long as necessary.

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

(b) When a portion having a maximum height of refuse equal to or higher than a threshold value appears in the receiving area, the next operation is a transfer operation from the portion.

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

The evaluation value may be a value calculated by evaluating the following items, for example. As for the evaluation value, it is not necessary to use all the evaluation values described below, and only necessary evaluation values may be used.

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

(e) The evaluation value of the flatness was evaluated (if the dispersion of the trash height in a predetermined range in the trash pit is equal to or more than the threshold value, the evaluation is low, and if it is less than the threshold value, the evaluation is high).

As described above, the operation order determination unit 107 determines the execution order of the stirring operation, the transfer operation, and the input operation in the target period so that the conditions for performing the stirring operation and the transfer operation in the time allocated by the scheduling unit 105 are satisfied. Thus, the execution sequence can be determined within the time schedule created by the scheduling unit 105 for the mixing operation, the transfer operation, and the input operation, which are main operations performed in the refuse pit.

[ example of implementation by software ]

The control module of the information processing device 1 (particularly, each unit included in the control unit 10) may be realized by a logic circuit (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 includes a computer that executes commands of a program, which is software for realizing the respective functions. The computer has, for example, one or more processors, and 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. The processor may be, for example, a Central Processing Unit (CPU). 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. The system may further include a RAM (Random Access Memory) for expanding the program. Further, the program may be supplied to the computer via any transmission medium (communication network, radio wave, etc.) capable of transmitting the program. Further, an embodiment of the present invention can also be realized as a data signal embedded in a carrier wave, the data signal being embodied by electronically transmitting the program.

[ additional notes ]

An information processing device according to an aspect of the present invention includes: a transfer time prediction unit that predicts a time required for a transfer operation for transferring the loaded refuse by a crane in a series of time periods, the series of time periods including: a time zone in which the amount of garbage carried into the garbage pit is relatively large and a time zone in which the amount of garbage carried into the garbage pit is small compared to the time zone; and a scheduling unit that allocates, to the stirring operation and the transfer operation, an operation time during which the garbage stirring operation or the transfer operation can be performed by the crane in the series of time periods so as to satisfy the following conditions (1) and (2), wherein (1) at least the time predicted by the transfer time prediction unit is used for performing the transfer operation; (2) the stirring operation is performed for a predetermined time or more in the time zone in which the amount of the garbage carried in is relatively large.

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

The information processing apparatus may further include an operation order determination unit that determines an execution order of the stirring operation, the transferring operation, and the loading operation for loading the garbage from the garbage pit into the hopper in the series of time slots so that a condition that the stirring operation and the transferring operation are performed at the time allocated by the scheduling unit is satisfied.

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

An information processing program, which is also included in the scope of the present invention, is configured to cause a computer to function as the information processing apparatus, and to cause a computer to function as the transfer time prediction unit and the scheduling unit.

The present invention is not limited to the above embodiments, and various modifications can be made within the scope shown in the claims, and embodiments obtained by appropriately combining technical means disclosed in different embodiments are also included in the technical scope of the present invention.

Description of the reference numerals

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

Claims

1. An information processing apparatus, comprising:

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

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

(1) at least the time predicted by the transfer time prediction unit is used for the transfer work;

(2) the stirring operation is performed for a predetermined time or more in the time zone in which the amount of the garbage carried in is relatively large.

2. The information processing apparatus according to claim 1,

the scheduling unit allocates the work time to the stirring work and the transfer work so that a predetermined condition associated with the garbage height of the garbage pit at the work end time in the series of time slots is satisfied in addition to the conditions (1) and (2).

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

the system is provided with an operation order determination unit that determines an execution order of the stirring operation, the transfer operation, and the loading operation for loading the garbage from the garbage pit into the hopper in the series of time periods while satisfying a condition that the stirring operation and the transfer operation are performed in the time allocated by the scheduling unit.

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

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

allocating an operation time during which the garbage stirring operation or the transferring operation can be performed by the crane to the stirring operation and the transferring operation in the series of time zones so as to satisfy the following conditions (1) and (2),

(1) at least the time predicted in the step is used for performing the transfer operation;

5. An information processing program for causing a computer to function as the information processing apparatus according to claim 1,

the information processing program is configured to cause a computer to function as the transfer time prediction unit and the scheduling unit.