JP2008265970A - Article loading system, article loading simulation method, article loading simulation program and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an article loading system and an article loading simulation method for enhancing working efficiency on loading, and improving a loading ratio in a storage space. <P>SOLUTION: This air cargo loading simulation system 60 comprises an information input means 50 inputting various information on a cargo, a cargo information input means 51 inputting data on at least a width dimension, a depth dimension, a height dimension, the weight of a cargo, and the number of the cargos, a space information input means 52 inputting information on the storage space, a simulation means 58 confirming and correcting its result by 3D by simulating a method for efficiently loading the cargo in the storage space by algorithm based on the inputted various information, and a document output means 55 creating and outputting a document 57 indicating a loading position, the loading direction and the loading order of the cargo based on the result simulated by the simulation means 58, and can be further used anytime and anywhere in a web base. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to an article loading system and an article loading simulation method, and more particularly to an efficient loading method for loading cargo on loading means, for example, at which position the cargo loaded on an aircraft is located. The present invention relates to an article loading system that allows a computer to simulate from what direction and in what order, and to load cargo in an optimal order according to the result.

  2. Description of the Related Art Conventionally, cargo transported by an aircraft is mounted on an aircraft in a state of being loaded on an aircraft-mounted equipment (ULD = Unit Load Device) such as a pallet or a container. Conventionally, when a pallet or container is mounted on an aircraft, the shape, size, and number of pallets to be used are determined in advance based on the maximum allowable load weight calculated for each aircraft. Next, the operator decides the optimal loading sequence of each cargo by empirically judging from the approximate volume of the pallet to be used and the weight, shape, etc. of each cargo. Carrying out the loading work. Also, since the handling volume of air cargo is increasing year by year, work speed, accuracy, and quality improvement are required when loading various cargo on pallets and the like.

As a prior art for improving the efficiency when loading cargo, Patent Document 1 discloses a cargo supplied as a method and apparatus for palletizing rectangular packaging products received in irregular sizes and weights. A technique is disclosed in which the volume of the pallet is measured and the pallet is automatically loaded by a gripper based on the measurement data.
Patent Document 2 also measures the weight and packaging of each cargo, calculates the density of each cargo from the weight and packaging of each cargo, accumulates the density information of each cargo, and positions each cargo for loading. And a method for loading each cargo based on the loading position information is disclosed.

  Further, Patent Document 3 discloses a plane for automatically calculating the loading state of the first stage of the pallet so as to increase the filling rate of the load on the loading surface of the pallet based on each dimension information of the load and the pallet. A packing form calculation step and a display step for displaying a packing form showing the state of the load loaded on the pallet including the first-stage packing form that is automatically calculated. According to the instruction step having at least a first step of finely adjusting the position by moving the load or a plurality of loads in a specified direction, the type of the pallet and the pallet A simulation technique for creating final package form definition information corresponding to the load of the product is disclosed.

Further, in Patent Document 4, based on the number of members to be packed within a predetermined period and the characteristics thereof, the specification form of the outer case necessary for packing and the quantity thereof are stored in the outer case development master, and the layout terminal In this case, the artificial intelligence or the expert system is used to search whether there is a space around the outer case already stacked in order from the back side of the container, and the conditions previously stored in the loading condition table are stored in the space. A technique for arranging a satisfactory exterior case is disclosed.
JP 2003-335417 A JP 2002-29631 A JP 2003-176025 A JP-A-7-53049

However, in the conventional loading method, an experienced worker determines the loading order of each cargo based on the weight, contents data, and shape of each cargo, and each cargo is palletized or containerized. Since it has a predetermined weight and a predetermined packing shape, it has to rely on the experience and intuition of the workers, and the optimal loading order is not always achieved.
The prior art described in Patent Document 1 is an invention relating to a procedure for measuring the volume of a supplied cargo and automatically loading it on a pallet with a gripper based on the measurement data. Since there is a risk of breakage, it is necessary to determine the loading conditions for loading, but there is a problem that these conditions cannot be reflected in detail.
In the prior art described in Patent Document 2, the pit scale and the three-dimensional sensor are activated, and the load and weight of the cargo loaded on the ULD pallet are sequentially measured, and the management displayed on the monitor display The stacking operation is performed while checking the graph as needed, and the problem that the restrictive conditions due to the cargo cannot be finely reflected as in Patent Document 1, and the work time for loading the cargo on the pallet by cut and try. There is a problem that it takes a lot.

In addition, the conventional technique described in Patent Document 3 has a problem that it is difficult to apply when handling cargoes having different sizes because the simulation target is a single product.
In the prior art described in Patent Document 4, a large, light and full case is selected as an outer case to be first loaded into a container, and can be stacked around the already loaded outer case. It is a way to proceed with the layout process by searching for a space and sequentially extracting and stacking outer cases that can be stacked in this space. There is a problem that the operation is troublesome.

  The present invention has been made in view of such a problem. A method for efficiently loading a plurality of cargos in a storage space of a storage means such as a pallet or a container is simulated in advance, and the simulation result is converted into a form format. By creating and outputting in this way, and loading cargo into the accommodation space based on this form, the work time required for loading is shortened, the work efficiency is increased, and the loading rate in the accommodation space is improved. It is an object to provide a loading system and an article loading simulation method.

