JP2003285931A - Transportation plan creating method and its system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide method and system capable of creating a transportation plan bearing with actual operation allowing a human expert also to determine good or bad of a transportation schedule created by the system, by automatically and gradually creating a schedule having high optimality from a schedule close to a transportation schedule created by a manpower. <P>SOLUTION: In creating the transportation schedule, the system receives a positional information of a physical distribution center and distribution destination, an amount of baggage to be transported, a baggage information including time limit, namely a deadline of arrival time of a transportation vehicle at the distribution destination, a transportation vehicle information including load limit of the transportation vehicle, and a basic route information for defining a transportation route used for creating the schedule of the transportation vehicle. The transportation route of the transportation vehicle is created using the route registered in the basic route information. <P>COPYRIGHT: (C)2004,JPO

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a technique for creating a schedule in the field of logistics using a computer, and in particular, a transportation plan that can be put to practical use so that a human expert can judge the quality of the transportation schedule created by the system. It relates to methods and systems that can be created.

[0002]

2. Description of the Related Art As a transportation schedule creation technology for a physical distribution system, a technology has already been developed for creating an efficient tour plan for a customer existing in a certain area, which corresponds to the so-called traveling salesman problem or vehicle routing problem. (For example, Japanese Patent Laid-Open No. 5-135070 “delivery scheduling device”).

Further, for example, in Japanese Unexamined Patent Publication No. 10-124588, "Scheduling device based on geographic information", an optimal schedule is created by using a neural network together with geographical information to determine the shortest route between customers. There is. Japanese Unexamined Patent Publication No. 8-115495 “Automatic vehicle allocation device” realizes a method of clustering a large number of delivery destinations and creating a transportation route in each cluster. Further, in Japanese Patent Laid-Open No. 9-305669, "Delivery Planning Method and Device", a method of creating an efficient vehicle allocation plan while complying with the load capacity constraint and operating time constraint of a truck is realized.

[0004]

A transportation schedule using a truck or the like has hitherto been prepared by a human expert. This expert's work not only cuts transportation costs, but also considers various conditions such as material inventory, work volume of logistics department, details of roads used for transportation, driver's load, etc. The schedule has been decided. However, although the above-mentioned various techniques use a good optimization algorithm to minimize the transportation cost, the transportation schedule thus created is not always suitable for actual operation. In addition, even if a human expert tries to judge whether such a schedule can withstand actual operation, the mechanically created transportation schedule is significantly different from the transportation schedule that was manually created by humans, and the judgment cannot be made. It was difficult.

According to the present invention, by starting from a schedule close to a manually created transportation schedule, a highly optimal schedule is automatically created step by step, so that even a human expert can create a transportation created by the system. An object of the present invention is to provide a method and system capable of creating a transportation plan that can withstand actual operation so that the quality of a schedule can be determined.

[0006]

In order to achieve the above-mentioned object, in the present invention, the transportation schedule which has been actually used in the past is gradually improved to create a transportation schedule with higher optimality. In other words, at the initial stage, a constraint condition will be introduced that creates a schedule equivalent to a manually created transportation schedule that was conventionally used in the schedule creation system. By introducing this constraint condition, the system automatically creates a transportation schedule similar to the transportation schedule that was actually used in the past. In the next step, weak constraints are removed from the constraints to create a more optimized schedule. By gradually relaxing this constraint condition, a schedule with a high optimality is automatically created step by step, starting from a schedule close to a transportation schedule that was conventionally created manually. By creating such a schedule having a high degree of optimality, a human expert can judge the quality of the transportation schedule created by the system.

In order to realize the above-mentioned stepwise transportation schedule creation, the invention according to claim 1 uses a system having at least an input / output device, a processing device and a storage device to connect between a distribution center and a transportation destination base. A transportation plan creation method for creating a transportation schedule for a vehicle that transports luggage by means of a location information registration step for inputting location information, which is the location information of the distribution center and the transportation destination location, the amount of luggage for each luggage, and the transportation destination. Baggage information registration step of inputting baggage information including location and delivery time constraint, transportation vehicle information registration step of inputting transportation vehicle information including limit information of load capacity of transportation vehicle, and basic travel route of transportation vehicle Restriction information and basic usage route information including the level of usage, and the travel route usage information registered in the basic usage route information used when creating the transportation schedule. A basic route information registration step of inputting a route, a transportation schedule creation step of creating a transportation schedule of a transportation vehicle from the information input by the step, and a transportation schedule output step of outputting the created transportation schedule. And

