Box selecting device and box selecting method

Abstract

To provide a box selecting device and a box selecting method for always setting the optimum kind of feces in a short time.SOLUTION: A delivery box selection device includes a box size information storage unit that stores size information of a box in which packages are packed, a package size information storage unit that stores size information of packages, a first calculation unit that calculates an approximate solution of a three dimensional packing problem using a first algorithm, a second calculation unit that calculates an approximate solution of the three dimensional packing problem using a second algorithm different from the first algorithm, and a selection unit that selects the first calculation unit in a case where the number of packages to be packed is equal to or less than a predetermined value. And a selection means for selecting the second calculation means when the number of cargoes to be boxed exceeds the predetermined value, and when a result that the cargoes to be boxed do not fit in the selected box is obtained by calculation of the first calculation means or the second calculation means selected by the selection means, a box of another size is selected, and recalculation is performed using the first algorithm or the second algorithm.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to a box selection device and a box selection method for selecting boxes into which to pack cargo such as products to be packaged and shipped. [Background technology]

[0002] For example, when shipping a package containing merchandise sold on an e-commerce (EC) site, it is necessary to select the delivery company's delivery type and the appropriate size delivery box (hereinafter, both of these selections will be referred to as delivery type setting).

[0003] Conventional shipping type selection involves selecting the smallest possible shipping box based on "specific gravity (one-dimensional)," a size guideline set for each package. In this case, "specific gravity" is set based on whether the package can fit into a certain shipping box, and when shipping multiple types of packages, the shipping box is selected by simply adding up the specific gravity of each package. This makes it difficult to select the appropriate shipping box with conventional shipping type selection. If the shipping box is too large or too small for the packages to be packed and the appropriate shipping type cannot be selected, the shipping volume increases, driving up shipping costs and causing problems such as temporary suspension of packing operations.

[0004] In the conventional method of setting the mail type, which involves setting the weight on a system, accuracy has a significant impact on delivery costs. To increase accuracy, the weight must be set by an experienced worker, and if the weight is set by someone other than an experienced worker, the mail type will be set with low accuracy, further increasing delivery costs.

[0005] Patent Document 1 discloses a delivery method that identifies the optimal locker from multiple lockers in a specified delivery locker based on the size and quantity of each of multiple packages and locker information. The technology described in Patent Document 1 matches multiple packages with lockers and identifies the optimal locker for storing multiple packages using an algorithm that provides a solution to a three-dimensional packing problem. [Prior art documents] [Patent documents]

[0006] [Patent Document 1] Japanese Patent Publication No. 2023-008775 Summary of the Invention [Problem to be solved by the invention]

[0007] However, when applying the technology described in Patent Document 1 to find the optimal delivery box for storing multiple packages, box calculation can take a significant amount of time, making it difficult to always quickly select the optimal delivery box.

[0008] SUMMARY OF THE INVENTION It is therefore an object of the present invention to provide a box selection device and a box selection method that can always set the optimum mail type in a short time. [Means for solving the problem]

[0009] According to the present invention, the box selection device includes a box size information storage unit that stores size information of boxes into which packages are to be packed, a package size information storage unit that stores package size information, a first calculation means that acquires size information of the selected box from the box size information storage unit and acquires size information of the packages to be packed from the package size information storage unit, and calculates an approximate solution of the three-dimensional packing problem using a first algorithm, a second calculation means that acquires size information of the selected box from the box size information storage unit and acquires size information of the packages to be packed from the package size information storage unit, and calculates an approximate solution of the three-dimensional packing problem using a second algorithm different from the first algorithm, and a selection means that selects the first calculation means if the number of packages to be packed is equal to or less than a predetermined value, and selects the second calculation means if the number of packages to be packed exceeds this predetermined value, and is configured to select a box of another size and perform recalculation using the first algorithm or the second algorithm if the calculation by the first calculation means or the second calculation means selected by the selection means shows that the packages to be packed will not fit into the selected box.

