JP6779396B1 - Delivery support methods, delivery support devices, and programs - Google Patents

Abstract

PROBLEM TO BE SOLVED: To support efficient delivery in consideration of movement after parking a vehicle.
A delivery support method executed by an information processing device, wherein a first parking position corresponding to a first delivery destination building, a second parking position corresponding to a second delivery destination building, and the like. And the acquisition step of acquiring the above, parking at the first parking position and delivering to the first delivery destination building, moving the vehicle to the second parking position, parking and parking at the second delivery destination building. The first time required for delivery and the first delivery building and the second delivery by parking at the collective parking position which is one of the first parking position and the second parking position. A calculation step for calculating the second time required for delivery to the destination building, or the difference between the first time and the second time, and the second time are shorter than the first time. In some cases, it includes a proposed step of proposing to park in the bulk parking position and deliver to the first delivery building and the second delivery building.
[Selection diagram] Fig. 3

Description

The present invention relates to delivery support methods, delivery support devices, and programs.

In recent years, it has been required to improve the efficiency of delivering packages. Therefore, a technology for selecting a parking place that improves delivery efficiency based on the actual parking place of the delivery vehicle, and a delivery plan in which the parking place of the delivery vehicle is specified for each group by grouping the packages by delivery destination are generated. Techniques have been proposed (eg, Patent Documents 1-5).

Japanese Unexamined Patent Publication No. 10-221104 Japanese Unexamined Patent Publication No. 2004-4021 Japanese Unexamined Patent Publication No. 2006-168914 Japanese Unexamined Patent Publication No. 2008-27100 Japanese Unexamined Patent Publication No. 2010-78571

In the above technology, a traveling route is automatically generated by connecting a plurality of delivery destination points on a map, but the emphasis is on the selection of the traveling route and the prediction of the traveling time. That is, the moving time of the vehicle is minimized.

However, in fields such as so-called home delivery, the delivery time on foot after parking also has a large effect on the entire delivery plan. This effect is even greater in areas with dense delivery destinations, such as urban areas. Skilled delivery personnel have empirically grasped when it is appropriate to carry out bulk delivery, but such a judgment is difficult for inexperienced delivery personnel. It is desired to construct an algorithm capable of creating a delivery plan similar to that of a skilled delivery person, but it is difficult to generate such an efficient delivery plan by the above-mentioned prior art.

An object of the present invention is to support efficient delivery in consideration of movement after parking of a vehicle.

A first aspect of the present invention is a delivery support method executed by an information processing device.
An acquisition step to acquire a first parking position corresponding to the first delivery destination building and a second parking position corresponding to the second delivery destination building.
A first required to park in the first parking position and deliver to the first delivery destination building, move the vehicle to the second parking position, park and deliver to the second delivery destination building. To park at one of the first parking position and the second parking position, and to deliver to the first delivery destination building and the second delivery destination building. A calculation step for calculating the required second time or the difference between the first time and the second time, and
With the proposal step of proposing to park in the collective parking position and deliver to the first delivery destination building and the second delivery destination building when the second time is shorter than the first time. ,
including.

Here, the first delivery destination building and the second delivery destination building may be scheduled for delivery in this order, or may be scheduled for delivery in the opposite order.

According to this aspect, it is possible to determine whether or not it is efficient to perform bulk delivery in consideration of the time required for walking after parking the vehicle by a simple process, and more efficient delivery support is possible. It becomes.

In this embodiment, the candidate for the collective parking position may be either the first parking position or the second parking position. For example, in the calculation step, the collective parking position is determined as the first parking position, and the second time is parked at the first parking position to the first delivery destination building and the second. It may be decided based on the time required for delivery to the destination building. By doing so, the processing becomes simpler, high-speed determination becomes possible, and sufficiently efficient proposals can be made.

The proposal in this embodiment may be made at any time, for example, it may be executed before the delivery by the delivery person is started, or it may be executed during the delivery by the delivery person. In the case of execution during delivery, in the acquisition step, the first parking position is acquired from the terminal possessed by the delivery person, and in the proposed step, when the second time is shorter than the first time. , A notification proposing delivery to the first delivery destination building and the second delivery destination building while parked in the first parking position may be transmitted to the terminal.

In this embodiment, the first parking position is a parking position estimated to be optimal when delivering to the first delivery destination building, and the second parking position is the second delivery destination building. It is preferable to use a parking position that is presumed to be optimal for delivery to. The method of obtaining the parking position estimated to be optimal when delivering to each delivery destination building is not particularly limited. One parking position may be manually set for the delivery destination building in advance, or may be set based on historical data of past delivery behaviors (including parking behaviors).

In the acquisition step of this aspect, a plurality of parking positions may be acquired for one delivery destination building. That is, in the acquisition step, at least one of the first parking position and the second parking position may be acquired. In this case, in the calculation step, the first time is determined based on the minimum time required for each combination of the first parking position and the second parking position. The second time may be determined based on the minimum of the required times required for each of the first parking position and the second parking position. In this way, even if a plurality of parking positions can be obtained for one delivery destination building, it is possible to determine the bulk delivery.