According to a second aspect of the present invention, in the transportation plan creating method according to the first aspect, the schedule creating step includes the use level input in the travel route registered in the basic route information. It is characterized in that the transportation schedule of each transportation vehicle is created by using only the traveling route of a higher utilization level.

According to a third aspect of the present invention, in the transportation plan creating method according to the first aspect, the schedule creating step is a travel route having the highest utilization level among the travel routes registered in the basic route information. To create a transportation schedule, and then create a transportation schedule that also uses a travel route whose usage level is one step lower than that usage level. It is characterized in that expansion is performed stepwise up to the input use level, a plurality of transportation schedules are created thereby, and differences between the transportation schedules are displayed together with schedule results.

According to a fourth aspect of the present invention, a transportation for creating a transportation schedule of a vehicle for transporting luggage between a distribution center and a transportation destination base using a system having at least an input / output device, a processing device, and a storage device. A plan creation device, which is a base information registration means for inputting base information, which is positional information of a distribution center and a transportation destination base, and a package information including a package amount of each package, a transportation site, and a delivery time constraint. Luggage information registration means, and transportation vehicle information registration means for inputting transportation vehicle information including limit information on the load capacity of the transportation vehicle,
Basic route information including the basic travel route restrictions of the transportation vehicle and its usage level, and basic route information registration means for inputting the usage level of the travel route registered in the basic route information used when creating the transportation schedule, It is characterized by further comprising: a transportation schedule creating means for creating a transportation schedule of a transportation vehicle from the information input by the means; and a transportation schedule outputting means for outputting the created transportation schedule.

According to a fifth aspect of the present invention, in the transportation plan creating apparatus according to the fourth aspect, the schedule creating means includes the use level input in the travel route registered in the basic route information. It is characterized in that the transportation schedule of each transportation vehicle is created by using only the traveling route of a higher utilization level.

According to a sixth aspect of the present invention, in the transportation plan creating apparatus according to the fourth aspect, the schedule creating means has the highest utilization level of the travel routes registered in the basic route information. To create a transportation schedule, and then create a transportation schedule that also uses a travel route whose usage level is one step lower than that usage level. It is characterized in that expansion is performed stepwise up to the input use level, a plurality of transportation schedules are created thereby, and differences between the transportation schedules are displayed together with schedule results.

[0013]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings. In the present embodiment, it is assumed that a plurality of vehicles (trucks, etc.) belonging to the distribution center leave the distribution center and deliver a package to a plurality of locations. Of course, it can also be applied to a schedule creation in which a plurality of vehicles (trucks, etc.) circulate a collection destination base to collect a package at a distribution center.

FIG. 1 is an overall configuration diagram of the system of this embodiment. This system includes an input device (101), an output device (102) such as a printer, and a display device (10) such as a display.
3), a processing device (104), and a storage device (109). The processing device (104) executes a series of programs (105) including an input processing unit (106), a transportation schedule creation unit (107), and a result output unit (108). In addition, the storage device (109) stores base information (110), baggage information (111), transportation vehicle information (112), distance table (113), road map (114), basic route information (11).
5) and transportation schedule information (116) created from these are stored. In addition, genetic information (117) and vehicle management information (118) used to create transportation schedules.
Is also stored.

FIG. 2 shows an example of information stored in the storage device (109) of FIG.

The location information (110) of FIG. 2A stores the location information of the distribution center and the delivery destination location of the package. Specifically, a base ID that uniquely identifies a distribution center or a delivery base.
(201), base name (202), base address (203), and latitude (204) and longitude (205) indicating the position of the base are stored.