[0010] The system obtains size information (height, width, depth) of the packages (rectangular prisms, products) to be packed, as well as size information (height, width, depth) of the boxes (containers, shipping boxes) into which they will be packed. If the number of packages is less than a predetermined value, an approximate solution to the three-dimensional packing problem is calculated using a first algorithm. If the number of packages exceeds the predetermined value, an approximate solution to the three-dimensional packing problem is calculated using a second algorithm. These first and second algorithms are algorithms for finding an approximate solution to the problem of placing the packages, which are the target objects, within a given area, which is a box, so that they do not overlap each other. If the result shows that the packages to be packed will not fit into the calculated box, a box of a different size, larger than this, is selected, and the calculation is rerun using the first or second algorithm. Since the algorithm used to find an approximate solution to the three-dimensional packing problem is changed depending on the number of packages to be packed, the optimal box can always be selected in a short time.

[0011] It is preferable that the calculation be performed by the first calculation means or the second calculation means by selecting boxes in order from smallest to largest size as the boxes. By selecting boxes in order from smallest to largest size and performing the calculation, if the result shows that the cargo to be packed can fit into the selected box, the smallest box will be selected.

[0012] It is also preferable that the first calculation means is a calculation means using the DBL method as the first algorithm, and the second calculation means is a calculation means using the three-dimensional BF (3BF) method as the second algorithm. The DBL (Deepest-Bottom-Left) method is a method of preparing many permutations of parcels and packing them in a simple manner, first determining the order in which rectangles are packed, and then repeatedly packing them as far down as possible, and as far to the left as possible if they are the same height. The three-dimensional BF (3D Best-Fit) method is a method of preparing one permutation of parcels and packing them one by one, repeatedly selecting a rectangular parallelepiped that can be placed in the highest priority position for an unplaced rectangular parallelepiped. By appropriately selecting and using such methods, it is possible to perform optimal flight type setting that makes use of the characteristics of each method.

[0013] In this case, it is more preferable that the predetermined value is 4. The DBL method can solve the packing problem with high accuracy, but the box calculation takes a long time, and the calculation time increases rapidly, especially when the number of packages exceeds 4. On the other hand, the 3BF method solves the packing problem with lower accuracy than the DBL method, but the box calculation time is short and does not increase rapidly even when the number of packages approaches 10. Therefore, when the number of packages to be packed is 4 or less, the box calculation is performed using the first calculation means of the DBL method (first algorithm), and when the number of packages to be packed is more than 4, the box calculation is performed using the second calculation means of the 3BF method (second algorithm). This makes it possible to perform the box calculation with high accuracy and in a short time.

[0014] It is also preferable to terminate box selection when the number of packages to be packed exceeds 20. When the number of packages exceeds 20, box selection is not performed because the probability of boxes being the maximum size is very high while the calculation time is long.

[0015] It is also preferable to further include an image display means for creating and displaying an image of the package packed according to the approximate solution when the calculation by the first calculation means or the second calculation means shows that the package to be packed will fit into the selected box. Since an image of how the package will be packed into the box is displayed, this is very convenient when actually packing the package.

[0016] According to the present invention, furthermore, the box selection method stores size information of the box into which the cargo will be packed and size information of the cargo, obtains size information of the selected box from the stored size information, and also obtains size information of the cargo to be packed from the stored size information, and if the number of cargo to be packed is equal to or less than a predetermined value, calculates an approximate solution to the three-dimensional packing problem using a first algorithm, and if the number of cargo to be packed exceeds the predetermined value, calculates an approximate solution to the three-dimensional packing problem using a second algorithm different from the first algorithm, and if this calculation shows that the cargo to be packed will not fit into the selected box, selects a box of another size and performs recalculation.

[0017] The system obtains size information (width, depth, height) of the packages (rectangular prism) to be packed, as well as size information (width, depth, height) of the selected box (rectangular prism). If the number of packages is less than a predetermined value, an approximate solution to the three-dimensional packing problem is calculated using a first algorithm. If the number of packages exceeds the predetermined value, an approximate solution to the three-dimensional packing problem is calculated using a second algorithm. These first and second algorithms are algorithms for finding an approximate solution to the problem of placing the packages, which are the target objects, within a given area, the box, so that they do not overlap each other. If the result shows that the packages to be packed will not fit into the selected box, a box of a different size is selected, and recalculation is performed using the first or second algorithm. Since the algorithm used to find an approximate solution to the three-dimensional packing problem is changed depending on the number of packages to be packed, the optimal box can always be selected in a short time.

[0018] It is preferable to perform calculations by selecting boxes in order from smallest to largest size. By selecting boxes in order from smallest to largest size and performing calculations, if the result shows that the cargo to be packed can fit into the selected box, the smallest box will be selected.

