Plan creation device, plan creation method, and program

Abstract

To provide a plan creation device capable of creating an allocation plan for efficiently allocating inbound and outbound work to each area so as not to bias the load on a specific area or a loading and unloading apparatus.SOLUTION: A plan creation device includes: an allocation plan creation unit that creates a tentative plan for allocating inbound and outbound work of a plurality of objects to one of a plurality of areas based on inbound and outbound work information including work start date and time of the inbound and outbound work of each of the objects; an evaluation unit that calculates an overall evaluation value of the tentative plan so that the greater the load bias in the area, the greater the value, in the tentative plan; a plan update unit that creates a plan proposal in which the area allocation of some of the inbound and outbound work of the tentative plan is changed, and updates the tentative plan with the plan proposal if the overall evaluation value of the plan proposal is smaller than that of the tentative plan; and an output unit that outputs the tentative plan as an allocation plan for the inbound and outbound work if a predetermined criterion is satisfied.SELECTED DRAWING: Figure 3

Description

Technical Field

[0001] The present disclosure relates to a planning device, a planning method, and a program.

Background Art

[0002] At bases for storing goods such as logistics warehouses and container terminals, it is required to determine the placement location of goods so that efficient inbound and outbound operations can be achieved. For example, in a system that performs inbound and outbound operations by introducing multiple cargo handling devices, if the areas of responsibility (shelves or a collection of multiple shelves) of the multiple cargo handling devices overlap, a deadlock may occur when the movement timings of the cargo handling devices overlap, etc., and thus complex control is required to avoid this. Therefore, in view of the ease of control between cargo handling devices and the conveyance efficiency, etc., one cargo handling device may be assigned to each area. At this time, if the goods for which inbound and outbound operations are continuously performed in a certain area are concentrated and placed, the load may concentrate on the cargo handling device responsible for this area, and there is a possibility that the inbound and outbound operations may stagnate. As a technique for suppressing the concentration of load, Patent Document 1 describes a method for determining the placement location of a container at a container terminal in consideration of the information on the number of levels at the placement location of the container, the information on the mother ship for loading and unloading the container, and the operating status of the container conveyance equipment each time a container conveyance operation occurs.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] For example, in the prior art described in Patent Document 1, assuming that the land-side transportation work is not carried out as expected, that is, the future inbound and outbound work is unclear, every time the transportation work occurs, it is necessary to re-create the container placement plan so that the load of the current cargo handling equipment is evenly distributed. However, in the method of re-creating the placement plan every time the transportation work occurs as in the prior art, if the future inbound and outbound work is known, the efficiency of the overall inbound and outbound work may instead decrease.

[0005] An object of the present disclosure is to provide a plan creation device, a plan creation method, and a program that can create an allocation plan in which inbound and outbound work is efficiently allocated to each area so that the load does not bias towards a specific area or cargo handling equipment.

Means for Solving the Problems

[0006] According to one aspect of the present disclosure, a plan creation device includes an allocation plan creation unit that creates a tentative plan for allocating the inbound and outbound work of the object to any of a plurality of areas based on the inbound and outbound work information including the work start date and time of the inbound and outbound work of each of the plurality of objects, an evaluation unit that calculates an overall evaluation value of the tentative plan so that the value increases as the bias of the load to the area increases in the tentative plan, a plan update unit that creates a plan proposal in which the allocation of the area of a part of the inbound and outbound work in the tentative plan is changed, and updates the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan, and an output unit that outputs the tentative plan as an allocation plan for the inbound and outbound work when a predetermined criterion is satisfied.

[0007] According to one aspect of the present disclosure, a planning method includes: creating a tentative plan for allocating the inbound and outbound operations of the objects to any of a plurality of areas based on the inbound and outbound operation information including the operation start date and time of the inbound and outbound operations of each of the plurality of objects; calculating an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan; creating a plan proposal in which the allocation of the areas of some of the inbound and outbound operations in the tentative plan is changed, and updating the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan; and outputting the tentative plan as an allocation plan for the inbound and outbound operations when a predetermined criterion is satisfied.

[0008] According to one aspect of the present disclosure, a program causes a planning device to execute: creating a tentative plan for allocating the inbound and outbound operations of the objects to any of a plurality of areas based on the inbound and outbound operation information including the operation start date and time of the inbound and outbound operations of each of the plurality of objects; calculating an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan; creating a plan proposal in which the allocation of the areas of some of the inbound and outbound operations in the tentative plan is changed, and updating the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan; and outputting the tentative plan as an allocation plan for the inbound and outbound operations when a predetermined criterion is satisfied.

Advantages of the Invention

[0009] According to the above aspect, it is possible to create an allocation plan for inbound and outbound operations that can prevent the load from concentrating on a specific area or handling equipment and the stagnation of inbound and outbound operations.

Brief Description of the Drawings

[0010]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Figure 12

Figure 13

Figure 14

Figure 15

Figure 16

Figure 17

Figure 18

Figure 19

Figure 20

Figure 21

Figure 22

Figure 23

Mode for Carrying Out the Invention

[0011] <First Embodiment> Hereinafter, the first embodiment will be described in detail with reference to FIGS. 1 to 16. In this embodiment, an example in which a planning device creates an allocation plan for the incoming and outgoing operations of goods (objects) in a picking system such as a warehouse or a factory will be described. In other embodiments, the planning device may create an allocation plan for incoming and outgoing operations with objects such as containers in a container terminal or vehicles in a parking lot.

[0012] (Overall Configuration) FIG. 1 is a schematic diagram showing the overall configuration of the picking system according to the first embodiment. FIG. 1 shows an example of the picking system 1 provided in a warehouse. In the warehouse, a plurality of areas A1 and A2 are provided with shelves capable of accommodating a plurality of goods. In each area A1 and A2, a supply pallet replenishment shelf L1 for storing supply pallets loaded with goods and an empty pallet storage shelf L2 for storing empty pallets are installed. Each supply pallet is loaded with, for example, one type of goods (products). The picking system 1 performs an operation (loading operation) of taking out the products ordered by the customer from each supply pallet for the number of orders and reloading them onto the shipping pallets for shipping to the customer.

[0013] The picking system 1 includes an AGF2 (Automated Guided Forklift), an AGV3 (Automated Guided Vehicle), a palletizer 4 (automatic loading device), and a planning device 10.

[0014] The AGF2 performs operations such as taking out goods (warehouse outbound) from the supply pallet replenishment shelf L1 and returning the remaining goods after the stacking operation to the supply pallet replenishment shelf L1 (warehouse inbound). One AGF2 is arranged in each of the areas A1 and A2.

[0015] The AGV3 transports goods (supply pallets) between each of the areas A1 and A2 and the working area of the palletizer 4. The transfer of goods between the AGF2 and the AGV3 is carried out at the transfer point L3 provided in each of the areas A1 and A2. One transfer point L3 may be provided in each of the areas A1 and A2, or a plurality of transfer points may be provided as in the example of FIG. 1.

