JP2020085811A - Information processor, information processing method and program - Google Patents

Abstract

To provide efficient delivery.SOLUTION: An information processor includes: first route searching means for searching a route to a destination using a current place of a vehicle as a departure place; first calculation means for calculating a first estimated time of arriving at the destination from a search result by the first route searching means; first determination means for determining whether or not the first estimated time calculated by the first calculation means is before a designated arrival time previously designated as an arrival time to the destination; and presentation means for presenting a passing spot which can be passed before the destination to a driver of the vehicle when the first determination means determines the first estimated time is before the designated arrival time.SELECTED DRAWING: Figure 2

Description

The present invention relates to an information processing device, an information processing method, and a program.

In recent years, in a delivery service for delivering an item using a vehicle or the like, a delivery time to a delivery destination is often designated. In such a case, not only the problem of arriving at the delivery destination after the delivery time is a problem, but the problem of arriving at the delivery destination earlier than the delivery time may be a problem. For example, when the delivery destination is a collection place or the like, even if the delivery destination arrives earlier than the delivery time, the item may not be received.

Here, as a technique for searching for a route that arrives at a destination at a designated time, for example, a technique for searching for a route that arrives at a destination at a time close to the designated time (for example, Patent Document 1) or a route that a user faces There is known a technique (for example, Patent Document 2) that searches for a route that can reach a destination at a desired time via the ground.

JP2012-141269A JP-A-2000-346667

However, the above-mentioned conventional technology has not been able to realize efficient delivery. On the other hand, for example, when the delivery destination is likely to arrive earlier than the designated delivery time (hereinafter also referred to as “designated delivery time”), the item is delivered to the delivery destination after the item is delivered to the other delivery destination. If it can be delivered, efficient delivery can be realized while keeping the designated delivery time of the delivery destination.

The present invention has been made in view of the above points, and an object thereof is to achieve efficient delivery.

In order to achieve the above object, an information processing apparatus according to an embodiment of the present invention includes a first route searching unit that searches for a route to a destination with a current position of a vehicle as a starting point, and the first route searching unit. The first calculation means for calculating a first estimated time of arrival at the destination and the first estimated time calculated by the first calculation means from the search result by the arrival time at the destination. And a first determination means for determining whether or not it is earlier than a designated arrival time designated in advance, and the first predicted time is earlier than the designated arrival time by the first determination means. When it is determined, the present invention further includes a presenting unit that presents to the driver of the vehicle a stopover point in front of the destination.

Efficient delivery can be realized.

It is a figure which shows an example of the whole structure of the delivery assistance system which concerns on this embodiment. It is a figure for explaining typically an example of efficiency improvement of a delivery order. It is a figure which shows an example of the hardware constitutions of a computer. It is a figure which shows an example of a function structure of the delivery assistance system which concerns on this embodiment. It is a figure which shows an example of a delivery plan list. It is a sequence diagram which shows an example of the transmission process of a delivery plan list. It is a sequence diagram which shows an example of the update process of a delivery plan list. It is a flow chart which shows an example of efficiency improvement processing of a delivery order. It is a figure which shows the other example of a delivery plan list.

Hereinafter, embodiments of the present invention (hereinafter, referred to as “this embodiment”) will be described with reference to the drawings. In this embodiment, a delivery support system 1 that supports efficient delivery of a vehicle (delivery vehicle) that delivers goods will be described.

Note that, in the present embodiment, as an example, when delivering some kind of article (for example, food, miscellaneous goods, furniture, home appliances, materials, mail, etc.) to a destination by vehicle, A case of improving efficiency will be described, but the case is not necessarily limited to the case of delivering goods. The present embodiment can be similarly applied to, for example, a case where a vehicle provides a visit-type maintenance service for a device or a transportation service that transports a person by a vehicle.

Further, in this embodiment, the term “delivery” is used, but “delivery” includes not only delivering or transporting an article to a destination, but also collecting an article from the destination. And

<Overall structure>
First, the overall configuration of the delivery support system 1 according to the present embodiment will be described with reference to FIG. FIG. 1 is a diagram showing an example of the overall configuration of a delivery support system 1 according to the present embodiment.

As shown in FIG. 1, the delivery support system 1 according to the present embodiment includes a management server device 10 and one or more delivery support terminals 20. The management server device 10 and each of the one or more delivery support terminals 20 are communicably connected via an arbitrary communication network N such as the Internet.

