JP2000276688A - Method and system for preparing transport schedule - Google Patents

Abstract

PROBLEM TO BE SOLVED: To prepare the schedule of reducing a cost including baggage transshipping at a relay base at high speed in transport schedule preparation. SOLUTION: The operation schedule of a transport delivery between bases and the information of the transshipping propriety at the relay base or the like are stored beforehand and a graph for which the transport route of the transport delivery is divided by a relay base unit is prepared. The node of the graph indicates a transport base and a path corresponds to a truck delivery. Virtual path and node for transshipping baggage are set for the transport base for expressing the base capable of transshipping the baggage in the graph, the upper limit of a baggage transport amount and the cost are set for the path as well and an optimum transport schedule using the graph to which the path and the node are added is prepared.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a transportation plan creation method and system for creating a transportation plan between bases via relay points in a distribution system, and more particularly to a transportation route for efficient delivery such as courier service. The present invention relates to a method and a system for creating a transportation plan that is used for coordination of a transportation plan and a relay plan, and that realizes reduction of distribution costs and improvement of serviceability.

[0002]

2. Description of the Related Art As a transportation plan creation technique in a distribution system, there is a technique for creating a plan for efficiently patrol customers and parts suppliers located in a certain area corresponding to a so-called traveling sales problem. No. 135070 "Delivery Scheduling System" etc. However, according to this conventional technique, a new tour plan is created every day in order to optimize a target including cost due to fluctuations in daily transportation volume and fluctuations in ordering.

[0003] As a transportation planning technique, optimization programming (Toshihide Ibaraki, Masao Fukushima, Iwanami Shoten 1991)
There is also a technique for solving the least-cost flow problem using the simplex method, which is a solution to the linear programming method described in (1). However, the least-cost flow problem, which formulates the transportation from the production area to the consumption area, is based on the flow of water and electricity.

[0004]

However, the above-mentioned conventional technique has the following problems. (1) Every day, since a completely new transportation plan is created, the work schedules of truck and other drivers and the work staff of transportation bases change drastically every day, making it difficult for humans to respond efficiently. . For example, if the operation route of a long-distance truck flight between transportation bases changes significantly, it is difficult for a truck driver to grasp the road conditions and the detailed situation of each transit base.

[0005] (2) The planning method corresponding to the traveling sales problem basically corresponds to solving a combination problem, so that it took an enormous amount of time to find an appropriate solution.

[0006] (3) The minimum cost flow problem is a model of a flow of water flow, electricity, or the like, in which a plan for transporting a production site having the lowest transportation cost as viewed from the consuming area is created. In addition, it is not possible to create a plan for transporting luggage that has left the departure point to a predetermined destination, unlike ordinary luggage transportation. Also, this method cannot take into account the cost of transshipment at the relay point.

An object of the present invention is to adjust the departure time of a truck or the like from a transportation base in order to realize improved transportation efficiency and serviceability without causing a significant change in the transportation plan between the bases, It is an object of the present invention to provide a method and a system for efficiently preparing a transshipment plan of packages between transportation flights.

[0008]

SUMMARY OF THE INVENTION In order to achieve the above object, the present invention provides a luggage counting step of counting collected luggage of a collection / delivery vehicle at each base, and an operation status of the collection / delivery vehicle. A collection status management step for managing the time of return to the base to which it belongs, and collection vehicle information including the collected baggage information collected at each base and the time of return to the base of the pickup truck are transmitted to a representative base that controls a plurality of bases. Pickup status transmission step, same day flight operation plan registration processing step of registering transportation information between transportation bases of the day, and same day relay point operation plan including whether or not transshipment of luggage between transportation flights at the same day of transportation is possible And a transportation plan creation step for creating a transportation plan for transportation by pickup and delivery vehicles including a transportation plan for transshipment of luggage at transit points between transportation services. To.

[0009] Further, a luggage totalizing means for totalizing the collected luggage of the pickup and delivery vehicles at each base, a collection state management means for inputting the operation status of the pickup and delivery vehicles, and managing a return time to the base to which the pickup and delivery vehicle belongs, A collection status transmission unit that transmits the collection vehicle information including the collection baggage information collected at the base and the time at which the pickup truck returns to the base to the representative bases in charge of multiple bases, and the transportation flight information between the transportation bases on the day. Same-day flight operation plan registration processing means to register, relay point operation plan registration means to register the same day relay point operation plan including whether transshipment of luggage between transport flights at the same day of transport, and transit between transport flights And a transportation plan creating means for creating a transportation plan of the transportation service including a relay plan for reloading the luggage at the base.