In the package information (111) of FIG. 2B, information on each package to be transported is stored. Specifically, the luggage index (206) that is sequentially assigned to each luggage from 1
A package ID (207) that uniquely identifies the package, a site ID (208) that indicates the delivery destination of the package, a load amount (209), and a time constraint (210 that indicates the designated time zone for collecting and delivering the package at the delivery destination (210). ) Is stored. In addition, whether the item is collected or delivered is also stored in the package information (111).

The transportation vehicle information (112) shown in FIG. 2 (c) stores information on the capacity and limit of the available vehicle loading weight and the operating time of the vehicle. Specifically, in order to uniquely identify the vehicle, the vehicle number (21
1), the payload limit for that type of vehicle (212), and
The departure time (213) of the vehicle from the distribution center and the end time (214) of finishing the delivery work are stored.

The distance table (115) of FIG. 2 (d) stores the information about the travel distance / time of a transportation vehicle such as a truck between bases, which is necessary for the transportation schedule creation.
Specifically, the departure base ID (215) and the arrival base ID (216),
The distance (217) between the bases and the required travel time (218) between the bases are stored.

The basic route information (116) in FIG. 2 (f) stores constraint conditions used when creating a transportation schedule in order to create a schedule equivalent to a transportation schedule conventionally created manually. Transportation Schedule Creation Department (10
7) creates a travel route of the transportation vehicle based on the route registered in the basic route information (116). The basic route information (116) consists of the base ID (219), the front base ID (220) that patrols before the base, and the rear base ID that patrols after the base.
(221), the priority of the basic route (222), and the level (223) to which the basic route is applied.

FIG. 3 shows the transportation schedule creation unit (1
It is a figure which shows an example of the transportation schedule information (115) created by 07). The transportation schedule information (115) stores information indicating the location where the vehicle travels in the transportation schedule created by the method according to the present invention and the traveling order of the vehicle. Specifically, the vehicle number (301), the number of vehicle patrol bases (302), the base ID of the delivery destination base (303), the arrival time at that base (304), and the package to be transported to or from that base. The index (305) of is stored. As shown by 306 to 308, a plurality of sets of the destination ID of the delivery destination base, the arrival time at the base, and the index of the package to be transported to and from the base are stored side by side. In addition, total baggage (309) and total mileage
It stores (310).

The gene information (117) in FIG. 4 (a) shows an example of the gene expression used in the transportation schedule creation by the genetic algorithm used in the transportation schedule creation unit (107). The gene stores a luggage index (401, 402, ..., 403) of luggage to be delivered by a transportation vehicle such as a truck.

The vehicle management information (118) of FIG. 4 (b) stores information indicating the correspondence of the gene information (116) used by the transportation schedule creation unit (107) to the vehicle. Gene information (116)
Is a one-dimensional array of luggage indexes, and which luggage is loaded in which vehicle is not recorded. In the vehicle management information (118), the following information is stored for each vehicle in order to indicate which part of the gene information (117) the luggage loaded in each vehicle corresponds to.
That is, a vehicle number (404) that uniquely identifies the vehicle, a gene start position (405) that indicates the start position on the gene of the luggage loaded in the vehicle, and a gene end position (40) that indicates the end position.
Store 6).

FIG. 5 is a flow chart showing an outline of the program (105) executed by the processing device (104) in FIG. First, in the input processing step (501), the user inputs information necessary for creating a transportation plan such as site information (110), baggage information (111), transportation vehicle information (112), and basic route information (115). input. Details of this processing will be described later with reference to FIG.
In the next transportation schedule creating step (502), an optimal transportation plan is determined from the information obtained in the input processing step (501). Here, the determination of the transportation plan means the allocation of the packages to which the truck capable of delivering all the inputted packages to the delivery destination should follow,
It refers to determining the route (transportation schedule information) that these trucks travel around. Details of this processing will be described later with reference to FIG. 7. Next, in the result output processing step (503), the created schedule is output together with its evaluation. Details of this processing will be described later with reference to FIG.