[0016] The palletizer 4 takes out predetermined goods from the supply pallets transported by the AGV3 to the working area and restacks them onto the shipping pallets. The shipped pallets after the stacking is completed are transported and stored in a shipping pallet storage shelf (not shown) by the AGV3.

[0017] The planning device 10 creates an allocation plan that allocates the inbound and outbound operations of goods (supply pallets) before and after the stacking operation to each of the areas A1 and A2. The detailed functional configuration of the planning device 10 will be described later.

[0018] FIG. 2 is a diagram for explaining the schematic functions of the picking system according to the first embodiment. FIG. 2 shows an overview of the operations in the picking system 1. (a) to (d) in FIG. 2 represent the outbound operation by the AGF 2 and the AGV 3, (e) represents the stacking operation by the palletizer 4, and (f) to (h) represent the inbound operation by the AGF 2 and the AGV 3. The supply pallet replenishment shelves L1 in each area A1, A2 are in a state where the goods P are replenished. An example of area A1 is shown in FIG. 2. First, the AGF 2 in area A1 (a) withdraws the goods P from the supply pallet replenishment shelf L1. Also, the AGF 2 (b) conveys this goods P to the transfer point L3 in area A1, and (c) places the supply pallet with the goods P loaded on the pedestal B at the transfer point L3. Next, (d) the AGV 3 loads the goods P (supply pallet) from the transfer point L3 in area A1 and conveys it to the stacking work area. The AGV 3 may load the goods P together with the pedestal B as in the example of FIG. 2. Also, in the stacking work area, (e) the palletizer 4 performs the stacking operation. After that, the AGV 3 (f) conveys the remaining goods P to the inbound destination area (area A1 in the example of FIG. 2), and (g) places the goods P (supply pallet) at the transfer point L3 in area A1. At this time, the AGV 3 may place the goods P together with the pedestal B at the transfer point L3 as in the example of FIG. 2. Then, the AGF 2 in area A1 (f) conveys the goods P placed at the transfer point L3 to the supply pallet replenishment shelf L1 and stores it. The AGF 2 and the AGV 3 perform the inbound and outbound operations of each goods P shown in FIG. 2 based on the allocation plan created by the planning device 10.

[0019] (Functional Configuration) FIG. 3 is a block diagram showing the functional configuration of the planning device according to the first embodiment. As shown in FIG. 3, the planning device 10 includes a processor 11, a memory 12, a storage 13, a communication interface 14, a display device 15, and an input device 16.

[0020] By operating according to a predetermined program, the processor 11 functions as an input information acquisition unit 110, an allocation plan creation unit 111, an evaluation unit 112, a plan update unit 113, and an output unit 114 in the plan creation device 10. The predetermined program executed by the processor 11 is stored in a computer-readable recording medium. The computer-readable recording medium refers to a magnetic disk, a magneto-optical disk, a CD-ROM, a DVD-ROM, a semiconductor memory, etc. Also, this computer program may be distributed to a computer via a communication line, and the computer that has received this distribution may execute the program. Furthermore, this program may be for realizing a part of the above-described functions. Furthermore, the above-described functions may be realized in combination with a program already recorded in the computer system, that is, a so-called difference file (difference program).

[0021] The input information acquisition unit 110 acquires input information for creating an allocation plan.

[0022] Based on an inbound and outbound plan that determines the execution times of the inbound and outbound operations for each of a plurality of packages (objects), the allocation plan creation unit 111 creates a tentative plan that allocates the inbound and outbound operations of the packages to any of a plurality of areas.

[0023] Based on evaluation items that predetermine the conditions under which the inbound and outbound operations in the area will be stalled, the evaluation unit 112 calculates the overall evaluation value of the tentative plan so that the evaluation value increases when the conditions are met.

[0024] The plan update unit 113 creates a plan proposal in which the allocation of areas for some of the inbound and outbound operations in the tentative plan is changed, and updates the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan.

[0025] When the output unit 114 meets a preset standard, it outputs the tentative plan as the allocation plan for the incoming and outgoing operations. In this embodiment, the output unit 114 outputs (displays) the allocation plan to the display device 15. In other embodiments, the output unit 114 may output (transmit) the allocation plan to an external device (not shown) such as a server or an operation terminal.

[0026] The memory 12 has a memory area necessary for the operation of the processor 11.

[0027] The storage 13 is a so-called auxiliary storage device, such as an HDD (Hard Disk Drive), an SSD (Solid State Drive), etc. Data such as data acquired, generated, and referred to by each part of the processor 11 during processing is stored in the storage 13.

[0028] The communication interface 14 is an interface for transmitting and receiving various data and control signals between the AGF2, the AGV3, etc.

[0029] The display device 15 is a display device for presenting the allocation plan created by the plan creation device 10 to the operator, such as a liquid crystal display or an organic EL display.

[0030] The input device 16 is an input device that receives the operator's operations, such as a general mouse, keyboard, touch sensor, etc.

[0031] (Processing flow) FIG. 4 is a first flowchart showing an example of the allocation plan creation process according to the first embodiment. Hereinafter, with reference to FIG. 4, the flow of the process for the plan creation device 10 to create an allocation plan for allocating the incoming and outgoing operations of the goods to any of a plurality of areas will be described.

[0032] First, the input information acquisition unit 110 reads input information for creating an allocation plan (step S11). The input information includes, for example, plan parameters, incoming and outgoing operation information for each piece of luggage, area information, transfer point information, initial inventory information, etc. The plan parameters include the unit time frame for incoming and outgoing operations, the specified number of time frames for continuous operations, etc. The specified number of time frames for continuous operations is the number of time frames considered to have performed incoming and outgoing operations continuously (performed continuous operations) in each area. The values of the parameters may be arbitrarily set by the operator of the plan creation device 10. The incoming and outgoing operation information includes identification information (luggage ID) that can identify the luggage, operation type (incoming or outgoing), operation start date and time, operation end date and time, etc. The area information includes identification information (area ID) that can identify the area, allocation priority, the number of pieces of luggage that can be placed, etc. The transfer point information includes identification information (transfer point ID) that can identify the transfer point L3, type (for incoming, for outgoing, shared for incoming and outgoing), the area ID of the area to which the transfer point L3 belongs, etc. The initial inventory information includes the luggage ID of the initial inventory, the area ID of the area where the initial inventory is stored, etc. The initial inventory is the luggage that has already been placed on the supply pallet replenishment shelf L1 in each area at the stage of creating the allocation plan. For example, when using the surplus inventory from the previous day as it is without moving it from the supply pallet replenishment shelf L1, it is recorded as the information of the initial inventory.

