JP2007297146A - Loading plan preparation method and its program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To accomplish an efficient loading plan of a baggage such as a carton box loaded in a truck or the like. <P>SOLUTION: The insertable largest baggage group is selected (S5, S10) and all insertion methods of 48 ways are tried, as a result, the maximum sub-space is determined after insertion in order to determine the insertion method of the highest loading efficiency (S9, S17). Thereafter, the loading plan including loading positions of the respective baggages, its rotation state and the loading order is prepared by repeating this (S20). <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a loading plan creation method and a program for executing the loading plan on a computer.

  Trucks, containers, pallets, etc. are used to load products (luggage). In order to reduce the distribution cost, it is required to efficiently load the goods in the truck bay or container, and the planability is required.

  An object of the present invention is to create a loading plan that can plan an efficient loading method of a rectangular parallelepiped or cubic shaped load on a main space that is a rectangular parallelepiped shaped space for loading loads such as trucks, containers, and pallets. It is to provide a method.

  A further object of the present invention is to create an efficient loading plan for a rectangular parallelepiped or cubic shaped load on a main space which is a rectangular parallelepiped shaped space for loading loads such as trucks, containers and pallets. To provide a loading plan creation program.

The technical problem is that according to the loading plan creation method of the present invention,
A method for creating a loading plan for loading a plurality of cubic or rectangular parallelepiped loads into a cubic or rectangular parallelepiped main space for loading loads such as trucks, containers and pallets,
A first step of generating a luggage group by grouping the same size of the plurality of luggage in various numbers including one and in various arrangement states;
A second step of trying to insert the luggage group into the main space in various rotational states and with different insertion positions;
For each insertion trial, a third step of dividing the empty space around the luggage group by a cubic or cuboid shaped subspace and obtaining the largest post-insertion maximum subspace for each insertion trial;
A fourth step of determining an insertion method for generating the largest post-insertion maximum subspace by comparing the size of the maximum post-insertion subspace determined for each insertion trial after all the insertion trials are completed;
Each time the luggage group is inserted, the empty space around the luggage group inserted in the main space is re-divided into a plurality of cubic or rectangular parallelepiped-shaped sub-spaces, and various kinds of sub-spaces are classified. After the insertion determined for each insertion trial after all insertion trials have been completed for each package group. Loading is characterized in that the loading method for the main space is determined by repeating the fifth step of comparing the size of the largest subspace to find the insertion method for generating the largest post-insertion maximum subspace. This is achieved by providing a plan creation method.

  As a modification of the third step and the fourth step, in the third step, for each insertion trial, an empty space around the luggage group is divided into a cubic or rectangular parallelepiped subspace, and each insertion trial is performed. In the next fourth step, after all the insertion trials are completed, the size of each subspace obtained for each insertion trial is compared and the largest maximum after insertion is calculated. An insertion method for generating a subspace may be obtained.