FIG. 6 shows the input processing step (501) in FIG.
3 is a flowchart showing the details of FIG. First, in the base information registration step (601), the base information (110) is registered. Next, in the package information registration step (602), the package information (111) is registered. Next, basic route information registration step (603)
Then, the basic route information (115) is registered. Next, in the transportation vehicle information registration step (604), the transportation vehicle information (112) is registered. Next, enter the simulation level information
(605). Next, in a distance table generation process (606), the distance between bases and the required travel time by truck are generated by referring to the road map (114). It is assumed that the road map (114) is prepared in advance to store roads used in car navigation, connection relationships between the roads, and distance information.

FIG. 7 is a flow chart showing the details of the transportation schedule creation process (502) in FIG. This transportation schedule creation processing complies with GA (genetic algorithm). First, different initial solution sets are created by a method including randomness (step 701).
Details of this processing will be described later with reference to FIG. Then 1 for the variable I
Is substituted (step 702). Next, the solution population is improved by genetic processing (step 703). Details of this processing will be described later with reference to FIG. At least a part of the solution group is changed by this solution group improvement processing, and the solution group gradually approaches the optimal solution by repeating the processing of steps 703 to 705. After the process of step 702, the group is evaluated.
(Step 704). The evaluation is performed on various factors such as the mileage of the vehicle calculated from the route information and the number of vehicles used, and the results rank the individual solutions in the solution group. The solution with the higher evaluation result is selected as the next-generation solution (step 705). Next, 1 is added to the variable I (step 706).

It is checked whether the variable I exceeds a preset number of processing generations G_MAX of GA or whether the evaluation value of the best solution in the next-generation population is better than a preset target value (step 707). ). If the condition is satisfied, the best solution in the current solution group is output (step 708) and the process is terminated. If the condition is not satisfied in step 707, step 703
Return to and repeat improvement of the solution population by genetic processing.

FIG. 8 shows the addition of packages to the transportation schedule used in the initial solution group creation (step 701) and the solution group improvement processing (step 703) in the transportation schedule creation processing using the genetic algorithm of FIG. It is a flow chart which shows details of processing. This process is a process of adding collection and delivery of one package to a transportation schedule composed of a plurality of transportation vehicles.

First, the variable T_MIN is Max_Value, S_Max is 0,
Set T_No to -1 and Pos to -1 (Step 80)
1). Substitute 1 for the variable I (step 802). Next, the values of the variable I and the variable Max_Truck are compared (step 803). here,
Max_Truck is a variable that represents the number of vehicles already included in the schedule. Max_Value is the maximum number that can be represented by the computer used.

When the variable I is equal to or smaller than the value of Max_Truck in step 803, the following processing is performed. First, the luggage L on the I-th vehicle
It is checked whether or not can be added (step 804). Details of this processing will be described with reference to FIG. In the process of step 804, if the designated vehicle can be loaded with luggage, on the transportation route in which the increment of the traveling distance (traveling time) of the vehicle is minimized after satisfying various constraints in the route of the vehicle. Returns the order of in the variable Pos. Further, the variable T0 is set to the increment of the traveling time, and the variable S0 is set to the priority of the basic route information corresponding to the additional position. Next, it is checked whether the value of the variable T0 is Max_Value (step 805). If this value is equal to Max_Value, addition is not possible, so the process proceeds to step 811 to check the next vehicle. If the value of the variable T0 is not equal to Max_Value, the value of S0 is compared with the value of S_Max (steps 806,8).
07). If the value of S0 is smaller than the value of S_Max, the priority is low, and the process proceeds to step 811 without adding. The value of S0 is S
If it is larger than the value of _Max, the priority is high, and the newly found additional position is recorded. That is, T_MIN is T
Substitute 0 for S_Max, P0 for Pos, and I for T_No
(Step 810). T0 and T_MI if S0 is equal to S_Max
The values of N are compared (step 808). If T0 is small, T_MI
Substitute T0 for N, S0 for S_Max, P0 for Pos, and I for T_No.
(Step 810). If T0 is not smaller than T_MIN, the process proceeds to step 811. Next, 1 is added to the variable I (step 811) and the process returns to step 803 to check the next vehicle.