In other words, the present invention is as follows. That is, information such as the operation plan of the transportation service between the bases and whether or not the transfer is possible at the relay base is stored in advance, and a graph in which the transportation route of the transportation service is divided for each relay base is created. The nodes in this graph represent transportation hubs, and the paths correspond to transportation flights. For the transportation hubs that represent the locations where luggage can be transshipped in this graph,
Set a virtual path and node for transshipment, set the upper limit and cost of the freight transportation amount for that path, and make an optimal transportation plan using the graph with this path and node added. This is a method of creating a luggage transshipment plan at each relay base.

Further, by grasping the status of the baggage collection at each transportation base and instructing the postponement of the departure time of the transportation service from each base, the above graph can be displayed in accordance with the possibility of transshipment at the relay base. The transportation plan is created by changing the amount of cargo transported on the pass.

[0012]

An embodiment of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a system configuration diagram showing an embodiment of the present invention. This system includes a representative base system 101 that integrally manages a plurality of bases, and a plurality of base systems 103 that are connected to the representative base system 101 via a network 102 and manage a transportation plan at each base. .

FIG. 2 is a configuration diagram showing details of each base system 103. Each base system 103 includes a portable computer system 201 mounted on a pickup and delivery vehicle, an input device 202 for inputting instructions to the system, a display device 203 for displaying a transportation plan, and an output device for outputting the transportation plan. 204, a processing device 205, a storage device 211,
And a communication device 214. Processing device 205
Is composed of, for example, a general-purpose computer.

A portable computer system 201 is mounted on a pickup / delivery vehicle for transporting luggage between a base and a customer, and transmits information on packages collected from the customer to a processing device 205 at the base by means of wireless communication or the like. It is.

The processing unit 205 includes a luggage totaling unit 206 for recording the collected luggage information sent from the portable computer 201 of the collection and delivery vehicle as collected luggage information 212 of the storage device 211, and a portable collection and processing unit mounted on the collection and delivery vehicle. A pickup / delivery status management processing unit 207 for storing the scheduled return time of the pickup / delivery vehicle in the pickup / delivery information 213 of the storage device 211 based on the information sent from the computer system 201, and a pickup package information 212 stored in the storage device 211 Collection and delivery status transmission processing unit 208 for transmitting the information of the collection and delivery vehicle information 213 to the representative base system 101, a transportation plan reception processing unit 209 for receiving the transportation plan created at the representative base, and the display device 203 for displaying the received transportation plan. And a transportation plan output unit 210 for outputting to the output device 204.

The base system 103 records the collected luggage information sequentially sent from the portable computer 201 of the collection and delivery vehicle as the collection luggage information 212 of the storage device 211, and records the collected luggage information 212 and the collection and delivery vehicle information 213. The information is transmitted to the representative base system 101 via the network 102, and the actual operation status of the transportation service is reflected on the representative base system 101.

FIG. 3 is a system configuration diagram showing details of the representative base system 101 of FIG. Representative base system 1
01, an input device 301 for inputting an operation plan of a transport flight of the day and various instructions to the system, a display device 302 for displaying a transport plan and the like, an output device 303, and a processing device 3
04, a storage device 312, and a communication device 319.

The processing unit 304 is composed of, for example, a general-purpose computer, and includes a pickup status reception processing unit 305 for receiving the pickup status and pickup / distribution information of the package sent from the base; A traffic volume aggregation processing unit 306 for calculating the amount of cargo to be loaded at each departure time of each transportation flight based on the pickup / delivery information, a daily flight operation plan registration processing unit 307 for registering the transportation schedule of the transportation flight of the day, a relay base Relay base operation registration processing unit 30 for registering whether or not luggage can be re-transferred
8, a transportation plan creation processing unit 309 for creating a transportation plan including a transshipment of luggage at the relay site on the day, and a transportation plan output processing unit 310 for displaying and outputting the created transportation plan.
And a transportation plan transmission processing unit 311 for transmitting the created transportation plan to each of the base systems 103 controlled by the representative base.

The storage device 312 stores inter-base transportation amount information 3 for storing the amount of transportation between the origin and destination of the package transportation.
13, basic transport information between bases 314 for storing information such as time and cost required for transport between bases, and transport schedule information 315 for storing operation schedules for each transport on the day.
Relay base operation plan information 316 for recording information such as whether or not luggage can be transshipped at the relay base;
7 is stored.