In addition, the above technical problem is according to the loading plan creation program of the present invention.
Loading to cause a computer to execute the following procedure to generate a loading plan for loading a plurality of cubic or rectangular parallelepiped loads into a cubic or rectangular parallelepiped main space for loading trucks, containers, pallets, etc. A plan creation program,
A first procedure for generating a luggage group by grouping the same size of the plurality of luggages in various numbers including one and in various arrangement states;
A second procedure for performing an attempt to insert the luggage group into the main space in various rotational states and at different insertion positions;
For each insertion trial, a third procedure for dividing the empty space around the luggage group into a cubic or cuboid shaped subspace and obtaining the largest post-insertion maximum subspace for each insertion trial;
A fourth procedure for determining an insertion method for generating the largest post-insertion maximum subspace by comparing the size of the maximum post-insertion subspace obtained for each insertion trial after all the insertion trials have been completed;
Each time the luggage group is inserted, the empty space around the luggage group inserted in the main space is re-divided into a plurality of cubic or rectangular parallelepiped-shaped sub-spaces, and various kinds of sub-spaces are classified. After the insertion determined for each insertion trial after all insertion trials have been completed for each package group. A fifth procedure for comparing the size of the maximum subspace to obtain an insertion method for generating the largest post-insertion maximum subspace,
When the fifth procedure is repeated and there is no more load to be loaded in the main space or there is no more empty space to insert the load, the load is determined according to the insertion method obtained in the fourth and fifth procedures. This is achieved by providing a loading plan creation program characterized by having a sixth procedure for generating a loading plan for loading the load.

  As a modification of the procedure 5, each time the luggage group is inserted, the empty space around the luggage group inserted into the main space is re-divided into a plurality of cubic or rectangular parallelepiped subspaces, An attempt is made to insert the re-subspaces in various rotational states and with different insertion positions to obtain the largest post-insertion maximum subspace, and an insertion method for generating the post-insertion maximum subspace is obtained. You may do it.

  That is, according to the present invention, among a plurality of packages, packages of the same size are grouped in various numbers and arrangement states, and an insertion trial is performed on the main space in which packages such as trucks are loaded using the package groups. In this insertion trial, trials are performed at various insertion positions and various rotation states of the selected luggage group, and the empty space after insertion is divided into rectangular or cubic subspaces. The largest post-insertion maximum subspace is obtained, and when the insertion trials of all the insertion patterns are completed, an insertion method for generating the largest post-insertion maximum subspace is obtained. Thereafter, an attempt is made to insert a package group one after another, and an insertion method for generating the maximum subspace after the insertion is obtained each time. A loading plan with excellent loading efficiency on a truck or the like can be created by the insertion method thus obtained.

  The above object, other objects and effects of the present invention will become apparent from the following detailed description of the embodiments of the present invention.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings.

  The loading plan creation method of the embodiment is executed by a PC in which a computer program that executes the loading plan is installed. The loading space of the truck, the size of the container, the size of the pallet (to this), the size of the loading space, By inputting the number and size of loads to be loaded, a loading plan with high loading efficiency is displayed on the monitor, and can be output to a printer as necessary. Of course, you may save and / or output as a file.

The terms used in the description of the program related to the creation of a loading plan are defined as follows.
(1) “Container”: It has a rectangular parallelepiped or cubic space in which luggage (commodities) such as containers and truck luggage can be loaded. The concept of the container includes not only an internal space defined by itself, such as a container and a truck loading chamber, but also includes the case of loading on a pallet. Therefore, as will be described below, this is a term for defining a space for loading a load, which is defined by length × width × height (x, y, z values) read by a PC.
(2) “Luggage”: An object such as a cardboard box or a rectangular or cuboid containing goods, goods for distribution.

(3) “Luggage group”: A plurality of packages having the same length on the three sides of length x width x height are arranged one-dimensionally, two-dimensionally, and three-dimensionally without any gaps. Include a single package in the term package group and treat them the same.
(4) “Main space” and “Sub space”: Spaces that allow loading of loads, and empty container spaces that are not loaded with loads are referred to as “main spaces” (for example, truck loading spaces). After the luggage is inserted into the main space, the empty space around the space occupied by the luggage can be divided into a plurality of rectangular or cubic spaces. This is called “subspace”.

  (5) “Rotation of luggage”: Rotating a luggage group around a horizontal axis or a vertical axis until each side of a rectangular parallelepiped or cube-shaped luggage is in parallel with each side defining the main space or subspace. Say. FIG. 1 shows a state in which a rectangular parallelepiped luggage group D is rotated about a horizontal axis or a vertical axis, and there are a total of six rotational states as indicated by (I) to (VI) in FIG.

(6) The criteria for “large” and “small” are as follows.
(a) First definition: The size of the main space, sub space, luggage, and luggage group, both of which are rectangular parallelepiped or cubic, is determined to be “large” or “small” by comparing the volumes.
(b) Second meaning: When it is determined to be the same in the first meaning, “large” and “small” are determined by comparing the longest side among the three sides.
(c) Third definition: When the first definition and the second definition are determined to be the same, “large” and “small” are determined by comparing the second longest side among the three sides.