In order to solve such a problem, the present invention claims that a method for efficiently loading a plurality of articles in a storage space is simulated, and the articles are stacked in the storage space based on the simulation result. An article loading system for presenting a procedure, wherein article information input means for inputting data relating to at least a width dimension, a depth dimension, a height dimension, a weight, and the number of the articles, and spatial information for inputting information relating to the accommodation space Simulation means for simulating a method for efficiently loading the article in the accommodation space based on each information input by the input means, the article information input means, and the space information input means, and the simulation means Based on the result of the simulation, the loading position and loading direction of the article, or the loading position of the article A form output means for creating and outputting a form instructing a loading direction and a loading order, and each information can be input by an operation screen displayed on a Web page. .
In the article loading system of the present invention, information on individual articles (width dimension, depth dimension, height dimension, weight, number, etc.) and information on a storage space (for example, a pallet or a container) in which the article is accommodated are stored in advance. Entered. The simulation means simulates a method for efficiently loading articles in the accommodation space based on such information. The simulation result is created and printed as a hard copy by the form output means, for example. The worker loads the article in the accommodation space on site while looking at the form. In addition, since each information can be input through the operation screen displayed on the Web page, the simulation can be performed at any time regardless of time. Thereby, the optimum loading method can be confirmed in advance, and the final result is output by the form output means, so that the work efficiency at the site can be enhanced.

According to a second aspect of the present invention, the simulation unit performs loading based on a loading procedure using a loading candidate point defined by a predetermined loading standard as a clue when loading in order of a number indicating a loading order given to each article. The first reference is the bottom of the housing space, the second reference is either the left side or the right side, and the third reference is either the front side or the back side. The stacking candidate points are sequentially set as a stacking reference, and the stacking procedure is repeated until all the articles having the numbers are stacked.
Each article is assigned a number in the order in which the articles are to be loaded in advance, and the articles are loaded in this number order. When stacking in the accommodation space in the order of numbers, stacking is performed based on a stacking procedure using a stacking candidate point defined by a predetermined stacking standard as a clue. That is, as a loading procedure, the first is the bottom of the accommodation space, the second reference is either the left side or the right side, and the third reference is either the front side or the rear side. , And the stacking procedure is repeated until all the articles are stacked. Thereby, the loading procedure is standardized, and the calculation speed of the simulation can be increased.

According to a third aspect of the present invention, in addition to the loading standard, the articles are stacked so that the center of gravity becomes the lowest, or the same article is stacked on top as ease of loading, or the loading direction and size of the article It is characterized by taking into account at least one of stacking so as to be uniform or stacking so as to increase the loading rate.
The basis of the algorithm of the present invention is performed based on the first to third loading standards. However, in addition to the standard, simulation is performed based on several conditions. That is, any one of the conditions such as lowering the center of gravity of the article as much as possible, stacking the same article on top, stacking with the same size, or stacking so that the loading rate is increased, etc. Is further simulated. Thereby, the accuracy of the simulation is improved and the loading result can be brought close to the intended loading method.

According to a fourth aspect of the present invention, the algorithm of the simulation means assumes that the accommodation space and the shape of the article are a rectangular parallelepiped or a cube, and one of the vertices included in the bottom surface of the accommodation space is set as an initial loading candidate point. The stacking is performed such that any one vertex included in the bottom surface of the article to be matched with the initial stacking candidate point, and the point at which any vertex of the article matches the side of the accommodation space is set as the next stacking candidate point. When the next article is loaded, the procedure for loading the next article so that the apex of the next article matches the loading candidate point having the highest priority among the next loading candidate points is repeated. To do.
The loading algorithm of the present invention assumes that the accommodation space and the article are a rectangular parallelepiped or a cube as a precondition. Then, one vertex included in the bottom surface of the accommodation space is set as an initial stacking candidate point. First, the stacking is performed so that one vertex included in the bottom surface of the article matches the initial stacking candidate point. As a result, points where the vertices of the article coincide with the sides of the accommodation space are generated, and these points are set as the next candidate loading points. When the next article is to be stacked, the stacking is performed so that the vertices included in the bottom surface of the article coincide with each other in the order of priority among the candidate stacking points. This procedure is repeated sequentially until all articles are loaded. This algorithm is called a BLD method (Bottom Left Depth Algorithm).

According to a fifth aspect of the present invention, when the algorithm of the simulation unit cannot load the next article so that the vertex of the next article coincides with a loading candidate point having the highest priority among the next loading candidate points. The stacking is performed such that the top of the next article matches the stacking candidate point of the next priority.
There are various shapes of articles, such as long articles and tall articles. However, since the storage space is limited in size, if loading is performed by the BLD method, even if an attempt is made to load at the highest priority stacking candidate point, some articles cannot be stored in the storage space. In such a case, even if the priority order of the stacking candidate points is high, the stacking is performed so as to match the stacking candidate point of the next priority order. As a result, articles can be loaded as much as possible in descending order of priority.

According to a sixth aspect of the present invention, among the stacking candidate points, the stacking candidate point that is located at the bottom of the accommodation space, is located on either the left side or the right side, and is located on the near side or the back side, It is characterized by being a loading candidate point having a high priority.
In the BLD method, the stacking candidate point that is located at the bottom, on the left side, and in the foreground has the highest priority. Accordingly, the priority order is sequentially determined from the loading candidate points. In addition, when there are a plurality of stacking candidate points included in the bottom surface, the stacking candidate point that is second closest to the left side is set as the next priority. As a result, the priority criteria are determined, and the priorities can be sequentially determined.

According to a seventh aspect of the present invention, the simulation means overlaps the attribute that only the lowest level can be loaded, the attribute that any article can be placed on top, and the attribute that cannot be placed on top, only in the case of the same article. And an attribute of an article to be considered at the time of simulation.
Each loaded item has an attribute. For example, an article that can be loaded only on the bottom stage due to its heavy weight, an article that can be placed on top of any article because it is made of a robust material, or that is placed on top because it is easily damaged There is an article that cannot be used, or an article that can be stacked only in the case of the same article. Considering the attributes of these articles, it is possible to prevent accidents such as damage to articles even if they are loaded based on the simulation results.