When I exceeds the value of Max_Truck in step 803, checking of all vehicles has been completed, and therefore the following processing is performed to add the luggage L to the transportation schedule. First, T
The value of _MIN and Max_Value are compared (step 812). T_MIN
If is equal to Max_Value, there is no vehicle that can add luggage L, so add a new vehicle in the schedule
(Step 814). Next, 1 is added to the variable Max_Truck representing the number of vehicles used in the schedule (step 815). Next, the luggage L is added to the additional vehicle (step 816). Specifically, the index of the luggage L is added to the last part of the gene information, and the vehicle management information of the additional vehicle is added.

If T_MIN is not equal to Max_Value in step 812, there is a vehicle to which luggage can be added.
Add L to Posth position of T_No vehicle (step 81
3).

FIG. 9 is a flow chart showing the details of the baggage addition check process in step 804 of FIG.

In this processing, it is assumed that the index of the luggage to be added to the transportation schedule is set in advance in the variable L, and the vehicle number of the vehicle to be checked for addition is set in the variable T_No. After this process,
If transport of L was possible with vehicle T_No, then variable PosP0
The additional position is set to, and the increment value of the traveling time of the vehicle due to the addition of the luggage is set to T0. Further, the priority in the basic route information of the added position is set in the variable S0. If it cannot be added, -1 is set in Pos and Max_Value is set in T0.

First, the delivery destination base of the package L to be added to the variable Z
Substitute the ID (step 901). Next, the load amount of the luggage L is set in the variable V (step 902). Then -1 for the variable PosP0 and Ma for T0
The x_Value and S0 are set to 0 (step 903). Next, the gene start position of the T_No-th vehicle is set to the variable I by referring to the vehicle management information (118) (step 904).

Next, the value of the variable I is compared with the value of the gene end position +1 of the vehicle (step 905). If the variable I is large, the process ends. If the variable I does not exceed the above value, the following processing is performed.

First, I is compared with the gene start position of the T_No-th vehicle (step 906). If they are equal, substitute the base ID representing the distribution center where the vehicle departs for variable X
(Step 908). If they are not equal, the base ID of the delivery destination of the (I-1) th package in the genetic information of the vehicle is substituted (step 907). Next, it is compared with the value of the gene end position +1 of the I and T_No-th vehicle (step 909). If they are equal,
Substitute the base ID of the distribution center for the variable Y (step 91
1). If they are not equal, the ID of the delivery destination base of the I-th package of the T_No-th vehicle is substituted for Y (step 910).

Next, basic route information of the base Z (Fig. 2 (f))
Then, it is checked whether the site ID 1 is X and the site ID 2 is Y (step 912). Details of this process are shown in FIG.
0 will be described. If registered in the basic route information, the priority of the basic route is returned in the variable S.
If it is not registered in the basic route information, 0 is returned in the variable S.

Next, the check of the load will be started. First, the load V
It is checked whether or not the luggage L can be loaded between the base X and the base Y of the I-th vehicle (step 913). In other words, the value of the additional cargo to be added from the distribution center where the vehicle departs to the delivery destination of the X-th transportation baggage plus V exceeds the maximum load capacity of the vehicle. Check if you don't. If it exceeds, proceed to step 921. If it does not exceed, the value obtained by subtracting the required time between X and Y from the sum of the required time between X and Z and the required time between Z and Y is substituted for T (step 914). Next, it is checked whether the value obtained by adding T to the vehicle arrival time at the point Y or later of the vehicle does not violate the time constraint (step 915). In addition, in FIG. 9, Time (X, Y)
Represents the travel time of the vehicle from the bases X to Y.