FIG. 4 shows a configuration example of data stored in the storage device 211 of FIG. 2 and the storage device 312 of FIG. The collected luggage information 212 is information for managing individual luggage, and is input using the portable computer system 201 when the collection and delivery vehicle collects the cargo, and as shown in FIG. , Pickup / distribution vehicle ID 401, package ID 402, departure point ID 403, destination ID 404, shipper information 405, package quantity 406, destination address 407, destination name 408, and collection time 409.

The inter-base transport volume information 313 is obtained from the departure location by the transport volume tabulation unit 306 based on the collected baggage information 212 and the collection / delivery vehicle information 213 sent from each base by the collection status reception processing unit 305 in FIG. Stores information that totals the amount of transportation to the destination. Here, the amount of luggage that can be loaded by the departure time of the transport flight from each base by the departure time of the transport flight registered in the transport schedule information 315, and the load that can be loaded when the departure of the transport flight is delayed for a certain period of time In this case, a plurality of different luggage quantities are recorded, and as shown in FIG.
09, destination ID 410, luggage amount (1) 411, luggage amount (2) 412, and the like.

The basic transport information between bases 314 stores the required operation time and the operating cost of the transportation service between two bases. As shown in FIG. 4C, the departure base ID 414, the destination base ID 415, and the required It consists of information on time 416 and required cost 417.

The pickup / distribution vehicle information 213 stores information on the scheduled return time to the base after the collection of the pickup / delivery vehicle on the day, and as shown in FIG. 4D, the base ID 418 and the collection / delivery vehicle ID 419. , Scheduled return time 420.

The transportation schedule information 315 records the operation schedule of the transportation service operated on the day, and as shown in FIG. 4E, the transportation service ID 421, the departure point 422, the departure time 423, and the arrival point 424. , Arrival time 425, and information on each passing base 426 and its arrival time 427.

The relay base operation information 316 registers whether or not transshipment of luggage is possible at each transportation base, and includes information such as a base ID 428, a relay enable / disable 429, a maximum relay amount 430, and a relay cost 431.

In the present embodiment, a transportation plan is generally created as follows. That is, information such as the operation plan of the transportation service between the bases and whether or not the transfer is possible at the relay base is stored in advance, and a graph in which the transportation route of the transportation service is divided for each relay base is created. The nodes in this graph represent transportation hubs, and the paths correspond to transportation flights. In this graph, a virtual path and a node for transshipment are set for the transportation bases which represent the bases where luggage can be transshipped, and the upper limit of the luggage transportation volume for that path as well. By setting the cost and the cost, and creating an optimal transportation plan using the graph to which the path and the node are added, the luggage transshipment plan at each relay base is created.

FIG. 5 is a diagram schematically illustrating a transportation plan targeted by the present invention. A, B, C, D, E,
F and G represent transportation bases, and a, b, c, and d represent transportation services such as trucks. In this figure, a truck flight a that has departed from the base A arrives at the base F via the base D.
The truck service b departs from the base B and reaches the base G via the base D. The truck service c departs from the base c and reaches the base G via the bases D and E. The truck service d shows a model that reaches the base G via the base E.

A description will now be given of a transportation plan creation method to which the present invention is applied, taking as an example the transportation of luggage from the bases A, B, and C to the bases F and G. There are three types of transportation of luggage from the base A to the base G as follows. The route is relayed from the truck service a to the truck service b at the base d. The route is relayed from the truck service a to the truck service c at the base D. From truck a to truck D at base D
After that, the route is further relayed to the truck service d at the base E.

Of the three transportation methods, which one has the highest efficiency can not be determined merely by the amount of luggage from the base A to the base G, but the transportation amount and relay between other bases can be determined. It depends on many factors, including the cost of transshipment to perform. The present invention is a method for comprehensively determining these factors, determining whether or not relay between truck flights is necessary, and creating a transportation plan. Also, when the plan is created, the actual operation state of each truck flight is grasped based on the estimated arrival time and is created.

FIG. 6 shows the upper limit of the amount of transportation between the bases and the transportation cost in the transportation using the truck service shown in FIG. A maximum of 10 tons of luggage can be transported between the site A and the site D, and the transportation cost is 12,000 yen per ton (in the figure, 1000 yen is described in units). Similarly, the table also shows the transportable amount and transportation cost between sites that can be transported by direct truck service.

FIG. 7 is a diagram in which the truck service route shown in FIG. 5 is divided and the number of the truck service route is divided into base units. The number "1" is given to the route from the base A to the base D of the truck service a in FIG. 5, and the number "6" is given to the route from the base D to the base F.
The order of the numbers is not particularly specified as long as the routes between all the bases can be uniquely distinguished. This number is assigned continuously from “1”.