According to an eighth aspect of the present invention, the simulation means performs the simulation by fixing the loading direction of the article, fixes the article position on the three-dimensional screen, and simulates the loading position in consideration of the inner diameter dimension and the outer dimension. The simulation is performed in consideration of the protrusion, and the handling of a plurality of articles as a set is a condition and possible operation to be considered at the time of simulation.
Some articles are configured as a set. For example, there are a display unit and a main body of a personal computer. The articles as such a set preferably have the same storage space for loading. Therefore, in the present invention, the loading direction is fixed, the position of the article is fixed, the inner diameter dimension and the outer dimension of the article are taken into consideration, the simulation is performed in consideration of the protrusion, and a plurality of articles are handled as a set. This is a condition for simulation. As a result, it is possible to easily load different-type articles, increase the loading efficiency during loading, and shorten the time for unloading set articles.

The simulation means may display the simulation result as a three-dimensional image in real time, and the simulation result can be changed by arbitrarily adjusting the three-dimensional image on the operation screen. And
The simulation result is displayed on the operation screen as a three-dimensional image. Therefore, the operator can finely adjust the simulation result together by arbitrarily changing the position of the article while viewing the screen. Thereby, fine adjustment can be performed so that the loaded state after the simulation is optimized.

According to a tenth aspect of the present invention, the form output means displays a loading position, a loading direction, and a loading quantity of articles loaded in each of the accommodation spaces for each loading stage.
Among the articles, there are articles that can be stacked and stacked and articles that cannot be stacked. Therefore, in the present invention, for articles that can be stacked and loaded, the loading position, loading direction, and loading quantity of the articles loaded for each loading stage are made into a drawing. This makes it possible to recognize the article loading method accurately and quickly.

An eleventh aspect of the present invention includes a database for storing a result of simulation performed by the simulation unit, and the simulation result stored in the database can be edited.
The database stores the simulation results. Therefore, when loading an article, if there is the same simulation result stored in the past, there is no need to perform the simulation again. Therefore, in the present invention, when an article is loaded, a simulation result stored in a database is searched and the simulation result can be edited. Thereby, useless simulation can be eliminated and data can be used effectively.

Claim 12 is an article loading simulation method for efficiently loading a plurality of articles in an accommodation space, and is defined by a predetermined loading standard when loading in order of numbers indicating the loading order given to each article. Loading based on the loading procedure using the loading candidate point as a clue, the first reference being the bottom of the accommodation space, the second reference being either the left side or the right side, The stacking candidate point is sequentially set as one of the near side and the back side as a reference for the above, and the loading procedure is repeated until all the articles having the numbers are loaded. .
The present invention has the same effect as that of the second aspect.

Claim 13 assumes that the shape of the article is a rectangular parallelepiped or a cube, uses one of the vertices included in the bottom surface of the storage space as an initial loading candidate point, and any one vertex included in the bottom surface of the article to be loaded first. Is loaded to match the initial loading candidate point, and a point that matches any apex of the article and the side of the accommodation space is set as the next loading candidate point. The stacking procedure is repeated so that the apex of the article matches the stacking candidate point having the highest priority among the stacking candidate points.
The present invention has the same effect as that of the fourth aspect.

According to a fourteenth aspect of the present invention, when it is impossible to stack the next article so that the apex of the next article matches the stacking candidate point having the highest priority among the next stacking candidate points, Loading is performed such that the vertex of the next article matches the candidate point.
The present invention has the same effect as that of the fifth aspect.

According to a fifteenth aspect of the present invention, the stacking candidate point that is the bottommost part of the accommodation space and is either the left side or the right side, and is located on either the front side or the back side, has the highest priority. It is characterized by being a loading candidate point having a high rank.
The present invention has the same effect as that of the sixth aspect.

An article loading simulation program according to a sixteenth aspect is characterized in that the article loading simulation method according to any one of the twelfth to fifteenth aspects is programmed so as to be controllable by a computer.
By programming the article loading simulation method of the present invention according to an OS that can be controlled by a computer, any computer equipped with the OS can be controlled by the same processing method.

