Information processing device, work plan creation method, and work plan creation program
The information processing apparatus optimizes work plans for warehouses by defining article-shelf correspondences and minimizing travel, addressing the inefficiencies in simultaneous collection and return operations.
Patent Information
- Application Number
- JP2021174895
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-10-26
- Publication Date
- 2025-07-31
- Estimated Expiration
- 2041-10-26
AI Technical Summary
The challenge in warehouses with multiple shelves is creating efficient work plans for simultaneous goods collection and return operations due to limited load capacity of transportation vehicles and numerous shelves, leading to complex and inefficient routing.
An information processing apparatus and method that creates work plans by defining identifiers for article-shelf correspondences, optimizing the movement of a moving body to perform loading and unloading operations in a single round trip using patterns that minimize unnecessary travel.
This approach reduces the number of round trips required and shortens travel distance, enhancing the efficiency of goods collection and return operations.
Smart Images

Figure 0007715990000001 
Figure 0007715990000002 
Figure 0007715990000003
Abstract
Description
Technical Field
[0001] This invention relates to an information processing apparatus, a work plan creation method, and a work plan creation program.
Background Art
[0002] Techniques for automatically performing picking operations have been disclosed (see Patent Documents 1 and 2).
Prior Art Documents
Patent Documents
[0003]
Patent Document 1
Patent Document 2
Summary of the Invention
Problems to be Solved by the Invention
[0004] In a warehouse where each goods shelf forms a row, picking operations may be performed using a moving body, for example, a traveling machine such as an automatic guided vehicle (AGV). However, since the maximum number of items that can be loaded on the traveling machine is specified, the number of items that can be transported at one time is limited. In addition, there are a large number of goods shelves in a vast warehouse. Therefore, it is complicated to create a work plan for simultaneously performing the goods collection operation and the return operation. Note that this problem is not limited to the case where the traveling machine automatically performs the picking operation, but may also occur when a worker manually performs the picking operation using a moving body such as a cart.
[0005] On one aspect, an object of this invention is to provide an information processing apparatus, a work plan creation method, and a work plan creation program that can create an efficient goods collection / return work plan.
Means for Solving the Problems
[0006] In one aspect, the work plan creation program relates to a plurality of articles, a plurality of rows including a plurality of article shelves, and a plurality of work paths provided between each of the plurality of rows. An identifier indicating the correspondence between each of the plurality of articles and each of the plurality of article shelves is defined. A moving body having a placement space for placing the articles moves along any one of the plurality of work paths as an outbound path and moves along any one of the plurality of work paths as a return path. A first operation of placing a plurality of first articles placed on the moving body on an article shelf specified by the identifier defined for the article, and a second operation of placing a plurality of second articles specified by the identifier on the moving body from the article shelf. Under the condition of performing, the computer is caused to execute a process of specifying the plurality of first articles and the plurality of second articles so that the first operation and the second operation can be performed by one outbound movement and one return movement.
Advantages of the Invention
[0007] Efficient loading and return work plans can be formulated.
Brief Description of the Drawings
[0008]
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
Embodiments for Carrying Out the Invention
[0009] Prior to the description of the embodiments, the outline of the automatic picking operation will be described.
[0010] In a logistics warehouse, the inventories of various products are stored in a vast space. In such a logistics warehouse, multiple types of products are stored. Each product case containing multiple of the same product is stored on a designated product shelf.
[0011] In the picking operation of these products, there are cases where workers pick up products from the product cases on each product shelf, or where a traveling machine (automated machine: AGV) automatically picks up products. Here, the case where the traveling machine automatically picks up products will be described as an example. For example, as illustrated in FIG. 1, the traveling machine 201 travels to the product shelf 202 where the product case (hereinafter referred to as the picking product case) containing the product designated for picking is stored, and picks up the picking product case from the product shelf 202. This operation will hereinafter be referred to as the picking operation. The traveling machine 201 that has loaded the picking product case into its loading space transports and aggregates the picking product case to the picking operation area 203. In the picking operation area 203, the final picking operation from the picking product case is performed by the worker. The traveling machine 201 transports the product case (hereinafter referred to as the return product case) after the final picking operation and returns it to the original product shelf 202.
[0012] However, since the maximum number of product cases that can be loaded onto the traveling machine 201 is specified, the number of product cases that can be transported at one time is limited. Also, there are a large number of product shelves in the vast warehouse. Therefore, formulating a work plan for simultaneously performing the picking operation and the return operation is complicated. If the combination and work order of the product cases to be returned and picked up in one operation are not considered, the work efficiency will instead decrease. Note that the specified maximum number of loaded cases may be different from the maximum allowable number of loads on the traveling machine 201. For example, even if up to 7 product cases can be loaded into the loading space of the traveling machine 201, the specified maximum number of loaded cases may be 6.
[0013] FIG. 2 is a diagram illustrating a picking operation that can efficiently perform loading and return operations. In the example of FIG. 2, the traveling machine 201 returns the returned product case in the middle of the traveling route indicated by the arrow, collects the collected product case in the empty loading space, and then continues to return the returned product case while not exceeding the maximum loading number, and can collect the collected product case. In such a case, the traveling machine 201 can efficiently perform the picking operation.
[0014] However, in the traveling route, when the product shelf of the collected product case is in front of the product shelf of the returned product case, it is required to detour the passage after finishing the return operation and collect the product again at the previous product shelf, resulting in extra travel.
[0015] Here, the details of the arrangement of the product shelves 202 in the warehouse will be described. FIG. 3 is a perspective view of the inside of the warehouse. As illustrated in FIG. 3, product shelves 202 in a plurality of rows (1, 2, 3,...) are arranged in a plurality of columns (1, 2, 3,...). That is, the position of each product shelf is defined by a matrix number = (row number, column number) having a column number and a row number. A plurality of product cases are stored in each product shelf 202. However, the number of the product cases stored in each product shelf 202 (hereinafter referred to as the product number) is specified. For example, product cases with product numbers = 1 to 6 are stored in the product shelf 202 with the matrix number (1, 1), and product cases with product numbers = 7 to 12 are stored in the product shelf 202 with the matrix number (2, 1), and the product numbers are specified in this way. The same type of product is stored in the product cases with the same product number. Different types of products are stored in the product cases with different product numbers.
[0016] By providing an interval between columns, the traveling machine 201 can travel. The path with an interval provided between columns is hereinafter referred to as a working path. If there is no interval provided between columns, the traveling machine 201 cannot travel. The traveling machine 201 does not turn back in the middle of the working path. For example, the traveling machine 201 does not travel halfway through the working path between column 1 and column 2 and then turn back. In the example described here, it is assumed that the traveling machine 201 does not travel back and forth on the same working path in one round trip. For example, after the traveling machine 201 finishes traveling on the working path between column 1 and column 2, it does not return to that working path but returns to another working path. However, if the return path is the working path between column 1 and column 2, the same working path can be traveled as the forward path of the next round trip.
[0017] The traveling machine 201 can perform a return operation and a loading operation in the same goods shelf. For example, the traveling machine 201 can return the goods cases with item numbers = 1 to 3 and load the goods cases with item numbers = 4 to 6 while stopped at the goods shelf with row-column number = (1,1). In the example described here, it is assumed that when the traveling machine 201 is performing an operation at the goods shelf with row-column number (1,1), it does not perform an operation at the row-column number (1,2).
[0018] FIG. 4 is a diagram for explaining the layout inside the warehouse used in the following description. As illustrated in FIG. 4, a working path is configured between column 1 and column 2, no working path is configured between column 2 and column 3, and a working path is configured between column 3 and column 4. Described in a general formula, a working path is configured between column (2m - 1) and column (2m), and no working path is configured between column (2m) and column (2m + 1). In each column, the working picking area side (the side where the forward path starts) is defined as the front side, and the side opposite to the working picking area (the side where the return path starts) is defined as the back side. The case where the traveling machine 201 travels from the front side to the back side is defined as the forward path, and the case where it travels from the back side to the front side is defined as the return path.
[0019] In the example of Fig. 5(a), in the driving route, the designated first pickup product case is ahead of the designated first return product case, and thereafter, the pickup operation can be performed without exceeding the maximum loading capacity of the traveling machine 201. However, in the example of Fig. 5(b), in the driving route, since the designated first return product case is ahead of the designated first pickup product case, the first pickup product case cannot be picked up, and it will take two round trips. In the example of Fig. 5(c), in the driving route, since the designated five return product cases are ahead of the designated pickup product case, five pickup product cases can be picked up. However, since the designated last return product case is ahead of the designated last pickup product case, it will also take two round trips.
[0020] Thus, if an efficient pickup operation and return operation cannot be determined, unnecessary round trips will occur. In the following embodiments, an information processing apparatus, a work plan formulation method, and a work plan formulation program that can formulate an efficient pickup / return operation will be described.
Embodiment
[0021] Fig. 6(a) is a block diagram illustrating the overall configuration of the information processing apparatus 100. As illustrated in Fig. 6(a), the information processing apparatus 100 includes a layout storage unit 10, an order storage unit 20, an order creation unit 30, a work set creation unit 40, a work unit creation unit 50, an output unit 60, and the like.
[0022] Fig. 6(b) is a block diagram illustrating the hardware configuration of the information processing apparatus 100. As illustrated in Fig. 6(b), the information processing apparatus 100 includes a CPU 101, a RAM 102, a storage device 103, an input device 104, a display device 105, and the like.
[0023] The CPU (Central Processing Unit) 101 is a central processing unit. The CPU 101 includes one or more cores. The RAM (Random Access Memory) 102 is a volatile memory that temporarily stores programs executed by the CPU 101, data processed by the CPU 101, and the like. The storage device 103 is a non-volatile storage device. As the storage device 103, for example, a solid state drive (SSD) such as a ROM (Read Only Memory), a flash memory, a hard disk driven by a hard disk drive, or the like can be used. The storage device 103 stores a work plan creation program. The input device 104 is an input device such as a keyboard or a mouse. The display device 105 is a display device such as an LCD (Liquid Crystal Display). By the CPU 101 executing the work plan creation program, the layout storage unit 10, the order storage unit 20, the order creation unit 30, the work set creation unit 40, the work unit creation unit 50, and the output unit 60 are realized. Note that, as the layout storage unit 10, the order storage unit 20, the order creation unit 30, the work set creation unit 40, the work unit creation unit 50, and the output unit 60, hardware such as a dedicated circuit may be used.
[0024] The layout storage unit 10 stores the layout of the warehouse shelves. Specifically, as illustrated in FIG. 7, the layout storage unit 10 stores by associating the product number of each product case with the row and column numbers of the product shelf in which the product case is stored.
[0025] The order storage unit 20 stores orders input from the outside. FIG. 8 is a diagram illustrating an order. As illustrated in FIG. 8, in an order, the product number to be picked is associated with the column number of the product shelf on which the product cases of each product number are arranged. Since the product number and the row and column numbers of each product shelf are associated with each other in the layout storage unit 10, only the product number may be specified in the order.
[0026] The work set creation unit 40 creates a work set using the layout stored in the layout storage unit 10 and the order stored in the order storage unit 20. The work unit creation unit 50 creates work units from the work set created by the work set creation unit 40. The output unit 60 outputs the work units created by the work units. Details will be described below.
[0027] First, an algorithm for the work set creation unit 40 to create a work set will be described. In this embodiment, during one round trip where the traveling machine 201 travels along one work path as the forward path and another work path as the return path, a combination of returned product cases and collected product cases (hereinafter referred to as a work set) is determined so that the return work and collection work of the maximum number of transportable product cases can be completed. By determining the work set as in this embodiment, an efficient collection and return operation can be planned. In this embodiment, when the traveling machine 201 performs work on a specific column, it does not perform work on the column facing it on the same work path. For example, when performing return / collection work in column 1 on the forward path, return / collection work is not performed in column 2 on the same forward path.
[0028] FIG. 9(a) and FIG. 9(b) are diagrams illustrating patterns of work sets (return sets and collection sets) that can complete return / collection work during one round trip. Let the maximum number of loads specified for the traveling machine 201 be M (M: integer, M > 0). It is assumed that there are M or more product cases for return / collection work in one column or a total of M or more when two columns are combined. During each round trip, M returned product cases are returned, and M collected product cases are collected at the loading positions of the traveling machine 201 emptied by the return.
[0029] Here, in order to execute return / collection work in one round trip, the return / collection locations need to exist on a product shelf of one column or a product shelf of two columns. Specifically, patterns such as pattern 1 in FIG. 9(a), pattern 2 in FIG. 9(a), pattern 3 in FIG. 9(b), and pattern 4 in FIG. 9(b) are considered.
[0030] In Pattern 1, the locations of M return product cases are in a single row A (or B), and the locations of M collection product cases are dispersed in two rows (A + B). In the outbound journey, the locations of M return product cases are on the front side, and the locations of some collection product cases are on the back side. In Pattern 1, M return product cases are returned only on the outbound journey. M collection product cases are collected over the outbound and return journeys. The collection product cases on the outbound journey are collected behind the M return product cases.
[0031] In Pattern 2, the locations of M return product cases are dispersed in two rows (A + B), and the locations of M collection product cases are in a single row B (or A). The locations of some return product cases are on the outbound journey, and the locations of the remaining return product cases are on the return journey. In the return journey, the locations of M collection product cases are in front of the locations of the remaining return product cases. In Pattern 2, M return product cases are collected over the outbound and return journeys, and M collection product cases are collected only on the return journey. The collection product cases on the return journey are collected in front of the remaining return product cases.
[0032] In Pattern 3, the locations of M return product cases are in a single row A, and the locations of M collection product cases are in a single row B. In Pattern 3, M return product cases are returned only on the outbound journey, and M collection product cases are collected only on the return journey.
[0033] In Pattern 4, the locations of M return product cases are in a single row A, and the locations of M collection product cases are also in the single row A. In the outbound journey, the locations of M collection product cases are behind the locations of M return product cases.
[0034] The work set creation unit 40 combines the orders of all picking operations according to patterns 1 to 4 based on the column numbers of the product shelves where each product case is stored. An example of the combined work set is illustrated in FIG. 10. Each work set includes a return set and a consolidation set. For example, work set #2 includes return set #2 and consolidation set #2. The numbers in the table indicate the column numbers of the product shelves where the product cases to be returned / consolidated in each work set are arranged. In the first work set #1, since the transporter 201 has not yet loaded the return product case, only the consolidation work is performed. Therefore, no column number is described in return set #1.
[0035] Work set #2 corresponds to pattern 1. Work set #3 corresponds to pattern 2. In return set #2 of work set #2, since the return work is performed only in column 1, single column A is described on the right side. In consolidation set #2 of work set #2, since the consolidation work is performed in columns 1 and 3, 2 columns (A + B) are described on the right side. In return set #3 of work set #3, since the return work is performed in columns 1 and 3, 2 columns (A + B) are described. In consolidation set #3 of work set #3, since the consolidation work is performed in column 3 different from return set #2, single column B different from single column A is described. Work set #4 corresponds to pattern 3. In return set #4 of work set #4, since the return work is performed in the same column 3 as consolidation set #3, single column B is described. In consolidation set #4 of work set #4, since the consolidation work is performed in column 1 different from return set #4, single column A different from single column B is described.
[0036] Since the product cases consolidated in the previous work set become the same as the product cases to be returned in the next work set, the consolidation set of the previous work set and the return set of the next work set are the same. For example, consolidation set #2 of work set #2 and return set #3 of work set #3 are the same. Therefore, only the consolidation sets among the work sets in FIG. 10 are extracted and illustrated in the upper part of FIG. 11.
[0037] To perform each of all work sets in one round trip, it is desirable to consider not only the arrangement of product cases in one work set but also the arrangement of product cases in consecutive preceding and succeeding work sets.
[0038] For example, when the collection product cases of a certain work set are arranged only on the outbound trip or only on the return trip, the same product cases can be returned only on the outbound trip in the next work set. Therefore, a work set in which the collection set is in a single row can be regarded as one work unit 1.
[0039] Next, when the collection product cases of a certain work set are arranged on both the outbound trip and the return trip, it is necessary to return the same product cases on both the outbound trip and the return trip in the next work set. As in Pattern 2, the next collection product cases need to be arranged on the return trip. Therefore, for example, if collection is done in a single row A in one work set, collection is done in two rows (A + B) in the next work set, and collection is done in a single row B in the next work set after that, each work set can be performed in one round trip. Thus, a combination of performing in order a work set with a collection set in a single row A, a work set with a collection set in two rows (A + B), and a work set with a collection set in a single row B (or A) can be regarded as one work unit 2.
[0040] After the work set creation unit 40 creates four patterns of work sets in this way, the work unit creation unit 50 groups the work sets into the following two patterns (hereinafter referred to as work units). By fixing the order of the work sets in this way by unitizing, it becomes possible to perform all the work in one round trip. Work unit 1: Single row A Work unit 2: Single row A + Two rows (A + B) + Single row B (or A)
[0041] Regarding work unit 2, as long as it follows this rule, there may be no upper limit. For example, the number of work sets in work unit 2 may exceed three, such as single row A + two rows (A + B) + single row B + two rows (B + C) + single row B.
[0042] The lower part of FIG. 11 is a diagram illustrating the case where the upper work sets are grouped into the above two types of work units. In the example of FIG. 11, since the loading set #1 is single row A, the loading set #2 is two rows (A + B), and the loading set #3 is single row B, work sets #1 to #3 correspond to work unit 2. Since the loading set #4 is single row A, work set #4 corresponds to work unit 1.
[0043] Since the loading set #5 is single row A, the loading set #6 is two rows (A + B), the loading set #7 is single row B, the loading set #8 is two rows (B + C), and the loading set #9 is single row B, work sets #5 to #9 correspond to work unit 2. Note that in order to indicate that the two rows of the loading set #6 are different from the two rows of the loading set #8, the two rows of the loading set #8 are denoted as (B + C).
[0044] In the example of FIG. 11, the order of each work set can be represented by work unit 1 and work unit 2. Therefore, it is possible to perform all operations in one round trip.
[0045] The created work units can perform all operations in one round trip regardless of the order of the work units, as long as the order of the work sets within the unit is not changed (it is possible to reverse the order). That is, by parameterizing the work units and optimizing the order and allocation to each work body in work unit units, it becomes possible to formulate a more efficient work plan.
[0046] FIGS. 12 to 14 are flowcharts showing an example of the operation of the information processing apparatus 100. Hereinafter, the operation of the information processing apparatus 100 will be described with reference to FIGS. 12 to 14.
[0047] The order creation unit 30 reads the orders stored in the order storage unit 20 (step S1). Next, the order creation unit 30 reads the matrix numbers for each product number included in the order from the layout storage unit 10 (step S2). Next, the order creation unit 30 sorts the orders in ascending order of column numbers (step S3). FIG. 15 shows the order of FIG. 8 sorted in ascending order of column numbers.
[0048] Next, the order creation unit 30 divides the orders obtained in step S3 into even and odd columns (step S4). Next, the work set creation unit 40 creates a work set (step S5). The details of step S5 will be described with reference to FIGS. 13 and 14. Next, the work unit creation unit 50 creates work units using the work set obtained in step S5 (step S6). Next, the output unit 60 outputs the work units created in step S6 (step S7). For example, the output work units are displayed on the display device 105. Alternatively, the output work units are input to the traveling machine 201. The traveling machine 201 executes a picking operation according to the input work units.
[0049] Hereinafter, FIGS. 13 and 14 will be described. The work set creation unit 40 reads the orders of the odd columns from the orders created by the order creation unit 30 and sets n = 1 (step S11). Next, the order creation unit 30 determines whether there are any products (product numbers) that have not been allocated to the work set (step S12). When step S12 is first executed, since no product has been allocated to the work set yet, the determination in step S12 is "Yes".
[0050] If the determination in step S12 is "Yes", the work set creation unit 40 calculates the number of unallocated products Pn(t) in column n (step S13). The number of products corresponds to the number of product numbers. Next, the work set creation unit 40 determines whether the number of products Pn(t) is equal to or greater than the specified maximum loading number M (step S14).
[0051] When it is determined "Yes" in step S14, the work set creation unit 40 creates a consolidation set A of single column A having M products from the products that have not yet been allocated to the work set in column n (step S15).
[0052] Next, the work set creation unit 40 determines whether Pn(t)! is N times the natural number M (step S16). In step S16, it is determined whether the remaining number of products in column n is a multiple of the maximum loading number M. In the case of a multiple, a set composed only of column n is repeatedly created with D. When it is determined "No" in step S16, the work set creation unit 40 creates a consolidation set A of single column A having M products from the products that have not yet been allocated for column n (step S17).
[0053] Next, the work set creation unit 40 calculates the number of unallocated products Pn(t) (step S18). Next, the work set creation unit 40 determines whether Pn(t) calculated in step S18 is zero (step S19). When it is determined "No" in step S19, it is executed again from step S17. When it is determined "Yes" in step S19, the work set creation unit 40 adds 2 to n (step S20). Then, it is executed again from step S12.
[0054] When it is determined "Yes" in step S16, the work set creation unit 40 determines whether the number of products Pn(t) is 2M or more (step S21). When it is determined "Yes" in step S21, the work set creation unit 40 selects a column k different from column n (step S22). Next, the work set creation unit 40 creates a consolidation set of two columns (A + B) from column n and column k (step S23).
[0055] Next, the work set creation unit 40 creates a consolidation set A of single column A from column n (step S24). Next, the work set creation unit 40 determines whether there are any unallocated products in columns 1 to n (step S25). When it is determined "No" in step S25, step S20 is executed.
[0056] If it is determined as "Yes" in step S25, the work set creation unit 40 identifies the youngest column L of the products (product numbers) that have not been allocated yet (step S26). Next, the work set creation unit 40 determines whether n = L (step S27). If it is determined as "Yes" in step S27, step S17 is executed.
[0057] If it is determined as "No" in step S14, the work set creation unit 40 selects a column k different from column n (step S28). Next, the work set creation unit 40 creates a consolidation set B of a single column B from column k (step S29). Next, the work set creation unit 40 creates a consolidation set (A + B) of two columns (A + B) from column n and column k (step S30).
[0058] Next, the work set creation unit 40 creates a consolidation set B of a single column B from column k (step S31). Next, the work set creation unit 40 identifies the youngest column L of the products (product numbers) that have not been allocated yet (step S32). Next, the work set creation unit 40 determines whether k = L (step S33). If it is determined as "No" in step S33, step S34 is executed. If it is determined as "No" in step S27, step S34 is also executed.
[0059] If it is determined as "Yes" in step S33, the work set creation unit 40 sets n = k (step S35). Next, the work set creation unit 40 calculates the number of unallocated products Pn(t) for column n (step S36). Next, the work set creation unit 40 determines whether the number of products Pn(t) is equal to or greater than M (step S37). If it is determined as "No" in step S37, S28 is executed. If it is determined as "Yes" in step S37, step S16 is executed.
[0060] If it is determined "No" in step S12, the work set creation unit 40 determines whether the even-numbered columns have been processed (whether item numbers have been assigned) (step S39). If it is determined "No" in step S39, the work set creation unit 40 reads the orders for the even-numbered columns from the orders created by the order creation unit 30, and sets n = 2 (step S40). Then, it is executed again from step S12. If it is determined "Yes" in step S39, the work set creation unit 40 outputs the creation result of each consolidation set as the creation result of the work set (S41). Then, the execution of the flowchart ends.
[0061] Here, the fractional items in each column will be described. FIGS. 16(a) to 16(c) are diagrams for explaining the fractional items in each column. Since the number of item numbers in the same column is not necessarily divisible by M, there are fractions that cannot be incorporated into the same return set or consolidation set. In this case, in addition to the extra travel required to return and consolidate this fraction, it will also generate fractions in other columns. On the other hand, by executing steps S22, S23, S28, and S30 in FIG. 13, all work sets can be completed in a single round trip.
[0062] (Simulation results) Using the actual data, the number of round trips required for the picking operation of all 1103 orders was calculated by simulation. As an example, the flowcharts in FIGS. 12 to 14 were used. FIG. 17 is a diagram showing the layout inside the warehouse used in the simulation. A work path is configured between column (2m - 1) and column (2m), and no work path is configured between column (2m) and column (2m + 1). In FIG. 17, columns 1 to 32 and columns 33 to 64 are drawn in two stages, so column 32 and column 33 are separated. Also, it is arranged up to column 64. It is assumed that each commodity shelf specified by each row and column number houses 20 commodity cases corresponding to 20 item numbers.
[0063] Figure 18 is a diagram showing a part of the work set planned for work. Here, the numbers in the table are the column numbers of the product shelves where each product is stored. Also, this part of the work set is the work set for the part surrounded by the broken line in Figure 17. For the order of 1103, the calculated number of round trips was 188 times. Figure 18 is a diagram showing a part of the created work set.
[0064] In contrast, for the order of 1103, a simulation was conducted in which the orders were sorted in ascending order of the numbers of the product shelves where the products were stored, and the picking and return operations were performed in order. In this case, for all orders of 1103, the calculated number of round trips was 243 times.
[0065] From these results, it can be seen that with the method according to this embodiment, the number of round trips can be reduced by 23%. Also, when calculating the minimum number of round trips required for this work, since it is 184 times (=1103 / 6≈183), it can be understood that a work plan has been established to complete the work with almost no loss of the number of round trips.
[0066] Figure 19 is a diagram showing the result of rearranging and leveling the created work set for each work unit. Figure 19 is a diagram showing a part of the created work unit. Here, assuming that the time required for one round trip of work is 10 minutes / round trip on average, the work time required before leveling is 260 minutes (10 minutes×26) because the required number of round trips is 26 round trips. In contrast, the work time required after leveling is 230 minutes (10 minutes×23) because the required number of round trips is 23 round trips. From the above, it can be seen that the work time can be reduced by 30 minutes by leveling.
[0067] In addition, after sorting and leveling by work unit, the travel distance of the traveling machine 201 may be further shortened. For example, in the work order in the upper left of FIG. 20, when returning the return product case of work set #4 and when collecting the consolidated goods case of work set #5, the work routes are separated by one work route, so the moving distance becomes long. Therefore, in the work order in the upper right of FIG. 20, the work units are rearranged to shorten the movement between work routes while keeping the number of round trips unchanged. In this way, it is preferable to shorten the distance between work routes for the outbound and inbound trips. Note that there may be conditional orders such as priority orders at the site. Even in such a case, it is possible to formulate a plan without significantly increasing the work distance by swapping each work unit including the corresponding order.
[0068] In addition, in each of the patterns 1 to 4 described with reference to FIGS. 9(a) and 9(b), a pattern in which all return product cases are returned and then the consolidated goods cases are collected has been described, but it is not necessarily limited to this. For example, as illustrated in FIG. 21, in patterns 1, 2, and 4, the return product cases and the consolidated goods cases may be mixed. However, in the travel route, it is a condition that the first return product case is ahead of the first consolidated goods case.
[0069] According to this embodiment, since a combination of product cases is created for performing the return work for the maximum number of loaded product cases and the collection work for the maximum number of loaded product cases in each round trip so that the product cases designated for collection are collected, it is not necessary to make unnecessary round trips. Therefore, according to this embodiment, an efficient collection / return work can be formulated.
[0070] Further, according to this embodiment, each round trip is classified into patterns 1 to 4, the work unit 1 and the work unit 2 are created according to the patterns 1 to 4, and the order of the work unit 1 and the work unit 2 is created. By creating the order in this way, the arrangement of the product cases of the continuous front and rear work sets is considered, and all the work can be performed in one round trip.
[0071] Further, according to this embodiment, the order of each round trip is switched so that the work route of the forward journey and the work route of the return journey are shortened in any one of the round trips. In this case, the travel distance of the traveling machine 101 is shortened, and the efficiency of work picking is increased.
[0072] In the above example, the product case is an example of an article. The product shelf is an example of an article shelf. The product number of each product case is an example of an identifier for specifying the article shelf in which the article is stored. The work set creation unit 40 and the work unit creation unit 50 are examples of a specifying unit that specifies the plurality of first articles and the plurality of second articles so that the first work and the second work can be performed by one forward movement and one return movement.
[0073] As described above, the embodiments of the present invention have been described in detail, but the present invention is not limited to such specific embodiments, and various modifications and changes are possible within the scope of the gist of the present invention described in the claims. (Supplementary Note) (Supplementary Note 1) Regarding a plurality of articles, a plurality of rows including a plurality of article shelves, and a plurality of work routes provided between each of the plurality of rows, an identifier indicating the correspondence between each of the plurality of articles and each of the plurality of article shelves is defined, and a moving body having a placement space for placing the articles moves along any one of the plurality of work routes as a forward journey and moves along any one of the plurality of work routes as a return journey, and a first operation of placing a plurality of first articles placed on the moving body on the article shelf specified by the identifier defined for the article, and a second operation of placing a plurality of second articles specified by the identifier on the moving body from the article shelf. Cause a computer to execute a process of identifying the plurality of first articles and the plurality of second articles so that the first operation can be performed in one forward movement and one return movement and the second operation can be performed, and a work plan creation program characterized by this. (Appendix 2) In the process of identifying the plurality of first articles and the plurality of second articles, each round trip is classified into a first pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in two columns, a second pattern in which the first operation is performed in two columns of the plurality of columns and the second operation is performed in a single column, a third pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in a single column, and a fourth pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in the single column. Create a first work unit that performs the second operation in a single column and a second work unit that performs the second operation according to the law of (single column + two columns + single column), and create the order of the first work unit and the second work unit. The work plan creation program according to Appendix 1, characterized by this. (Appendix 3) Cause the computer to execute a process of swapping the order of the first work unit and the second work unit so as to shorten the moving distance of the moving body in any one of the round trips, and the work plan creation program according to Appendix 1 or Appendix 2, characterized by this. (Appendix 4) Under the above conditions, a plurality of articles are stored in each article shelf, and both the first operation and the second operation can be performed in the same article shelf. The work plan creation program according to any one of Appendices 1 to 3, characterized by this. (Appendix 5) Under the above conditions, the article is a product case in which a plurality of products of the same type are stored. The work plan creation program according to any one of Appendices 1 to 4, characterized by this. (Appendix 6) Regarding a plurality of articles, a plurality of columns including a plurality of article shelves, and a plurality of work paths provided between each of the plurality of columns, an identifier indicating a correspondence relationship between each of the plurality of articles and each of the plurality of article shelves is defined. A moving body having a placement space for placing the articles moves along any one of the plurality of work paths as an outbound path and moves along any one of the plurality of work paths as a return path. A first operation of placing a plurality of first articles placed on the moving body on an article shelf specified by the identifier defined for the article, and a second operation of placing a plurality of second articles specified by the identifier on the moving body from the article shelf are performed, under the condition of A work plan formulation method, characterized in that a computer executes a process of specifying the plurality of first articles and the plurality of second articles so that the first operation and the second operation can be performed with one outbound movement and one return movement. (Appendix 7) In the process of specifying the plurality of first articles and the plurality of second articles, each round trip is classified into a first pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in two columns, a second pattern in which the first operation is performed in two columns of the plurality of columns and the second operation is performed in a single column, a third pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in a single column, and a fourth pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in the single column. A first work unit that performs the second operation in a single column and a second work unit that performs the second operation according to the law of (single column + two columns + single column) are created, and the work plan formulation method according to Appendix 6, characterized in that the order of the first work unit and the second work unit is created. (Appendix 8) On the computer, The work plan formulation method according to Appendix 6 or Appendix 7, characterized in that a process of swapping the order of the first work unit and the second work unit is executed so as to shorten the moving distance of the moving body in any one of the round trips. (Appendix 9) In the above conditions, a plurality of articles are stored in each article shelf, and both the first operation and the second operation can be performed in the same article shelf. The work plan formulation method according to any one of Appendices 6 to 8, characterized in that. (Appendix 10) In the above conditions, the article is a product case in which a plurality of products of the same type are stored. The work plan formulation method according to any one of Appendices 6 to 9, characterized in that. (Appendix 11) Regarding a plurality of articles, a plurality of columns including a plurality of article shelves, and a plurality of work paths provided between each of the plurality of columns, an identifier indicating the correspondence between each of the plurality of articles and each of the plurality of article shelves is defined. A moving body having a placement space for placing the articles moves along any one of the plurality of work paths as an outward path and moves along any one of the plurality of work paths as a return path. A first operation of placing a plurality of first articles placed on the moving body on the article shelf specified by the identifier specified for the article, and a second operation of placing a plurality of second articles specified by the identifier on the moving body from the article shelf. In the condition of performing, a specifying unit for specifying the plurality of first articles and the plurality of second articles so that the first operation and the second operation can be performed by one outward movement and one return movement is provided. An information processing apparatus characterized by that. (Appendix 12) In the process of specifying the plurality of first articles and the plurality of second articles, the specifying unit classifies each round trip into a first pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in two columns, and a second pattern in which the first operation is performed in two columns of the plurality of columns and the second operation is performed in a single column, and a third pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in a single column, and a fourth pattern in which the first operation is performed in a single column of the plurality of columns and the second operation is performed in the single column. A first work unit that performs the second operation in a single column and a second work unit that performs the second operation according to the law of (single column + two columns + single column) are created, and the information processing apparatus according to Appendix 11, characterized in that the order of arrangement of the first work unit and the second work unit is created. (Supplementary Note 13) The information processing apparatus according to Supplementary Note 11 or Supplementary Note 12, wherein the specific unit switches the order of the first work unit and the second work unit so as to shorten the moving distance of the moving body in any one of the reciprocations. (Supplementary Note 14) The information processing apparatus according to any one of Supplementary Notes 11 to 13, wherein a plurality of articles are stored in each article shelf, and both the first work and the second work can be performed in the same article shelf under the conditions. (Supplementary Note 15) The information processing apparatus according to any one of Supplementary Notes 11 to 14, wherein the article is a product case in which a plurality of products of the same type are stored under the conditions.
Explanation of Signs
[0074] 10 Layout storage unit 20 Order storage unit 30 Order creation unit 40 Work set creation unit 50 Work unit creation unit 60 Output unit 100 Information processing apparatus 101 CPU 102 RAM 103 Storage device 104 Input device 105 Display device 201 Traveling machine 202 Product shelf 203 Picking work area
Claims
1. Regarding a plurality of articles, a plurality of rows including a plurality of article shelves, and a plurality of work paths provided between each of the plurality of rows, an identifier indicating the correspondence between each of the plurality of articles and each of the plurality of article shelves is defined, and a moving body having a placement space for placing the articles moves along any one of the plurality of work paths as an outbound path and moves along any one of the plurality of work paths as a return path, and performs a first operation of placing a plurality of first articles placed on the moving body on an article shelf specified by the identifier defined for the article, and a second operation of placing a plurality of second articles specified by the identifier on the moving body from the article shelf. Under the condition of performing, On a computer, A work plan creation program characterized by causing the computer to execute a process of identifying the plurality of first articles and the plurality of second articles so that the first operation and the second operation can be performed by one outbound movement and one return movement.
2. In the process of identifying the plurality of first articles and the plurality of second articles, each round trip is classified into a first pattern in which the first operation is performed in a single row of the plurality of rows and the second operation is performed in two rows, a second pattern in which the first operation is performed in two rows of the plurality of rows and the second operation is performed in a single row, a third pattern in which the first operation is performed in a single row of the plurality of rows and the second operation is performed in a single row, and a fourth pattern in which the first operation is performed in a single row of the plurality of rows and the second operation is performed in the single row. A first work unit that performs the second operation in a single row and a second work unit that performs the second operation according to the law of (single row + two rows + single row) are created, and the work plan creation program according to claim 1, characterized in that the order of the first work unit and the second work unit is created.
3. On the computer, The work plan creation program according to claim 2, characterized in that the computer is caused to execute a process of swapping the order of the first work unit and the second work unit so as to shorten the moving distance of the moving body in any one of the round trips.
4. Under the above conditions, a plurality of articles are stored in each article shelf, and the work plan creation program according to any one of claims 1 to 3, characterized in that both the first operation and the second operation can be performed in the same article shelf.
5. The work plan formulation program according to any one of claims 1 to 4, wherein, under the above conditions, the article is a product case in which a plurality of products of the same type are accommodated.
6. Regarding a plurality of articles, a plurality of rows including a plurality of article shelves, and a plurality of work paths provided between each of the plurality of rows, an identifier indicating the correspondence between each of the plurality of articles and each of the plurality of article shelves is defined. A moving body having a placement space for placing the article moves along any one of the plurality of work paths as an outbound path and moves along any one of the plurality of work paths as a return path. A first operation of placing a plurality of first articles placed on the moving body on an article shelf specified by the identifier defined for the article, and a second operation of placing a plurality of second articles specified by the identifier from the article shelf onto the moving body. Under the condition of performing the above, A work plan formulation method, characterized in that a computer executes a process of specifying the plurality of first articles and the plurality of second articles so that the first operation and the second operation can be performed by one outbound movement and one return movement.
7. Regarding a plurality of articles, a plurality of rows including a plurality of article shelves, and a plurality of work paths provided between each of the plurality of rows, an identifier indicating the correspondence between each of the plurality of articles and each of the plurality of article shelves is defined. A moving body having a placement space for placing the article moves along any one of the plurality of work paths as an outbound path and moves along any one of the plurality of work paths as a return path. A first operation of placing a plurality of first articles placed on the moving body on an article shelf specified by the identifier defined for the article, and a second operation of placing a plurality of second articles specified by the identifier from the article shelf onto the moving body. Under the condition of performing the above, an information processing apparatus comprising a specifying unit that specifies the plurality of first articles and the plurality of second articles so that the first operation and the second operation can be performed by one outbound movement and one return movement.
Citation Information
Patent Citations
Article picking up method
JP1994271019A
Automatic guided vehicle controller, automatic carrying system and carrying schedule allocation method
JP1999282534A
Picking apparatus
JP2015040118A
Collection control device and collection control program
JP2019016088A
Information processing device, and information processing program
JP2020106914A