If the time constraint cannot be observed in step 915, the process proceeds to step 921. If it can be protected, S is compared with S0 (step 916). This is the process of comparing the priority of the transportation route information for the already found insertable location with the priority of the transportation route information for the insertion point found this time (step 9).
16). If the two are equal, the priority does not change, and therefore, the one with a small increment of the traveling time is selected. That is,
T is compared with T0 (step 917), and if T is smaller, T is substituted for T and PosP0 is substituted for the value of I (step 919). T is T0
In the above cases, the values of T0 and Pos are not changed. If S is not equal to S0 in step 916, it is determined whether the value of S is larger than S0 (step 918). If it is larger, the priority for the newly found additional position is higher, so T0 is set.
The value of T is substituted, the value of S is substituted for S0, and the value of I is substituted for PosP0 (step 920).

Next, 1 is added to the variable I (step 921) and the process returns to step 905 to check the next additional position.

FIG. 10 is a flow chart showing details of the basic route check process of step 912 in FIG.

First, in the basic route information (FIG. 2 (f)), the site ID is Z, the site ID1 is X, and the site ID2
Is Y and the level is greater than the variable Level (specified value) (step 1001). If this condition is satisfied, the priority of the basic route information is set in the variable S, and the process ends (step 1002). If the condition is not satisfied, S is set to 0 and the process is terminated (step 1003).

FIG. 11 shows the initial solution group generation process in FIG.
It is a flowchart which shows the detail of (step 701). In addition, the traveling schedule of a plurality of vehicles is registered in one solution. Moreover, the solution group includes a plurality of solutions. The number of individuals of genes to be registered in the initial population is set in advance in the variable SIZE. Further, the number of delivery destination bases registered in the route is set in the variable LEN.

First, 0 is substituted for the variable I (step 110
1). Next, while I is smaller than SIZE (step 1102), the processes of steps 1103 to 1106 are repeated to generate the number of genes specified by SIZE.

First, an area for storing empty genes in which no value is set for each element is generated (step 1103). Next, an array in which the packages in the package information are rearranged in a random order.
Create T [] (step 1104). Next, the packages registered in the sequence T [] are sequentially added to the empty gene in this order by the addition procedure shown in FIG. 7 (step 1105). Next, 1 is added to the variable I (step 1106), and the process for creating the next initial solution is started.

FIG. 12 is a flowchart showing details of the improvement (step 703) of the solution group in FIG. Genetic processing is the central processing of GA that changes and improves the solution population.

First, the number of solutions registered in the solution group is substituted into the variable SIZE (step 1201). Then C_NUM, S
The maximum integer that does not exceed the value obtained by multiplying IZE and the preset intersection rate is substituted (step 1202). Then the variable I
Substitute 1 for (step 1203). If I is less than or equal to C_NUM, repeat the following process to perform the intersection process (step
1204).

First, two different solutions (genes) are selected from the solution population (step 1205). Next, cross processing is performed based on the two selected solutions (genes), and the solution (gene) newly generated by the cross processing is added to the solution group (step 1
206). Details of this intersection processing will be described with reference to FIG. Next, 1 is added to I (step 1207), the process returns to step 1204 to proceed to the next crossover process.

If I exceeds C_NUM in step 1204, the mutation process is performed next. First, in the variable M_NUM, SIZ
The maximum integer that does not exceed the value obtained by multiplying E by the preset mutation rate is substituted (step 1208). Then the variable I
Substitute 1 for (step 1209). Next, while I is equal to or less than the value of M_NUM, the following processing is repeated (step 1210).

First, one solution (gene) is randomly selected from the solution group (step 1211). Next, the selected solution is subjected to mutation processing, and the solution (gene) is added to the solution group (step 1212). Details of this processing will be described with reference to FIG. Next, 1 is added to the variable I (step 1213), the process returns to step 1210 to continue the processing.

FIG. 13 shows the intersection process of FIG. 12 (step 120).
It is a flow chart which shows the details of 6).

First, the number of packages registered in each solution (gene) is substituted into the variable N (step 1301). Next, copy the two solutions (genes) to be crossed into the arrays G1 [], G2 []
(Step 1302). Next, in order to determine the intersection, an integer from 2 to N-1 is randomly generated and assigned to the variable P.
(Step 1303). Next, the P-th and subsequent package data indexes of G1 are deleted (step 1304). That is, -1 is assigned to the element to be deleted. Next, 1 is assigned to the variable I (step 1305). While the variable I is N or less (step 1306), the following processing is performed.

