JPH11175595A - On-board loading method and vehicle delivery planning system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To prepare a vehicle delivery plan for guaranteeing loading efficiency and transportation quality. SOLUTION: This system is provided with a car delivery planning part for preparing a plan by loading shipping packages in the order of a shape group loaded at the lowermost stage of a vehicle so that the upper limit of the loading amounts of the shape group cannot be exceeded based on the loading reference data of each shape group of packages stored in a loading reference data storing part, vehicle total loading amount upper limit data related with a vehicle stored in a vehicle total loading amount upper limit data storing part, and shipping package data inputted to a shipping package data storing part, and repeating this processing until all packages to be loaded for each shape group are exhausted.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of loading a vehicle and a vehicle allocation planning system, and more particularly, to a vehicle allocation plan capable of improving loading efficiency and guaranteeing transportation quality. The present invention relates to a vehicle loading method and a vehicle allocation planning system.

[0002]

2. Description of the Related Art Materials such as exterior walls for home use have various shapes and sizes in packing at the time of shipment, and the order of loading on vehicles is directly determined by transport quality (for example, cracks or chips during transportation, etc.). Damage) is greatly affected, and therefore, a dispatch plan that guarantees the transport quality and the possibility of being mounted on an actual vehicle is important.

[0003] As a conventional vehicle mounting method and vehicle allocation planning system, for example, there is one disclosed in Japanese Patent Application Laid-Open No. 4-294451. In short, the on-vehicle method and the vehicle allocation planning system disclosed in the above publication are configured to distribute members up to the maximum loadable capacity of the vehicle in consideration of only whether members can be stacked.

[0004]

However, the above-mentioned conventional on-vehicle method and dispatch planning system have the following problems.

That is, as described above, when distributing the members to the maximum loadable amount of the vehicle considering only the possibility of stacking the members, the members are loaded even if they are within the range of the mountable amount of the vehicle. Depending on the packing style of the members, there is a possibility that the vehicle cannot be actually loaded into the vehicle, or a vehicle allocation plan cannot guarantee the transport quality.

SUMMARY OF THE INVENTION The present invention has been made in view of the above circumstances, and has as its object to provide a vehicle mounting method and a vehicle allocation planning system capable of creating a vehicle allocation plan that can guarantee loading efficiency and transportation quality.

[0007]

According to a first aspect of the present invention, a package is classified into shape groups in advance according to similar shapes and sizes, and the order of loading for each shape group and the loading on a vehicle. The upper limit of the quantity is determined in advance, and the packages to be shipped are loaded at the bottom of the vehicle while not exceeding the upper limit of the loading capacity of each shape group, and not exceeding the upper limit of the total loading capacity of the vehicle. The vehicle mounting method is characterized in that loading is performed such that the vehicle is sequentially stacked on the vehicle from a shape group in an earlier loading order to a slower shape group loaded on the uppermost stage.

According to a second aspect of the present invention, the packages are classified into the shape groups as described above, and the loading order of each shape group and the upper limit of the loading amount for the vehicle are determined in advance. Efficient loading into the vehicle can be achieved by carrying out the on-boarding method and planning the dispatch while keeping the upper limit of the loading capacity of each shape group and not exceeding the upper limit of the total loading capacity of the vehicle. Possible,
In addition, a dispatch plan that can guarantee the transport quality is created.

[0009]

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is a configuration diagram according to an example of an embodiment of the present invention, and FIG. 2 is a flowchart showing a processing flow performed inside a vehicle allocation planning unit.

As shown in FIG. 1, the vehicle dispatching planning system according to the vehicle mounting method and the vehicle dispatching planning system according to the present invention includes loading reference data for storing loading reference data for each shape group, which will be described later, in packing of a member such as a house outer wall. Storage unit 1
A vehicle total loading capacity upper limit data storage unit 2 for storing total vehicle loading capacity upper limit data for the vehicle, a shipping packaging data storage unit 3 for storing input shipping packaging data, and a vehicle allocation plan created from the above data. And a vehicle allocation plan data storage unit 5 for storing vehicle allocation plan data obtained by the vehicle allocation planning unit 4.