[0033] FIG. 5 is a diagram showing an example of incoming and outgoing operation information according to the first embodiment. Based on the operation start date and time of the incoming and outgoing operation information, the input information acquisition unit 110 creates an incoming and outgoing operation schedule for each time frame shown in FIG. 5 and adds it to the incoming and outgoing operation information. As shown in FIG. 5(a), the input information acquisition unit 110 divides the calculation period (the period during which a series of incoming and outgoing operations are performed) into unit time frames, and assigns each of the incoming operation and the outgoing operation to the time frame corresponding to the operation start date and time.

[0034] Also, in this embodiment, an allocation plan is created so that only one operation is performed in each area within each time frame, so that operations are not assigned to AGF2 or AGV3 redundantly. That is, the number of operations that can be performed simultaneously within one time frame is up to the same number as the number of areas. Therefore, when the number of operations to be performed in the same time frame exceeds the number of areas, the input information acquisition unit 110 makes an adjustment to delay the excess number of operations to the next time frame. The input information acquisition unit 110 selects the operations to be changed (moved backward) to the immediately following time frame until the number of operations in each time frame becomes equal to or less than the number of areas according to a predetermined evaluation criterion. Further, the input information acquisition unit 110 updates the operation start date and time of the changed operation to the start date and time of the time frame after the change.

[0035] There are three evaluation criteria, for example, "(1) the operation start date and time is the latest", "(2) the number of operations of the same operation type (inbound or outbound) performed within the same time frame is small", and "(3) the reading order of the input data is late", and the priorities are high in the order of (1), (2), and (3). When there are multiple operations that meet the criterion with a higher priority, the input information acquisition unit 110 further narrows down the operations that meet the criterion with a lower priority to select the excess number of operations. Regarding criterion (2), it is a criterion for making an adjustment to delay the operation with the smaller number to the next time in order to suppress the possibility of continuously performing the same type of operations in the previous and subsequent time frames. For example, when the inbound operation and the outbound operation are consecutive in the previous and subsequent time frames, it is possible to transport both the goods to be stored and the goods to be shipped by reciprocating one AGV3, so it is more likely to use AGV3 efficiently than when only the inbound operation (or only the outbound operation) is consecutive.

[0036] In the example of Fig. 5(a), based on criterion (1), the "inward operation of package P2" and the "outward operation of package P3" with the latest work start date and time in time frame T8 are extracted as change candidates. Also, based on criterion (2), in time frame T8, since the number of inward operations is less than that of outward operations, the "inward operation of package P2" is selected as the operation to be changed. When the number of inward and outward operations in time frame T8 is the same, based on criterion (3), the operation is selected starting from the one with the later reading order of the input data. As shown in Fig. 5(b), the input information acquisition unit 110 shifts the selected "inward operation of package P2" to the immediately following time frame T9. Also, the work start date and time of this operation is updated to the start date and time of time frame T9 (08:40:00 in the example of Fig. 5). The input information acquisition unit 110 performs such adjustments for all time frames and adjusts the work schedule so that the number of operations in each time frame does not exceed the number of areas.

[0037] Next, the allocation plan creation unit 111 creates an initial plan (the first tentative plan) based on the input information (step S12).

[0038] Fig. 6 is a second flowchart showing an example of the allocation plan creation process according to the first embodiment. First, with reference to Fig. 6, the flow of the process in which the allocation plan creation unit 111 creates an initial plan will be described. Here, an example in which the inward and outward operations of five packages P1 to P6 are each assigned to three areas A1 to A3 will be described.

[0039] First, the allocation plan creation unit 111 rearranges the inward and outward operations according to the rules that define the priority order (step S102). For example, the rules are set so that the priority increases in the order of "(1) the first outward operation with initial inventory", "(2) the first outward operation other than the initial inventory", "(3) the earlier work start date and time", and "(4) the earlier data reading order".

[0040] Next, the allocation plan creation unit 111 selects the operation with the highest priority and an unallocated area (step S103).

[0041] Further, the allocation plan creation unit 111 selects an area that is unevaluated and has the highest allocation priority among the plurality of areas A1 to A3 (step S104).

[0042] Next, the evaluation unit 112 calculates an allocation evaluation value when the work selected in step S103 is allocated to the area selected in step S104 (step S105). The allocation evaluation value is an evaluation value indicating the degree of bias in the load on this area when the selected work is allocated to the selected area, and the smaller the value, the better. The allocation evaluation value is obtained, for example, by the following formula (1).

[0043]

Equation

[0044] In formula (1), i represents the warehousing work among the works to be evaluated, and j represents the shipping work among the works to be evaluated. x n is the score of an arbitrary evaluation item, N is the set of evaluation items, and n is an arbitrary evaluation item. The evaluation item is an item for evaluating the bias in the load on the area, and the larger the score, the greater the bias in the load. Details of the evaluation items will be described later.

[0045] Next, the allocation plan creation unit 111 determines whether the evaluation of all areas for the selected work is completed (step S106). If the evaluation of all areas is not completed (step S106; NO), the process returns to step S104. Then, the processes of steps S104 to S105 are repeatedly executed to calculate the evaluation value when the selected work is allocated to other areas. On the other hand, if the evaluation of all areas is completed (step S106; YES), the area with the smallest evaluation value is selected and allocated as the warehousing destination or shipping source area of the selected work (step S107).

[0046] Also, the allocation plan creation unit 111 determines whether the area allocation for all the operations included in the incoming and outgoing operation information (operation schedule) has been completed (step S108). If the area allocation for all the operations has not been completed (step S108; NO), the process returns to step S103. Then, the processes of steps S103 to S107 are repeatedly executed to perform area allocation for all the operations. On the other hand, if the area allocation for all the operations has been completed (step S108; YES), the creation of the initial plan is terminated.

[0047] Figs. 7 to 10 are diagrams for explaining the functions of the allocation plan creation unit according to the first embodiment. The details of the initial plan creation process shown in Fig. 6 will be described by taking Figs. 7 to 10 as examples.

[0048] For example, in the initial inventory information, it is assumed that the packages P1 and P3 have already been placed (already in the initial inventory) in areas A1 and A2, respectively. The allocation plan creation unit 111 selects the first outgoing operations of these packages P1 and P3 in step S103. As shown in Fig. 7, the allocation plan creation unit 111 allocates the first outgoing operation (time frame T1) of the package P1, which is already in the initial inventory, to area A1 based on the incoming and outgoing operation information. Similarly, the allocation plan creation unit 111 allocates the first outgoing operation (time frame T3) of the package P3, which is already in the initial inventory, to area A3. At this time, since the initial placement area has already been determined, steps S104 to S106 may be omitted.

[0049] Also, the allocation plan creation unit 111 allocates the initial placement areas of the other packages P2, P4, P5, and P6 other than the initial inventory. In the example of Fig. 8, the allocation plan creation unit 111 allocates areas A2, A1, A2, and A3 to the first outgoing operations (time frames T2), (time frames T4), (time frames T5), and (time frames T6) of the package P2, the package P4, the package P5, and the package P6, respectively, by the processes of steps S103 to S107.