In this embodiment, after it is determined that the delivery to the first delivery destination building and the second delivery destination building should be combined, it is determined whether or not the delivery to yet another delivery destination building can be combined. You may. For example, when the second time is shorter than the first time, a third parking position corresponding to the third delivery destination building is further acquired, and the parking position is parked at the collective parking position to obtain the first parking position. And the third time required to deliver to the second delivery destination building, move the vehicle to the third parking position, park and deliver to the third delivery destination building, the summary parking position and the said. The fourth time required to park in the second summary parking position, which is one of the third parking positions, and deliver to the first to third delivery destination buildings, or the third time and the above. A fourth time difference is calculated, and when the fourth time is shorter than the third time, the vehicle is parked at the second summary parking position and delivered to the first to third delivery destination buildings. You may propose to do so.

In the proposed step of this aspect, when the second time is shorter than the first time, the vehicle is parked in the collective parking position and is placed in the first delivery destination building and the second delivery destination building. If a delivery plan for delivery is proposed and the first time is shorter than the second time, the vehicle is parked in the first parking position and delivered to the first delivery destination building, and the delivery is performed. A delivery plan may be proposed for parking at a second parking position and delivering to the second delivery destination building.

Another aspect of the invention is a delivery support device comprising means for performing each step of the above method. Yet another aspect of the invention is a program for causing a computer to perform each step of the method described above. Yet another correspondence of the present invention is a delivery support device including a processor and a storage device that stores the above program.

According to the present invention, it is possible to support efficient delivery in consideration of movement after parking the vehicle.

Schematic configuration diagram of the system according to the embodiment A flowchart showing the entire delivery plan creation process in the embodiment. Flow chart showing details of summary processing in the first embodiment The figure explaining the time required for the delivery performed by parking individually and the bulk delivery. Diagram explaining the summary process Flow chart showing details of summary processing in the second embodiment Flow chart showing details of summary processing in the third embodiment A schematic configuration diagram of the system according to the fourth embodiment and a flowchart for closing the processing flow.

In the conventional delivery plan, one parking position is generally associated with one delivery destination building. In the present embodiment, it is determined whether or not to combine the parking positions for a plurality of delivery destination buildings into one in consideration of the time required for the delivery action after the delivery vehicle is parked.

[Glossary]
Before going into a detailed description, a description of terms herein will be given.

“Delivery” refers to the process of delivering multiple packages to their respective destinations. "Delivery" refers to the process of delivering a package to one destination included as a component of "delivery". Delivery typically involves shipping packages from a warehouse, passing through one or more transit points, and delivering from the nearest point to the destination.

"Delivery address" refers to the delivery address of the package. The delivery address may be determined according to the delivery address, or may be determined for each recipient. "Delivery building" refers to the delivery building. A delivery building includes one or more delivery destinations.

"Bulk delivery" refers to stopping a delivery vehicle at one parking position and delivering to multiple delivery destination buildings. "Bulk parking position" refers to the parking position when performing bulk delivery.

<First Embodiment>
[System configuration]
FIG. 1 is a schematic configuration diagram of a system according to the present embodiment. As shown in FIG. 1, the system according to the present embodiment includes a delivery plan creation server 1 and a delivery information management server 2.

The delivery plan creation server 1 (hereinafter, also simply referred to as a server 1) is a computer (information processing device) having a processor 11, a communication device 12, an input device 13, an output device 14, and a storage device 15. The processor 11 may be a single processor, a multiprocessor, or one processor may have a plurality of cores. Processors are CPU (Central Processing Unit), DSP (Digital Signal Processor), GPU (Graphics Processing U)
It may be a nit), a math processor, or a vector processor. The storage device 15 is RA
It includes a volatile main storage device such as M and a non-volatile auxiliary storage device such as SSD (Solid State Disk) or HDD (Hard Disk Drive).

The storage device 15 stores the programs of the delivery destination information acquisition module 16, the parking position acquisition module 17, the delivery order determination module 18, the summary processing module 19, and the delivery plan output module 20. The function of each module is realized by the processor 11 executing the program stored in the storage device 15. Details of the functions of each module will be described below.

The delivery information management server 2 (hereinafter, also simply referred to as server 2) is also a computer similar to the server 1 and holds information on delivery. The delivery information includes, for example, a delivery address, a recipient's name, a designated delivery date and time, etc., which are determined for each package.

The server 1 and the server 2 are connected to each other so as to be able to communicate with each other via the network N. Therefore, the server 1 can acquire the delivery information from the server 2.

[processing]
FIG. 2 is a flowchart showing the entire delivery plan creation process performed by the server 1 according to the present embodiment. FIG. 3 is a flowchart showing the details of the summary process in the delivery plan creation process. FIG. 4 is a diagram illustrating the time required for delivery when bulk delivery is performed and when it is not performed. FIG. 5 is a diagram illustrating a specific example of the summary process.