FIG. 8 shows the transport route information shown in FIG.
It shows the contents of the transport path table 317 tabulated for each route. In FIG. 8, the path ID 801 includes:
An ID for uniquely identifying each path is stored.
In the departure point ID 802 and the destination point ID 803, IDs of points linked by paths are stored. The transport flight ID 804 includes the I of the truck flight that operates the pass.
D is stored. The relay truck ID 805 is used by the transportation plan creation processing unit 309 shown in FIG.
The cost 806 stores the cost required for transporting a unit amount of package on the path. In addition, the loading upper limit 807
Stores the upper limit of the load capacity of the truck that operates the path.

FIG. 9 shows the transportation plan creation processing unit 309 of FIG.
3 is a schematic processing flow of FIG. First, in the flight schedule analysis processing 901, the flight schedule information 315 registered in the storage device 312 is read, and the transport path table 317 shown in FIG. 8 is created.

In the next relay point development process 902, a process of adding a path representing transshipment to a path arriving at a relayable base in the transport path table 317 is performed. Details are shown in FIG.

In the next expansion point connection processing 903, a processing for adding a path connecting the nodes newly added to the transport path table 317 in the relay point expansion processing is performed. FIG. 14 shows the details of this processing.

FIG. 10 shows the operation of the relay point extension processing and the development point connection processing. In FIG. 10, if the baggage can be transshipped at the site C, no new nodes and paths are added to the graph in the state of FIG. 10A before the processing, and FIG. Expand to graph. That is, when the transshipment at the site C is possible, virtual nodes c1 to c4 are created at the site C, and these virtual nodes c1 to c4 are created.
Paths p1 to c4 indicating that luggage can be transshipped
Create p4.

When this developing process is applied to the transport path graph shown in FIG. 7, if the transshipment is possible at all the bases, it is developed into a transport path as shown in FIG. FIG.
In Dao, Dai, Dbo, Dbi, Dco,
Dci represents a virtual node created at the site D, and Ec
o, Eci, Edo, and Edi represent virtual nodes created at the base E. Numerical values adjacent to the arrow lines indicate path IDs, and paths (virtual paths) “10” to “22” are newly created with respect to the initial transport path in FIG. By such processing, as shown in FIG. 12, the transport path table 317 shown in FIG. 8 adds the path with the path ID = “10” to “14” as shown in FIG. 704 to pass ID
= Paths “15” to “22” are added. in this case,
A method for setting the cost 806 and the loading upper limit 807 of the added path will be described with reference to FIG.

In the pickup status display processing 904, the inter-base transport information 313 totaled by the transport total processing unit 306 in FIG.
Is displayed on the display device 302. The “transportation amount between bases at the standard departure time of the transportation flight and the transportation amount when the departure is delayed” registered in the display device 302.

In the next transportation flight departure time designation processing 905,
Specify the departure time of the transportation service at each base. In the next relaying availability determination process 906, it is determined whether or not transshipment is possible at each relay base at the departure time of each transportation flight specified in step 905. Details are shown in FIG.

In the next transportation plan creation processing 907, the amount of cargo to be transported is determined by the following procedure using each path registered in the transportation path table 317. Hereinafter, the details of this processing will be described.

The inter-base transport volume information 314 shown in FIG.
_k , destination D _k , and luggage amount are stored in L _k . Here, the index variable k corresponds to the luggage for each departure base and destination stored in the inter-base transport amount information 314. However, the inter-base transport volume corresponding to the departure time of the transport service from each base specified in the transport flight departure time specifying process in step 905 is extracted from the inter-base transport volume information 313 and stored.

The transportation costs of each path shown in FIG. 10 and stored in C _i. Further, the upper limit of the transport amount for each pass is stored in U _i . These C _i and U _i are obtained by extracting information from the transport path table 317 after the extension processing shown in FIG. 12 and storing the values. The origin of the path i is represented by head (i), and the destination is represented by tail (i).

Now, it is assumed that the variable x _ik represents the amount of transportation of the luggage between the origin and destination registered in the k-th registered information of the inter-base transportation amount information by the i-th path. At this time, _xik that minimizes the following equation (1) under the conditions of (2) and (3) is the transportation plan with the minimum cost.

[0044]

(Equation 1)

[0045]

(Equation 2)

[0046]

(Equation 3)