In the embodiment, the following rules are followed regarding the loading of packages.
(a) Ignore the center of gravity, rigidity, load capacity, etc. of the cargo such as cardboard boxes and products.
(b) The luggage group may be loaded in any of the above six rotation states. That is, any loading state can be selected as long as the loading state of the package is the six states in FIG.
(c) Ignore the overall balance of the container, for example, the load deviation due to the load.

  Referring to FIG. 2, a rectangular or cubic main space 2 on which a load (goods) can be loaded, such as a container, a cargo room of a truck, and a pallet, is the same as or more than this main space 2. It is also possible to load or insert a small luggage group D. If there is an empty space when the luggage group D1 is inserted in the main space 2, this empty space can be divided into a plurality of rectangular or cubical spaces. Each space divided into a rectangular parallelepiped or a cubic shape is referred to as a subspace 3, and FIG. 2 shows subspaces S 1 to S 3 formed when one load group D 1 is inserted into the main space 2. Each of the subspaces S1 to S3 is in contact with the side surface defining the main space 2 and is in contact with the side surface of the luggage group D1.

  The insertion of the luggage group D into the main space 2 and the sub space 3 is preferably performed at any one of the eight corners of the main space 2 or the sub space 3, but is not limited thereto. Is not to be done. FIG. 3 is a diagram for explaining a method of inserting one cargo group D1 into the main space 2 as a typical example. As can be seen from FIG. 3, one vertex of the luggage group D is made to coincide with one of the eight vertices of the main space 2, and three sides of the luggage group D that intersect at this vertex correspond to the corresponding three of the main space 2. The luggage group D is inserted into the main space 2 so as to coincide with one side. Therefore, for the insertion of the luggage group D, there are eight insertion positions related to the eight vertices of the main space 2 or each subspace 3 for each of the six rotation states (FIG. 1) of the luggage group D. Therefore, 6 × 8 = 48 patterns can be inserted.

  For example, as shown in FIG. 2, by inserting a luggage group D1 represented by (x, y, z) into the left corner of the main space 2 (L, W, H), the first to third Subspaces S1 to S3 are generated. Here, the first subspace S1 can be represented by (L-x, W, H), the second subspace S2 can be represented by (L, W-y, H), and the third subspace S3 can be represented by (L, W, H-z).

  4 to 8 are diagrams for explaining grouping of individual packages. FIG. 4 illustrates the arrangement states (I) to (IX) of individual packages in each package group when six packages 1 are grouped. FIG. 5 illustrates the arrangement states (I) to (III) of individual packages in each package group when five packages 1 are grouped. FIG. 6 exemplifies the arrangement states (I) to (VI) of individual packages in each package group when four packages 1 are grouped. FIG. 7 illustrates the arrangement states (I) to (III) of individual packages in each package group when three packages 1 are grouped. FIG. 8 illustrates the arrangement states (I) to (III) of individual packages in each package group when two packages 1 are grouped. As described above, the concept of the luggage group D includes the case of one luggage 1.

  Regarding the subspace 3, the concept of disappearance of space (this disappearance also applies to the main space 2), merging, and expansion is applied. FIG. 9 shows that when the luggage group becomes the same size as the space 2 or 3 due to the grouping of the luggage 1, the space 2 or 3 is “disappeared” by inserting the luggage group into the space 2 or 3. handle.

  FIG. 10 is a diagram for explaining the merging of the subspaces 3. In the case where two adjacent subspaces 3 and 3 are in complete contact with each other, the two subspaces 3 and 3 are handled as one space. This process is called “merging”.

  FIG. 11 is a diagram for explaining expansion of the subspace 3. When the surface where two adjacent subspaces 3 and 3 are in contact with each other is included in the surface of one subspace 3, that is, when the surface 3a of one subspace 3A is larger than the surface 3b of the other subspace 3B, The smaller subspace 3B is treated as a space expanded to a relatively large subspace 3A. This process is called “expansion”.

  In this way, by introducing the concept of merging and expanding the subspace 3, it is increased as the luggage groups D are inserted one after another so as to be referred to as the following secondary subspace and tertiary subspace. The number of subspaces to be consolidated is consolidated, and empty spaces around a number of already inserted luggage groups are re-divided to generate a plurality of rectangular or cubic subspaces. As a result, it is possible to insert as large a luggage group as possible into the subspace.

  Referring to FIG. 12, the first three subspaces S1 to S3 (FIG. 2) are generated by inserting the luggage group D1 into the main space 2 of the container. For example, in the third subspace S3, When the next luggage group D2 is inserted, three rectangular or cubic secondary subspaces can be generated around the luggage group D2 in the third subspace S3. This secondary subspace is not shown in FIG. 12, but this means that three subspaces S1 to S3 are generated when the first luggage group D1 is inserted into the main space 2 described above. Is the same as

  Therefore, in the example of FIG. 12, in the main space 2, among the first to third subspaces S1 to S3 generated in association with the insertion of the first luggage group D1, In the third sub-space S3, three second-order sub-spaces are generated by inserting the second luggage group D2. As a result, the first and second luggage groups D1, D2 are assigned to the main space 2. The empty space that becomes smaller with the insertion becomes a state in which the primary subspace and the secondary subspace are mixed. In order to consolidate the subspaces, the above-described subspaces are merged and expanded, whereby the first and second subspaces around the first and second luggage groups D1 and D2 are changed. It is possible to generate a subspace that is newly divided into a rectangular parallelepiped or a cubic shape by organizing and integrating. This makes it possible to try to insert a relatively large luggage group for each subspace.

  FIG. 12 illustrates a case where the first and second luggage groups D1 and D2 are inserted. Specifically, the case where the first luggage group D1 is inserted into the main space 2 and the second luggage group D2 is inserted into the primary third subspace S3 generated thereby is illustrated. By inserting the second luggage group D2 into the third subspace S3, the second three subspaces (not shown) are generated in the third subspace S3. In computer processing, the primary first and second subspaces S1 and S2 and the secondary three subspaces generated in the third subspace S3 are mixed. Some of the mixed subspaces are arranged by the above-described merging and expansion, and the empty spaces around the first and second cargo groups D1 and D2 are re-divided into rectangular or cubic subspaces. This process is the same when the third package group is inserted next, and the same applies when the package groups are inserted one after another.

  FIG. 13 and FIG. 14 are flowcharts for specifically explaining the loading plan creation method of the embodiment, and FIG. 14 shows steps subsequent to step S10 in FIG. Prior to describing the embodiment based on the flowchart, the outline will be described. The number of loads loaded on the transportation means for loading loads such as trucks, containers, pallets, etc. is limited, and every time the loads are loaded on the truck. In addition, the number of luggage to be loaded is reduced. That is, if there are 30 pieces of luggage to be loaded on the truck, if 10 of them are grouped and loaded on the truck, the remaining unloaded luggage on the truck is reduced to 20. Accordingly, when the luggage group D1 is first inserted into the main space 2, the grouping of the next insertable luggage group D2 is for the remaining luggage.

  In addition, for example, cardboard boxes are generally shaped into a plurality of types. Therefore, as described with reference to FIG. 4 to FIG. 8 by grouping the same size packages, various numbers of package groups having various arrangements are generated, and this package group is physically divided into a single package. Handle the same. Then, an attempt is made to insert the largest baggage group D1 into the main space 2 from the baggage groups of a size that can be inserted. The insertion trial for the main space 2 is performed for all of the 48 insertion patterns described above, and the most efficient insertion pattern is selected from the 48 insertion patterns.

  The high efficiency is low because the volume of the largest subspace among the three primary subspaces S1 to S3 generated by the individual insertion patterns when the first luggage group D1 is inserted in 48 patterns is compared. Thus, the insertion pattern having the largest volume in the sub space is selected. That is, when the largest luggage group D1 among the insertable sizes is inserted into the main space 2 in 48 patterns, the three primary subspaces S1 to S3 generated for each insertion pattern The largest sub-space after insertion is memorized, and after all 48 insertion patterns have been tried, the largest sub-space is compared and the largest volume is compared. The insertion pattern that creates the largest subspace after insertion is selected as the most efficient insertion method and is determined in this embodiment. Of course, for each insertion pattern insertion trial, the size of the three subspaces generated by this is stored, and after all the insertion pattern insertion trials have been completed, the largest subspace is obtained. You may make it select the insertion pattern which produces | generates the largest subspace after insertion.

  The second baggage group D2 to be inserted next has a reduced number of packages to be loaded by the first insertion group D1 already inserted. The largest luggage group D2 is selected, and an attempt is made to insert the selected luggage group D2 into the primary subspaces S1 to S3. This insertion trial is performed for all of the 48 insertion patterns described above, and the most efficient insertion method obtained as a result is selected.

  The determination of the efficiency of the second luggage group D2 is as follows. That is, when the second luggage group D2 is inserted into each of all the subspaces of the primary subspaces S1 to S3 in 48 patterns, each insertion pattern is inserted into the inserted primary subspace. Three secondary subspaces are formed every time. The empty space around the first and second luggage groups D1 and D2 is in a state where the primary subspace and the secondary subspace are mixed on the computer processing. In order to consolidate this, the above-described merging and expansion are executed to recreate the empty space around the first and second packages D1 and D2 into a subspace re-divided into rectangular subspaces. And every time it tries with 48 types of insertion patterns with respect to the 1st-3rd subspace S1-S3, the rearranged subspace is produced | generated and the largest after insertion largest among this remade subspace. Determine the volume of the subspace. When all 48 insertion pattern trials are completed for the first to third subspaces S1 to S3, the second luggage group D2 is inserted into each subspace S1 to S3 with each insertion pattern. The insertion method for generating the largest post-insertion maximum subspace is selected by comparing the size of the maximum post-insertion subspace generated accordingly. This insertion method includes a primary subspace into which the second luggage group D2 is inserted and an insertion pattern for the primary subspace. Of course, the size of a plurality of subspaces generated for each insertion pattern insertion trial is stored, and after all the insertion pattern insertion trials are completed, the largest subspace is obtained and the maximum after this insertion is determined. The insertion pattern for generating the subspace may be selected and determined.

  For the third and subsequent luggage groups to be inserted next, an insertion trial is performed in the same manner as in the second luggage group D2. That is, since the number of packages to be loaded is reduced by the already inserted first and second insertion groups D1 and D2, the largest package group is selected from the number of remaining packages and the type of package that can be generated Then, an attempt is made to insert the selected luggage group into each of the plurality of subspaces rearranged after inserting the second luggage group D2. This insertion trial is performed for all of the 48 insertion patterns described above, and the most efficient insertion method obtained as a result is selected. The selection of the most efficient insertion method is the most among the sub-spaces obtained by dividing the empty space after the first to third luggage groups D1 to D3 are inserted by introducing the above-mentioned idea of merging and expansion. The insertion method that generates the largest subspace after the large insertion is selected and determined.

  By repeating the above procedure, the number of loads to be loaded is reduced and the space for loading is also reduced. Since the concept of the luggage group includes a single luggage, the above procedure is repeated until there is no luggage to be loaded or until there is no empty space that can be inserted. The attempt to insert D ends.

  When the insertion attempt of the luggage group D into the main space 2 is completed, a loading guide, that is, a loading plan, that specifically specifies the order of loading the luggage onto the truck or container, the loading position of each luggage, and the rotation state of the luggage. Is created. This is because the insertion position, rotation state, and size of the package 1 constituting each package group obtained as a result of the above-described insertion trial are the first package group D1, the next second package group D2, and the subsequent package groups. A loading plan can be easily created based on the above.

  On the premise of the above, the loading plan creation method and program procedure of the embodiment will be described in detail based on the flowcharts of FIGS. First, referring to FIG. 13, in step S <b> 1, data of various types of luggage 1 to be loaded on the container is read. As the data of the luggage 1, for example, if the luggage 1 is a plurality of types of cardboard boxes, it includes the vertical and horizontal dimensions of the various cardboard boxes, that is, the numerical values and the number of (x, y, z). Next, in step S2, the length × width × height dimension, ie, (x, y, z) values of the main space 2 of the container (for example, the cargo space of the truck) are read. The number of these items 1 and the numerical value of (x, y, z) and the numerical value of (x, y, z) in the main space 2 may be input using an input means such as a keyboard connected to the PC. Data generated by another PC may be used.

  In the next step S3, the packages 1 are grouped based on the data of the packages 1 acquired in step S1. In this grouping, a group of all luggage groups D that can be created by the method described with reference to FIGS. 4 to 8 is created for the luggage 1 having the same vertical dimension, horizontal dimension, and height dimension. The The group of the luggage group D includes a case where the luggage 1 is single. As described above, for example, when the insertion attempt of the first luggage group D1 is completed and the insertion method is determined, the group of the luggage 1 constituting the first luggage group D1 is deleted from the group of the luggage 1 to be loaded. A package group D that can be generated by the group of packages 1 from which this is removed appears conceptually. In the present embodiment, a package group including all of these is preliminarily created in step S3. However, when the insertion trial of the preceding package group D is completed, a subsequent package group group is created thereafter, A package group D to be inserted next may be selected from the group of package groups.