In step S1, the processor 11 that executes the program of the delivery destination information acquisition module 16 acquires the delivery destination information of the package to be delivered on a specific day (or period) from the delivery information management server 2. The information to be acquired includes the delivery address of each package, and the delivery building can be identified from the delivery address.

In the following, for the sake of simplification of the description, it will be described that the processor executes the program of a module and performs the processing, that the module performs the processing. For example, step S1 is expressed as a process in which the delivery destination information acquisition module 16 acquires delivery destination information.

In step S2, the parking position acquisition module 17 determines (acquires) a parking position according to each delivery destination building. In the present embodiment, the parking position according to the delivery destination building is the parking position estimated to be optimal when individually delivering to the delivery destination building. The method of determining the parking position according to the delivery destination building is not limited to a specific method. For example, it is conceivable to determine the parking position for each building in advance. This preset setting may be performed manually by the administrator, or may be performed by analyzing the historical data of the parking position in the past delivery by a computer. The parking position determination process may be performed by the server 1, or the determination process itself may be performed by a device other than the server 1 (for example, the server 2), and the server 1 may only acquire the result.

In step S3, the delivery order determination module 18 determines (acquires) the delivery order of each delivery destination. The method for determining the delivery order is not limited to a specific method, and any known algorithm can be adopted. The delivery order is typically determined as an optimization problem of maximizing the number of packages delivered per hour, with the constraint of keeping the specified delivery date and time. The delivery order determination process may be performed by the server 1, or the determination process itself may be performed by a device other than the server 1 (for example, the server 2), and the server 1 may only acquire the result.

Here, according to the delivery order, representing the delivery destination building _{D 1,} D 2, · · ·, and _{D N.} Further, it represents a parking position corresponding to the respective delivery point buildings _{P 1,} P 2, · · ·, and _{P N.} N is an integer representing the number of delivery destination buildings. However, even if the delivery is to the same delivery destination building, if the designated delivery date and time are different, the same delivery destination building having a different delivery order is counted as one and N is determined.

FIG. 5A shows an example of the delivery plan obtained at this point. Dotted arrows in the figure indicate movement on foot, and solid arrows indicate movement by vehicle. In addition, the rounded squares indicate a combination of a parking position and a delivery destination building that is parked and delivered at that parking position. In this example, _three delivery destination buildings, D _{1 to} D ₃ , are obtained, and parking positions P _{1 to} P ₃ are obtained corresponding to each. In this case, first parked in the parking position P ₁ performs the delivery of on foot to the delivery destination building D _1, performs a delivery on foot to the parking position P ₂ moving and parked the vehicle to the delivery destination building D _2, parking position carry out the delivery on foot to P ₃ moving and parked the vehicle to the delivery destination building D _3, delivery plan that can be obtained.

In step S4, the summary processing module 19 performs a process (referred to as a summary process) of sharing parking positions with respect to a plurality of delivery destination buildings.

FIG. 3 is a flowchart showing a detailed flow of the summary process S4. Summary process S4 is loop L1 formed of the processing in step S401~S404 are each delivery destination Building _{D i (i = 1,2, ···} , N-1) is performed on.

In step S401, the summarizing processing module 19, and delivered on foot delivery point building D _i parked in the parking position P _i, to move the vehicle to the parking position P _{i + 1,} the delivery destination building parked in the parking position P _{i + 1} Calculate the time Ta required to deliver to _{Di + 1} on foot. Time Ta corresponds to the "first time" in the present invention.

The calculation of the required time Ta will be described in more detail with reference to FIG. 4A. As shown in FIG. 4A, the required time Ta is obtained as the total of the following times (1) to (11).

(1) Time to prepare for taking out luggage and trolley from the vehicle at parking position P ₁ (2) Time to walk from parking position P ₁ to delivery destination building D ₁ (3) Arrival at delivery destination building D ₁ Time to deliver in the building and get out of the building (4) Time to walk from the delivery destination building D ₁ to the parking position P ₁ (5) Time to prepare for departure such as storing the trolley in the vehicle (6) parking position P ₁ from the parking position P ₂ until time to move the vehicle (7) parking position P time to park the vehicle in ₂ (8) parking position P ₂ preparation time, such as taking out baggage and carriage in ( 9) Time to walk from parking position P ₂ to delivery destination building D ₂ (10) Time from arrival at delivery destination building D ₂ to delivery within the building and exit from the building (11) Delivery Time to walk from the previous building D ₂ to the parking position P ₂ Here, the luggage removal time (1) (8), departure preparation time (5), and parking time (7) are preset as fixed times. Can be done. However, the time may be changed according to the number and weight of packages to be delivered.

The walking time (2), (4), (9), and (11) and the vehicle moving time (6) can be calculated from the moving distance and the average moving speed. The moving distance is obtained as the route length by searching the route between two points. The average moving speed can be set in advance for both walking and vehicle movement.