The problem of determining the variable x _ik that minimizes the transportation cost expressed by the equation (1) under the conditions (2) and (3) is a general linear programming problem. Therefore, Si
By applying the mplex method or the Karmakar method, it is possible to obtain the value of a variable _xik representing the amount of cargo transported on each path for minimizing cost and realizing transportation.

Next, in the transportation plan display processing 908, the transportation plan created in the transportation plan creation processing 907 is displayed on the display device 30.
3 is displayed. Next, the user is inquired about whether or not the displayed transportation plan is available (step 909). If the transportation plan is adopted, the process is ended. If not adopted, the transportation flight departure time designation process 905 in step 905 is performed again.

FIG. 13 is a flowchart showing the processing procedure of the relay point expansion processing. In FIG. 13, first, it is determined whether or not all the paths registered in the transport path table 317 have been expanded (step 1301). If there are no unprocessed paths, the process ends. If an unprocessed path remains, the path is taken out (step 1).
302), the following processing is performed.

It is determined whether it is possible to reload the luggage at the destination ID 803 of the taken out path (step 130).
3). This determination is made by referring to the relay base operation information 316 stored in the storage device 312. If it is not possible to relay at the destination of the path, the extracted path is processed (step 1310), and the next unprocessed path is processed. If the relay availability is “OK”, the destination I
D803 is the I that does not appear in the transport path table 317.
Get two from D. One of these is a destination ID 80 of the pass.
3 (step 1304).

Next, one new path is additionally registered in the transport path table 317 (step 1305). The base ID set as the destination base ID 803 of the original path in the previous step is set as the source base ID 802, and the other acquired ID is set as the destination base ID 803.

For the newly registered path, the transportation ID 804 of the path of interest is set (step 130).
6). Next, “0” is registered as the cost 807 of the new path (step 1307). Further, the maximum relay amount 430 registered in the relay base operation information 316 of the storage device 312 is registered as the loading upper limit 807 (step 130).
8).

Next, it has the same departure point ID 802 as the original destination point ID 803 and the same transportation ID 80 as the original path.
If the connection path of No. 4 is in the transport path table 317, the originating point ID 802 is replaced with the value of the destination point ID 803 of the newly registered path (step 1309).
Next, the path of interest is changed to processed (step 1).
310), the process proceeds to the next unprocessed path.

FIG. 14 is a flowchart showing the detailed processing procedure of the development point connection processing. First, it is determined whether the combining process has been performed on all the paths registered in the transport path table 317 (step 1401). If there are no unprocessed paths, the process ends.

If an unprocessed path remains, it is determined whether the destination ID 803 of the path has been changed in the relay point development processing (step 1402). If not changed, the process proceeds to the next unprocessed path. If it has been changed, the following processing is performed.

The same departure point ID 8 as the destination point ID 803 before being changed by the relay point expansion processing of the path of interest at present.
From the transport path table 317, all the paths having the same destination point ID 803 before the change in the relay point expansion processing and the same departure point ID 802 before the change in the relay point expansion processing are the same for the path having No. 02 and the path of current interest (step 14
03). The following processes are all performed on the obtained path. When there are no more unprocessed paths, this partial processing ends (step 1404).

The transport ID 804 of the transport path table 317
Is the transport ID 804 of the pass whose destination base ID 803 has been changed
It is determined whether it is equal to (Step 1405). If they are equal, this path is regarded as processed and the process proceeds to the next unprocessed path. If the transportation IDs 804 are not equal, a new path is added to the transportation path table 317 (step 1406). At this time, the departure base ID 802
Sets the destination base ID 803 changed in the relay point change processing. In the destination base ID 803, the origin base ID 802 of the path of interest in step 1402 is set. In the cost 806, the cost 431 stored in the relay base operation information 316 stored in the storage device 312 is set. The loading upper limit 807 also stores the maximum relay amount 430 stored in the relay base operation information 316. In addition, transport flights I
In D804, the transportation ID set for the path of interest in step 1402 is set, and in the relay transportation ID 805, the transportation ID of the path of interest in step 1405 is set.
Set 4.

FIG. 15 is a flowchart showing details of the relay availability determination processing. First, it is determined whether or not the relay permission / inhibition determination processing has been performed on all the paths registered in the transport path table 317 (step 1501). If there are no unprocessed paths, the process ends. If an unprocessed path remains, one unprocessed path is extracted and the following processing is performed.

It is determined whether or not the relay flight of the extracted path has not been registered (step 1502). If not registered, the path is determined to have been processed, and the process proceeds to the next path. If a transit flight has been registered, the transport flight ID 8 of the same pass
It is determined whether or not the relay flight ID 04 and the relay flight ID 805 are different (step 1503). If they are the same, the path is determined to have been processed (step 1509), and the process proceeds to the next path.