In the next step S4, the created package groups D are rearranged in the order of “large” according to the following rules.
(a) First definition: The size of the luggage group D that is a rectangular parallelepiped or a cube is determined to be “large” or “small” by comparing the volumes.
(b) Second meaning: When it is determined to be the same in the first meaning, “large” and “small” are determined by comparing the longest side among the three sides.
(c) Third definition: When the first definition and the second definition are determined to be the same, “large” and “small” are determined by comparing the second longest side among the three sides.

  In the next step S5, the largest baggage group D1 is selected from the baggage groups of a size that can be inserted into the main space 2, and insertion into the main space 2 is attempted with the above-described 48 insertion patterns for the baggage group D1. (Step S6).

  And primary subspace S1-S3 is produced | generated for every insertion pattern, The volume of the largest subspace in it is calculated | required, and this is memorize | stored (step S7). When all 48 insertion pattern trials are completed, the process proceeds to step S8 to step S9, and the largest subspace for each insertion pattern obtained in step S7 is compared to generate the largest subspace. An insertion pattern is obtained, and the first luggage group D1 with respect to the main space 2 and its insertion method (insertion position, rotation state, etc.) are determined (step S9).

  In the above step S9, when there are, for example, two preferable insertion positions of the luggage group D1 with respect to the main space 2, it is preferable to preferentially select the part that contacts the lower surface of the main space 2, It is better to give priority to the back (the back of the cargo room, for example).

  Referring to FIG. 14, in the next step S10, the already determined first luggage group D1 among the remaining luggage groups D, excluding the luggage 1 constituting the already determined first luggage group D1, is the main space. The luggage group D2 that can be inserted into the first to third subspaces S1 to S3 that are generated as a result of being inserted into the second subspace S2 is selected. In this selection, it is preferable to select the luggage group D2 that can be inserted into the largest subspace among the subspaces S1 to S3, and the following insertion trial is performed on the subspace into which the selected luggage group D2 can be inserted in step S11. It is executed afterwards.

  First, the second luggage group D2 selected in step S10 is inserted into one primary subspace (for example, the first subspace S1), and then in step S12, the inserted first primary subspace S1. In step S13, the secondary subspace and the other primary subspaces (S2, S3) are merged and expanded to re-divide the sub-spaces. Create a space. In the next step S14, the largest subspace (the maximum subspace after insertion) is obtained from the recreated subspaces and stored.

  When 48 insertion trials are completed for the first subspace S1, the process advances from step S15 to step S16, and then returns to step S11 to enter the second subgroup (for example, the second subspace S2) into the second luggage group D2. Is attempted (steps S12 to S15). When all the 48 insertion pattern trials have been completed for the second subspace S2, an attempt is made to insert the second luggage group D2 into the next first subspace S3. When all trials of 48 insertion patterns for S3 are completed, the process proceeds to step S17, and an insertion for generating the largest subspace among the plurality of post-insertion maximum subspaces stored for each insertion trial in step S14 is performed. The method (identification of the subspaces S1 to S3 to be inserted, the insertion position, the rotation state) is obtained and determined.

  For example, the most efficient insertion position and rotation state of the second luggage group D2 are determined by rearranging the insertion position and rotation state and the empty space after insertion for each trial of insertion of the second luggage group D2. The size of the subspace may be stored, and the insertion method for generating the largest subspace may be determined after all insertion attempts of the second luggage group D2. In this case, the insertion position and rotation state data of the second luggage group D2 are taken from this insertion method, and in step S11, the vacant space after insertion of the first and second luggage groups D1 and D2 is based on this data. A subspace obtained by re-dividing the space into a rectangular parallelepiped or a cubic shape may be generated, and this may be used as an Nth-order subspace to perform the processing from step S11 onward.

  Then, in the next step S18, the presence / absence of the remaining package group D is confirmed. In the next step S19, the presence / absence of the subspace that can be inserted is confirmed. Then, the process returns to step S10 to select the third insertion group. Subsequently, 48 insertion trials are made for each of the plurality of subspaces re-sorted for each insertion pattern and insertion position of the second luggage group D2 described above, and stored for each insertion trial in step S14. An insertion method for generating the largest post-insertion maximum subspace among the plurality of largest subspaces is obtained and determined.

  Thereafter, the same process is executed for the remaining luggage groups, and the insertion of the luggage groups is successively performed until the remaining luggage groups are zero or there is no subspace in which insertion is possible.

  Whether or not the selected package group D can be inserted into the subspace is determined according to the following determination criteria (a) to (c).