The time (3) and (10) required for delivery within the building can be set in advance for each building or for each building attribute (for example, size, number of elevators, procedure at the time of admission, etc.). Further, since this time changes according to the number of delivery destinations, it is advisable to set a calculation formula or a look-up table in which the number of delivery destinations is a variable.

In step S402, the summarizing processing module 19 calculates the time Tb required for delivery on foot parked in the parking position _{P i} to the delivery point buildings _{D i} and delivery destination buildings _{D i + 1.} The time Tb can be said to be the time required for the collective delivery with the parking position _Pi as the collective parking position, and corresponds to the "second time" in the present invention.

The calculation of the required time Tb will be described in more detail with reference to FIG. 4B. As shown in FIG. 4B, the required time Tb is obtained as the sum of the following times (1) to (3) and (9') to (11').

(1) Time to prepare for taking out luggage and trolley from the vehicle at parking position P ₁ (2) Time to walk from parking position P ₁ to delivery destination building D ₁ (3) Arrival at delivery destination building D ₁ Time to leave the building after delivery in the building (9') Time to walk from the delivery destination building D ₁ to the delivery destination building D ₂ (10) After arriving at the delivery destination building D ₂ , Time to leave the building after delivery in the building (11') Time to walk from the delivery destination building D ₂ to the parking position P ₁ Time of these (1) (2) (3) (10) ) Can be regarded as almost the same as above. Further, the walking travel time (9') (11') is different from the walking travel time (9) (11), but can be obtained by the same process. The route for walking from the delivery destination building D ₁ to the delivery destination building D ₂ may or may not pass through the parking position P ₁ . When passing through the parking position P _1, the delivery person is first performed delivery takes out the baggage delivery destination building D ₁ destined removed luggage delivery destination building D ₂ addressed when it comes back to the vehicle from the vehicle You may. In this case, the time required for baggage removal may be added to the above time (9').

In step S403, the summary processing module 19 determines which of the time Ta and the time Tb is larger. If the time Tb is shorter than the time Ta (S403-YES), the process proceeds to step S404, otherwise the loop process L1 is repeated.

Since it is sufficient to know the magnitude relationship between the time Ta and the time Tb in this way, it is not necessary to obtain the respective times in steps S401 and S402. Only the above times (4) to (9), (11), (9'), and (11') regarding the difference between the time Ta and the time Tb are obtained, and (4) + (5) + (6) + The difference between the time Ta and the time Tb may be obtained by (7) + (8) + (9) + (11)-(9')-(11'). That is, as in the time (1), (2), (3), and (10), the difference may be calculated without considering the same or substantially equal time by the two methods.

In step S404, the summarizing processing module 19, a parking position corresponding to the delivery destination building _{D i + 1} is updated from _{P i + 1} to _{P i.} That is, when the direction of the time Tb is shorter than the time Ta, who make a one delivery is because it is efficient, the parking position corresponding to the delivery destination building D _i and D _{i + 1} and P _i.

Therefore, when the time Tb is shorter than the time Ta (S403-YES), the parking position P
A delivery plan (delivery plan) is created indicating that _i is collectively delivered to the delivery destination buildings _Di and _{Di + 1} with _i as the parking position. On the other hand, is shorter than the time Ta is the time Tb (S403-NO), not the Summary delivery, parked in the parking position _{P i} and delivered to the delivery destination building _{D i,} and parked in the parking position _{P i + 1} A delivery plan (delivery plan) indicating delivery to the delivery destination building _{Di + 1} is created.

The above processes S401 to S404 are executed while incrementing i. That is, according to the process of the present embodiment, when parked in some parking position P _i that corresponds to a particular delivery address building D _i, who was delivered delivery destination building D _{i + 1} also collectively have or not efficient or Judge in order. Further, when it is more efficient to deliver the delivery destination building _Di and _{Di + 1} together, it is determined whether it is more efficient to deliver the delivery destination building _{Di + 2} together.

Specifically, parked in parking position P _i deliver walking the delivery destination building D _i and D _{i + 1,} once moved by the vehicle to the parking position P _{i + 2} back to the vehicle, parked in the parking position P _{i + 2} Calculate the time Ta'(third time) required for delivery to the delivery destination building _{Di + 2} on foot. The calculated delivery destination building _D i parked in the parking position _{P i, D i + 1,} D i + 2 time required to deliver on foot Tb '(the fourth time). These times are shown as Ta and Tb in the flowchart of FIG. 3, but here they are represented as Ta'and Tb'to clarify that they are the times required in the next loop processing. Further, the parking position P _i parked time required to delivery the delivery destination building D _i in the is not calculated, the time Ta 'and Tb' for the difference it is necessary to obtain the above time common to both Does not have to be asked. However, the time Ta'and Tb' may be obtained including this time.

In this way, as long as bulk delivery is efficient, parking positions will be grouped together.

This will be specifically described with reference to FIGS. 5A to 5C. FIG. 5A shows the relationship between the delivery destination and the parking position at the start of the summary process S4, and different parking positions P _{1 to} P ₃ are associated with the delivery destination buildings D _{1 to} D ₃ .

The first loop L1, namely, when the i = 1, for delivery to the delivery address building _{D 1} and the parking position _{P 1} and the delivery destination building _{D 1} and _{D 2,} respectively parked in _{P 2} corresponding to the _{D 2} time required for the time required to deliver to both the delivery destination building D ₁ and D ₂ parked in the parking position P ₁ are compared. Here, if it is determined that the time required for the bulk delivery is shorter, the parking position with respect to the delivery destination building D ₂ is updated to P ₁ as shown in FIG. 5B. In FIG. 5B, the movement from the delivery destination building D ₁ to the delivery destination building D ₂ goes through the parking position P ₁ , but as described above, the passage through the parking position P ₁ is not essential.

In the next loop processing, i is incremented so that i = 2. At this point, the parking position corresponding to the delivery destination building D ₂ is P ₁ . Thus, the parking position P ₁ and P ₃ to the time required to delivery the delivery destination buildings D ₂ and D ₃ respectively parked with the parking to the parking position P ₁ on both the delivery point Building D ₂ and D ₃ The time required for delivery is compared. In practice, when parked in the parking position P _1, while the delivery against the delivery destination building D ₂ via is performed delivery destination building D _1, to complete the delivery to the delivery destination building D ₂ The time required to complete is common to both delivery methods and does not need to be considered. If towards the parking position duration Summary delivery delivery destination building D ₁ to D ₃ of the parked in P ₁ is short, as shown in FIG. 5C, the parking position corresponding to the delivery destination building D3 is updated to P1 To. On the other hand, if the time required for individual delivery to the delivery destination buildings D _{1 to} D ₂ and the delivery destination building D ₃ parked at the parking positions P ₁ and P ₃ , respectively, is shorter, the correspondence between the delivery destination building and the parking position Remains in FIG. 5B.

If the number of delivery destination buildings is 3 (N = 3), the process is confirmed by the above, but if the number of delivery destination buildings is 4 or more, the above process is further repeated.

Returning to FIG. 2, in step S5, the delivery plan output module 20 generates and outputs a delivery plan including at least the correspondence between each delivery destination building and the parking position. It can be said that the output delivery plan is the delivery plan proposed by the server 1. In addition to the correspondence between the delivery destination building and the parking position, the delivery plan may include other information such as the travel route of the delivery vehicle.

[Advantageous effect]
According to this embodiment, an efficient delivery plan can be generated by a simple process. It is difficult for a person who is not a delivery expert to accurately grasp which combination of delivery destination buildings should be delivered in bulk or not, but by using this embodiment, an unskilled delivery person can be notified. Appropriate delivery plans can be proposed, and even unskilled workers can deliver as efficiently as skilled workers.

In this embodiment, as a candidate for a parking position (collective parking position) for bulk delivery, a parking position for individual delivery is used, and a new parking position for bulk delivery is not searched. .. Therefore, there are advantages that the processing is simple and high speed, and that the delivery person does not have to park in an unfamiliar parking position for bulk delivery. It has been confirmed that sufficiently efficient bulk delivery is possible without searching for a new parking position for bulk delivery.

<Second Embodiment>
In the first embodiment, the collective parking position is the parking position corresponding to the delivery destination building where the delivery is performed earlier in time. That is, the parking position when delivering collectively the delivery destination building D _i and D _{i + 1} was parking position P _i corresponding to the delivery destination building D _i. In this embodiment, also the parking position P _{i + 1} corresponding to the delivery destination building D _{i + 1} as a candidate for collectively parking position.

The configuration and processing of this embodiment are basically the same as those of the first embodiment, and only the content of the parking position summarizing process S4 is different. Hereinafter, the summary process S4 in the present embodiment will be described with reference to FIG. The basic structure of determining whether or not to arrange the parking positions in order by the loop process L1 is the same as that of the first embodiment.

The calculation of the required time Ta and Tb in steps S401 and S402 is the same process as in the first embodiment.

In step S411, the summarizing processing module 19 calculates the time Tc required for delivery on foot parked in the parking position _{P i + 1} to the delivery point buildings _{D i} and delivery destination buildings _{D i + 1.} Since the calculation process is the same as the time Tb calculation in step S402, the repeated description will be omitted.

In step S412, the summary processing module 19 determines which of the above times Ta, Tb, and Tc is the shortest.

When the time Ta is the shortest, the loop process L1 is repeated without doing anything.

Time when Tb is the shortest, the process proceeds to step S413, the summarizing processing module 19 updates the parking position corresponding to the delivery destination building _{D i + 1} to _{P i.} In this case, the same parking positions as in the first embodiment (FIG. 5B, etc.) will be summarized.

Time when Tc is the shortest, the process proceeds to step S414, the summarizing processing module 19 updates the parking position corresponding to the delivery destination building _{D i} to _{P i + 1.}

The present embodiment can also be regarded as an embodiment in which the shorter of the time Tb and the time Tc is determined as the time Tb (second time) in the first embodiment. That is, in the present embodiment, both the parking positions _Pi and _{Pi + 1} are candidates for the collective parking position.

According to this embodiment, the possibility of bulk delivery can be further increased. For example, in the example of FIG. 5A, although the required time than the individual delivery when the summarized delivery from the parking position P ₁ becomes longer, even if the required time than the individual delivery when making a one delivery from the parking position P ₂ is shortened presence To do. In the present embodiment, it is possible to propose a bulk delivery even in such a case, so that more efficient delivery can be realized.

<Third Embodiment>
In the first and second embodiments, an example in which one parking position is acquired for one delivery destination building has been described in the parking position acquisition step S2. The present embodiment proposes a process suitable when one or more parking positions are acquired for one delivery destination building.

The configuration and processing of this embodiment are basically the same as those of the first embodiment, and mainly differ only in the content of the parking position summarizing process S4. However, since a plurality of parking position for one delivery address building may correspond, after decided delivery order in step S3, the parking position corresponding to the delivery destination building D _i P _{i, j (j} = 1, 2, ... _Ni ). N _i is the number of parking position corresponding to the delivery destination building D _i.

FIG. 7 is a flowchart showing the parking position summarizing process S4 in the present embodiment. The basic structure of determining whether or not to arrange the parking positions in order by the loop process L1 is the same as that of the first embodiment.

In step S421, the summarizing processing module 19, park position _{P i,} parked _j is delivered to the delivery destination building _{D i,} required for delivery to the delivery address building _{D i + 1} parked in a parking position _{P i + 1, k} The time is calculated for all combinations of j and k. Thus, _{N i} × _{N i +} time required for types ₁ are obtained. The minimum required time among them is stored as Ta. In addition, each parking position that gives the minimum value is stored as _Pi and _{Pi + 1} .

In step S422, the summary processing module 19 determines the time required for collective delivery to the delivery destination building _Di and the delivery destination building _{Di + 1} by parking at either the parking position Pi, _j or the parking position _{Pi + 1, k.} , For all j and k. _{Thus, N i +} N i ₊ time required for types ₁ are obtained. The minimum required time among them is stored as Tb. Also stored as the parking position and the P _i that gives the minimum value

In step S423, the summary processing module 19 determines which of the time Ta and the time Tb is larger. If the time Tb is shorter than the time Ta (S423-YES), the process proceeds to step S424, both the parking position corresponding to the delivery destination building _{D i} and delivery destination buildings _{D i + 1} is set to the parking position _{P i.} On the other hand, is shorter than the time Ta is the time Tb (S423-NO), the process proceeds to step S425, the delivery point buildings _{D i} and delivery destination buildings _{D i} parking position _{+ 1} corresponding parking position to each _{P i} and _{P i + 1} Set to.

According to the present embodiment, it is possible to propose a batch delivery even when there are a plurality of parking position candidates for the delivery destination building. In addition, even in the case of individual delivery instead of bulk delivery, it is possible to propose where among a plurality of parking position candidates it is efficient to park.

<Fourth Embodiment>
Each of the first to third embodiments assumes that a delivery plan is generated before the delivery is executed. In the present embodiment, it is proposed to the delivery person who is delivering whether or not to perform bulk delivery.

FIG. 8A is a schematic configuration diagram of the system according to the present embodiment. As shown in FIG. 1, the system according to the present embodiment includes a delivery plan creation server 1 and a deliveryman terminal 3.

The delivery plan creation server 1 basically has the same configuration as the above embodiment. The deliveryman terminal 3 is a terminal possessed by the deliveryman, and is a computer (information processing device) having a processor 31, a communication device 32, an input device 33, an output device 34, and a storage device 35. The delivery person terminal 3 is further provided with a GPS device 36 and can acquire position information. The deliveryman terminal 3 performs the following processing by executing the program stored in the storage device 35 by the processor 31. Although the delivery information management server 2 is not shown in FIG. 8A, the delivery information management server 2 may be included in the system.

FIG. 8B is a diagram illustrating a flow of processing in the present embodiment.

In step S41, the deliveryman terminal 3, for delivery to the delivery destination building D _i, detects that the delivery person is parked delivery vehicle. This detection may be performed in any way, and for example, it is conceivable to detect an explicit input made by the delivery person to the delivery person terminal 3 as a trigger. In addition, for example, the deliveryman terminal 3 may detect the engine stop of the delivery vehicle and / or the opening of the loading platform door (rear door) as a trigger. Note that it is delivered to the delivery destination building D _i is the delivery member is may be explicitly input to the delivery member terminal 3, the delivery member terminal 3 may be determined with reference to the delivery plan.

In step S42, the deliveryman terminal 3 acquires the current position information from the GPS device 36 and transmits it to the server 1. Here, the position information is acquired from the GPS device of the deliveryman terminal 3, but the position information may be acquired from the GPS device mounted on the delivery vehicle. Further, any position information acquisition means other than the GPS device may be used.

In step S43, the server 1 acquires information on the future delivery destination building and the corresponding parking position related to the deliveryman terminal 3 to which the location information has been transmitted. When the delivery plan is stored in the server 1, it may be read from the storage device, or the information may be acquired from the delivery person terminal 3. Note that the server 1, a parking position P _i corresponding to the current delivery point buildings D _i, is set to a position information transmitted from the delivery member terminal 3.

In step S44, the server 1 executes the parking position summarization process for the delivery destination building _{Di and} thereafter. This process is basically the same as the summary process S4 in the first embodiment. The difference is that the exit and that loop L1 starts from the current delivery point buildings D _i, the loop L1 at the time of the determination (S403-NO) and is more efficient than delivery summarized better separate delivery Is. That is, the server 1, the delivery destination building D _{i + 1} also summarizes determine whether it is better to deliver it in accordance with the delivery to the delivery destination building D _i, who collectively deliveries if efficient, further delivery destination building D Determine if it is more efficient to combine _{i + 2} . This is repeated until bulk delivery is determined to be inefficient.

In step S45, the server 1 transmits the information of the summary processing result to the delivery person terminal 3. This information includes information about the correspondence between the delivery destination building and the parking position determined in step S44. More specifically, this information preferably includes at least the delivery destination building to be delivered at the current parking position, and the next delivery destination building and the parking position at that time.

In step S46, the deliveryman terminal 3 presents the information received from the server 1 to the deliveryman as a proposal for a delivery plan. For example, delivery member terminal 3, if efficient be combined to one previous delivery point, "performs delivery summarized in the delivery destination building D ₁ and D ₂ from the current parking position, subsequent parking position P ₃ carry out the proposal of content for delivery moved to the delivery destination building D ₃ is more efficient "that. On the other hand, if efficient better separate delivery without summary delivery, postman terminal 3 "performs delivery the delivery destination building D ₁ from the current parking position, and moved to subsequent parking position P ₂ carry out the proposal of content for delivery to the delivery destination building D ₂ is more efficient "that.

According to the present embodiment, it is possible to propose a bulk delivery even if the delivery plan is not predetermined and the delivery person does not park at the parking position according to the delivery plan.

<Modification example>
In the above description, the delivery plan as a result of the summary processing is output as it is, but it is also preferable to check whether the delivery plan after the summary process satisfies the condition of the designated delivery date and time. If the delivery time is shortened to some extent by bulk delivery, the delivery plan may be readjusted by adjusting the delivery order of each delivery destination building again or including new packages in the packages to be delivered. Good.

Further, in the above description, when the required times of the bulk delivery and the individual delivery are equal, the individual delivery is performed, but in this case, the bulk delivery may be selected. Further, when the time required for the bulk delivery and the individual delivery are equal, it is possible to select whether to perform the bulk delivery or the individual delivery in consideration of other conditions.

In the above example, each function of the device is realized by the processor executing the program, but some or all the functions are realized by a dedicated hardware circuit such as an ASIC (Application Specific Integrated Circuit). You may.

[Computer readable recording medium]
A program that realizes the above functions on a computer or other machine or device (hereinafter, computer or the like) can be recorded on a non-temporary recording medium that can be read by the computer or the like. Then, the function can be provided by causing a computer or the like to read and execute the program of this recording medium.

Here, a non-temporary recording medium that can be read by a computer or the like means that information such as data or a program is stored by electrical, magnetic, optical, mechanical, or chemical action and read from the computer or the like. A recording medium that can be used. Among such recording media, those that can be removed from a computer or the like include, for example, SSD, flexible disk, magneto-optical disk, CD-ROM, CD-R / W, DVD, Blu-ray disk, DAT, 8 mm tape, flash memory, etc. There is a memory card etc. Further, as a recording medium fixed to a computer or the like, there are a hard disk, an SSD, a ROM, and the like.

1: Delivery plan creation server 11: Processor 12: Communication device 13: Input device 13: Output device 15: Storage device 16: Delivery destination information acquisition module 17: Parking position acquisition module 18: Delivery order determination module 19: Summary processing module 20 : Delivery plan output module

Claims (15)

A delivery support method executed by an information processing device.
An acquisition step to acquire a first parking position corresponding to the first delivery destination building and a second parking position corresponding to the second delivery destination building.
A first required to park in the first parking position and deliver to the first delivery destination building, move the vehicle to the second parking position, park and deliver to the second delivery destination building. To park at one of the first parking position and the second parking position, and to deliver to the first delivery destination building and the second delivery destination building. A calculation step for calculating the required second time, or a difference in which the magnitude relationship between the first time and the second time can be grasped , and
With the proposal step of proposing to park in the collective parking position and deliver to the first delivery destination building and the second delivery destination building when the second time is shorter than the first time. ,
Delivery support methods, including. In the calculation step,
With the summary parking position as the first parking position,
The second time is determined based on the time required to park in the first parking position and deliver to the first delivery building and the second delivery building.
The delivery support method according to claim 1. In the acquisition step, the first parking position is acquired from the terminal possessed by the delivery person.
In the proposed step, when the second time is shorter than the first time, the vehicle is delivered to the first delivery destination building and the second delivery destination building while being parked in the first parking position. Send a notification suggesting that to the terminal,
The delivery support method according to claim 1 or 2. The first parking position is a parking position that is presumed to be optimal when delivering to the first delivery destination building.
The second parking position is a parking position that is presumed to be optimal when delivering to the second delivery destination building.
The delivery support method according to any one of claims 1 to 3. In the acquisition step, at least one of the first parking position and the second parking position is acquired.
In the calculation step, the first time is determined based on the minimum time required for each of the combinations of the first parking position and the second parking position, and the second time is determined. The time is determined based on the minimum of the required times required for each of the first parking position and the second parking position.
The delivery support method according to any one of claims 1 to 3. Further, when the second time is shorter than the first time,
Acquire a third parking position corresponding to the third delivery building,
A third required to park at the summary parking position and deliver to the first and second delivery destination buildings, move the vehicle to the third parking position, park and deliver to the third delivery destination building. A fourth time required to park at the second collective parking position, which is one of the collective parking position and the third parking position, and deliver to the first to third delivery destination buildings. Calculate the time or the difference in which the magnitude relationship between the third time and the fourth time can be grasped .
When the fourth time is shorter than the third time, it is proposed to park at the second summary parking position and deliver to the first to third delivery destination buildings.
The delivery support method according to any one of claims 1 to 5. In the proposed step,
When the second time is shorter than the first time, a delivery plan is proposed in which the vehicle is parked in the collective parking position and delivered to the first delivery destination building and the second delivery destination building.
When the first time is shorter than the second time, the vehicle is parked in the first parking position, delivered to the first delivery destination building, and parked in the second parking position. Propose a delivery plan for delivery to the second delivery destination building.
The delivery support method according to any one of claims 1 to 6. An acquisition means for acquiring a first parking position corresponding to the first delivery destination building and a second parking position corresponding to the second delivery destination building.
A first required to park in the first parking position and deliver to the first delivery destination building, move the vehicle to the second parking position, park and deliver to the second delivery destination building. To park at one of the first parking position and the second parking position, and to deliver to the first delivery destination building and the second delivery destination building. A calculation means for calculating the required second time, or a difference capable of grasping the magnitude relationship between the first time and the second time.
When the second time is shorter than the first time, the proposing means for proposing to park in the collective parking position and deliver to the first delivery destination building and the second delivery destination building. ,
Including delivery support equipment. The summary parking position is the first parking position.
The calculation means determines the second time based on the time required to park in the first parking position and deliver to the first delivery destination building and the second delivery destination building.
The delivery support device according to claim 8. The acquisition means acquires the first parking position from a terminal owned by a delivery person, and obtains the first parking position.
When the second time is shorter than the first time, the proposed means delivers to the first delivery destination building and the second delivery destination building while parked in the first parking position. Send a notification suggesting that to the terminal,
The delivery support device according to claim 8 or 9. The first parking position is a parking position that is presumed to be optimal when delivering to the first delivery destination building.
The second parking position is a parking position that is presumed to be optimal when delivering to the second delivery destination building.
The delivery support device according to any one of claims 8 to 10. The acquisition means acquires at least one of the first parking position and the second parking position.
The calculation means determines the first time based on the minimum time required for each of the combinations of the first parking position and the second parking position, and determines the second time. The time is determined based on the minimum of the required times required for each of the first parking position and the second parking position.
The delivery support device according to any one of claims 8 to 10. Further, when the second time is shorter than the first time,
The acquisition means acquires a third parking position corresponding to the third delivery destination building.
The calculation means includes a third time required for parking at the summary parking position and the third parking position and delivering to the first and second delivery destination buildings and the third delivery destination building. The fourth time required to park in the second summary parking position, which is one of the summary parking position and the third parking position, and deliver to the first to third delivery destination buildings, or the above. Calculate the difference that can grasp the magnitude relationship between the third time and the fourth time,
The proposed means proposes to park in the second summary parking position and deliver to the first to third delivery destination buildings when the fourth time is shorter than the third time.
The delivery support device according to any one of claims 8 to 12. The proposed means
When the second time is shorter than the first time, a delivery plan is proposed in which the vehicle is parked in the collective parking position and delivered to the first delivery destination building and the second delivery destination building.
When the first time is shorter than the second time, the vehicle is parked in the first parking position, delivered to the first delivery destination building, and parked in the second parking position. Propose a delivery plan for delivery to the second delivery destination building.
The delivery support device according to any one of claims 8 to 13. A program for causing a computer to perform each step of the method according to any one of claims 1 to 7.

Images