If they differ, the path indicates a relay at the base, and the arrival time of the transportation service to the base indicated by the path is calculated (step 1504). This processing includes the arrival time at each base in the transportation schedule information 315 of the transportation flight ID 804 registered in the pass, and the departure time delay of the transportation flight input in the transportation flight departure time designation processing (step 905). Calculate using time. Next, relay flight ID 8
The arrival time of the transportation service 05 at the base is calculated as in step 1504 (step 1505).

Next, in step 1505, the arrival time of the transportation flight obtained in step 1504 to determine whether the transit flight indicated by the transportation flight ID 804 and the transportation flight indicated by the relay flight ID 805 can be transshipped is determined. It is determined whether or not it is before a time obtained by adding a predetermined luggage transfer time to the obtained arrival time of the transportation service (step 1506).

If the condition is satisfied, it is determined that the luggage can be reloaded, and the maximum relay amount 430 of the relay base operation information 316 is stored in the upper limit 807 of the path (step 1).
508). If the condition is not satisfied, it is determined that transfer is impossible, and “0” is set to the upper limit 807 of the pass (step 1507). Next, the path is changed to the processed state (step 1509), and the process proceeds to the next path.

Note that the scheduled return time of the pickup and delivery vehicles is as follows.
It can be obtained as follows. Hereinafter, an example of a process of calculating a scheduled return time of the pickup and delivery vehicle based on information transmitted from the portable computer 201 of the pickup and delivery vehicle will be described.

FIG. 16 is a diagram showing an example of a pickup / delivery vehicle operation schedule information table for storing pickup / delivery schedules of pickup / delivery vehicles. The operation schedule of the pickup and delivery vehicles on the day is registered in this table in advance. The customer name 1601 includes the name of the customer to be collected and delivered, latitude 16
02, longitude 1603, customer location information is stored. In the distance 1604, a distance between locations of customers scheduled to be collected and delivered is calculated in advance and stored. Scheduled time 1
In 605, each customer and the final scheduled return time calculated by the calculation method shown in the scheduled return time processing flow of FIG. 18 are stored. The actual result 1606 stores the actual scheduled return time.

FIG. 17 shows a latitude 1701 and a longitude 1702.
For each time zone in an area having two points of latitude 1703 and longitude 1704 as two vertices of a rectangle, the average speed of pickup and delivery in that area is registered.

FIG. 18 shows a processing flow for calculating the scheduled return time of the pickup and delivery vehicles. This processing is performed by the portable computer system 201 of the pickup / delivery vehicle from the pickup package information 2
12 is started each time it is sent to the base system 103.

First, the collection time 409 included in the collected luggage information is set as the actual time 1606 of the collection / delivery vehicle operation schedule information of the collection / delivery vehicle corresponding to the shipper information of the collected luggage information (step 1801). Next, it is determined whether the actual time 1606 set in step 1701 is equal to the scheduled time 1605 (step 1802). If the two times match, it is determined that the pickup and delivery vehicle is operating at the scheduled time, and the process ends. However, if they do not match, the following processing is performed to update the scheduled arrival time 1605 of the collection / delivery vehicle operation schedule information to each customer.

First, the collection time 409 of the collection baggage information 212 sent from the collection and delivery vehicle is set to the customer's scheduled time 1605 of the corresponding collection and delivery vehicle operation schedule information (step 1).
803). All the scheduled times 1605 of the customer in the collection / delivery vehicle operation schedule information after setting the actual time in step 1703 are cleared (step 1804).

Next, it is checked whether or not there is a customer for whom the scheduled time is not set in the collection / delivery vehicle operation schedule information (step 1805). If there is no customer for whom the scheduled time has not been set, the process is terminated. If there is a customer for whom the scheduled time has not been set, the following processing is performed.

A No. in the collection / delivery vehicle operation schedule information of the last customer for which the scheduled time is set in the variable I is set (step 1806). Latitude 1602, longitude 1 of the I-th customer
An area including the position indicated by reference numeral 603 is searched from the area average operation speed table of FIG. 17, and an average speed in a time zone including the scheduled time of the I-th customer is obtained (step 1807).

The required time from the I-th customer to the I + 1-th customer is obtained by dividing the distance 1604 registered for the (I + 1) -th customer in the pickup / delivery vehicle operation schedule information by the obtained average speed (step 1808). .