[0019] It is also preferable that the first algorithm is a calculation algorithm using the DBL method, and the second algorithm is a calculation algorithm using the three-dimensional BF (3BF) method. The DBL method is a method of preparing many permutations of parcels and packing them in a simple manner, first determining the order in which the rectangles will be packed, and then repeatedly packing them as low as possible, and as far to the left as possible if they are the same height. The three-dimensional BF method is a method of preparing one permutation of parcels and packing them one by one, repeatedly selecting the rectangular parallelepiped that can be placed in the highest priority position for an unplaced rectangular parallelepiped. By appropriately selecting and using such methods, it is possible to determine the optimal flight type by taking advantage of the characteristics of each.

[0020] In this case, it is more preferable that the predetermined value is 4. The DBL method can solve the packing problem with high accuracy, but the box calculation takes a long time, and the calculation time increases rapidly, especially when the number of packages exceeds 4. On the other hand, the 3BF method solves the packing problem with lower accuracy than the DBL method, but the box calculation time is short and does not increase rapidly even when the number of packages approaches 10. Therefore, when the number of packages to be packed is 4 or less, the box calculation is performed using the DBL method (first algorithm), and when the number of packages to be packed is more than 4, the box calculation is performed using the 3BF method (second algorithm). This makes it possible to perform the box calculation with high accuracy and in a short time.

[0021] It is also preferable to terminate box selection when the number of packages to be packed exceeds 20. When the number of packages exceeds 20, box selection is not performed because the probability of boxes being the maximum size is very high while the calculation time is long.

[0022] If the calculation shows that the package to be packed will fit into the selected box, it is also preferable to create and display an image of the package packed according to this approximate solution. Since the image shows how the package will fit into the box, it is very convenient when actually packing the package. [Effects of the Invention]

[0023] According to the present invention, an approximate solution to the three-dimensional packing problem is obtained by changing the algorithm used depending on the number of packages to be packed, so that the optimum box can always be selected in a short time. [Brief explanation of the drawings]

[0024] [Figure 1] 1 is a block diagram showing an outline of the overall configuration of a delivery box selection device as one embodiment of the box selection device of the present invention. [Figure 2] 2 is a flowchart showing an example of an operation process performed by the delivery box selection device of FIG. 1. [Figure 3] 10 is a graph showing the relationship between the number of products and calculation time when box calculation is performed using the DBL method and the three-dimensional BF method in the delivery box selection device of FIG. 1. [Figure 4] 2 is a diagram showing an example of an image of how products are packed into delivery boxes in the delivery box selection device of FIG. 1. FIG. [Figure 5] 1. FIG. 4 is a diagram illustrating another example of an image showing how products are packed into delivery boxes in the delivery box selection device of FIG. DETAILED DESCRIPTION OF THE INVENTION

[0025] Figure 1 shows a schematic diagram of the overall configuration of a delivery box selection device as one embodiment of the package box selection device of the present invention. This embodiment relates to a delivery box selection device that selects the optimal delivery box when packaging and boxing sold products. Therefore, in this embodiment, the "package" corresponds to the "product" to be packaged and shipped, and the "box" corresponds to the "delivery box" set by the delivery company.

[0026] As shown in Figure 1, the delivery box selection device of this embodiment is mainly composed of a box calculation unit 12 that is connected to a core system 10 that manages everything from product ordering to shipping via an API (application programming interface) processing unit 11 and performs box calculations, and an image creation unit 13 that is connected to this box calculation unit 12 and creates images of products packed in the optimal delivery box obtained by the box calculation.

[0027] The delivery box selection device is connected to the box calculation unit 12 and includes an order information database (DB) 14 that stores multiple pieces of order information, a product size database (DB) 15 that pre-stores size information (width, depth, height) for various products, a delivery box size database (DB) 16 that pre-stores size information (width, depth, height) for various delivery boxes, and a calculation result database (DB) 17 that stores the results of box calculations. The box calculation unit 12 is configured to acquire product sizes and delivery box sizes from the product size DB 15 and delivery box size DB 16, perform box calculations using an approximate solution to the three-dimensional packing problem using a first algorithm (DBL method) or a second algorithm (3D BF method), and store the calculation results in the calculation result DB 17. The delivery box selection device further includes a packing method image database (DB) 18 connected to the image creation unit 13, and is configured to store information on packing method images created by the image creation unit 13 in the packing method image DB 18. The delivery box selection device also includes an error transmission unit 19 for transmitting error information, and an error notification destination database (DB) 20 in which information on destinations to notify of errors is stored in advance. When error information is notified from the box calculation unit 12, the error transmission unit 19 reads out the information on the error notification destination stored in the error notification destination DB 20, and notifies the error notification receiving unit 21 of the occurrence of the error, for example by email. The delivery box selection device also includes a product size update unit 22 for updating product size information, and is configured to update the product size information stored in the product size DB 15 as necessary.