[0050] The allocation plan creation unit 111 allocates areas for other incoming and outgoing operations as well. In step S103, the allocation plan creation unit 111 selects the incoming operation with the highest priority (the earliest to be executed) among the operations for which the area for incoming storage after stacking is not determined. Also, in step S104, it selects an unevaluated area with a high allocation priority. In the example of FIG. 9, the incoming operation of the package P1 (time frame T3) is selected. Note that the subsequent outgoing operation of the package P1 (time frame T8) will be carried out in the same area as the incoming operation. Therefore, the allocation plan creation unit 111 sets the pair of the incoming operation of the package P1 (time frame T3) and the outgoing operation (time frame T8) as the operation to be evaluated. Also, in step S104, for these operations to be evaluated, it selects the area with the highest allocation priority. In the example of FIG. 9, the allocation priorities of the areas A1 to A3 are "1 (high)", "2 (medium)", and "3 (low)", respectively. Therefore, the allocation plan creation unit 111 selects the area A1 in step S104. Then, in step S105, the evaluation unit 112 obtains the allocation evaluation value when these operations to be evaluated are allocated to the area A1. The allocation evaluation value of the incoming operation (time frame T3) is calculated by the first term of Equation (1), and the allocation evaluation value of the outgoing operation (time frame T8) is calculated by the second term of Equation (1). The sum of these values is the allocation evaluation value when these operations to be evaluated are allocated to the area A1. Note that when there is no subsequent outgoing operation, the second term of Equation (1) becomes 0.

[0051] FIG. 11 is a diagram showing an example of the evaluation items according to the first embodiment. The evaluation unit 112, for example, sums up the scores x n of each of the evaluation items shown in FIG. 11 to calculate the allocation evaluation value when the operation to be evaluated is allocated to the selected area.

[0052] (Item 1) Multiple operations in the same time frame are not carried out in the same area. To suppress the stagnation of the work of AGF2, it is desirable to avoid performing other work in the same area within the same time frame as much as possible. Therefore, in item 1, when there is work assigned to the same area within the same time frame, the score is set to increase. For example, as shown in Fig. 11, (1A) when there is work assigned to the same time frame and the same area, the score is 100,000, and (1B) when there is no work assigned to the same time frame and the same area, the score is set to 0.

[0053] (Item 2) Try not to exceed the upper limit of the number of times the transfer point is used within the same time frame. When the AGV3 transports the goods together with the gantry B as in the example of Fig. 2, if the inbound operation continues beyond the number of transfer points, there will be no place for the AGV3 to place the gantry B. Then, the AGV3 performing the inbound operation has to wait until another AGV3 transports the gantry B (performs the outbound operation) or the AGF2 retreats the gantry B to the empty pallet storage shelf L2 etc., and the work will stagnate accordingly. The same is true when the outbound operation continues. Therefore, in item 2, when the number of operations exceeds the number of transfer points, a calculation formula is determined so that the score increases. For example, as shown in Fig. 11, the score of item 2 is calculated as 1000×(excess over the upper limit). The excess over the upper limit is obtained by (the number of consecutive times of the same type of work before the time frame for which the work to be planned is scheduled) - (the upper limit number of transfer points of the same type as the work to be evaluated). When the excess over the upper limit is a negative value, it is set to 0. The number of transfer points and the type of transfer points (inbound, outbound, in-out shared) in each area can be specified from the transfer point information. Taking the outbound operation in the time frame T8 of Fig. 9 as an example, since this operation only continues with the outbound operation in the time frame T4, (the number of consecutive times of the same type of work) is 1. When the upper limit number of outbound transfer points is 3, 1 - 3 = -2, so the excess over the upper limit is 0. Therefore, the score of the outbound operation in the time frame T8 is 1000×0 = 0. In addition, for example, if there are outbound operations in each of the time frames T4 to T7 (4 consecutive times), the excess over the upper limit = 4 - 3 = 1. In this case, the score of the outbound operation in the time frame T8 is 1000×1 = 1000.

[0054] (Item 3) Neither the incoming nor outgoing operation is continuous. In order to suppress the work stagnation of AGF2 and AGV3, it is desirable to make the work not continuous in the time frames before and after as much as possible. Therefore, in Item 3, when there is any work in the time frames before and after in the same area, it is set so that the score becomes large. For example, as shown in FIG. 11, the score in the case of (3A) continuous execution is set to 999, and the score in the case of (3B) no continuous execution is set to 0.

[0055] Regarding the work to be evaluated, if the difference from the time frame in which the work immediately before or immediately after is performed is within the specified number of time frames, it is determined that "the work is continuous in the time frames before and after (continuous execution)". Immediately before or immediately after means that there is no work in the time frame between the work to be evaluated and the work subject to continuous determination. The specified number of time frames is information included in the parameters of the plan acquired by the input information acquisition unit 110 as input information.

[0056] Taking as an example the case where the operation to be evaluated is the warehousing operation (package P1) within the time frame T3 in Fig. 9. The operation immediately before the operation to be evaluated within the time frame T3 is the warehousing operation (package P1) within the time frame T1, and the operation immediately after is the warehousing operation (package P4) within the time frame T4. For the time frame T3 of the operation to be evaluated, the operation immediately before (the warehousing operation within the time frame T1) is separated by two time frames. Therefore, when the specified number of consecutive time frames is 1, it is determined that the warehousing operation within the time frame T1 is not continuously carried out. On the other hand, when the specified number of consecutive time frames is 2 or more, it is determined that the warehousing operation within the time frame T1 is continuously carried out. Also, for the time frame T3 of the operation to be evaluated, the operation immediately after (the warehousing operation within the time frame T4) is separated by one time frame. Therefore, when the specified number of consecutive time frames is 1 or more, it is determined that the warehousing operation within the time frame T4 is continuously carried out. For example, when the specified number of consecutive time frames is 5, the warehousing operation (package P1) within the time frame T8 is also included within the time frame for continuous determination. However, since there is an operation within the time frame T4 between the warehousing operations within the time frame T8, it is determined that the warehousing operation within the time frame T8 is not the operation immediately after the operation to be evaluated. Therefore, it is determined that the warehousing operation within the time frame T8 is not continuously carried out. Or it is excluded from the target of continuous determination. Note that when the specified number of consecutive time frames is 0, continuous determination is not performed. If the time frame is large enough, the specified number of consecutive time frames may be set to 0.