Next, the required time obtained in step 1708 is added to the scheduled time 1605 of the I-th customer in the pickup / delivery vehicle operation schedule information, and the result is set as the scheduled time 1605 of the (I + 1) -th customer (step 1809). Next, the process returns to step 1705 to continue the process. By performing such processing, the base system 103 grasps the actual operation status of each pickup and delivery vehicle and reflects the actual operation status on the representative base system 101.

[0073]

According to the present invention, information on transport flights operating between transport hubs, information on whether or not transshipment is possible at the hubs via transport flights, and information on actual luggage collection status on the day are collected in advance. By adjusting the departure time of the transport flight on the day, it is possible to determine which truck flight can carry luggage transported from each transportation base, and to plan the transshipment of luggage at the transit base via the truck flight cost And minimizing the total cost of transshipment at the transfer point can be created, contributing to the improvement of transportation efficiency.

In the above embodiment, the base system 103 and the representative base system 101 are provided, and the collection information of all the bases is concentrated on the representative base system 101 to create a transportation plan corresponding to the actual operation situation. However, when the transportation network is not large, the configuration can be made only with the representative base system 101. Also, the collection information is transmitted from the portable computer system mounted on the transportation service to the base system, but the collection information is transmitted to the base system by radio telephone or wireless facsimile, and the collection of the transportation service in the base system is performed. It can be configured so that information is input and counted.

[Brief description of the drawings]

FIG. 1 is a system configuration diagram showing an embodiment of the present invention.

FIG. 2 is a diagram illustrating a configuration example of a base system.

FIG. 3 is a diagram illustrating a configuration example of a representative base system.

FIG. 4 is a diagram showing details of stored information.

FIG. 5 is a diagram schematically showing a route of a transportation flight to which the present invention is applied.

FIG. 6 is a diagram schematically showing the cost of a transportation service targeted by the present invention.

FIG. 7 is a diagram schematically showing a truck transport path.

FIG. 8 is a diagram showing a path table storing path information for trucking.

FIG. 9 is a schematic process flowchart of a transportation plan creation process.

FIG. 10 is an explanatory diagram illustrating an outline of a relay point extension process.

FIG. 11 is an explanatory diagram illustrating an example of a relay point extension process.

FIG. 12 is a diagram illustrating an example of a path table after a relay point extension process.

FIG. 13 is a detailed processing flowchart of a relay point expanding process.

FIG. 14 is a detailed processing flowchart of a development point combining process.

FIG. 15 is a detailed processing flowchart of a relay availability determination process.

FIG. 16 is a diagram showing an example of a table of operation schedule information for calculating a scheduled return time of a pickup and delivery vehicle.

FIG. 17 is a diagram illustrating an example of a table of average operating speeds by area for calculating a scheduled return time of a pickup and delivery vehicle.

FIG. 18 is a flowchart of a process for calculating a scheduled return time of a pickup and delivery vehicle.

[Explanation of symbols]

101: representative base system, 102: network, 1
03: base system, 201: portable computer system, 202, 301: input device, 203, 302 ... display device, 204, 303 ... output device, 205, 304 ...
Processing devices, 211, 312: storage device, 206: package totaling processing unit, 207: collection and delivery status management processing unit, 212: collected package information, 213: collection and delivery vehicle information, 307: same-day flight operation plan registration processing unit, 308: relay Base operation registration processing unit, 30
9: transportation image creation processing unit, 313: transportation amount information between bases, 3
15 ... transportation flight schedule information, 316 ... relay base operation information,
317: Transport path table.

 ──────────────────────────────────────────────────続 き Continuing on the front page (72) Inventor Sen Kubota 6-81 Onoe-cho, Naka-ku, Yokohama-shi, Kanagawa Prefecture In-house Hitachi Software Engineering Co., Ltd. 81 Hitachi Software Engineering Co., Ltd. In-house F-term (reference) 5B049 AA06 BB11 CC40 EE02 EE05 EE32 FF01 5H180 AA15 BB04 FF10 FF17

Claims (9)