[0028] The product size information stored in the product size DB 15 is, for example, size information on the width, length, and height of each product as shown in Table 1. However, the contents of Table 1 only show a portion of the products for reference, and the actual number and size of products are not limited to the contents of Table 1. Furthermore, this size information is updated as appropriate by the product size update unit 22. [Table 1]

[0029] The delivery box size information stored in the delivery box size DB 16 is, for example, size information on the width, length, and height of each delivery box as shown in Table 2. However, the contents of Table 2 only show a portion of the delivery boxes for reference, and the actual number and size of delivery boxes are not limited to the contents of Table 2. [Table 2]

[0030] FIG. 2 shows a flow of an example of operation processing by the delivery box selection device of this embodiment.

[0031] When a customer orders a product on an EC site, for example, and requests the product to be shipped, the core system 10 on the seller side (shipper) registers all the requested order information and requests a shipping box selection device to select the most suitable shipping box for each piece of order information.

[0032] When multiple pieces of order information are sent from the core system 10 to the delivery box selection device via the API processing unit 11, the order information is stored in the order information DB 14 via the box calculation unit 12. When a delivery box selection process is requested to the box calculation unit 12, first, the calculation result DB 17 is initialized (step S1). This initialization is performed by registering the new request contents in the calculation result DB 17. Next, the previous product size information and delivery box size information loaded into the box calculation unit 12 are initialized, and all product size information and delivery box size information stored in the product size DB 15 and delivery box size DB 16 are read and loaded into the box calculation unit 12 (step S2).

[0033] Next, an order loop is started (step S3), and the first order information is read from the order information DB 14. Next, it is determined whether the number of products in this read order information exceeds 20 (step S4). If it is determined that the number of products exceeds 20 (YES), the calculation time is long, but the proportion of boxes that are the maximum size is very high, so box selection processing is not performed for that order information, and the process returns to step S3, and the next order information is read.

[0034] If it is determined in step S4 that the number of items does not exceed 20 (20 or less) (NO), a shipping box loop is started (step S5) and the first shipping box is selected. The first shipping box is the smallest shipping box. In other words, shipping box E in Table 2 is selected.

[0035] Next, it is determined whether the number of products is four or less (corresponding to the predetermined value of the present invention) (Step S6). If it is determined that the number of products is four or less (YES), box calculation for the selected shipping box is performed using the first algorithm, the DBL (Deepest-Bottom-Left) method (Step S7). The DBL method is a simple method of packing a container (shipping box) using a large number of permutations of rectangular parallelepipeds (products). It is a well-known method that first determines the order in which the rectangular parallelepipeds are packed, and then repeatedly packs them as low as possible, and as far left as possible if they are the same height. Representative references include, for example, Kawashima Daiki et al., "An Efficient Bottom-Left Method for 3D Packing," Research Institute for Mathematical Sciences Kokyuroku, Vol. 1626, 2011, pp. 50-61.

[0036] If it is determined that the number of products is not four or less (more than four) (NO), box calculation for the selected delivery box is performed using the second algorithm, the 3D BF method (3D Best-Fit method) (step S8). The 3D BF method is a method in which one permutation of cuboids (products) is prepared and they are packed one by one into a container (delivery box). It is a well-known method in which a cuboid that can be placed in the highest priority position is repeatedly selected for an unplaced cuboid. Representative references include, for example, S.D. Allen et al., "A hybrid placement strategy for the three-dimensional strip packing problem," European Journal of Operational Research 209, (2011), pp. 219-227.