[0057] (Item 4) Operations of the same type are not consecutive. For example, if the warehousing operations are continuously carried out in the same area, the AGV2 has to go to the working area of the palletizer 4 to pick up the goods in a non-loaded state, which is not efficient. The same applies when the outbound operations are continuously carried out. Therefore, in item 4, the score is set to increase when the same type of operations are continuous within the same area in the front and back time frames. For example, as shown in Fig. 11, (4A) the score for the case where the same type of operations are continuously carried out is 100, and (4B) the score for the case where the same type of operations are not continuously carried out is set to 0. The method of continuous determination is the same as that in item 3. For example, assuming that the number of specified time frames is 1 and the operation to be evaluated is the warehousing operation (goods P1) in the time frame T3 of Fig. 9. In this case, although the outbound operation in the time frame T4 is determined to be continuously carried out with the operation to be evaluated, since it is not the same type of operation (warehousing operation), it is determined that the same type of operations are not continuous (score = 0). If the time frame T4 is a warehousing operation, it is determined that the same type of operations are continuous (score = 100).

[0058] (Item 5) The number of continuous operations is small. In order to suppress the stagnation of the operations of AGF2 and AGV3, it is desirable that the operations are not continuous in the front and back time frames as much as possible. Therefore, in item 5, a calculation formula is determined such that the score increases as the number of continuous operations increases. For example, as shown in Fig. 11, the score of item 5 is calculated as 10×(the number of continuous operations). Also, for the number of continuous operations, 0 is given when it is not continuous in both the front and back, 1 when it is continuous in either one, and 2 when it is continuous in both the front and back. The method of continuous determination is the same as that in item 3. For example, assuming that the number of specified time frames is 1 and the operation to be evaluated is the warehousing operation (goods P1) in the time frame T3 of Fig. 9. In this case, since the operation to be evaluated is continuous only in the subsequent time frame T4 (the number of continuous operations = 1), the score is 100×1 = 100.

[0059] (Item 6) The allocation priority of the area is high. Item 6 is set so that the score increases as it is assigned to an area with a higher allocation priority. For example, as shown in FIG. 11, the score of Item 6 is calculated as 1×(the value of the priority of the area information). For example, for the warehousing operation (package P1) in time frame T3 of FIG. 9, since the priority of the assigned area A1 is 1, the score is 1×1 = 1.

[0060] The allocation plan creation unit 111 and the evaluation unit 112 repeatedly execute steps S104 to S105 to calculate the evaluation values when the evaluation target operations in FIG. 9 are assigned to each area. Then, in step S107, the area with the smallest evaluation value is assigned to the evaluation target operation in FIG. 9. Also, the allocation plan creation unit 111 and the evaluation unit 112 repeatedly execute steps S103 to S107 to perform area allocation in the same way for other inbound and outbound operations. FIG. 10 shows an example of area allocation for all inbound and outbound operations.

[0061] Note that the scores and calculation formulas shown in FIG. 11 are just examples and can be arbitrarily changed according to the usage environment of the picking system 1. Also, in the example of FIG. 11, for example, when multiple operations are carried out in the same area within the same time frame, the scores are set to become very large, and the execution of multiple operations is not prohibited. That is, even when operations have already been assigned to all areas, it is allowed to assign an operation to the area with the smallest allocation evaluation value. This can avoid the situation where there is no assignment destination for an operation and the allocation plan cannot be created.

[0062] When the creation of the initial plan is completed, the plan creation device 10 returns to FIG. 4 to perform subsequent processing. The allocation plan creation unit 111 sets the initial plan as a tentative solution (tentative plan) (step S13).

[0063] Next, the plan update unit 113 performs optimization calculations until a predetermined criterion is satisfied, and sets the plan with the smallest evaluation value among them as a tentative solution (tentative plan) (step S14). Note that the predetermined criterion is the optimization calculation time in the present embodiment, and it is determined that the criterion is satisfied when the elapsed time since the start of the optimization calculation becomes equal to or longer than the optimization calculation time. The optimization calculation time may be arbitrarily set by the operator of the plan creation device 10.

[0064] FIG. 12 is a third flowchart showing an example of the allocation plan creation process according to the first embodiment. FIGS. 13 to 16 are diagrams for explaining the functions of the plan update unit according to the first embodiment. Here, the details of the process of step S14 in FIG. 4 will be described with reference to FIGS. 12 to 16.

[0065] First, the plan update unit 113 creates a plan proposal in which the plan of the tentative solution is partially changed (step S111). Specifically, the plan update unit 113 randomly selects two operations to be performed in the same time frame from the plan of the tentative solution. For example, as shown in FIG. 13, it is assumed that the operation of shipping the package P2 in the time frame T7 and the operation of receiving the package P5 are selected. Further, the plan update unit 113 also extracts the operations corresponding to each of the two selected operations. The corresponding operation is, in the case where the combination from when entering a certain area to when shipping out is one combination, the shipping operation of the same package immediately after if it is a receiving operation, and the receiving operation of the same package immediately before if it is a shipping operation. As shown in FIG. 14, the operation corresponding to the operation of shipping the package P2 in the time frame T7 is the operation of receiving the package P2 in the time frame T4. Further, the operation corresponding to the operation of receiving the package P5 in the time frame T7 is the operation of shipping the package P5 in the time frame T10. Then, the plan update unit 113 exchanges the allocation areas of the two selected sets of operations. As shown in FIGS. 14 to 15, the area A2 assigned to the set of the package P2 and the area A3 assigned to the set of the package P5 are exchanged. That is, in the changed plan proposal, the set of the receiving operation (time frame T4) and the shipping operation (time frame T7) of the package P2 is assigned to the area A2, and the set of the receiving operation (time frame T7) and the shipping operation (time frame T10) of the package P5 is assigned to the area A3.

[0066] In addition, when another operation is assigned to the area to be swapped, it may not be possible to swap the areas. For example, as shown in FIG. 16, consider the case of swapping the areas of the set of packages P1 in time frames T3 and T8 and the set of packages P6 in time frames T8 and T11. At this time, among the set of packages P6, the outbound operation in time frame T11 overlaps with the inbound operation of package P1, so it cannot be assigned to area A1. In this case, in order to eliminate the overlap of operations, the plan update unit 113 re-determines the area assignment for operations other than the swapped operations by the initial plan generation process of FIG. 6. In the example of FIG. 16, with the inbound operation (time frame T3) and outbound operation (time frame T8) of package P1 fixed in area A2 and the inbound operation (time frame T8) and outbound operation (time frame T11) of package P6 fixed in area A1, the area assignment for other operations is re-determined. Note that the initial placement area is not changed.

[0067] Next, the evaluation unit 112 calculates the overall evaluation value of the changed plan proposal (step S112). Note that when the overall evaluation value of the tentative solution has not been calculated, the evaluation unit 112 also calculates the overall evaluation value of the tentative solution together. The overall evaluation value is the sum of the assignment evaluation values of all operations and is obtained by the following formula (2).

[0068]

Equation