First, it is checked whether G2 [I] is not included in the array G1 [] (step 1307). If it is not included, the package information is added to the transportation schedule of G1 [] by the processing procedure shown in FIG. 7 (step 130).
8). Next, add 1 to the variable I (step 1309), and step 13
Return to 06. If the condition is not met in step 1307,
Go to step 1309. If I exceeds N in step 1306, the process ends.

FIG. 14 is a flow chart showing details of the mutation process (step 1212) in FIG.

First, the solution (gene) to be subjected to mutation processing is copied to the array G [] (step 1401). Next, the distance between the delivery destination base farthest from the distribution center and the distribution center is substituted into the variable L (step 1402). From 0 to the variable R
A real number in the range of 0.3 is randomly generated and substituted (step 1403). Next, the product of the value of the variable L and the value of R is substituted into the variable L1 (step 1404). Next, in order to determine the mutation site on the gene, an integer of 1 or more and N or less is randomly selected and substituted for the variable P (step 1405). Then the variable I
To 0 and J to 0 (step 1406). The value of G [P], that is, the index value of the package information is substituted for the variable K (step 1407).

Next, while I is N or less (step 1408), the following processing is repeated. First, it is checked whether the distance between the delivery destination base of the package whose index is K and the delivery destination base of the package of G [I] is L1 or less (step 1409). If the condition is met, substitute the value of G [I] for T [J] and -1 for G [I].
(Step 1410). Next, add 1 to variable J (step 141
1), 1 is also added to I (step 1412), the process returns to step 1408 to continue the process. If the condition is not satisfied in step 1409, the process proceeds to step 1412. If the value of I exceeds the value of N in step 1408, the element having a value of -1 in the array G is deleted and the elements are packed forward (step 1413). Then the array
The delivery destination bases of the J packages stored in T are sequentially added from the beginning to the transportation schedule of array G by the processing procedure shown in FIG. 8 (step 1414).

FIG. 15 is a flow chart showing details of the result output process (step 503) in FIG. First, the transit points of each transportation flight are displayed on the map (step 1501). Regarding the schedule obtained by the transportation schedule creation process and the values such as the number of required vehicles and mileage,
Create and display tables and graphs. Further, the evaluation value of the obtained transportation schedule is displayed (step 1502). next,
If there is a print instruction, print a graph or table (step 150
3).

[0059]

As described above, according to the present invention,
It is possible to create a transportation schedule that gradually reduces constraints on transportation routes from a transportation schedule equivalent to the transportation schedule that has been operated in the past, and to create a transportation schedule that is more optimal in terms of cost. You can In this way, by creating a transportation schedule with a higher degree of optimality, it becomes possible for humans to easily make multi-faceted judgments regarding social and environmental aspects other than transportation costs. Create an efficient transportation plan that can withstand.

[Brief description of drawings]

FIG. 1 is an overall configuration diagram showing a system according to an embodiment.

FIG. 2 is a diagram showing a configuration of data included in a storage device.

FIG. 3 is a diagram showing a configuration of transportation schedule data included in a storage device.

FIG. 4 is a diagram showing a structure of genetic information of GA used in a transportation schedule creation unit.

FIG. 5 is a flowchart showing an overview of overall processing.

FIG. 6 is a flowchart showing an input process.

FIG. 7 is a flowchart showing a transportation schedule creation process.

FIG. 8 is a flowchart of a process of adding a delivery destination site of a package to a transportation schedule.

FIG. 9 is a flowchart of a baggage addition check process when a delivered baggage or a collected baggage is added to a transportation schedule.

FIG. 10 is a flowchart of basic route check processing.

FIG. 11 is a flowchart of an initial group generation process.

FIG. 12 is a flowchart showing an outline of genetic processing. .

FIG. 13 is a flowchart showing an intersection process.

FIG. 14 is a flowchart showing a mutation process.

FIG. 15 is a flowchart showing a result output process.

[Explanation of symbols]