The management server device 10 is a computer or a computer system that manages the delivery destination of each vehicle that delivers the article. The management server device 10 is, for example, on a daily basis, to the delivery support terminal 20 used by the driver of each vehicle, a list of delivery destinations to which the vehicle delivers on the day (hereinafter also referred to as a “delivery plan list”). ) Is sent. Further, the management server device 10 updates the delivery plan list (for example, when the delivery destination is added or when the delivery destination is deleted, when the designated delivery time to the delivery destination is changed, etc.). ), the data for updating the delivery plan list held in the delivery support terminal 20 is transmitted to the relevant delivery support terminal 20.

The delivery support terminal 20 is a computer that can be installed in or carried in a vehicle that delivers articles. The delivery support terminal 20 provides, for example, information such as the order of delivery destinations (hereinafter, also referred to as “delivery order”) of delivering these items to the driver of the vehicle that delivers the items. At this time, the delivery support terminal 20 provides the driver with information in which the delivery order of the delivery destination is made efficient according to the estimated arrival time to the next delivery destination and the designated delivery time of the next delivery destination. .. The designated delivery time is generally represented by a time width such as “10:00 to 12:00”, “in the morning”, and “20:00 to 21:00”.

Here, to make the delivery order of the delivery destination more efficient means that if another deliverable destination exists before the next delivery destination, the other delivery destination is placed before the next delivery destination. To change the delivery order so that it will be delivered. In other words, if another delivery destination can be passed before the next delivery destination, the delivery order is changed so that the delivery is performed to the next delivery destination via the other delivery destination. .. By making the delivery order of the delivery destinations efficient, for example, it is possible to realize efficient delivery of goods while keeping the designated delivery time of each delivery destination.

The delivery support terminal 20 may provide the driver with a route to the delivery destination, navigation information according to the route, and the like, in addition to the delivery order of the delivery destinations described above.

As the delivery support terminal 20, any computer that can be installed in or carried in a vehicle can be used. For example, a smartphone, a tablet terminal, a navigation terminal, various in-vehicle devices, etc. can be used as the delivery support terminal 20.

The vehicle on which the delivery support terminal 20 is mounted or brought in may be any vehicle. For example, it may be a four-wheeled vehicle including a truck, a three-wheeled vehicle, a two-wheeled vehicle, a bicycle, or the like.

<Outline of efficiency of delivery order>
Here, an example of making the delivery order of the delivery destinations efficient will be described with reference to FIG. FIG. 2 is a diagram for schematically explaining an example of streamlining the delivery order.

As shown in FIG. 2, for example, the designated delivery with the current time “9:00” and the next delivery destination A (the delivery order of this delivery destination A is “n” (n is an integer of 1 or more)). It is assumed that the time is “10:00 to 12:00” and the estimated arrival time from the current position to the delivery destination A is “9:45”.