[Claims] 1. A computer system comprising at least an input / output device, a processing device, and a storage device, and a portable computer system for inputting picked-up package information are connected by a communication line, and are transported between bases via a relay point. A method for creating a transportation plan for a vehicle, comprising: a luggage counting step for counting the luggage of the pickup / delivery vehicle at each base; and a pickup for inputting the operation status of the pickup / delivery vehicle and managing a return time to the base to which the collection / delivery vehicle belongs. A status management step, a collection status transmission step of transmitting the collection vehicle information including the collection baggage information collected at each location and a return time to the location of the collection vehicle to a representative location having jurisdiction over a plurality of locations, and a transportation location of the day. Same day flight operation plan registration processing step of registering transportation flight information between the same day, and relay base operation registration of the same day relay point operation plan including whether or not transshipment of luggage between transportation flights at the same day of transportation is possible And planning registering step, transportation planning method characterized by and a transportation schedule creation step of creating a transportation schedule of transportation facilities by collection and delivery vehicles comprising a relay scheme luggage transshipment over the base between transport flights. 2. A method for preparing, by a computer system, a transportation plan of a transportation service between bases via a relay point, comprising at least an input / output unit, a processing unit, and a storage unit, wherein the collection of pickup vehicles at each base is performed. A baggage totaling step for totalizing luggage, a collection state management step for inputting the operation status of the pickup / delivery vehicle, and managing a return time to the base to which the pickup / delivery vehicle belongs, and a collection baggage information collected at each base and the base of the pickup vehicle. A pickup status transmission step of transmitting pickup vehicle information including a return time to a representative base that manages a plurality of bases; a same-day flight operation plan registration processing step of registering transport flight information between transport bases of the same day; A relay base operation plan registration step for registering a relay point operation plan on the day including whether or not transshipment of luggage between transportation flights at the transportation base is possible, and a transfer of luggage at a transit base between transportation flights. A transportation plan creation step of creating a transportation plan of a transportation flight including a connection plan. 3. A transportation service between bases via a communication line, wherein a computer system having at least an input / output device, a processing device, and a storage device is connected to a portable computer system for inputting pickup luggage information by a communication line. A method of creating a transportation plan for each vehicle, including a luggage counting step for collecting the luggage of the pickup and delivery vehicles at each base, and a pickup for inputting the operation status of the pickup and delivery vehicles and managing the return time to the base to which the pickup and delivery vehicle belongs. A status management step, a step of managing the collected luggage information including the collected luggage information collected at each base and the time at which the picked-up vehicle returns to the base, and a same-day flight operation plan registration for registering the transport flight information between the transport bases of the day. A processing step, a transit point operation plan registration step of registering a transit point operation plan on the day including whether or not transshipment of transit between transit flights at the transit point on the day, and a luggage load at transit point between transit flights A transportation plan creation step of creating a transportation plan of a transportation flight including a transfer plan of the exchange. 4. In the relay operation plan registration step, in addition to the information on whether or not luggage can be reloaded at a relay point for each location, a luggage reloadable time frame, a cost required for reloading, 4. The method according to claim 1, further comprising the step of inputting the relay point operation information including the transfer capacity of the transportation schedule. 5. An operations research method including a linear programming method in the transportation plan creation step, in order to create a transportation plan in which the total of the cost of each transportation flight and the cost of transshipment at the transit point is minimized. The method according to any one of claims 1 to 3, wherein the method is used. 6. In the transportation plan creation step, the amount of transportable luggage when the departure time of each transportation flight is delayed, the transportation cost, and the creation of a relay plan for transshipment of luggage between transportation flights at the relay base are created. The method according to any one of claims 1 to 3, wherein: 7. The transportation plan creation step according to claim 1, wherein a plan that minimizes the sum of the cost of each transportation flight and the cost of transshipment at the transit point is created. How to create a transportation plan. 8. The plan for minimizing the sum of the cost of each transportation flight and the cost of transshipment at the transit point under the condition that the maximum amount of transshipment at the transit point is not exceeded. 4. A method for creating a transportation plan according to claim 1, wherein: 9. A collection and delivery vehicle between bases via a relay point, wherein a computer system having at least an input / output device, a processing device, and a storage device is connected by a communication line to a portable computer system for inputting pickup package information. Is a system that creates a transportation plan for each vehicle, a luggage collection unit that totals the collected luggage of the pickup and delivery vehicles at each base, and a pickup that inputs the operation status of the pickup and delivery vehicles and manages the return time to the base to which the pickup and delivery vehicle belongs Situation management means; Pickup status transmission means for transmitting pickup vehicle information including the collection baggage information collected at each base and the time at which the pickup truck returns to the base to the representative bases in charge of multiple bases; On-the-day flight operation plan registration processing means for registering transportation service information between the same day, and a relay base operation plan registration means for registering a same-day relay point operation plan including whether or not transshipment of luggage between transportation flights at the same day of transportation is possible If, transportation planning system, characterized in that it comprises a transportation schedule creating means for creating a transport flights transportation planning by collection and delivery vehicles comprising a relay scheme luggage transshipment over the base between transport flights.