(a) The longest side (maximum side) among the three sides of the selected luggage group D is equal to or less than the maximum side of the subspace.
(b) Of the three sides of the selected luggage group D, the second longest side (intermediate side) is less than or equal to the intermediate side of the subspace.
(c) The shortest side (minimum side) of the three sides of the selected luggage group D is not more than the minimum side of the subspace.

  If there are a plurality of insertion patterns having the same maximum subspace volume after insertion, the insertion position with the lowest and deepest insertion positions is preferentially selected.

  In step S20, the loading plan including the loading position, the rotation state, and the loading order of each load 1 based on the first to Nth load groups determined by the above procedure, the insertion position of each load group, and the rotation state. The loading plan is output from a computer and displayed on a monitor, and printed on paper by a printer as necessary. Of course, you may save and / or output as a file.

  In this way, by inputting the size and the number of the plurality of luggage 1 to be loaded, a loading plan including the loading sequence and the loading position for loading the plurality of luggage 1 can be created. It becomes easy to make a shipping plan including arrangement of trucks. Also, a worker who loads a truck, a container, or a pallet can load with high loading efficiency only by loading each of the plurality of loads 1 onto a truck or the like according to the above loading plan.

It is a figure for demonstrating six types of rotation states of a rectangular parallelepiped luggage (packages, such as a cardboard box). It is a figure for demonstrating three rectangular parallelepiped subspace produced | generated by inserting a load into the space (main space) which loads a load on a truck, a container, a pallet, etc. It is a figure for demonstrating eight insertion positions of the load with respect to the space (main space) which loads a load on a truck, a container, a pallet, etc., and a rectangular parallelepiped subspace. It is a figure for demonstrating the various arrangement | sequence states when grouping six packages. It is a figure for demonstrating the various arrangement | sequence states when grouping five packages. It is a figure for demonstrating various arrangement | sequence states when grouping four packages. It is a figure for demonstrating the various arrangement | sequence states when grouping three packages. It is a figure for demonstrating the various arrangement | sequence states when grouping two packages. It is a figure for demonstrating the loss | disappearance of main space or a subspace when it is satisfy | filled with the load (package group) inserted in the main space or the subspace. It is a figure for demonstrating merger of two adjacent subspaces. It is a figure for demonstrating expansion of two adjacent subspaces. It is a figure for demonstrating that a secondary subspace is produced | generated when a load (luggage group) is inserted in a subspace. It is a flowchart for demonstrating an example of the loading plan preparation method of this invention. It is a flowchart for demonstrating an example of the loading plan preparation method of this invention similarly to FIG.