[0069] In formula (2), K is the set of inbound and outbound operations, k is an arbitrary inbound and outbound operation, N is the set of evaluation items, n is an arbitrary evaluation item, and x k,n is the score of an arbitrary evaluation item. The smaller the overall evaluation value, the better the plan with less load bias.

[0070] Next, the plan update unit 113 determines whether the overall evaluation value of the modified plan proposal is smaller than the overall evaluation value of the tentative solution (step S113). If the overall evaluation value of the plan proposal is smaller than that of the tentative solution (step S113; YES), the tentative solution is updated with the plan proposal (step S114). On the other hand, if the overall evaluation value of the tentative solution is smaller than that of the plan proposal, the tentative solution is not updated and the plan proposal is discarded.

[0071] Also, the plan update unit 113 determines whether the optimization calculation time has elapsed since the start of the process in FIG. 12 (step S115). If the optimization calculation time has elapsed (step S115; YES), the plan update unit 113 causes the output unit 114 to output the current tentative solution as the calculation result (determined allocation plan) (step S116). The output unit 114 displays the calculation result on the display device 15. The allocation plan is information indicating which luggage work is assigned to each time frame of each area, for example, as shown in FIG. 10. The allocation plan further includes detailed information such as the luggage ID, work type (warehousing or shipping), work start date and time, and work end date and time for each time frame. The output unit 114 may display the detailed information of each work included in the allocation plan on the display device 15 according to the operation instruction of the operator.

[0072] On the other hand, if the optimization calculation time has not elapsed (step S115; NO), the plan update unit 113 returns to step S111. The plan generation device 10 repeatedly executes the processes of steps S111 to S114 until the optimization calculation time is exceeded. Thereby, the allocation plan can be brought closer to the optimal state as long as time permits. In the present embodiment, an example in which the optimization calculation is repeated until the optimization calculation time elapses has been described, but the present invention is not limited to this. In other embodiments, for example, the optimization calculation may be repeated until the optimization calculation is performed a predetermined number of times or more, or until the update of the tentative solution is not performed a predetermined number of times or more.

[0073] (Function, effect) As described above, the planning device 10 according to the present embodiment includes an allocation plan creation unit 111 that creates a tentative plan for allocating the incoming and outgoing operations of packages to any of a plurality of areas based on the incoming and outgoing operation information including the operation start date and time of the incoming and outgoing operations of each of the plurality of packages, an evaluation unit 112 that calculates an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan, a plan update unit 113 that creates a plan proposal in which the allocation of the areas for some of the incoming and outgoing operations in the tentative plan is changed, and updates the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan, and an output unit 114 that outputs the tentative plan as an allocation plan for the incoming and outgoing operations when a predetermined criterion is satisfied.

[0074] By doing so, the planning device 10 can create an allocation plan in which the incoming and outgoing operations are efficiently allocated to each area so that the load is not biased towards a specific area or handling equipment (AGF2, AGV3).

[0075] Further, when the evaluation unit 112 allocates one incoming and outgoing operation selected from a plurality of incoming and outgoing operations to each area, the evaluation unit 112 further calculates an allocation evaluation value for each area such that the value increases as the bias of the load on each area increases. The allocation plan creation unit allocates the area with the smallest allocation evaluation value to the selected incoming and outgoing operation.

[0076] By doing so, the planning device 10 can allocate each incoming operation to each area so that the load is not biased towards a specific area.

[0077] The plan update unit 113 selects two incoming and outgoing operations to be performed in the same time frame from the tentative plan, and creates a plan proposal in which the areas allocated to the selected incoming and outgoing operations are swapped.

[0078] When creating the allocation plan, for tasks with a lower priority, it is often the case that each area has already been allocated to other tasks, and there is a possibility that the area allocation is not in an optimal state (a state where the load bias is suppressed). However, by creating a plan proposal in which the allocation of a part of the tentative plan is swapped in this way, the planning device 10 can increase the possibility that tasks with a lower priority are also allocated to appropriate areas. As a result, the planning device 10 can bring the tentative plan closer to an optimal state with suppressed load bias.

[0079] Further, when the plan update unit 113 swaps the area allocated to the selected incoming and outgoing operation and there is an overlap with other incoming and outgoing operations, the plan update unit 113 further changes the area allocation of the overlapping other incoming and outgoing operations.

[0080] By doing so, the planning device 10 can search for various pattern plan proposals different from the initial plan and bring the tentative plan closer to a more optimal state.

[0081] In the above-described embodiment, an example of allocating incoming and outgoing operations has been described only for the area where the supply pallet replenishment shelf L1 is provided, but the present invention is not limited to this. In other embodiments, a temporary storage area may be used as the area to which the incoming and outgoing operations are allocated. The temporary storage area is an area where the AGF2 is not arranged, and only the AGV3 is used to temporarily store (warehouse) the goods and transport (shipment) them to the working area of the palletizer 4. When using the temporary storage area, the area information, which is one of the input information, further includes information indicating the area type (shelf L1 or temporary storage area). Further, the allocation plan creation unit 111 creates an area allocation plan on the condition that no goods are placed in the temporary storage area at the beginning and the end of the planning period. For example, the allocation plan creation unit 111 does not select the temporary storage area in step S104 for the first shipment operation and the last receipt operation of each piece of goods. By doing so, for example, goods that are frequently transported to the working area of the palletizer 4 can be temporarily stored in the temporary storage area, so that the load bias to each area and the AGF2 can be more effectively suppressed.

[0082] <Second Embodiment> Next, the second embodiment will be described with reference to FIG. 17. The same reference numerals are given to the components common to the above-described embodiments, and the detailed description thereof will be omitted.

[0083] When storing luggage in each area, it is required to determine the placement location of the luggage so that efficient loading and unloading can be realized. However, when the stay time of each piece of luggage is different, if the luggage with a long stay time is placed in a location close to the loading / unloading port (transfer point L3) (supply pallet replenishment shelf L1), that location will be unavailable during that time. Then, the AGF2 has to transport the luggage from the transfer point L3 to the far shelf L1, which may cause the loading / unloading operation to stagnate accordingly. Therefore, the planning device 10 according to the present embodiment plans the placement location of the luggage assigned to each area in the allocation plan so that as many luggage as possible are placed on the shelf L1 close to the transfer point L3, that is, so that the total moving distance between the transfer point L3 of the AGF2 and the shelf L1 is shortened.

[0084] (Functional Configuration) FIG. 17 is a block diagram showing the functional configuration of the planning device according to the second embodiment. As shown in FIG. 17, the planning device 10 according to the present embodiment further includes a placement plan creation unit 115.

[0085] Based on the allocation plan, the placement plan creation unit 115 assigns a placement location within the area for each piece of luggage that undergoes loading / unloading operations in the area.

[0086] (Processing Flow) FIG. 18 is a first flowchart showing an example of the placement plan creation process according to the second embodiment. Here, an example of planning the placement locations of the luggage P1 to P7 assigned to the area A1 will be described.