The loading reference data storage unit 1 stores the packing of members in a shape group classified according to similar packing shape and size, and a loading order for each shape group obtained based on the floor area of the vehicle. And the upper limit of the loading amount of the vehicle for each shape group according to the loading order are stored as loading reference data.

Here, the loading order of the shape groups is as follows: "Shape group that is large in size and has no effect even if another package is placed on it"; If the size is small, other packages can be placed on top of it. "Finally," three-dimensional shape that cannot have other packages on itself. "

The above-mentioned vehicle allocation planning unit 4 includes loading reference data for each package shape group stored in the loading reference data storage unit 1 and a vehicle for the vehicle stored in the vehicle total loading amount upper limit data storage unit 2. On the basis of the total loading capacity upper limit data and the shipping packing data input to the shipping packing data storage unit 3, a vehicle allocation plan is created as follows.

That is, first, shipping packages are stacked in order from the shape group to be loaded at the bottom of the vehicle so as not to exceed the upper limit of the loading capacity of the shape group. Proceeding to the stacking of shipping packages of the next loading group in order, and if the total weight of the vehicle exceeds the upper limit or the loading of the last loading group in the loading order is completed, the next vehicle Repeat the above until there are no more packages to load. The above is represented by a processing flow as shown in FIG.

In FIG. 2, reference numeral 6 denotes the start of the processing flow, 7 denotes an execution instruction for initializing the vehicle, 8 denotes judgment of the presence or absence of packing, 9 denotes an execution instruction for initializing the shape group, and 10 denotes the shape. Judgment of presence / absence of shipping packages belonging to the group, 11: judgment of whether or not the total load capacity of the vehicle has been exceeded, 12: judgment of whether or not the load upper limit has been exceeded, 13: an execution instruction for fixing the loading, 1
Reference numeral 4 denotes an execution instruction for changing the vehicle, and reference numeral 15 denotes the end of the processing flow.

Next, the operation will be described.

First, the packing of the members is classified according to the packing shape and size to form a shape group. Next, the loading order of each shape group is obtained based on the floor area of the vehicle and the like, and the shape group according to the loading order is obtained. An upper limit of the loading amount for each vehicle is determined, loading reference data is created, and the loading reference data is stored in the loading reference data storage unit 1.

Here, the loading order is as follows: "shape group which is large in size and has no effect even if a package is placed on top"; You can put other packing on it. "
… Finally, it is decided to say, "Three-dimensional shape that cannot have other packaging on itself."

Similarly, the vehicle total loading capacity upper limit data for the vehicle is stored in advance in the vehicle total loading capacity upper limit data storage unit 2.

When the shipping packing data is input and stored in the shipping packing data storage unit 3, the dispatch planning unit 4
Loading reference data for each packing shape group stored in the loading reference data storage unit 1, vehicle total loading amount upper limit data for vehicles stored in the vehicle total loading amount upper limit data storage unit 2, and shipping packing data storage unit First, based on the shipping packing data input to 3, the shipping packing is first stacked in order from the shape group to be loaded at the bottom of the vehicle so as not to exceed the upper limit of the loading amount of the shape group, and the shape group is When the maximum load capacity of the vehicle is exceeded, the stacking of shipping packages of the next shape group in the loading order is sequentially performed, and the total load weight of the vehicle is exceeded or the last shape group in the loading order is stacked. In such a case, the above is performed on the next vehicle, and the above is repeated until there is no more packing to be loaded, and a vehicle allocation plan is created.

The vehicle allocation plan data storage unit 5 stores the vehicle allocation plan data obtained by the vehicle allocation planning unit 4.

By doing so, a vehicle allocation plan that can be actually loaded on the vehicle and that can guarantee the transport quality can be created.

Hereinafter, the above will be described more specifically. Here, FIG. 3 is an example of loading according to the vehicle assignment plan of the present invention, and FIG. 4 is an example of loading when priority is given to loading efficiency as a comparative example. 3 and 4
In the figure, 16 and 17 are vehicles.

For example, as shown in Table 1, a package having a large size and a loading coefficient of 20 on which anything can be placed, and another package having a size not large but smaller than itself are placed thereon. With a loading factor of 7,
It is assumed that there is a package with a loading coefficient of 5 on which nothing is placed.