Explanation of symbols

1 Luggage 2 Main space (eg truck bay)
3 Subspace D Luggage group

Claims (8)

A method for creating a loading plan for loading a plurality of cubic or rectangular parallelepiped loads into a cubic or rectangular parallelepiped main space for loading loads such as trucks, containers and pallets,
A first step of generating a luggage group by grouping the same size of the plurality of luggage in various numbers including one and in various arrangement states;
A second step of trying to insert the luggage group into the main space in various rotational states and with different insertion positions;
For each insertion trial, a third step of dividing the empty space around the luggage group by a cubic or cuboid shaped subspace and obtaining the largest post-insertion maximum subspace for each insertion trial;
A fourth step of determining an insertion method for generating the largest post-insertion maximum subspace by comparing the size of the maximum post-insertion subspace determined for each insertion trial after all the insertion trials are completed;
Each time the luggage group is inserted, the empty space around the luggage group inserted in the main space is re-divided into a plurality of cubic or rectangular parallelepiped-shaped sub-spaces, and various kinds of sub-spaces are classified. After the insertion determined for each insertion trial after all insertion trials have been completed for each package group. Loading is characterized in that the loading method for the main space is determined by repeating the fifth step of comparing the size of the largest subspace to find the insertion method for generating the largest post-insertion maximum subspace. How to create a plan. A method for creating a loading plan for loading a plurality of cubic or rectangular parallelepiped loads into a cubic or rectangular parallelepiped main space for loading loads such as trucks, containers and pallets,
A first step of generating a luggage group by grouping the same size of the plurality of luggage in various numbers including one and in various arrangement states;
A second step of trying to insert the luggage group into the main space in various rotational states and with different insertion positions;
For each insertion trial, a third step of dividing the empty space around the luggage group into a cubic or cuboid shaped subspace and determining the size of the subspace generated for each insertion trial;
A fourth step of determining an insertion method for generating the largest post-insertion maximum subspace by comparing the size of each subspace obtained for each insertion trial after all the insertion trials are completed;
Each time the luggage group is inserted, the empty space around the luggage group inserted in the main space is re-divided into a plurality of cubic or rectangular parallelepiped-shaped sub-spaces, and various kinds of sub-spaces are classified. Repeating the fifth step to obtain the largest post-insertion maximum subspace by performing an attempt to insert at a different rotational position and at different insertion positions, and to obtain an insertion method for generating the post-insertion maximum subspace, A loading plan creation method characterized by determining a loading method for the main space.   The position of insertion into the cubic or rectangular parallelepiped main space and sub-space is such that one of the eight vertices of the main space or sub-space coincides with the vertex of the luggage group and one of the main space or sub-space. The loading plan creation method according to claim 1 or 2, wherein there are eight insertion positions in which three sides of the main space that intersect at the apex coincide with corresponding sides of the luggage group.   The re-segmentation of the sub-space performed in the fifth step includes rearranging the sub-space by merging and / or expanding the sub-space generated with the insertion of the luggage group. Item 4. The loading plan creation method according to any one of Items 1 to 3.   The loading plan creation method according to any one of claims 1 to 4, wherein the luggage group is a maximum luggage group that can be inserted into the main space or the subspace. Loading to cause a computer to execute the following procedure to generate a loading plan for loading a plurality of cubic or rectangular parallelepiped loads into a cubic or rectangular parallelepiped main space for loading trucks, containers, pallets, etc. A plan creation program,
A first procedure for generating a luggage group by grouping the same size of the plurality of luggages in various numbers including one and in various arrangement states;
A second procedure for performing an attempt to insert the luggage group into the main space in various rotational states and at different insertion positions;
For each insertion trial, a third procedure for dividing the empty space around the luggage group into a cubic or cuboid shaped subspace and obtaining the largest post-insertion maximum subspace for each insertion trial;
A fourth procedure for determining an insertion method for generating the largest post-insertion maximum subspace by comparing the size of the maximum post-insertion subspace obtained for each insertion trial after all the insertion trials have been completed;
Each time the luggage group is inserted, the empty space around the luggage group inserted in the main space is re-divided into a plurality of cubic or rectangular parallelepiped-shaped sub-spaces, and various kinds of sub-spaces are classified. After the insertion determined for each insertion trial after all insertion trials have been completed for each package group. A fifth procedure for comparing the size of the maximum subspace to obtain an insertion method for generating the largest post-insertion maximum subspace,
When the fifth procedure is repeated and there is no more load to be loaded in the main space or there is no more empty space to insert the load, the load is determined according to the insertion method obtained in the fourth and fifth procedures. A loading plan creation program comprising a sixth procedure for generating a loading plan for loading a load. Loading to cause a computer to execute the following procedure to generate a loading plan for loading a plurality of cubic or rectangular parallelepiped loads into a cubic or rectangular parallelepiped main space for loading trucks, containers, pallets, etc. A plan creation program,
A first procedure for generating a luggage group by grouping the same size of the plurality of luggages in various numbers including one and in various arrangement states;
A second procedure for performing an attempt to insert the luggage group into the main space in various rotational states and at different insertion positions;
For each insertion trial, a third procedure for dividing the empty space around the luggage group into a cubic or cuboid shaped subspace and determining the size of the subspace generated for each insertion trial;
A fourth procedure for determining an insertion method for generating the largest post-insertion maximum subspace by comparing the size of each subspace obtained for each insertion trial after all the insertion trials have been completed;
Each time the luggage group is inserted, the empty space around the luggage group inserted in the main space is re-divided into a plurality of cubic or rectangular parallelepiped-shaped sub-spaces, and various kinds of sub-spaces are classified. A fifth procedure for determining the largest post-insertion maximum subspace by performing an attempt to insert at a different rotational position and at different insertion positions, and for determining an insertion method for generating the post-insertion maximum subspace,
When the fifth procedure is repeated and there is no more load to be loaded in the main space or there is no more empty space to insert the load, the load is determined according to the insertion method obtained in the fourth and fifth procedures. A loading plan creation program comprising a sixth procedure for generating a loading plan for loading a load.   The loading plan creation program according to claim 6 or 7, wherein the size of the plurality of packages and the size of the main space are input to the computer by input means connected to the computer.

Images