On the other hand, there is an undelivered delivery destination B (the delivery order of this delivery destination B is "n'" (where n'>n)) with the specified delivery time "none", and this It takes 60 minutes from the current position to the delivery destination B, and 15 minutes from the delivery destination B to the delivery destination A.

In this case, if it is assumed that the customer directly goes to the delivery destination A from the current position, the delivery destination A arrives at “9:45”, and therefore the delivery destination A receives the goods delivered outside the designated delivery time. If not, a waiting time of about 15 minutes occurs.

On the other hand, even if it is delivered to the delivery destination B before the delivery destination A, it can arrive at the delivery destination A at “10:15” (however, in this example, the staying time at the delivery destination B (for example, , Time required for loading and unloading goods, etc.) is not taken into consideration. That is, even though the delivery destination B is used, the delivery destination A can arrive within the designated delivery time. Therefore, in such a case, the delivery order of the delivery destination B is “n” and the delivery order of the delivery destination A is “n+1”, and the delivery order is delivered to the user of the delivery support terminal 20 (that is, the driver of the vehicle). Provide information indicating. Thereby, the waiting time of about 15 minutes described above does not occur, and the goods can be efficiently delivered.

As described above, the delivery support system 1 according to the present embodiment is in time when the estimated arrival time at the next delivery destination is before the designated delivery time and even when the delivery destination passes through another delivery destination. In this case, the delivery order is changed so as to deliver to the next delivery destination after passing through the other delivery destination, and the result is presented to the driver of the vehicle. As a result, it becomes possible to efficiently deliver the articles as described above.

<Hardware configuration>
Next, the hardware configurations of the management server device 10 and the delivery support terminal 20 according to the present embodiment will be described. The management server device 10 and the delivery support terminal 20 according to the present embodiment can be realized by, for example, the computer 500 shown in FIG.

The computer 500 illustrated in FIG. 3 includes an input device 501, a display device 502, an external I/F 503, a RAM (Random Access Memory) 504, a ROM (Read Only Memory) 505, a processor 506, and a communication I/F 507. And an auxiliary storage device 508. These pieces of hardware are connected to each other by a bus B.

The input device 501 is, for example, a touch panel, various buttons, etc., and is used by the user to perform various inputs to the computer 500. The display device 502 is, for example, an LCD (Liquid Crystal Display), and displays the processing result of the computer 500. The management server device 10 and the delivery support terminal 20 may not include at least one of the input device 501 and the display device 502.

The external I/F 503 is an interface with an external device. The external device includes a recording medium 503a and the like. The computer 500 can read and write the recording medium 503a via the external I/F 503. Examples of the recording medium 503a include a CD (Compact Disc), a DVD (Digital Versatile Disc), a Blu-ray (registered trademark) Disc, an SD memory card, and a USB memory.

The RAM 504 is a volatile semiconductor memory that temporarily holds programs and data. The ROM 505 is a non-volatile semiconductor memory that can retain programs and data even when the power is turned off. The ROM 505 stores, for example, setting information regarding an OS (Operating System), setting information for connecting to the communication network N, and the like.

The processor 506 is, for example, a CPU (Central Processing Unit) or the like, and controls the entire computer 500 by reading a program or data from the ROM 505 or the auxiliary storage device 508 or the like onto the RAM 504 and executing processing based on the program or data. And a computing device that realizes various functions.

The communication I/F 507 is an interface for connecting the computer 500 to the communication network N. The computer 500 can perform various data communication with other devices via the communication I/F 507.

The auxiliary storage device 508 is, for example, a HDD (Hard Disk Drive), an SSD (Solid State Drive), or the like, and is a non-volatile memory that stores programs and data. The programs and data stored in the auxiliary storage device 508 include, for example, an OS, application software that runs on the OS, and one or more programs that implement the present embodiment.

The management server device 10 and the delivery support terminal 20 according to the present embodiment can realize various kinds of processing described below by the hardware configuration of the computer 500 shown in FIG. The delivery support terminal 20 according to the present embodiment may have, for example, a GPS (Global Positioning System) receiver in addition to the hardware configuration of the computer 500 shown in FIG. Further, the delivery support terminal 20 according to the present embodiment may have a voice output device such as a speaker, for example.

<Functional configuration>
Next, the functional configuration of the delivery support system 1 according to the present embodiment will be described with reference to FIG. FIG. 4 is a diagram showing an example of the functional configuration of the delivery support system 1 according to the present embodiment.

<<Management server device 10>>
As shown in FIG. 4, the management server device 10 according to this embodiment includes a transmission unit 101. The transmission unit 101 is realized, for example, by a process of causing one or more programs installed in the management server device 10 to be executed by the CPU or the like of the management server device 10.

Further, the management server device 10 according to the present embodiment has a storage unit 102. The storage unit 102 can be realized by using, for example, an auxiliary storage device of the management server device 10.

The storage unit 102 stores a delivery plan list of each vehicle (that is, each delivery support terminal 20 installed in or brought into the vehicle). These delivery plan lists are created and updated by, for example, an administrator or an operator who manages the delivery plan of each vehicle.

The transmitting unit 101, for example, on a daily basis, transmits the delivery plan list corresponding to the vehicle to the delivery support terminal 20 installed in or brought into each vehicle. Further, when the delivery plan list stored in the storage unit 102 is updated, the transmission unit 101 causes the corresponding delivery support terminal 20 (that is, the delivery support terminal 20 that holds the delivery plan list before update). On the other hand, data for updating the delivery plan list (hereinafter also referred to as “update data”) is transmitted. The update data may be data indicating the difference between the updated delivery plan list and the pre-updated delivery plan list, or the updated delivery plan list itself.

<Delivery support terminal 20>
As illustrated in FIG. 4, the delivery support terminal 20 according to the present embodiment includes a list management unit 201 and an efficiency improvement processing unit 202. Each of these units is realized, for example, by a process of causing one or more programs installed in the delivery support terminal 20 to be executed by the CPU of the delivery support terminal 20.

Further, the delivery support terminal 20 according to the present embodiment has a storage unit 203. The storage unit 203 can be realized by using, for example, an auxiliary storage device of the delivery support terminal 20.

The storage unit 203 stores the delivery plan list received from the management server device 10. The delivery plan list is a list format data including delivery plan data including at least a delivery destination, a delivery order, and a designated delivery time. Details of the delivery plan list will be described later.

In addition, the storage unit 203 stores route network data for performing a route search from a departure place to a destination. The route network data includes, for example, information (hereinafter referred to as “node information”) about nodes indicating various points such as intersections and branch points, locations where road attributes change, locations where road width changes, and between nodes. It is data including information (hereinafter, referred to as "link information") about a link connecting between. The node information includes, for example, a node number, latitude and longitude, names of intersections (kanji and readings), presence/absence of traffic lights, and the like. In addition, the link information includes, for example, information such as the link length, the coordinate point sequence, the cost of the link, the node numbers of the nodes at both ends of the link, the number of road lanes indicated by the link, the traveling direction, and the altitude (elevation). Has been.

Upon receiving the delivery plan list from the management server device 10, the list management unit 201 stores the delivery plan list in the storage unit 203. Further, when the list management unit 201 receives update data from the management server device 10, the list management unit 201 updates the delivery plan list stored in the storage unit 203 with the update data.

The efficiency improvement processing unit 202 executes processing for improving the efficiency of the delivery order of the delivery plan list stored in the storage unit 203 (efficiency processing for the delivery order). Here, the efficiency improvement processing unit 202 includes a route search unit 211, an estimated arrival time calculation unit 212, a determination unit 213, a reference unit 214, and a delivery order change unit 215.

The route search unit 211 uses the route network data stored in the storage unit 203 to perform a route search (first route search) with the current location as the departure point and the next delivery destination as the destination. In addition, the route search unit 211 uses the route network data stored in the storage unit 203 to set the current location as the origin, the next delivery destination as the destination, and the delivery plan data referred to by the reference unit 214. A route search (second route search) using the destination as a stopover is also performed.

The estimated arrival time calculation unit 212 calculates an estimated arrival time (first estimated arrival time) at the destination (that is, the next delivery destination) from the result of the first route search by the route search unit 211. The estimated arrival time calculation unit 212 also calculates an estimated arrival time at the destination (second estimated arrival time) from the result of the second route search by the route search unit 211.

The determination unit 213 determines whether the first estimated arrival time calculated by the estimated arrival time calculation unit 212 is before the designated delivery time of the next delivery destination. The determination unit 213 also determines whether or not the second estimated arrival time calculated by the estimated arrival time calculation unit 212 is within the designated delivery time of the next delivery destination.

The reference unit 214 refers to delivery plan data indicating an undelivered delivery destination among the delivery plan data included in the delivery plan list stored in the storage unit 203.

The delivery order changing unit 215 determines that the first arrival time is earlier than the designated delivery time of the next delivery destination and the second arrival time is within the designated delivery time of the next delivery destination. In this case, the delivery order of the destination (next delivery destination) and the transit point is changed. That is, the delivery order of the delivery destination (that is, the next delivery destination) that is the destination is “n” (n is an integer of 1 or more), and the delivery order of the delivery destination that is the stopover is “n′” (however, n In the case of ′>n), the delivery order changing unit 215 sets the delivery order of the delivery destination as the transit point to “n” and the delivery order of the delivery destination as the destination to “n+1”.

《Delivery plan list》
Next, an example of the delivery plan list stored in the storage unit 203 of each delivery support terminal 20 will be described with reference to FIG. FIG. 5 is a diagram showing an example of the delivery plan list. The delivery plan list shown in FIG. 5 is a delivery plan list stored in the storage unit 203 of the delivery support terminal 20 installed in or brought into a vehicle.

As shown in FIG. 5, the delivery plan list is composed of one or more delivery plan data. Further, each delivery plan data includes, as data items, “delivery order”, “delivery destination”, “designated delivery time”, “delivery item”, “quantity”, and “collection category”. Be done.

In the data item "delivery order", the delivery order to the delivery destination is set. As the delivery order, for example, an integer of 1 or more that does not overlap between the delivery plan data is set.

In the data item “delivery destination”, the name, address, etc. of the delivery destination are set. In addition to these, in the data item “delivery destination”, for example, position information of the delivery destination, a telephone number, etc. may be set.

In the data item "designated delivery time", the designated delivery time to the delivery destination is set. The designated delivery time is set, for example, by the time width determined by the start time and the end time. For example, when the designated delivery time is “12:00 to 12:00”, the start time is “10:00” and the end time is “12:00”. When the designated delivery time is not designated, “none” is set in the data item “designated delivery time”. Further, for example, when the data item “designated delivery time” is set to “in the morning”, the start point time and the end point time are respectively predetermined times (for example, the start point time “9:00” and the end point time). "12:00"). Further, two or more designated delivery times may be set in the data item "designated delivery time".

In the data item “delivery item”, the delivery item to the delivery destination is set. In addition, when "collection" is set in the data item "collection classification" described later, the item to be collected from the collection destination is set in the data item "delivery item".

In the data item “quantity”, the number of items to be delivered to the delivery destination (or the number of items to be collected from the collection destination) is set.

In the data item "collection category", "collection" is set when an item is collected from the collection destination. When "collection" is set in the data item "collection category", information of the collection destination is set in the data item "delivery destination". Similarly, a designated collection time is set in the data item “designated delivery time”.

As described above, each piece of delivery plan data forming the delivery plan list includes information such as delivery order, delivery destination, and designated delivery time. In addition to this, each delivery plan data may include various information.

<Details of processing of delivery support system 1>
Next, details of the processing executed by the delivery support system 1 according to the present embodiment will be described.

<Transmission process of delivery plan list>
First, for example, on a daily basis, a process of transmitting a delivery plan list corresponding to a vehicle to the delivery support terminal 20 installed in or brought into each vehicle will be described with reference to FIG. .. FIG. 6 is a sequence diagram showing an example of transmission processing of the delivery plan list.

The transmission unit 101 of the management server device 10 transmits each of the delivery plan lists stored in the storage unit 102 to the delivery support terminal 20 corresponding to the delivery plan list (step S101). Note that which delivery plan list is to be sent to which delivery support terminal 20 may be set in advance.

Upon receiving the delivery plan list from the management server device 10, the list management unit 201 of each delivery support terminal 20 stores the delivery plan list in the storage unit 203 (step S102). Then, the efficiency improvement processing unit 202 of each delivery support terminal 20 executes a delivery order efficiency improvement process (step S103). As a result, the delivery order of the delivery plan list stored in the storage unit 203 is made efficient, and the delivery can be performed in the efficient delivery order. The details of the delivery order efficiency improving process will be described later.

<Update process of delivery plan list>
Next, for example, when a certain delivery plan list is updated, processing for transmitting update data to the delivery support terminal 20 corresponding to the delivery plan list will be described with reference to FIG. 7. FIG. 7 is a sequence diagram showing an example of a delivery plan list update process. As mentioned above, when the delivery plan list is updated, for example, when the delivery destination is added or when the delivery destination is deleted, the designated delivery time to the delivery destination has changed. This is the case.

The transmission unit 101 of the management server device 10 transmits the update data of the delivery plan list to the relevant delivery support terminal 20 (step S201).

Upon receiving the update data from the management server device 10, the list management unit 201 of the delivery support terminal 20 updates the delivery plan list stored in the storage unit 203 with the update data (step S202). That is, the list management unit 201 uses the update data to add the delivery plan data to the delivery plan list stored in the storage unit 203, delete the delivery plan data included in the delivery plan list, and create the delivery plan list. At least one of the changes in the included delivery plan data is performed.

Then, the efficiency improvement processing unit 202 of the delivery support terminal 20 executes a delivery order efficiency improvement process (step S203). As a result, the delivery order of the delivery plan list (that is, the updated delivery plan list) stored in the storage unit 203 becomes efficient, and the delivery can be performed in the efficient delivery order. The details of the delivery order efficiency improving process will be described later.

《Delivery order efficiency processing》
Next, details of the delivery order efficiency improving process executed in steps S103 and S203 will be described with reference to FIG. FIG. 8 is a flow chart showing an example of a delivery order efficiency improving process. In FIG. 8, the delivery order of the next delivery destination is “n” (n is an integer of 1 or more), the delivery destinations of the delivery order n−1 or less have already been delivered, and the delivery destinations of the delivery order n+1 or more are It shall be undelivered.

In addition to the above-described steps S103 and S203, the delivery order efficiency processing may be executed at predetermined time intervals (for example, every 5 minutes). By performing the delivery order efficiency processing at predetermined time intervals, it is possible to improve the delivery order efficiency in accordance with, for example, changes in traffic conditions while the vehicle is moving to the delivery destination. .. This is because the expected arrival time at the destination (that is, the next delivery destination) also changes due to changes in traffic conditions and the like. In addition to this, for example, after the goods are delivered to the delivery destination, the efficiency of the delivery order may be executed when departing the next delivery destination or before departing the next delivery destination.

First, the route search unit 211 of the efficiency improvement processing unit 202 uses the route network data stored in the storage unit 203 to search for a route with the current location as the departure point and the next delivery destination as the destination (first route). Search) is performed (step S301). Note that, for example, instead of storing the route network data in the storage unit 203, the route network data may be acquired from a predetermined server.

Next, the estimated arrival time calculation unit 212 of the efficiency improvement processing unit 202 calculates the estimated arrival time at the destination (that is, the next delivery destination) from the result of the first route search in step S301 (first arrival). The estimated time) is calculated (step S302). A known method may be used to calculate the estimated arrival time.