[0037] In this way, the algorithm used for box calculation is changed depending on the number of items to be packed to obtain an approximate solution to the three-dimensional box packing problem. That is, when the number of items to be packed is four or less, box calculation is performed using the DBL method, and when the number of items to be packed is more than four, box calculation is performed using the 3D BF method. This results in a very short time required for box calculation. Figure 3 shows the relationship between the number of items and calculation time when box calculation is performed using the DBL method and the 3D BF method, with the horizontal axis representing the number of items and the vertical axis representing the calculation time (seconds). Note, however, that this figure shows the relationship between the number of items and calculation time for the case where the calculation time is the longest, and in many cases, the calculation time is shorter. As can be seen from the figure, when the DBL method is used, calculation time increases rapidly when the number of items exceeds four, but when the 3D BF method is used, calculation time does not increase rapidly even when the number of items exceeds four. Therefore, by using the DBL method for box calculation when the number of items to be packed is four or less, and using the 3D BF method for box calculation when the number of items to be packed is more than four, delivery box selection can be performed in a very short time. Incidentally, when the inventors of the present application measured the calculation time for box calculation according to this embodiment, the calculation time for one order was 0.4 seconds at the longest and 0.01 seconds on average.

[0038] Next, based on this box calculation, it is determined whether the products to be packed will fit into the selected delivery box (Step S9). If it is determined that they will not fit (NO), the process returns to Step S5, the next delivery box size is selected, and the processes of Steps S6 to S9 are repeated. The next size delivery box is the next largest delivery box. In other words, delivery box D in Table 2 is selected. Thereafter, in Step S5, the next largest delivery box C, the next largest delivery box B, and the largest delivery box A are selected in sequence. In this way, by selecting delivery boxes in sequence from smallest to largest size and performing calculations, if the result shows that the products to be packed will fit into the selected delivery box, the smallest delivery box will be selected.

[0039] In step S9, if it is determined that the product to be packed fits into the selected delivery box (YES), the calculation result of the box calculation is stored in the calculation result DB 17 (step S10), and the delivery box loop ends (step S11). This ensures that the optimal delivery box is selected reliably and in a short time.

[0040] Next, an image of how the products are packed into the delivery box, obtained as a result of the box calculation, is created (step S12), and the image data of the created packing is stored in the packing image DB 18. As an example of the created image, FIG. 4 shows an image of how the products are packed when the number of products is four and box calculation is performed using the DBL method to obtain the optimal delivery box. (A) in FIG. 4 is a perspective view, (B) is a plan view, (C) is a left side view, and (D) is a front view. In this example, the products to be packed are 1 (product d), 2 (product a), 3 (product c), and 4 (product b), and delivery box C is selected. As an example of the created image, FIG. 5 shows an image of how the products are packed when the number of products is five and box calculation is performed using the 3D BF method to obtain the optimal delivery box. (A) in FIG. 4 is a perspective view, (B) is a plan view, (C) is a left side view, and (D) is a front view. In this example, the products to be packed are 1 product a, 2 product e, 3 product c, 4 product b, and 5 product d, and delivery box C is selected.

[0041] Thereafter, it is determined whether all orders have been completed, i.e., whether the number of orders has been processed is greater than the number of orders (step S13). If the number of orders is not greater than the number of orders (NO), the process returns to step S3, the next order information is read from the order information DB14, and the processes of steps S4 to S13 are repeated.

[0042] If it is determined in step S13 that the number of orders to be processed is greater than the number of orders (YES), it is assumed that all orders have been processed and the order loop is terminated (step S14), and the process of selecting the optimal delivery box for each order information is terminated.

[0043] If an exception occurs in the program, for example, if box calculation is started when the delivery box size or product size has not been registered, the box calculation unit 12 sends error information to the error transmission unit 19. The error transmission unit 19 reads out information about the error notification destination stored in the error notification destination DB 20, such as the destination's email address, and notifies the error notification receiving unit 21 of the occurrence of the error, for example, by email.

[0044] The core system 10 can obtain the optimum delivery box for each order information and an image of how to pack the products in that delivery box from the order information DB 14, the calculation result DB 17, and the packing image DB 18.