A recording medium according to a seventeenth aspect is characterized in that the article loading simulation program according to the sixteenth aspect is recorded in a computer-readable format.
By recording the article loading simulation program on a recording medium in a computer-readable format, the program can be operated anywhere by carrying the recording medium.

  According to the present invention, there is provided an article loading system for simulating a method for efficiently loading a plurality of articles in a storage space and presenting a procedure for loading the articles in the storage space based on the simulation result. Article information input means for inputting data relating to at least the width dimension, depth dimension, height dimension, weight, and number of pieces, spatial information input means for inputting information relating to the accommodation space, article information input means, and spatial information input Based on each information input by the means, simulation means for simulating a method of efficiently loading the article in the accommodation space, and based on the simulation result by the simulation means, the loading position of the article, the loading direction, And a form output means for creating and outputting a form instructing the loading order, and each information is Since the possible input by an operation screen displayed on the Web page, to increase the working efficiency by reducing the work time required for loading, it is possible to realize improvement of loading ratio of the accommodation space.

  Hereinafter, the present invention will be described in detail with reference to embodiments shown in the drawings. However, the components, types, combinations, shapes, relative arrangements, and the like described in this embodiment are merely illustrative examples and not intended to limit the scope of the present invention only unless otherwise specified. .

  FIG. 1 is a block diagram schematically showing a configuration of a cargo loading system (article loading system) in a station according to an embodiment of the present invention. The cargo loading system 100 simulates a method of efficiently loading a plurality of cargoes (articles) in a storage space of a storage means such as a pallet or a container, and loads the cargo into the storage means based on the simulation result. The cargo loading system is roughly divided into customer, sales, reservation, space control, and loading operations. Specifically, it is executed by the air cargo loading simulation system 6.

  When the sales department 3 requests an estimate from the customer 1 through sales activities, or when the customer 1 requests an estimate via the agency 2, the sales department 3 or the agency 2 makes a cargo transportation reservation 4 for the customer 1. As a result, the reservation content is registered in the air cargo loading simulation system 6 as a project (5). At that time, various information regarding the cargo, cargo information regarding at least the width dimension, depth dimension, height dimension, weight, and number of the cargo, and spatial information regarding the storage means are input to the air cargo loading simulation system 6 ( 7). The data is stored in the database (DB) 17 as item data. Based on the various information, the cargo information, and the space information, a method of efficiently loading the cargo in the storage means is simulated (8). The simulation result is displayed on the screen as a 3D image in real time (9). When the optimum simulation is completed, a form instructing the cargo loading position, loading direction, and loading sequence is created and output based on the simulation result (10). Based on the result, an estimate 11 for the number of pallets is created, and the estimate is delivered to the customer 1 via the agency 2 and the sales 3 based on the estimate 11.

  On the other hand, when the customer 1 confirms and approves the estimate, the case is fixed (16) and is input to the air cargo loading simulation system 26 as the loading / case registration 20. Then, various information relating to the confirmed cargo, cargo information relating to at least a width dimension, a depth dimension, a height dimension, a weight and the number of cargoes, and spatial information relating to the storage means are input (21). The data is stored in the DB 17 as item data. Based on the various information, the cargo information, and the space information, a method of efficiently loading the cargo in the storage means is simulated (22). The simulation result is displayed on the screen as a 3D image in real time (23). When the optimal simulation is completed, a form 27 instructing the cargo loading position, loading direction, and loading sequence is created and output based on the simulation result (24). The form 27 is delivered to a worker on site, and the cargo of the customer 1 is loaded in the accommodation means 28 according to the form 27. Then, it is mounted on the aircraft 31 or the truck 29 and transported to the destination. In this embodiment, it is described that the air cargo loading simulation system 6 is used at the time of reservation and the air cargo loading simulation system 26 is used at the time of project confirmation. It doesn't matter. The comprehensive cargo information system 25 is a system that comprehensively manages all the flow and information of the transportation business from online reservation to delivery and further to fare settlement by connecting each station online.

  FIG. 2 is a functional block diagram of the air cargo loading simulation system. The air cargo loading simulation system 60 includes an information input means 50 for inputting various information such as a cargo requester, a cargo type, a transportation destination, and the like, and at least a width dimension, a depth dimension, a height dimension, a weight, and a number of cargos. Freight information input means 51 for inputting data relating to the data, spatial information input means 52 for inputting information relating to the storage means 28, information input means 50, freight information input means 51, and each of the space information input means 52 input by the spatial information input means 52. Based on the information, simulation means 58 for simulating a method for efficiently loading cargo in the storage means 28, and based on the simulation result by the simulation means 58, the cargo loading position, loading direction, and loading sequence are determined. A form output means 55 for creating and outputting the instructed form 57, and a simulation result A display unit 54 that displays 3D (three-dimensional image), a communication unit that is connected to a network and allows each information to be input through an operation screen displayed on a Web page, and a program stored in a storage unit (not shown) A control unit 53 for controlling each unit, an information input unit 50, a cargo information input unit 51, and a database 59 for storing each information input by the spatial information input unit 52, a simulation result, and the like. Configured.

That is, the air freight loading simulation system 60 of this embodiment is managed on the database 59 by inputting various information (information such as the requester, the type of freight, the transportation destination, etc.) of the cargo loaded by the information input means 50. Is done. In addition, information (width dimension, depth dimension, height dimension, weight, number, and the like) related to each cargo and information related to an accommodation space (pallet or container) that accommodates the cargo are input. And the simulation means 58 simulates the method of loading cargo efficiently in the accommodation means based on these information. The simulation result is created and printed by the form output means 55 as a hard copy. The worker loads the article on the storage means at the site while looking at the form 57. In addition, since each information can be input through the operation screen displayed on the Web page, the simulation can be performed at any time regardless of time. As a result, the optimum loading method can be confirmed in advance, and the final result is output by the form output means 55, whereby the work efficiency at the site can be enhanced.
The simulation result is displayed on the display unit 54 as 3D. Therefore, the operator can change the simulation result by finely adjusting the position of the cargo while viewing the image. Thereby, the loading state after the simulation can be finely adjusted to an optimum loading position.