[0026]

[Table 1] In this case, first, the packing having the loading coefficient of 20 is classified into the shape group A, the packing having the loading coefficient of 7 is classified into the shape group B, and the packing having the loading coefficient of 5 is classified into the shape group C. The loading order is 1, the loading order of the shape group B is 2, the loading order of the shape group C is 3, and the upper limit of the loading amount of the shape group A is 40.
It is assumed that the upper limit of the loading capacity of the packages of the shape group B is 28, and the upper limit of the loading capacity of the packages of the shape group C is 20. Then, the loading reference data as shown in Table 2 is created and stored in the loading reference data storage unit 1.

[0027]

[Table 2] At the same time, the upper limit of the total load capacity of the vehicle is determined. In this case, the upper limit of the total vehicle loading capacity is 95, so that the upper limit data of the total vehicle loading capacity as shown in Table 3 is created and stored in the upper total vehicle loading data storage unit 2.

[0028]

[Table 3] Then, four packages of the shape group A and the shape group B
In the case where eight packages are shipped and eight packages of the shape group C are shipped, the shipping packing data shown in Table 4 is input, and the input shipping packing data is stored in the shipping packing data storage unit 3. .

[0029]

[Table 4] Then, the vehicle allocation planning unit 4 calculates the loading reference data for each package shape group stored in the loading reference data storage unit 1 and the vehicle total loading amount upper limit for the vehicle stored in the vehicle total loading amount upper limit data storage unit 2. Based on the data and the shipping packing data input to the shipping packing data storage 3, a vehicle allocation plan is created as follows in accordance with a processing flow as shown in FIG.

1) Processing is started (Start 6).

2) Initialization necessary for the first vehicle is performed by the execution command 7.

3) Next, in judgment 8, it is confirmed whether or not any packages to be loaded remain. At first, since a total of 16 packages remain as they are, the process proceeds to the next execution instruction 9.

4) The loading order n = 1 by the execution instruction 9
Then, initialization necessary for processing the shape group A is performed.

5) Thereafter, in judgment 10, the loading order n = 1
Check whether the package of (shape group A) remains. Since eight packages remain in the shape group A, the process proceeds to the next judgment 11.

6) In judgment 11, it is checked whether or not the upper limit of the loading capacity of the shape group A on the vehicle when one shape group A is loaded in one package. Check if there is any. In this case, since both are not exceeded, the process proceeds to the next execution instruction 13.

7) 1 of the shape group A by the execution instruction 13
It is determined that the package is to be loaded on the vehicle, the shape group and the planned amount for each vehicle are updated, and the process returns to the determination 10.

8) Thereafter, in the same manner as described above, the process proceeds to the judgment 10, the judgment 11, the judgment 12, and the execution instruction 13, and the packing of the shape group A is further determined by loading one more packing (two packages in total), and the process returns to the judgment 10.

9) Next, in the same manner as described above, the procedure proceeds from decision 10 to decision 11 and decision 12, but in decision 12, the shape group A
Because the total loading upper limit of the vehicle exceeds the upper limit, the process returns to the determination 8, the loading order n = 2 is set by the execution command 9, and initialization necessary for processing the shape group B is performed.

10) Then, in the same procedure as described above, the shape group B is determined to have four packages, and the process returns to the judgment 10 and proceeds to the judgments 11 and 12. When the judgment 12 proceeds, the total load of the vehicles in the shape group B exceeds the upper limit. Therefore, the process returns to the judgment 8, the loading order n is set to n = 3 by the execution command 9, the initialization for processing the shape group C is performed, and the above is repeated.

11) Shape group C in the same manner as above
When 4 packages are fixed and the process returns to the judgment 10 and then proceeds to the judgment 11, the judgment results in the judgment 11 that the total loading upper limit 95 of the vehicle is exceeded.
The process proceeds to the execution command 14 and the execution command 7, and the execution command 7 performs necessary initialization for the second vehicle.

12) Thereafter, the same processing as described above is performed for the second vehicle, and loading of 2, 4, and 4 packages is determined for each of the two vehicles having the shape groups A, B, and C. .