Next, the determination unit 213 of the efficiency improvement processing unit 202 determines whether or not the first estimated arrival time calculated in step S302 is earlier than the designated delivery time of the next delivery destination ( Step S303). That is, the determination unit 213 refers to the data item “designated delivery time” of the delivery plan data indicating the next delivery destination in the delivery plan data included in the delivery plan list stored in the storage unit 203, It is determined whether the estimated arrival time of 1 is before the start time of the designated delivery time of the next delivery destination.

In the present embodiment, it is determined whether or not the first estimated arrival time is before the start point time of the designated delivery time of the next delivery destination. For example, the first estimated arrival time is It may be determined whether it is before the end time of the designated delivery time. Alternatively, for example, it may be determined whether or not the first estimated arrival time is earlier than a time that is a predetermined time before the end time of the designated delivery time.

When it is not determined in step S303 that the first estimated arrival time is before the start point time of the designated delivery time, the efficiency improvement processing unit 202 ends the delivery order efficiency improvement processing. This is because in this case, the delivery order cannot be further improved.

On the other hand, when it is determined in step S303 that the first estimated arrival time is before the start point time of the designated delivery time, the reference unit 214 of the efficiency improvement processing unit 202 causes the delivery plan stored in the storage unit 203. Of the delivery plan data forming the list, one piece of delivery plan data indicating an undelivered delivery destination is referred to (step S304). Note that, for example, the reference unit 214 may refer to the delivery plan data having the smallest delivery order among the delivery plan data indicating the undelivered delivery destinations, or the delivery plan data indicating the undelivered delivery destinations. From here, the delivery plan data may be randomly referenced. Alternatively, for example, the reference unit 214 may refer to the delivery plan data indicating the delivery destination closest to the current location among the delivery plan data indicating the undelivered delivery destinations.