In addition, there are cargoes that can be stacked and those that cannot be stacked. Therefore, in the present embodiment, the loading position, loading direction, and loading quantity of the cargo loaded for each loading stage are created. Thereby, the loading method of cargo can be recognized correctly and rapidly.
Further, the database 59 stores the result of simulation for each type of information. Therefore, when loading cargo, if there is the same loading method stored in the past, there is no need to perform simulation again. Therefore, in the present embodiment, when cargo is loaded, existing information stored in the database 59 is searched, and if there is the same cargo, the simulation result can be edited. Thereby, useless simulation can be eliminated and data can be used effectively.

  FIG. 3 is a flowchart showing a flow from registration of a new case to creation of a form. First, when the system is started up, an initial screen is displayed and an ID and a password for login are input (S1). If the ID and password are correct, the main screen for the new item is displayed, the new item is registered in the DB 59 (S2), the necessary item information is entered (S3), and at least the width, depth, and height of the cargo Cargo information regarding the size, weight, and number is input (S4), and loading space information regarding the accommodation space is input (S5). When the input is completed, the simulation screen is called (S6), and the simulation is started (details of the simulation algorithm will be described later) (S7). When the simulation is completed (YES in S8), the simulation is terminated (S9), and the screen returns to the main screen (S10). Here, in order to finely adjust the simulation result, when a 3D screen for displaying the simulation result three-dimensionally is called (S11), 3D display is started on the screen (S12), and fine adjustment is performed while viewing the screen (S13). . When fine adjustment is completed (YES in S13), 3D display is terminated (S14), and the screen returns to the main screen (S15).

  Next, in order to output the simulation result to the form, the form is called from the main screen (S16). When this is executed, the form is created (S17). When the form creation is completed (YES in S18), the form creation is finished. (S19), the form data is downloaded (S20), the storage location is designated and the form is saved (S21). Then, the form is edited and printed (S22). A screen for registering the form data is called (S23), and a form registration file is selected and uploaded from the screen (S24). As a result, the form registration is finished (S25), the form screen is closed and finished (S26), and the display returns to the main screen (S27). Then, by logging out (S28), the screen returns to the login screen (S29).

  FIG. 4 is a flowchart showing a flow from editing an existing case to creating a form. The same operations will be described with the same step numbers as in FIG. First, when the system is started up, an initial screen is displayed and an ID and a password for login are input (S1). Then, the DB 59 is searched (S30), and if an existing case exists (YES in S31), the case is fixed (S32). Next, the cargo information regarding at least the width dimension, the depth dimension, the height dimension, the weight, and the number of the cargo is edited (S33), and the loading space information regarding the accommodation space is edited (S34). Since the operation after this is the same as the operation after step S6 in FIG.

  FIG. 5 is a flowchart for explaining the 3D cooperation operation from the Web UI. First, a 3D screen is called (S35), and when the screen is displayed, it is operated while looking at the screen (S36). When the operation is completed, the data is saved (S37). Since the saved simulation data is naturally changed, the screen is called again (S38), Web UI “B / U Plan” is executed (S39), and the data is saved (S40). When operating 3D at this stage, the 3D screen is called again (S41), and the process is repeated from step S36. When the simulation is repeated, the simulation is executed (S43), 3D is called, and the process is repeated from step S36.

  6 and 7 are diagrams for explaining the existing BL method of the loading algorithm. Since the BL method is a two-dimensional packing algorithm and is necessary for understanding the BLD method of the present invention, it will be described first. FIG. 6A is a diagram in which numbers are assigned to the cargo to be loaded in the order of loading. In this embodiment, a case where 10 cargoes are loaded on the pallet 40 will be described. FIG. 6B is a view of the pallet 40 as viewed from the side, and the sides are denoted by 41, 42, 43, and 44, respectively. A point a that is at the bottom of the side 41 (Bottom) and is on the left side of the side 44 (Left) is referred to as an initial stacking candidate point. The basis of the algorithm of the BL method is that the numbered cargos are as low as possible (Bottom) as shown in FIG. 6B in order of numbers, and left as much as possible if the loading candidate points (described later) are the same height ( Left).

Hereinafter, a procedure for loading cargo 1 to cargo 10 will be described with reference to FIGS. In addition, in order to simplify description, the shape of a pallet and each cargo is demonstrated as a rectangle.
FIG. 6C: The cargo 1 is loaded so that one vertex of the cargo 1 matches the initial loading candidate point a. At that time, a loading candidate point (hereinafter simply referred to as a candidate point) A where the vertex of the cargo 1 matches the side 44 and a candidate point B where the vertex of the cargo 1 matches the side 41 are generated. Since the candidate point A is Bottom rather than B by the algorithm definition, the priority order of the candidate points is A and B.
FIG. 6D: Cargo 2 is loaded so that one apex of cargo 2 matches candidate point A having a high priority. At that time, a candidate point C where the vertex of the cargo 2 matches the side 44 and a candidate point D where the side of the cargo 1 and the vertex of the cargo 2 match occur. Since the candidate point C is the most Bottom according to the definition of the algorithm, the priority order of the candidate points is C, D, and B.
FIG. 6E: The cargo 3 is loaded so that one vertex of the cargo 3 matches the candidate point C having a high priority. At that time, since there is no candidate point where the apex of the cargo 3 matches the side 44, the previous candidate points B and D remain.
FIG. 6F: The cargo 4 is loaded so that one vertex of the cargo 4 matches the candidate point D having a high priority. At that time, a candidate point E is generated on the side of the cargo 3. Therefore, the candidate points are B and E. Since the candidate point B is the most Bottom according to the algorithm definition, the priority order of the candidate points is B and E.

FIG. 7G: The cargo 5 is loaded so that one vertex of the cargo 5 matches the candidate point B having a high priority. At that time, a candidate point F is generated on the side of the cargo 1. Accordingly, the candidate points are E, F, and G. Since the candidate point F is the bottom according to the algorithm definition, the priority order of the candidate points is F, E, and G.
FIG. 7 (h): The cargo 6 wants to be loaded so that one vertex of the cargo 6 coincides with the candidate point F having a high priority, but the cargo 6 cannot be loaded there. Therefore, the stacking is performed so as to match the candidate point E which is the next priority. At that time, candidate points H are generated on the sides of the cargo 3. Accordingly, the candidate points are F, G, and H. Since the candidate point F is the bottom according to the algorithm definition, the priority order of the candidate points is F, H, and G.
FIG. 7 (i): The cargo 7 is desired to be loaded so that one vertex of the cargo 7 matches the candidate point F having a high priority, but the cargo 7 cannot be loaded at that place. Therefore, the stacking is performed so as to match the candidate point H which is the next priority. At that time, candidate points J are generated on the sides of the cargo 3. Accordingly, the candidate points are F, G, I, and J. Since the candidate point F is the bottom according to the algorithm definition, the priority order of the candidate points is F, J, G, I.