101 ... Input device, 102 ... Output device, 103 ... Display device, 104 ... Processing device, 105 ... Program, 106 ...
Input processing unit, 107 ... Transportation schedule creation unit, 108
... Result output unit, 109 ... Storage device, 110 ... Base information,
111 ... Luggage information, 112 ... Transport vehicle information, 113 ... Distance table, 114 ... Road map, 115 ... Transport schedule information, 116 ... Gene information, 117 ... Vehicle management information.

Continued front page    (72) Inventor Takuya Maekawa             6-81 Onoe-cho, Naka-ku, Yokohama-shi, Kanagawa             Hitachi Software Engineering Stock Association             In-house (72) Inventor Sen Kubota             6-81 Onoe-cho, Naka-ku, Yokohama-shi, Kanagawa             Hitachi Software Engineering Stock Association             In-house

Claims (6)

[Claims] 1. A transportation plan creation method for creating a transportation schedule of a vehicle for transporting luggage between a distribution center and a transportation destination base by using a system having at least an input / output device, a processing device, and a storage device. , A base information registration step of inputting base information which is the positional information of the distribution center and the transportation destination base, and a package information registration step of inputting package information including a package amount of each package, a transportation site, and a delivery time constraint, A transportation vehicle information registration step for inputting transportation vehicle information including limit information on the load capacity of the transportation vehicle, basic route information including constraints of the basic traveling route of the transportation vehicle and its usage level, and used when creating a transportation schedule The basic route information registration step of inputting the usage level of the traveling route registered in the basic route information, and the input in the above step. Transportation schedule creation method characterized by comprising a transport scheduling step of creating a transport schedule for transporting vehicles from the information, and a transport schedule output step of outputting the created transportation schedule. 2. The transportation plan creation method according to claim 1, wherein the schedule creation step includes a use level higher than the input use level among the travel routes registered in the basic route information. A transportation plan creation method characterized in that a transportation schedule of each transportation vehicle is created by using only a traveling route. 3. The transportation plan creation method according to claim 1, wherein the schedule creation step uses only the travel route with the highest utilization level among the travel routes registered in the basic route information. Create
Next, a transportation schedule is created by using a traveling route whose usage level is one step lower than the usage level, and the transportation schedule is expanded by using such stepwise basic route information up to the input usage level. A method of creating a transportation plan, characterized by carrying out in stages, creating a plurality of transportation schedules, and displaying differences between the transportation schedules together with schedule results. 4. A transportation plan creation device for creating a transportation schedule of a vehicle for transporting luggage between a distribution center and a transportation destination base by using a system having at least an input / output device, a processing device, and a storage device. , A base information registration means for inputting base information, which is the positional information of the distribution center and the transportation destination base, and a baggage information registration means for inputting the parcel information including the parcel amount of each parcel, the transportation base, and the delivery time constraint, Transport vehicle information registration means for inputting transport vehicle information including limit information on the load capacity of the transport vehicle, basic route information including constraints on the basic travel route of the transport vehicle and its usage level, and used when creating a transport schedule Basic route information registration means for inputting the use level of the traveling route registered in the basic route information, and information of the transport vehicle from the information input by the means. Transportation schedule creation device characterized by comprising: a transportation schedule creation means for creating a transmission schedule, and a transportation schedule output means for outputting the created transportation schedule. 5. The transportation plan creating apparatus according to claim 4, wherein the schedule creating unit has a usage level higher than the input usage level in the travel routes registered in the basic route information. A transportation plan creation device characterized by creating a transportation schedule of each transportation vehicle using only a traveling route. 6. The transportation plan creating apparatus according to claim 4, wherein the schedule creating means uses only the travel route with the highest utilization level among the travel routes registered in the basic route information. Next, the transportation schedule is created by using the traveling route whose utilization level is one step lower than the utilization level, and the expansion of the transportation schedule by the use of such basic stepwise route information is input as described above. A transportation plan creation device characterized in that it performs stepwise operations up to different usage levels, creates a plurality of transportation schedules, and displays the differences between the transportation schedules together with the schedule results.