Next, the route search unit 211 of the efficiency improvement processing unit 202 uses the route network data stored in the storage unit 203 to refer to the current location as the departure point, the next delivery destination as the destination, and the reference unit 214 as a reference. A route search (second route search) is performed with the delivery destination indicated by the existing delivery plan data as a transit point (step S305).

Next, the estimated arrival time calculation unit 212 of the efficiency improvement processing unit 202 calculates the estimated arrival time (second arrival) from the result of the second route search in step S305 to the destination (that is, the next delivery destination). The estimated time) is calculated (step S306). At this time, the second estimated arrival time may be calculated in consideration of the staying time at the delivery destination which is the transit point. The method of calculating the estimated arrival time is the same as that of step S302 of the higher order.

Next, the determination unit 213 of the efficiency improvement processing unit 202 determines whether or not the second estimated arrival time calculated in step S306 is within the designated delivery time of the next delivery destination (step S307). ). That is, the determination unit 213 refers to the data item “designated delivery time” of the delivery plan data indicating the next delivery destination in the delivery plan data included in the delivery plan list stored in the storage unit 203, It is determined whether the estimated arrival time of 2 is within the designated delivery time of the next delivery destination (that is, after the start point time of the designated delivery time and before the end point time).

When it is not determined in step S307 that the second estimated arrival time is within the designated delivery time, the reference unit 214 of the efficiency improvement processing unit 202 configures the delivery that constitutes the delivery plan list stored in the storage unit 203. It is determined whether or not there is unreferenced delivery plan data that is delivery plan data indicating an undelivered delivery destination in the plan data (step S308).