FIG. 7 (j): The cargo 8 wants to be loaded so that one apex of the cargo 8 matches the candidate point F having a high priority, but the cargo 8 cannot be loaded at that place. Therefore, although it is desired to load the cargo to match the candidate point J that is the next priority, the cargo 8 cannot be loaded at that location, so the cargo is loaded to match the candidate point G that is the next priority. At that time, a candidate point K is generated on the side of the cargo 4. Accordingly, the candidate points are J, I, K, and L. Since the candidate point J is the bottom according to the algorithm definition, the priority order of the candidate points is J, K, I, and L.
FIG. 7 (k): The cargo 9 wants to be loaded so that one vertex of the cargo 9 matches the candidate point J having a high priority, but the cargo 9 cannot be loaded there. Therefore, although it is desired to load the cargo 9 so as to coincide with the candidate point K which is the next priority, the cargo 9 cannot be loaded in that place, so the cargo is loaded so as to coincide with the candidate point I which is the next priority. At that time, since there is no candidate point where the apex of the cargo 9 coincides with the side of the cargo 7, the previous candidate points J, K, and L remain. Since the candidate point J is the bottom according to the algorithm definition, the priority order of the candidate points is J, K, and L.
FIG. 7 (l): The cargo 10 wants to be loaded so that one vertex of the cargo 10 matches the candidate point J having a high priority, but the cargo 10 cannot be loaded at that place. Therefore, the stacking is performed so as to match the candidate point K which is the next priority. At that time, a candidate point M is generated in which the apex of the cargo 10 coincides with the side of the cargo 4. According to the algorithm definition, the candidate point J is the most Bottom, so the priority order of the candidate points is J, M, and L. This is the end of loading of all cargo.

FIG. 8 is a diagram for explaining the BLD method of the loading algorithm of the present invention. The BLD method is a three-dimensional application of the two-dimensional packing BL method described above. FIG. 8A is a diagram in which numbers are assigned to the cargoes to be loaded in the order of loading. In the present embodiment, a case where four cargoes are loaded on the container 45 will be described. FIG. 8B is a view of the container 45 as viewed obliquely from the rear, and each side is designated as 46, 47, and 48, respectively. The point a that is the bottom (Bottom), the left side (Left), and the front side is referred to as an initial stacking candidate point. The basics of the algorithm of the BLD method are as follows (numbered) as much as possible in order of numbered cargo as shown in FIG. 8 (b), and left as much as possible if the loading candidate points are the same height (Left). In addition, it is an algorithm that loads as close as possible. In FIG. 8B, the direction is seen from the arrow P side, and the inside is seen from the opposite side of the arrow P.
Hereinafter, a procedure for loading cargo 1 to cargo 4 will be described with reference to FIGS. In addition, in order to simplify description, the shape of a container and each cargo is demonstrated as a rectangular parallelepiped or a cube.

FIG. 8C: Cargo 1 is loaded so that one apex of cargo 1 matches initial loading candidate point a. At that time, a candidate point A where the vertex of the cargo 1 matches the side 47, a candidate point B where the vertex of the cargo 1 matches the side 48, and a candidate point C where the vertex of the cargo 1 matches the side 46 are generated. According to the algorithm definition, candidate point A and candidate point B have the same height, but since candidate point A is the leftmost, the priority order of candidate points is A, B, and C.
FIG. 8D: The cargo 2 is loaded so that one vertex of the cargo 2 matches the candidate point A having a high priority. At that time, candidate points D where the vertex of the cargo 2 matches the side 47 and candidate points E, F where the side of the cargo 1 and the vertex of the cargo 2 match occur. Although the candidate points B, D, and E have the same height according to the definition of the algorithm, since the candidate point D is the leftmost, the priority order of the candidate points is D, E, B, F, and C.

FIG. 8E: The cargo 3 is desired to be loaded so that one vertex of the cargo 3 matches the candidate point D having a high priority, but the cargo 3 cannot be loaded at that place. Therefore, the cargo 3 is desired to be loaded so as to coincide with the candidate point E, which is the next priority, but the cargo 3 cannot be loaded at that location. Therefore, the stacking is performed so as to match the candidate point B which is the next priority. At that time, a candidate point G where the vertex of the cargo 3 matches the side 48 and a candidate point H where the side of the cargo 1 and the vertex of the cargo 3 match occur. Although the candidate points G, D, and E have the same height according to the algorithm definition, since the candidate point D is the leftmost, the priority order of the candidate points is D, E, G, F, H, and C.
FIG. 8 (f): The cargo 4 wants to be loaded so that one vertex of the cargo 4 matches the candidate point D having a high priority, but the cargo 4 cannot be loaded there. Therefore, it is desired to load the vehicle so as to match the candidate point E, which is the next priority, but the cargo 4 cannot be loaded at that location. Therefore, the stacking is performed so as to match the candidate point G which is the next priority. At that time, a candidate point I where the vertex of the cargo 3 matches the side 48 and a candidate point J where the side of the cargo 3 and the vertex of the cargo 4 match occur. According to the algorithm definition, the candidate points D, E, J, and I have the same height, but since the candidate point D is the leftmost, the priority order of the candidate points is D, E, J, I, F, H, C. This is the end of loading of all cargo.

That is, each cargo is given a number according to the order of loading in advance, and is loaded in the order of this number. When the containers 45 are loaded in numerical order, loading is performed based on a loading procedure using a candidate point defined by a predetermined loading standard as a clue. That is, as a loading procedure, the cargo is first loaded with a priority order such as the first bottom of the container 45, the left side as the second reference, and the front side as the third reference. This loading procedure is repeated until all are loaded. Thereby, the loading procedure is standardized, and the calculation speed of the simulation can be increased.
The basic algorithm of this embodiment is performed based on the first to third stacking standards. However, in addition to the standard, simulation is performed based on several conditions. That is, any one of the conditions such as lowering the center of gravity of the article as much as possible, stacking the same article on top, stacking with the same size, or stacking so that the loading rate is increased, etc. Is further simulated. Thereby, the accuracy of the simulation is improved and the loading result can be brought close to the intended loading method.