[0087] First, the input information acquisition unit 110 reads the input information for creating the placement plan (step S21). The input information includes, for example, placement location information, allocation plans, and the like. The placement location information includes identification information (placement location ID) that can identify the placement location (supply pallet replenishment shelf L1), the distance from the placement location to the transfer point L3, and the like. The allocation plan is created in advance by the planning device 10 by the method described in the first embodiment.

[0088] Next, the placement plan creation unit 115 sorts the packages to be evaluated into groups (step S22).

[0089] FIG. 19 is a second flowchart showing an example of the placement plan creation process according to the second embodiment. FIGS. 20 to 22 are diagrams for explaining the functions of the placement plan creation unit according to the second embodiment. The method of grouping the packages will be described with reference to FIGS. 19 to 22. First, the placement plan creation unit 115 sorts the packages in the order of the scheduled arrival date and time (the order of the start date and time of the arrival operation) (step S201).

[0090] Next, the placement plan creation unit 115 generates a new group (step S202).

[0091] Also, the placement plan creation unit 115 selects packages that meet the conditions from among the packages (step S203). The conditions are, for example, "(1) the residence time does not overlap with that of the packages already assigned to the group", "(2) the start date and time of the arrival operation is the earliest", and "(3) the data reading order is earlier", and the condition with a smaller number is the most prioritized condition. The residence time of a package is the time from the start date and time of the arrival operation of the package to the start date and time of the departure operation. At this time, if there are packages arriving and departing at the same time, these packages are determined to have overlapping residence times.

[0092] Next, the placement plan creation unit 115 assigns the selected package to the group created in step S202 (step S204). For example, as shown in FIG. 20, assume that in step S203, package P1 is selected. This package P1 is assigned to group 1 created in step S202.

[0093] The placement plan creation unit 115 determines whether there is a remaining package that meets the above condition (1) among other packages (step S205). If there is a remaining package that meets condition (1) (step S205; YES), the placement plan creation unit 115 returns to step S203 and assigns the package that meets the condition to the group (steps S203 - S204). For example, as shown in FIG. 21, assume that packages P5 and P6 meet the condition. In this case, these packages P5 and P6 are assigned to the same group 1 as package P1.

[0094] On the other hand, if there is no remaining package that meets condition (1) (step S205; NO), the placement plan creation unit 115 determines whether the assignment of all packages to groups is completed (step S206). If the assignment of all packages to groups is not completed (step S206; NO), the placement plan creation unit 115 returns to step S202. The placement plan creation unit 115 repeats steps S202 - S204 to assign each package to each group. For example, as shown in FIG. 22, the placement plan creation unit 115 assigns packages P2, P4, and P7 to group 2 and assigns package P3 to group 3. Also, if the assignment of all packages to groups is completed as shown in FIG. 22 (step S206; YES), the placement plan creation unit 115 ends the grouping process.

[0095] Next, the placement plan creation unit 115 assigns a placement location to each group (step S23).

[0096] FIG. 23 is a third flowchart showing an example of the arrangement plan creation process according to the second embodiment. The method of allocating the placement locations will be described with reference to FIG. 23. First, the arrangement plan creation unit 115 sorts the groups 1 to 3 in descending order of the number of packages assigned (step S211). For example, in the example of FIG. 22, three packages are assigned to group 1, three packages are assigned to group 2, and one package is assigned to group 3. When the number of packages is the same, they are arranged in the order of group creation. That is, they are arranged in the order of group 1, group 2, and group 3.

[0097] The arrangement plan creation unit 115 selects an unassigned group from the head of the sorted groups (step S212). Also, the arrangement plan creation unit 115 selects unassigned placement locations in ascending order of the movement distance (step S213). Then, the selected placement location is assigned to the selected group (step S214). For example, first, group 1 is selected (step S212). Then, for this group 1, the placement location with the smallest distance (movement distance) to the transfer point L3 among the placement locations (supply pallet replenishment shelf L1) is assigned (steps S213, S214).

[0098] Next, the arrangement plan creation unit 115 determines whether there is a remaining group with an unassigned placement location (step S215). If there is a remaining group with an unassigned placement location (step S215; YES), the arrangement plan creation unit 115 returns to step S212. Then, steps S212 to S214 are repeated to assign placement locations to groups 2 and 3 in order. On the other hand, when all groups have been assigned placement locations (step S215; NO), the arrangement plan creation unit 115 assigns the placement location assigned to the group to which each group's package belongs to the package (step S216). In the example of FIG. 22, the placement location with the smallest movement distance is assigned to the packages P1, P5, and P6 of group 1. Similarly, the placement location with the second smallest movement distance is assigned to the packages P2, P4, and P7 of group 2. The placement location with the third smallest movement distance is assigned to the package P3 of group 3.

[0099] Note that the placement plan creation unit 115 may determine the assignment of the placement location for each piece of luggage so that the total moving distance of the AGF2 is minimized by solving the placement location planning problem using a mathematical optimization model. For example, the placement plan creation unit 115 models the placement location planning problem with an interval graph and obtains a solution that satisfies the constraint conditions of "(Constraint 1) Luggage must be assigned to one placement location" and "(Constraint 2) Luggage belonging to the same clique cannot be placed in the same location". A clique is a clique in graph theory, and here it is a set of luggage with overlapping stay times.

[0100] (Function, effect) As described above, the plan creation device 10 according to the present embodiment further includes a placement plan creation unit 115 that assigns a placement location within the area for each piece of luggage that performs inbound and outbound operations in the area based on the allocation plan output by the output unit 114.

[0101] By doing so, the plan creation device 10 can minimize the moving distance of the AGF2 that performs inbound and outbound operations of luggage within each area. As a result, it is possible to perform efficient inbound and outbound operations with a further reduced load on the AGF2.

[0102] <Other embodiments> Although the embodiments have been described in detail with reference to the drawings above, the specific configuration is not limited to the above, and various design changes and the like are possible. That is, in other embodiments, the order of the above processes may be appropriately changed. Also, some processes may be executed in parallel.

[0103] <Supplementary note> The plan creation device, plan creation method, and program described in the above embodiments are understood as follows, for example.

[0104] (1) According to the first aspect, the plan creation device 10 includes an allocation plan creation unit 111 that creates a tentative plan for allocating the incoming and outgoing operations of the objects to any of a plurality of areas based on the incoming and outgoing operation information including the operation start date and time of the incoming and outgoing operations of each of the plurality of objects, an evaluation unit 112 that calculates an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan, a plan update unit 113 that creates a plan proposal in which the allocation of the areas of some of the incoming and outgoing operations in the tentative plan is changed, and updates the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan, and an output unit 114 that outputs the tentative plan as an allocation plan for the incoming and outgoing operations when a predetermined criterion is satisfied.