If it is not determined in step S308 that there is delivery plan data indicating an undelivered delivery destination and there is unreferenced delivery plan data, the efficiency improvement processing unit 202 ends the delivery order efficiency improvement process. This is because, in this case, there is no delivery destination that can be passed through before the next delivery destination, and the delivery order cannot be further improved.

On the other hand, when it is determined in step S308 that the delivery plan data indicating the undelivered delivery destination and the unreferenced delivery plan data exist, the reference unit 214 of the efficiency improvement processing unit 202 determines the undelivered delivery destination. One piece of delivery plan data that is not referred to in the delivery plan data shown is referred to (step S309). The reference unit 214 may refer to, for example, delivery plan data indicating an undelivered delivery destination and the delivery plan data having the smallest delivery order among the unreferenced delivery plan data. It is also possible to refer to the delivery plan data at random from among the delivery plan data that has not yet been referred to and is the delivery plan data indicating the delivery destination of. Alternatively, the reference unit 214 may refer to, for example, delivery plan data indicating an undelivered delivery destination and delivery plan data indicating a delivery destination closest to the current location among the unreferenced delivery plan data.

Then, the efficiency improvement processing unit 202 returns to step S305. As a result, steps S305 to S309 are repeatedly executed on the delivery plan data indicating the undelivered delivery destination.