Each cargo to be loaded has an attribute. For example, a cargo that can only be loaded at the bottom because of its heavy weight, a cargo that can be placed on top of any cargo because it is made of a solid material, or a cargo that can easily be damaged There are cargoes that cannot be carried out and cargo that can be stacked only in the case of the same cargo. By taking these cargo attributes into consideration, accidents such as cargo breakage can be prevented even if the cargo is loaded based on the simulation results.
Some cargoes are configured as a set. For example, there are a display unit and a main body of a personal computer. The cargo as such a set preferably has the same accommodation space for loading. Therefore, in this embodiment, the loading direction is fixed, the position of the cargo is fixed, the inner diameter and outer dimensions of the cargo are taken into consideration, the simulation is performed in consideration of the protrusion, and plural cargos are handled as a set. This is a condition for simulation. As a result, it is possible to easily load a different type of cargo, to increase the loading efficiency at the time of loading, and to shorten the time for unloading the set cargo.

The loading algorithm of the present invention assumes that the container 45 and the cargos 1 to 4 are rectangular parallelepipeds or cubes as conditions. Then, one vertex a included in the bottom surface of the container 45 is set as an initial stacking candidate point. The cargo 1 is first loaded so that one initial vertex included in the bottom surface of the cargo coincides with the initial loading candidate point a. As a result, points where the vertices of the cargo 1 coincide with the sides of the container 45 are generated, and these points are set as the next candidate points. When loading the next cargo 2, it loads so that the vertex contained in the bottom face of the cargo 2 may correspond in order with high priority among each candidate point. Repeat this procedure in sequence until all cargo is loaded. This algorithm is called a BLD method (Bottom Left Depth Algorithm).
There are various shapes of cargo such as long cargo and tall cargo. However, since the container 45 is limited in size, if it is loaded by the BLD method, some cargo that cannot be accommodated in the container 45 will come out even if it is loaded on the highest priority candidate point. In such a case, even if the priority order of the candidate points is high, the cargo is loaded so that the top of the cargo matches the candidate point of the next priority order. As a result, cargo can be loaded as much as possible in descending order of priority.
In the BLD method, the candidate point at the bottom, left side, and front side has the highest priority. Accordingly, the priority order is sequentially determined from the candidate points. That is, when there are a plurality of candidate points included in the bottom face, the next priority order is the next closest candidate point to the left side. As a result, the priority criteria are determined, and the priorities can be sequentially determined.

  FIG. 9 is a flowchart for explaining the operation of the algorithm for searching for the optimum solution of the present invention. First, the order of cargo is determined (S51). At this time, they are arranged at random, but tuning is necessary in consideration of volume order and width order. Next, the stacking is performed according to the arrangement order (see FIG. 10 for the stacking process flow) (S52). Further, the direction of the cargo is changed (S53) with the order of arrangement unchanged, and loaded (S54). This is repeated N times. Next, the arrangement order of the two cargoes is changed (S55) and loaded (S56). This is repeated N (N-1) / 2 times. Then, this flow is repeated for the designated number of trials, and the one with the maximum loading rate is output as a result (S57). The above operation is repeated a specified number of times.

  FIG. 10 is a flowchart of the stacking process according to steps S52, S54, and S56 of FIG. A cargo is selected according to the order of the cargo (S60). The selected cargo is loaded on the ULD (S61). At that time, a loading candidate point that can be loaded is found and loaded (S62). It is determined whether or not the loaded cargo can be loaded on the selected ULD (S63). If the ULD cannot be loaded (NO in S63), the loading to the next ULD is attempted and repeated until a loadable ULD is found (S66 to S68). If loading is possible in step S63 (YES in S63), loading is performed on the ULD (S64), and the loading candidate point is updated (S65). Attempt to load all cargo in this flow.

  FIG. 11 is a detailed flowchart of the rotation process according to step S53 of FIG. First, one cargo is selected from N cargoes, and the L × W plane is rotated (S71). There are N ways to choose at this time. Next, the loading volume V ′ at that time is calculated (S72), compared with the original volume V (S73), and when the loading rate decreases, it is returned to the original direction and another cargo is rotated ( S80). If the loading rate increases in step S73 (YES in S73), the original volume V is updated (S74), and the direction of one cargo is rotated (S76). Then, the loading volume V ′ at that time is calculated (S77), compared with the original volume V (S78), and when the loading rate decreases, all are returned to the original direction and another cargo is rotated. (S80). If the loading rate increases in step S78 (YES in S78), the original volume V is updated (S79) and repeated. This flow is repeated N times, with the result that the loading rate is the maximum.

  FIG. 12 is a detailed flowchart of the order change in step S55 of FIG. First, two cargoes are selected from N cargoes, and the order is changed (S91). At this time, there are N (N-1) / 2 ways to select. Next, the loading volume V 'at that time is calculated (S92), compared with the original volume V (S93), and when the loading rate decreases, it is returned to its original state and another cargo is replaced (S96). If the loading rate increases in step S93 (YES in S93), the original volume V is updated (S94), and the order of the two cargoes is changed (S96). Then, the loading volume V 'at that time is calculated (S97), compared with the original volume V (S98), and when the loading rate decreases, the arrangement order of all the replaced cargoes is restored (S101). If the loading rate increases in step S98 (YES in S98), the original volume V is updated (S99) and repeated. This flow is repeated N (N-1) / 2 ways, and the result is the one with the maximum loading rate.

  In the above description, the case where aircraft cargo is loaded on a pallet or container has been described as an example. However, it goes without saying that the present invention can also be applied when cargo is loaded on a truck, a freight car or a ship. .

It is a block diagram showing typically composition of a cargo loading system in a station concerning one embodiment of the present invention. It is a functional block diagram of an air cargo loading simulation system. It is a flowchart which shows the flow from registration of a new case to form creation. It is a flowchart which shows the flow from the edit of the existing case to report creation. It is a flowchart explaining the operation | movement linked | linked by 3D from WebUI. It is FIG. (1) explaining BL method of a loading algorithm. It is FIG. (2) explaining BL method of a loading algorithm. It is a figure explaining the BLD method of the loading algorithm of this invention. It is a flowchart explaining operation | movement of the algorithm which searches for the optimal solution of this invention. 10 is a flowchart of a stacking process according to steps S52, S54, and S56 of FIG. 10 is a detailed flowchart of a rotation process according to step S53 in FIG. 10 is a detailed flowchart of the order change according to Step S55 of FIG. 9.