[0105] By doing so, the plan creation device 10 can create an allocation plan in which the incoming and outgoing operations are efficiently allocated to each area so that the load is not biased towards a specific area or handling equipment (AGF2, AGF3).

[0106] (2) According to the second aspect, in the plan creation device 10 according to the first aspect, when the evaluation unit 112 allocates a single incoming and outgoing operation selected from a plurality of incoming and outgoing operations to each area, the evaluation unit 112 further calculates an allocation evaluation value for each area such that the value increases as the bias of the load on each area increases, and the allocation plan creation unit 111 allocates the area with the smallest allocation evaluation value to the selected incoming and outgoing operation.

[0107] By doing so, the plan creation device 10 can allocate each incoming operation to each area so that the load is not biased towards a specific area.

[0108] (3) According to the third aspect, in the plan creation device 10 according to the first or second aspect, the plan update unit 113 selects two incoming and outgoing operations to be performed in the same time frame from the tentative plan, and creates a plan proposal in which the areas allocated to the selected incoming and outgoing operations are swapped.

[0109] When creating the allocation plan, for tasks with a low priority, it is often the case that each area has already been assigned to other tasks, and there is a possibility that the area allocation is not in an optimal state (a state where the load bias is suppressed). However, by creating a plan proposal in which the allocation of a part of the tentative plan is swapped in this way, the planning device 10 can increase the possibility that tasks with a low priority are also assigned to appropriate areas. As a result, the planning device 10 can bring the tentative plan closer to an optimal state with suppressed load bias.

[0110] (4) According to the fourth aspect, in the planning device 10 according to the third aspect, when the plan update unit 113 swaps the area assigned to the selected incoming and outgoing operation and there is an overlap with other incoming and outgoing operations, it further changes the area allocation of the overlapping other incoming and outgoing operations.

[0111] By doing so, the planning device 10 can search for various pattern plan proposals different from the initial plan and bring the tentative plan closer to a more optimal state.

[0112] (5) According to the fifth aspect, the planning device 10 according to any one of the first to fourth aspects further includes an arrangement planning unit that assigns an arrangement location within the area to each object for which incoming and outgoing operations are to be performed in the area based on the allocation plan.

[0113] By doing so, the planning device 10 can minimize the moving distance of the AGF2 that performs the incoming and outgoing of the luggage within each area. As a result, it is possible to perform an efficient incoming and outgoing operation with a further reduced load on the AGF2.

[0114] (6) According to the sixth aspect, the planning method includes: creating a tentative plan for allocating the inbound and outbound operations of the objects to any of a plurality of areas based on the inbound and outbound operation information including the operation start date and time of the inbound and outbound operations of each of the plurality of objects; calculating an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan; creating a planned case in which the allocation of the areas of some of the inbound and outbound operations in the tentative plan is changed, and updating the tentative plan with the planned case when the overall evaluation value of the planned case is smaller than that of the tentative plan; and outputting the tentative plan as an allocation plan for the inbound and outbound operations when a predetermined criterion is satisfied.

[0115] (7) According to the seventh aspect, the program causes the planning device 10 to execute: creating a tentative plan for allocating the inbound and outbound operations of the objects to any of a plurality of areas based on the inbound and outbound operation information including the operation start date and time of the inbound and outbound operations of each of the plurality of objects; calculating an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan; creating a planned case in which the allocation of the areas of some of the inbound and outbound operations in the tentative plan is changed, and updating the tentative plan with the planned case when the overall evaluation value of the planned case is smaller than that of the tentative plan; and outputting the tentative plan as an allocation plan for the inbound and outbound operations when a predetermined criterion is satisfied.

Explanation of Reference Numerals

[0116] 1 Picking System 4 Palletizer 10 Planning Device 11 Processor 110 Input Information Acquisition Unit 111 Allocation Plan Creation Unit 112 Evaluation Unit 113 Plan Update Unit 114 Output Unit 115 Arrangement Plan Creation Unit 12 Memory 13 Storage 14 Communication Interface 15 Display Device 16-input device

Claims

1. An allocation plan creation unit that creates a tentative plan for allocating the incoming and outgoing operations of the objects to any of a plurality of areas based on the incoming and outgoing operation information including the operation start date and time of the incoming and outgoing operations of each of the plurality of objects; An evaluation unit that calculates an overall evaluation value of the tentative plan such that the value increases as the bias of the load to the area increases in the tentative plan; A plan update unit that creates a plan proposal in which the allocation of the areas of some of the incoming and outgoing operations in the tentative plan is changed, and updates the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan; An output unit that outputs the tentative plan as the allocation plan for the incoming and outgoing operations when a predetermined criterion is satisfied; A plan creation device comprising:

2. When the evaluation unit allocates one incoming and outgoing operation selected from a plurality of the incoming and outgoing operations to each of the areas, the evaluation unit further calculates an allocation evaluation value for each area such that the value increases as the bias of the load to the area increases. The allocation plan creation unit allocates the area with the smallest allocation evaluation value to the selected incoming and outgoing operation. The plan creation device according to claim 1.

3. The plan update unit selects two incoming and outgoing operations to be performed in the same time frame from the tentative plan, and creates the plan proposal in which the areas allocated to the selected incoming and outgoing operations are swapped. The plan creation device according to claim 1.

4. When the plan update unit swaps the areas allocated to the selected incoming and outgoing operations and there is an overlap with other incoming and outgoing operations, the plan update unit further changes the allocation of the areas of the overlapping other incoming and outgoing operations. The plan creation device according to claim 3.

5. Further comprising an arrangement plan creation unit that allocates an arrangement location within the area to each of the objects that perform incoming and outgoing operations in the area based on the allocation plan. The planning device according to any one of claims 1 to 4.

6. Creating a tentative plan for allocating the incoming and outgoing operations of the objects to any one of a plurality of areas based on the incoming and outgoing operation information including the operation start date and time of the incoming and outgoing operations of each of the plurality of objects; Calculating an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan; Creating a plan proposal in which the allocation of the areas of some of the incoming and outgoing operations in the tentative plan is changed, and updating the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan; Outputting the tentative plan as an allocation plan for the incoming and outgoing operations when a predetermined criterion is satisfied; A planning method having the above.

7. Creating a tentative plan for allocating the incoming and outgoing operations of the objects to any one of a plurality of areas based on the incoming and outgoing operation information including the operation start date and time of the incoming and outgoing operations of each of the plurality of objects; Calculating an overall evaluation value of the tentative plan such that the value increases as the bias of the load on the area increases in the tentative plan; Creating a plan proposal in which the allocation of the areas of some of the incoming and outgoing operations in the tentative plan is changed, and updating the tentative plan with the plan proposal when the overall evaluation value of the plan proposal is smaller than that of the tentative plan; Outputting the tentative plan as an allocation plan for the incoming and outgoing operations when a predetermined criterion is satisfied; A program for causing a planning device to execute the above.

Images