On the other hand, when it is determined in step S307 that the second estimated arrival time is within the designated delivery time, the delivery order changing unit 215 of the efficiency improvement processing unit 202 determines that the destination (the next delivery destination) and the stopover point. The delivery order of is changed (step S310). That is, the delivery order changing unit 215 changes the delivery order of the delivery plan list by setting the delivery order of the delivery destination as the stopover to "n" and the delivery order of the next delivery destination as the destination to "n+1".

It should be noted that the delivery order changing unit 215 appropriately changes the delivery order of the other undelivered delivery destinations according to this change. For example, when the delivery order before the change of the delivery destination, which is the via point, is “n′” (where n′≧n+2), the delivery order changing unit 215 determines that the delivery order before the change is “n+1”. "1" is added to the delivery order of the delivery destination that is equal to or more than "n'-1". On the other hand, for example, when the delivery order before the delivery destination changed as the above-mentioned destination is “n′=n+1”, the delivery order change unit 215 determines that the delivery destination is the destination and the delivery destination is the destination. There is no need to change the delivery order for delivery destinations other than.

As described above, in the delivery support terminal 20 according to the present embodiment, the delivery order of delivery destinations can be made efficient. Then, when the delivery order of the delivery destination has been made efficient (that is, when step S310 described above is performed), the efficiency improvement processing unit 202 changes the delivery order of the delivery destination or the next delivery destination ( That is, the route to the stopover) is presented to the driver of the vehicle. At this time, an arbitrary format can be adopted as the output format of the information presented to the driver. For example, it may be output as characters or symbols to a display device such as a display, or may be output as voice from an audio output device such as a speaker. In addition to these, the driver may be notified that the delivery order has been changed due to vibration or the like.

Here, in the above-described embodiment, the delivery order is made more efficient by passing through another delivery destination before the next delivery destination. However, for example, when another delivery destination cannot be passed and the efficiency cannot be further improved. (For example, if No in step S308). In such a case, it may arrive at the next delivery destination before the designated delivery time, and a waiting time may occur at the next delivery destination.

Therefore, in such a case, for example, the delivery order may be changed so as to pass through the service area or parking before the next delivery destination. Specifically, for example, the delivery order list shown in FIG. 9 may be used to perform the delivery order efficiency process. The delivery plan list shown in FIG. 9 includes delivery plan data in which a service area such as “ABC service area” and parking such as “AAA parking” are set for the data item “delivery destination”.