Explanation of symbols

  6, 26, 60 Air cargo loading simulation system, 17, 59 database, 50 information input means, 51 cargo information input means, 52 spatial information input means, 53 control means, 54 display unit, 55 form output means, 56 communication means, 57 forms, 58 simulation means, 100 cargo loading system

Claims (17)

An article loading system for simulating a method of efficiently loading a plurality of articles in a storage space and presenting a procedure for loading the articles in the storage space based on the simulation result,
Article information input means for inputting data relating to at least the width dimension, the depth dimension, the height dimension, the weight, and the number of the articles;
Space information input means for inputting information about the accommodation space;
Simulation means for simulating a method of efficiently loading the article in the accommodation space based on the information input by the article information input means and the space information input means;
A form output means for creating and outputting a form instructing a loading position and a loading direction of the article, or a loading position, a loading direction, and a loading order of the article based on a result of simulation by the simulation means; Prepared,
The information loading system according to claim 1, wherein each piece of information can be input through an operation screen displayed on a Web page. The simulation means performs loading based on a loading procedure using a loading candidate point defined by a predetermined loading standard as a clue when loading in order of a number indicating a loading order given to each article.
The first reference is the bottom of the accommodation space, the second reference is either the left side or the right side, and the third reference is either the front side or the rear side in order. The article loading system according to claim 1, wherein the loading candidate point is determined as a loading reference, and the loading procedure is repeated until all the articles having the numbers are loaded.   In addition to the loading standard, loading the article so that the center of gravity of the article is lowest, or loading the same article as the ease of loading, or loading so that the loading direction and size of the article are aligned. The article loading system according to claim 2, wherein at least one of loading and loading so as to increase a loading rate is taken into consideration.   The algorithm of the simulation means assumes that the shape of the article is a rectangular parallelepiped or a cube, sets one of the vertices included in the bottom surface of the accommodation space as an initial loading candidate point, and includes any one included in the bottom surface of the article to be loaded first. When stacking so that one apex coincides with the initial stacking candidate point, and the point at which any apex of the article coincides with the side of the accommodation space is set as the next stacking candidate point, 4. The article according to claim 2 or 3, wherein a procedure for loading the next article so that the apex of the next article coincides with a loading candidate point having the highest priority among the next loading candidate points is repeated. Loading system.   When the algorithm of the simulation means is unable to load the next article so that the vertex of the next article matches the loading candidate point having the highest priority among the next loading candidate points, The article loading system according to claim 2, 3 or 4, wherein loading is performed so that a vertex of the next article matches a loading candidate point.   Among the stacking candidate points, the stacking candidate point that is located at the bottom of the accommodation space, located on either the left side or the right side, and located on either the front side or the back side is the stacking candidate with the highest priority. 6. The article loading system according to claim 4, wherein the article loading system is a point.   The simulation means has an attribute that only the bottom stage can be loaded, an attribute that any article can be placed on top, an attribute that cannot be placed on top, and an attribute that can be superimposed only in the case of the same article The article loading system according to claim 4 or 5, characterized in that:   The simulation means performs the simulation by fixing the loading direction of the article, fixing the position of the article on the three-dimensional screen, simulating the loading position in consideration of the inner diameter dimension and the outer dimension, and considering the protrusion. 6. The article loading system according to claim 4, wherein the simulation and the handling of a plurality of articles as a set are a condition and a possible operation that are considered in the simulation.   The simulation means displays the simulation result in real time as a three-dimensional image, and the simulation result can be changed by arbitrarily adjusting the three-dimensional image on the operation screen. Article loading system described in 1.   2. The article stacking system according to claim 1, wherein the form output unit displays a stacking position, a stacking direction, and a stacking quantity of articles to be stacked in each of the accommodation spaces for each stacking stage.   The article loading system according to any one of claims 1 to 10, further comprising a database that stores a result of simulation performed by the simulation unit, wherein the simulation result stored in the database can be edited. An article loading simulation method for efficiently loading a plurality of articles in a storage space,
When loading in the order of the number indicating the loading sequence assigned to each article, performing loading based on the loading procedure using the loading candidate points defined by a predetermined loading standard as a clue,
The first reference is the bottom of the accommodation space, the second reference is either the left side or the right side, and the third reference is either the front side or the rear side in order. The article loading simulation method, wherein the loading candidate point is determined as a loading reference, and the loading procedure is repeated until all of the numbered articles are loaded.   Assuming that the shape of the article is a rectangular parallelepiped or a cube, one of the vertices included in the bottom surface of the accommodation space is an initial loading candidate point, and any one vertex included in the bottom surface of the article to be loaded first is the initial loading. When loading the next article, the next candidate stacking point is used as the next candidate loading point. 13. The article loading simulation method according to claim 12, wherein the loading procedure is repeated so that the apex of the article coincides with the loading candidate point having the highest priority among the items.   When it is impossible to stack the next article so that the vertex of the next article matches the highest loading candidate point among the next loading candidate points, the next priority loading candidate point The article loading simulation method according to claim 12 or 13, wherein the article is loaded so that the vertices of the article coincide with each other.   Among the stacking candidate points, the stacking candidate point that is at the bottom of the accommodation space and is located on either the left side or the right side and located on either the front side or the back side is the stacking candidate with the highest priority. 15. The article loading simulation method according to claim 12, 13, or 14, characterized in that the point is a point.   An article loading simulation program in which the article loading simulation method according to any one of claims 12 to 15 is programmed to be controllable by a computer.   A recording medium in which the article loading simulation program according to claim 16 is recorded in a computer-readable format.

Images