13) Thereafter, it is confirmed in decision 10 that the packaging of the shape group C has been lost, and it is confirmed in decision 8 that all the packaging has been removed, and the processing is terminated (end 15).

As a result, vehicle allocation plan data as shown in Table 5 obtained by the vehicle allocation planning unit 4 is obtained, and the vehicle allocation planning data is output to the vehicle allocation planning data storage unit 5 and stored.

[0044]

[Table 5] Specifically, two vehicles 16 and 17 are required, and two packages of the shape group A are provided for each vehicle 16 and 17.
The vehicle allocation plan is to load four packages of the shape group B and four packages of the shape group C, and as shown in FIG. 3, it is possible to actually load the vehicles 16 and 17 and to guarantee the transportation quality. A dispatch plan is created.

On the other hand, as in the prior art, the vehicle 16,
In the case of carrying out a vehicle allocation plan in which the packages are loaded to just below the upper limit of the total loading capacity on the vehicle 17, the first vehicle 16 is loaded with three packages having a loading coefficient of 20 as shown in FIG. Next, by loading five packages having a loading coefficient of 7 to make the loading capacity (20 * 3 + 7 * 5 = 95) equal to the total loading upper limit, the second vehicle 17 has a loading coefficient of 20 The remaining one of the packages is loaded, then the remaining three packages with a loading factor of 7 are loaded, and further, four packages with a loading factor of 5 are loaded. As a result, the second vehicle 17 has a loading capacity of Is 20+
Since 7 * 3 + 5 * 4 = 61, and four packages with a loading coefficient of 5 are not loaded, loading is impossible with two vehicles 16 and 17, or a vehicle allocation plan that requires three vehicles is required. I will.

It should be noted that the present invention is not limited to the above-described embodiment, and various changes can be made without departing from the scope of the present invention.

[0047]

As described above, according to the on-vehicle method and the vehicle allocation planning system of the present invention, it is possible to obtain an excellent effect that a vehicle allocation plan that can improve the loading efficiency and guarantee the transportation quality can be created.

[Brief description of the drawings]

FIG. 1 is a configuration diagram according to an example of an embodiment of the present invention.

FIG. 2 is a flowchart showing a processing flow performed inside a vehicle allocation planning unit.

FIG. 3 is an example of loading according to the vehicle allocation plan of the present invention.

FIG. 4 is an example of loading when loading is performed with priority given to loading efficiency.

[Explanation of symbols]

 1 Loading reference data storage unit 2 Vehicle total loading capacity upper limit data storage unit 3 Shipping packing data storage unit 4 Distribution planning unit 5 Distribution planning data storage unit

Claims (2)

[Claims] A package is classified into shape groups in advance according to similar shapes and sizes, and a loading order and an upper limit of a loading amount for a vehicle are determined in advance for each shape group, and packages to be shipped are determined for each shape group. From the shape group with the fastest loading order at the bottom of the vehicle to the slow shape group with the highest load, without exceeding the upper limit of the loading capacity and the upper limit of the total loading capacity of the vehicle. And loading them sequentially on the vehicle. 2. A shape group in which shipping packages are classified according to similar shapes and sizes, a loading order for each shape group obtained based on the floor area of the vehicle, and a vehicle for each shape group according to the loading order. A loading reference data storage unit that stores the upper limit of the loading capacity for the vehicle as loading reference data, a total vehicle loading capacity upper storage unit that stores the total loading capacity data of vehicles, and a shipment that stores the input shipping packaging data. A packing data storage unit, loading reference data for each package shape group stored in the loading reference data storage unit, and vehicle total loading capacity upper limit data for the vehicle stored in the vehicle total loading capacity upper limit data storage unit. Based on the shipping packing data input to the shipping packing data storage unit, in order from the shape group loaded at the bottom of the vehicle, Stack the shipping packages so as not to exceed the upper limit, and when the loading limit of each shape group is exceeded, proceed to the stacking of shipping packages of the next loading group in order, and set the upper limit of the total loading weight of the vehicle. When the stacking of the last shape group in the loading order is completed, the above procedure is performed on the next vehicle, and the above is repeated until there is no more packing to be loaded. A dispatch planning system characterized by the following.