[0045] As described above, according to this embodiment, size information of the products to be packed is obtained from the product size DB 15, and size information of the delivery box into which they will be packed is obtained from the delivery box size DB 16. When the number of products is four or less, the packing problem is calculated using the DBL algorithm. When the number of packages is more than four, the packing problem is calculated using the 3D BF algorithm. The DBL algorithm and the 3D BF algorithm are algorithms that find an approximate solution to the problem of arranging the target products within a given area, the delivery box, without overlapping each other. If the result indicates that the products to be packed will not fit in the calculated box, a larger delivery box of a different size is used, and recalculation is performed using the DBL algorithm or the 3D BF algorithm. In this way, an approximate solution to the 3D packing problem is found by changing the algorithm depending on the number of products to be packed. Box calculations are performed sequentially from small to large delivery boxes, so the smallest box can always be selected in a short time. Furthermore, when the number of packages to be packed exceeds 20, the calculation for the delivery box is terminated. When the number of packages exceeds 20, box calculations are not performed because the probability of the largest box being used is very high despite the long calculation time.

[0046] The above-described embodiments are merely illustrative of the present invention and are not limiting, and the present invention can be embodied in various other modified and altered forms. Therefore, the scope of the present invention is defined only by the claims and their equivalents. [Explanation of symbols]

[0047] 10 Core Systems 11 API processing section 12 Box calculation section 13 Image Creation Department 14 Order Information DB 15 Product size DB 16 Shipping box size DB 17 Calculation result DB 18 Checkmate Image DB 19 Error transmission section 20 Error notification destination DB 21 Error notification receiver 22 Product size update section

Claims

1. a box size information storage unit that stores size information of boxes into which packages are packed; a luggage size information storage unit that stores luggage size information; a first calculation means for acquiring size information of a selected box from the box size information storage unit and acquiring size information of packages to be packed from the package size information storage unit, and calculating an approximate solution to a three-dimensional packing problem using a first algorithm; a second calculation means for acquiring size information of the selected box from the box size information storage unit and acquiring size information of packages to be packed from the package size information storage unit, and calculating an approximate solution to the three-dimensional packing problem using a second algorithm different from the first algorithm; a selection means for selecting the first calculation means when the number of packages to be packed is equal to or less than a predetermined value, and for selecting the second calculation means when the number of packages to be packed exceeds the predetermined value; It is equipped with A box selection device characterized in that, if the calculation by the first calculation means or the second calculation means selected by the selection means shows that the cargo to be packed will not fit into the selected box, a box of another size is selected and recalculation is performed using the first algorithm or the second algorithm.

2. 2. The box selection device according to claim 1, wherein the boxes are selected in order from smallest to largest size, and calculations are performed by the first calculation means or the second calculation means.

3. 2. The box selection device according to claim 1, wherein the first calculation means is a calculation means that uses a DBL method as the first algorithm, and the second calculation means is a calculation means that uses a three-dimensional BF method as the second algorithm.

4. 4. The box selection device according to claim 3, wherein the predetermined value is four.

5. 2. The box selection device according to claim 1, wherein box selection is terminated when the number of packages to be packed exceeds 20.

6. 2. The box selection device according to claim 1, further comprising an image display means for creating and displaying an image of the package packed according to the approximate solution when the calculation by the first calculation means or the second calculation means results in a result that the package to be packed will fit into the selected box.

7. Store size information of the box into which the package is to be packed and size information of the package, Acquire size information of the selected box from the stored size information, and also acquire size information of the cargo to be packed from the stored size information; When the number of packages to be packed is equal to or less than a predetermined value, an approximate solution to the three-dimensional packing problem is calculated using a first algorithm, and when the number of packages to be packed is greater than the predetermined value, an approximate solution to the three-dimensional packing problem is calculated using a second algorithm different from the first algorithm; This box selection method is characterized in that, if the calculation shows that the cargo to be packed cannot fit into the selected box, a box of another size is selected and recalculation is performed.

8. 8. The box selection method according to claim 7, wherein the calculation is performed by selecting the boxes in order from smallest to largest size.

9. 8. The box selection method according to claim 7, wherein the first algorithm is a calculation algorithm using the DBL method, and the second algorithm is a calculation algorithm using the three-dimensional BF method.

10. 10. The box selection method of claim 9, wherein the predetermined value is four.

11. 8. The box selection method according to claim 7, wherein when the number of packages to be packed exceeds 20, box selection is terminated.

12. The box selection method according to claim 7, characterized in that, if the calculation results in a result that the cargo to be packed will fit into the selected box, an image of the cargo packed according to the approximate solution is created and displayed.

Images