When the result of the above step S308 is No, the above-mentioned steps S305 to S309 are executed with reference to each of the delivery plan data in which these service areas, parking lots, etc. are set in the data item "delivery destination". Accordingly, when the vehicle arrives at the next delivery destination earlier than the designated delivery time, the service area or the parking area that can be reached before the next delivery destination can be presented to the driver. Therefore, it is possible to prevent unnecessary waiting time from occurring due to the arrival at the delivery destination before the designated delivery time.

<Summary>
As described above, in the delivery support system 1 according to the present embodiment, when the delivery destination arrives at the next delivery destination earlier than the designated delivery time, efficient delivery is performed via another delivery destination. The order can be presented to the driver. This allows the driver to deliver the goods in an efficient order. Therefore, according to the delivery support system 1 according to the present embodiment, it is possible to realize prevention of unnecessary waiting time and prevention of delivery delay, for example.

In the present embodiment, the above-described delivery order efficiency processing is performed by each delivery support terminal 20, but the present invention is not limited to this, and the delivery order efficiency processing may be performed by the management server device 10. In this case, the delivery support terminal 20 may receive the processing result of the efficiency processing of the delivery order from the management server device 10 and present the processing result to the driver.

The present invention is not limited to the above specifically disclosed embodiments, and various modifications and changes can be made without departing from the scope of the claims.

1 Delivery Support System 10 Management Server Device 20 Delivery Support Terminal 101 Transmission Unit 102 Storage Unit 201 List Management Unit 202 Efficiency Improvement Processing Unit 203 Storage Unit 211 Route Search Unit 212 Estimated Arrival Time Calculation Unit 213 Judgment Unit 214 Reference Unit 215 Change Delivery Order Department

Claims (7)

First route searching means for searching for a route to the destination with the current location of the vehicle as a departure point;
First calculating means for calculating a first expected time of arrival at the destination from the search result by the first route searching means;
First determining means for determining whether or not the first expected time calculated by the first calculating means is before a designated arrival time previously designated as an arrival time width at the destination ,
When it is determined by the first determination means that the first predicted time is before the specified arrival time, the driver of the vehicle is asked to select a transit point in front of the destination. Presentation means to present,
An information processing device comprising: Selecting means for selecting one waypoint from a plurality of waypoints when the first determining means determines that the first expected time is before the specified arrival time;
Second route searching means for searching a route from the departure place to the destination via the transit point selected by the selecting means;
Second calculating means for calculating a second predicted time of arrival at the destination from the search result by the second route searching means;
A second determining means for determining whether or not the second expected time calculated by the second calculating means is within the designated arrival time,
The presenting means is
When the second predicted time is judged to be within the specified arrival time by the second judgment means, it is selected by the selection means as a transit point before the destination. The information processing apparatus according to claim 1, wherein a waypoint is presented. The first determination means,
The information processing apparatus according to claim 1, wherein it is determined whether or not the first predicted time is before a time that is a start point of the designated arrival time. The first determination means,
It is determined whether the first predicted time is before the time that is the end point of the designated arrival time, or is it before the time that is a predetermined time before the time that is the end point. The information processing apparatus according to claim 1 or 2, wherein the information processing apparatus determines whether or not it is. The destination is the next delivery destination among the delivery destinations to which the vehicle delivers the article,
The information processing apparatus according to claim 1, wherein the waypoint is a delivery destination, a service area, or a parking lot where the vehicle has not yet delivered the article. A first route search procedure for searching for a route to the destination, with the current location of the vehicle as the starting point;
A first calculation procedure for calculating a first expected time of arrival at the destination from the search result of the first route search procedure;
A first determination procedure for determining whether or not the first estimated time calculated in the first calculation procedure is before a designated arrival time designated in advance as the arrival time width at the destination; ,
When it is determined in the first determination procedure that the first predicted time is earlier than the specified arrival time, the driver of the vehicle is asked to select a transit point in front of the destination. Presentation procedure to present,
An information processing method, characterized in that a computer executes. A first route search procedure for searching for a route to the destination, with the current location of the vehicle as the starting point;
A first calculation procedure for calculating a first expected time of arrival at the destination from the search result of the first route search procedure;
A first determination procedure for determining whether or not the first estimated time calculated in the first calculation procedure is before a designated arrival time designated in advance as the arrival time width at the destination; ,
When it is determined in the first determination procedure that the first predicted time is earlier than the specified arrival time, the driver of the vehicle is asked to select a transit point in front of the destination. Presentation procedure to present,
A program that causes a computer to execute.

Images