Information processor
The information processing apparatus optimizes delivery routes by connecting requested and proxy workers with a merge point, addressing delays and ensuring timely delivery completion.
Patent Information
- Application Number
- JP2025069483
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2025-04-21
- Publication Date
- 2025-07-03
AI Technical Summary
Existing delivery management systems fail to account for potential business delays due to traffic jams or worker inefficiencies, leading to incomplete deliveries by the end of business hours.
An information processing apparatus that creates a route connecting a requested delivery worker with a proxy worker and determines a merge point based on travel time, allowing efficient transfer of packages to prevent delays.
Prevents business delays by enabling efficient package transfer between workers, ensuring timely completion of deliveries without excessive burden on either party.
Smart Images

Figure 2025100801000001_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to an information processing apparatus.
Background Art
[0002] Techniques for managing the deliveries of multiple delivery workers have been developed (for example, Patent Document 1).
Prior Art Documents
Patent Documents
[0003]
Patent Document 1
Summary of the Invention
Problems to be Solved by the Invention
[0004] During delivery, traffic jams may occur due to traffic accidents or the like, and there may be delivery workers who cannot complete the delivery by the end of the business hours. However, the technique disclosed in Patent Document 1 does not consider the occurrence of such business delays.
[0005] As an example of the problems to be solved by the present invention, there is managing the deliveries of multiple delivery workers so as not to cause business delays.
Means for Solving the Problems
[0006] In order to solve the above problems, the invention according to claim 1 includes a route creation unit that creates a route connecting the position of a requested delivery worker and the position of a proxy delivery worker who delivers a part of the luggage to be delivered by the requested delivery worker instead, and a merge position determination unit that determines a merge position where the requested delivery worker and the proxy delivery worker meet based on the required time when moving along the route.
[0007] The invention according to claim 8 is an information processing method executed by a computer, comprising a route creation step of creating a route connecting the position of a requested delivery person and the position of a proxy delivery person who delivers part of the luggage to be delivered by the requested delivery person instead, and a confluence position determination step of determining a confluence position where the requested delivery person and the proxy delivery person meet based on the time required to move along the route.
[0008] The invention according to claim 9 causes a computer to execute the information processing method according to claim 8.
[0009] The invention according to claim 10 stores the information processing program according to claim 9.
Brief Description of the Drawings
[0010]
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
[0011] An information processing apparatus according to an embodiment of the present invention includes a route creation unit that creates a route connecting the position of a requested delivery person and the position of a proxy delivery person who delivers a part of the package to be delivered by the requested delivery person instead, and a merging position determination unit that determines a merging position at which the requested delivery person and the proxy delivery person merge based on the required time when moving along the route. Therefore, in this embodiment, until the closest time, the requested delivery person and the proxy delivery person continue to deliver, and it is possible to merge after the closest time. Thus, in this embodiment, it is possible to prevent business delays while performing efficient delivery. As a result, in this embodiment, it is possible to manage the deliveries of a plurality of delivery persons so as not to cause business delays.
[0012] The merging position determination unit may determine, as the merging position, a position that the requested delivery person reaches in half the time required from the position of the requested delivery person to the position of the proxy delivery person. By doing so, it becomes possible to transfer the package from the requested delivery person to the proxy delivery person as soon as possible.
[0013] If an intermediate position, which is the position that the requested delivery person reaches in half the time required from the position of the requested delivery person to the position of the proxy delivery person, satisfies a first condition and / or does not satisfy a second condition, the merging position determination unit may determine the intermediate position as the merging position. By doing so, it becomes possible to set only a place suitable for package transfer as the merging position.
[0014] If the intermediate position does not satisfy the first condition or satisfies the second condition, the merging position determination unit may determine, as the merging point, the position closest to the merging point candidate among the positions that are between the intermediate position and the position of the delivery staff and satisfy the first condition and / or do not satisfy the second condition. By doing so, it is possible to reduce the burden on the delivery staff and perform the delivery of the package at a location suitable for the delivery of the package.
[0015] The first condition may include at least one of the following conditions: 1) a road with a width of at least the first road width; 2) a road with a parking lot. By doing so, it is possible to set only the locations suitable for the delivery of the package as the merging positions.
[0016] The second condition may include at least one of the following conditions: 1) a road with a width of at most the second road width; 2) a road where parking is prohibited. By doing so, it is possible to prevent a location not suitable for the delivery of the package from being determined as the merging position.
[0017] In the route created by the route creation unit, the position may be represented by nodes and links. By doing so, it is possible to set only the links corresponding to the roads suitable for the delivery of the package as the merging positions.
[0018] Also, an information processing method according to an embodiment of the present invention is an information processing method executed by a computer, and includes a route creation step of creating a route connecting the position of a requested delivery person and the position of a proxy delivery person who delivers a part of the luggage to be delivered by the requested delivery person instead, and a confluence position determination step of determining a confluence position where the requested delivery person and the proxy delivery person meet based on the time required to move along the route. Therefore, in this embodiment, until the closest time, the requested delivery person and the proxy delivery person continue to deliver, and it is possible to meet after the closest time. Thus, in this embodiment, it is possible to prevent business delays while performing efficient delivery. As a result, in this embodiment, it is possible to manage the deliveries of multiple delivery persons so as not to cause business delays.
[0019] Also, an information processing program according to an embodiment of the present invention causes a computer to execute the above information processing method. Therefore, in this embodiment, it is possible to manage the deliveries of multiple delivery persons using a computer so as not to cause business delays.
[0020] Also, a computer-readable storage medium according to an embodiment of the present invention stores the above information processing program. Therefore, in this embodiment, the above information processing program can be distributed alone in addition to being incorporated into a device, and it is possible to easily perform version updates and the like.
Example
[0021] <Information Processing Apparatus 100> FIG. 1 is a diagram showing an information processing apparatus 100 according to an embodiment of the present invention. The information processing apparatus 100 includes a control unit 110, a storage unit 120, and a communication unit 130. The control unit 110 is configured by a computer. The storage unit 120 is a storage device that stores information, for example, a hard disk or a memory. The communication unit 130 is a communication device for transmitting and receiving information to and from other devices.
[0022] The information processing apparatus 100 stores delivery management information for managing the deliveries of a plurality of delivery personnel in the storage unit 120, receives the delivery status of the delivery personnel through the communication unit 130, and updates the delivery management information by the control unit 110 based on the received delivery status. Then, when there is a delivery personnel (requested delivery personnel) who needs to have a part of the goods to be delivered delivered by another delivery personnel instead, the control unit 110 of the information processing apparatus 100 according to this embodiment determines a proxy delivery personnel who will deliver a part of the goods to be delivered by the requested delivery personnel instead, and determines the goods to be transferred from the requested delivery personnel to the proxy delivery personnel and the merging position for delivering the goods from the requested delivery personnel to the proxy delivery personnel.
[0023] Figure 2 is a diagram showing the control unit 110 according to an embodiment of the present invention. The control unit 110 includes a delivery status acquisition unit 111, a delivery management information update unit 112, a proxy delivery personnel determination unit 113, a merging position determination unit 114, a transferred goods determination unit 115, and a transfer information transmission processing unit 116.
[0024] The delivery status acquisition unit 111 acquires the delivery status from a plurality of delivery personnel. The delivery status includes, for example, the current position of the delivery personnel and information regarding the goods for which delivery has been completed. The delivery status may include the delivery route from the current position of the delivery personnel. The delivery status acquisition unit 111 acquires the delivery status of the delivery personnel, for example, by receiving the delivery status of the delivery personnel from a terminal device used by the delivery personnel (for example, a terminal device carried by the delivery personnel or a terminal device mounted on a vehicle).
[0025] The delivery management information update unit 112 updates the delivery management information stored in the storage unit 120 based on the delivery status acquired by the delivery status acquisition unit 111. The delivery management information is information for managing the deliveries of a plurality of delivery personnel and includes, for example, a delivery management database, a delivery route database, and a delivery scheduled goods database.
[0026] FIG. 3 is a diagram showing an example of a delivery management database. The delivery management database is a database for information regarding the delivery schedule and delivery status for each delivery person. For example, it includes the end time of work, which is the time when the delivery person finishes work, the scheduled completion time of delivery, which is the time when the delivery of the delivery person is scheduled to end, and the predicted number of deliveries with delays among the packages scheduled for delivery by the delivery person. In the example shown in FIG. 3, the delivery management database includes the number of deliveries today, the number of completed deliveries, the scheduled completion time of delivery, the leaving time (an example of the end time of work), and the predicted number of delivery delays. In the case of the example shown in FIG. 3, the delivery management information update unit 112 updates the number of completed deliveries, the scheduled completion time of delivery, and the predicted number of delivery delays based on the acquired delivery status.
[0027] FIG. 4 is a diagram showing an example of a delivery person's scheduled position database. The delivery person's scheduled position database is the schedule of the delivery person's position, that is, the delivery route from the delivery person's current position. The delivery person's scheduled position database includes, for example, information (time, latitude, longitude) indicating the schedule of where each delivery person is at each time, as shown in FIG. 4. The delivery management information update unit 112 updates the delivery person's scheduled position database, for example, by re-creating the delivery route based on information such as the delivery person's current position and the remaining delivery destinations among the delivery status acquired from the delivery person. FIG. 4 shows, for example, the delivery person's scheduled position database when the delivery status is acquired at 13:30.
[0028] FIG. 5 is a diagram showing an example of a database of packages scheduled for delivery. The database of packages scheduled for delivery is information regarding packages for which delivery has not yet been completed. The database of packages scheduled for delivery includes, for example, as shown in FIG. 5, a number for identifying the package (package number), the scheduled arrival time at the delivery destination of the package (scheduled arrival time), and information regarding the position of the delivery destination of the package (delivery destination latitude, delivery destination longitude). The delivery management information update unit 112 updates this database of packages scheduled for delivery based on the acquired delivery status.
[0029] The substitute delivery person determination unit 113 determines a substitute delivery person when a predetermined event (trigger event) occurs.
[0030] The trigger event is, for example, a delay in the delivery staff's work. At this time, for example, when the substitute delivery staff determination unit 113 detects a delivery staff with a work delay or a delivery staff predicted to have a work delay, the detected delivery staff is set as the requested delivery staff. Also, at this time, it is preferable that the information processing apparatus 100 has a work delay detection unit 117 that detects the work delay of the delivery staff. The work delay detection unit 111 performs detection of a work delay based on, for example, delivery management information. The work delay detection unit 111 determines that a work delay has occurred, for example, when there is a package with a delivery delay, when there is a package predicted to have a delivery delay, or when the scheduled delivery completion time of the delivery staff is later than the end time of the work.
[0031] Also, the trigger event may be a request from the requested delivery staff. That is, for example, the substitute delivery staff determination unit 113 may determine a substitute delivery staff when it receives information indicating a request for substitute delivery from the terminal device used by the requested delivery staff. By doing so, even when the requested delivery staff predicts that a work delay will occur based on their own judgment, it becomes possible to transfer some of the packages to be delivered by the requested delivery staff to a substitute delivery staff.
[0032] The meeting point determination unit 114 determines a meeting point for delivering the package from the requested delivery staff to the substitute delivery staff determined by the substitute delivery staff determination unit 111.
[0033] The package to be transferred determination unit 115 determines the package to be transferred from the requested delivery staff to the substitute delivery staff determined by the substitute delivery staff determination unit 111.
[0034] The transfer information transmission processing unit 116 transmits transfer information including information on the requested delivery staff, the substitute delivery staff, the meeting point, and the package to be transferred to the requested delivery staff and the substitute delivery staff. That is, the transfer information transmission processing unit 116 transmits the transfer information to the terminal device used by the requested delivery staff and the terminal device used by the substitute delivery staff through the communication unit 130.
[0035] As described above, in this embodiment, even if a predetermined event occurs, the substitute delivery person, the merging position with the substitute delivery person, and the package to be delivered to the substitute delivery person are determined. Therefore, in this embodiment, even if it is predicted that a business delay of the requested delivery person will occur, it is possible for the requested delivery person to transfer a part of the packages to be delivered to the substitute delivery person, and it is possible to prevent the business delay of the requested delivery person. As a result, in this embodiment, it is possible to manage the deliveries of a plurality of delivery persons so as not to cause a business delay.
[0036] FIG. 6 is a diagram showing an example of a processing operation performed in the information processing apparatus 100 when a trigger event occurs. The substitute delivery person determination unit 113 determines a substitute delivery person (step S601). The merging position determination unit 114 determines a merging position for delivering the package from the requested delivery person to the substitute delivery person, and the delivery package determination unit 115 determines the package to be delivered from the requested delivery person to the substitute delivery person (step S602). The delivery information transmission processing unit 116 transmits delivery information including information on the requested delivery person, the substitute delivery person, the merging position, and the delivered package to the requested delivery person and the substitute delivery person (step S603).
[0037] <Determination of Substitute Delivery Person> The substitute delivery person determination unit 113 determines a substitute delivery person based on the delivery route of the requested delivery person and the delivery routes of other delivery persons. For example, the substitute delivery person determination unit 113 determines, as the substitute delivery person, the delivery person who is closest to the requested delivery person in the delivery schedule after the trigger event occurs.
[0038] At this time, it is preferable that the control unit 110 has a closest time calculation unit 118 that calculates, for each delivery person other than the requested delivery person, the closest time which is the time closest to the requested delivery person in the delivery schedule after the trigger event occurs. Then, the substitute delivery person determination unit 114 calculates, for each delivery person other than the requested delivery person, the distance from the requested delivery person at the closest time, and determines, as the substitute delivery person, the delivery person with the shortest distance from the requested delivery person at the closest time.
[0039] FIG. 7 is a diagram for explaining the relationship between the delivery route of the requested delivery person and that of other delivery persons. In the example shown in FIG. 7, it shows a case where there are two delivery persons, A and B, who can deliver part of the packages of the requested delivery person. The requested delivery person and delivery person A are closest at time TA, and the distance at this time is DA. The requested delivery person and delivery person B are closest at time TB, and the distance at this time is DB. In the example shown in FIG. 7, since the distance DA between the requested delivery person and delivery person A at the closest time TA of delivery person A is shorter than the distance DB between the requested delivery person and delivery person B at the closest time TB of delivery person B, delivery person A is determined as the substitute delivery person.
[0040] Thus, in this embodiment, the substitute delivery person is the delivery person who is closest to the requested delivery person. Therefore, it is possible to shorten the distance that the requested delivery person moves to join the substitute delivery person, and it is possible to efficiently perform the transfer of packages from the requested delivery person to the substitute delivery person.
[0041] Also, the control unit 110 may further include a substitute delivery person candidate list creation unit 119 that creates a substitute delivery person candidate list which is a list of delivery persons who can perform substitute delivery, and the substitute delivery person determination unit 113 may determine the substitute delivery person from among the delivery persons included in the substitute delivery person candidate list. By doing so, it becomes possible to determine the substitute delivery person from among the delivery persons who can perform substitute delivery.
[0042] At this time, it is preferable to set the delivery persons without business delays as the delivery persons who can perform substitute delivery. The substitute delivery person candidate list creation unit 119 may, for example, set the delivery persons predicted not to be delayed in package delivery or the delivery persons whose scheduled delivery completion time is earlier than the business end time as the delivery persons without business delays. Also, the substitute delivery person candidate list creation unit 119 may, for example, create the substitute delivery person candidate list each time the delivery management information is updated. By doing so, it becomes possible to prevent the delivery persons with business delays from being determined as the substitute delivery persons.
[0043] FIG. 8 is a diagram showing an example of a processing operation performed by the control unit 110 when determining a proxy delivery person. The closest time calculation unit 118 calculates, for each delivery person other than the requested delivery person, the closest time, which is the time when approaching the closest to the requested delivery person in the delivery schedule after the trigger event occurs (step S801). The proxy delivery person determination unit 114 calculates, for each delivery person other than the requested delivery person, the distance from the requested delivery person at the closest time, and determines the delivery person with the shortest distance from the requested delivery person at the closest time as the proxy delivery person (step S802).
[0044] FIG. 9 is a diagram showing an example of a processing operation performed by the closest time calculation unit 118 when calculating the closest time for each delivery person other than the requested delivery person. Set the time T to the current time and set the initial value of the closest time Tmin (step S901). Here, the initial value of the closest distance Lmin is set as appropriate. The initial value of the closest distance Lmin is preferably, for example, a value larger than the scale of the delivery area to be managed. Calculate the distance L between the requested delivery person and the proxy delivery person at time T (step S902). The distance L is preferably calculated by obtaining the positions of the requested delivery person and the proxy delivery person at time T from the delivery management information. At this time, the distance L may be the straight-line distance between the position of the requested delivery person and the position of the proxy delivery person, or the road distance on the optimal route connecting the position of the requested delivery person and the position of the proxy delivery person.
[0045] Thereafter, it is confirmed whether the distance L is smaller than the closest distance Lmin (step S903). If the calculated distance L is smaller than the closest distance Lmin (step S903, YES), set the closest time Tmin to the time T, set the closest distance Lmin to the distance L (step S904), advance the time T, and set it to T + ΔT (step S905). If the calculated distance L is greater than or equal to the closest distance Lmin (step S903, NO), advance the time T and set it to T + ΔT (step S905).
[0046] After that, it is checked whether the time T is greater than the scheduled delivery completion time (step S906). If the time T is greater than the scheduled delivery completion time (step S906, YES), the process ends. If the time T is less than or equal to the scheduled delivery completion time (step S906, NO), the process returns to step S902.
[0047] <Determination of the merging position> FIG. 10 is a diagram showing a merging position determination unit 114 according to an embodiment of the present invention. The merging position determination unit 114 includes a route creation unit 1141 that creates a route connecting the position of the requested delivery person and the position of the substitute delivery person, and a determination unit 1142 that determines, based on the time required to move along the route, a merging position where the requested delivery person and the substitute delivery person merge on the route created by the route creation unit 1141.
[0048] At this time, the determination unit 1142 may determine an intermediate position, which is the position where the requested delivery person arrives at half the time required from the position of the requested delivery person to the position of the substitute delivery person, as the merging position. By doing so, it becomes possible to transfer the package from the requested delivery person to the substitute delivery person as quickly as possible.
[0049] As shown in FIG. 11(A), the route creation unit 1141 may create a route connecting the position of the requested delivery person and the position of the substitute delivery person when the trigger event occurs, or as shown in FIG. 11(B), create a route connecting the position of the requested delivery person and the position of the substitute delivery person at the time when the requested delivery person and the substitute delivery person are closest (the closest time calculated by the closest time calculation unit 118) after the trigger event occurs. The method of creating the route may be any method as long as it can create an optimal route connecting the position of the requested delivery person and the position of the substitute delivery person.
[0050] When the route creation unit 1141 creates a route connecting the position of the requested delivery person and the position of the substitute delivery person when a trigger event occurs, the merging position determined by the merging position determination unit 114 is on this route as shown in Fig. 11(A). Therefore, it is possible for the requested delivery person and the substitute delivery person to merge as soon as possible after the trigger event occurs.
[0051] On the other hand, when the route creation unit 1141 creates a route connecting the position of the requested delivery person at the closest time and the substitute delivery person, the merging position determined by the merging position determination unit 114 is on this route as shown in Fig. 11(B). Therefore, after the trigger event occurs, the requested delivery person and the substitute delivery person continue with the delivery until the closest time and can merge after the closest time. Thus, in this embodiment, it is possible to prevent business delays while performing efficient delivery. In particular, when the substitute delivery person is determined based on the closest time, it is advisable for the route creation unit 1141 to create a route connecting the position of the requested delivery person at the closest time and the substitute delivery person, and for the merging position to be determined based on the closest time.
[0052] The intermediate position may not be a place suitable for the delivery of the package. Therefore, the determination unit 1142 may determine the intermediate position as the merging position if the intermediate position satisfies the first condition and / or does not satisfy the second condition. At this time, the first condition is "being a place suitable for the delivery of the package", and includes at least one of, for example, "(1) a road with a road width of a predetermined width or more" and "(2) a road with a parking lot". The second condition is "being a place not suitable for the delivery of the package", and includes at least one of, for example, "(1) a road with a road width of a second width or less" and "(2) a road where parking and stopping are prohibited". That is, if the intermediate position is a place suitable for the delivery of the package, the determination unit 1142 determines the intermediate position as the merging position. Therefore, by doing so, it becomes possible to set only the place suitable for the delivery of the package as the merging position.
[0053] In the route created by the route creation unit 1141, the position may be expressed by nodes and links. At this time, the position of the merging position is expressed by a link. By doing so, it becomes possible to set only the link corresponding to the path suitable for the delivery of the package as the merging position.
[0054] Also, if the intermediate position does not satisfy the first condition or satisfies the second condition, the determination unit 1142 determines, as the merging point, the position closest to the merging point candidate among the positions that are between the intermediate position and the position of the commissioned delivery person and that satisfy the first condition and / or do not satisfy the second condition. By doing so, it becomes possible to reduce the burden on the commissioned delivery person and perform the delivery of the package at a location suitable for the delivery of the package.
[0055] FIG. 12 is a diagram showing an example of the processing operation in the merging position determination unit 114. The route creation unit 1141 creates a route connecting the position of the commissioned delivery person and the position of the substitute delivery person (step S1201). At this time, in the created route, the position is expressed by nodes and links. The determination unit 1142 calculates the time Tmiddle, which is half of the required time from the position of the commissioned delivery person to the position of the substitute delivery person, and derives the link Lj that arrives at this time Tmiddle (step S1202).
[0056] Thereafter, it is confirmed whether or not the road corresponding to the link Lj satisfies the first condition (step S1203). If the road corresponding to the link Lj satisfies the first condition (step S1203, YES) and the road corresponding to the link Lj does not satisfy the second condition (step S1204, YES), the link Lj is determined as the merging position (step S1205), and the process ends. If the road corresponding to the link Lj does not satisfy the first condition (step S1203, NO) or the road corresponding to the link Lj satisfies the second condition (step S1204, NO), among the two links connected to the link Lj in the created route, the link on the current position side of the commissioned delivery person is set as the new link Lj (step S1206), and the process returns to step S1203.
[0057] <Determination of Handover Parcels> The handover parcel determination unit 115 determines, for example, the parcels to be handed over from the requesting delivery staff to the proxy delivery staff from among the parcels that the requesting delivery staff is scheduled to deliver, so as to eliminate the business delay of the requesting delivery staff.
[0058] At this time, the handover parcel determination unit 115 repeatedly determines whether a business delay occurs when a part of the parcels that the requesting delivery staff is scheduled to deliver is excluded, while increasing the number of excluded parcels until the occurrence of the business delay disappears. When the occurrence of the business delay disappears, the parcels excluded at that time are determined as the parcels to be handed over to the proxy delivery staff. The determination of whether a business delay occurs when a part of the parcels that the requesting delivery staff is scheduled to deliver is excluded may be performed, for example, by creating a route of the requesting delivery staff when a part of the parcels that the requesting delivery staff is scheduled to deliver is excluded, and checking whether a business delay occurs when the requesting delivery staff delivers along this created route.
[0059] In this way, in this embodiment, the parcels to be handed over to the proxy delivery staff are determined so as to eliminate the business delay of the requesting delivery staff. Therefore, in this embodiment, it is possible to eliminate the business delay of the requesting delivery staff, and as a result, it is possible to manage the deliveries of a plurality of delivery staff so as not to cause a business delay. Also, in this embodiment, it is possible to eliminate the business delay of the requesting delivery staff without excessively increasing the burden on the proxy delivery staff.
[0060] When there is a confluence position on the route connecting the position of the requesting delivery staff and the position of the proxy delivery staff when the trigger event occurs, the handover parcel determination unit 115 may determine the parcels to be handed over from the requesting delivery staff to the proxy delivery staff from among the parcels that the requesting delivery staff is scheduled to deliver after the trigger event occurs. That is, the handover parcel determination unit 115 may determine the parcels to be handed over based on the determination of whether a business delay occurs when a part of the parcels that the requesting delivery staff is scheduled to deliver after the trigger event is excluded.
[0061] On the other hand, when there is a merging position on the route connecting the position of the commissioned delivery person and the position of the proxy delivery person at the time when they are closest after the trigger event occurs (the closest time calculated by the closest time calculation unit 118), the delivery luggage determination unit 115 may determine the luggage to be transferred from the commissioned delivery person to the proxy delivery person from among the luggage that the commissioned delivery person plans to deliver after the closest time. That is, the delivery luggage determination unit 115 may determine the luggage to be transferred based on a determination as to whether a business delay occurs when a part of the luggage that the commissioned delivery person plans to deliver after the closest time is excluded.
[0062] FIG. 13 is a diagram showing an example of the processing operation in the delivery luggage determination unit 115. Let P = 1 (step S1301). Create the delivery route of the commissioned delivery person when P pieces of luggage are excluded, and calculate the scheduled delivery completion time and the predicted number of delivery delays (step S1302). At this time, for example, among the luggage that the commissioned delivery person plans to deliver after the closest time Tmin, P pieces of luggage from the ones with earlier scheduled delivery are excluded from the luggage that the commissioned delivery person delivers.
[0063] If the scheduled delivery completion time is earlier than the business end time (step S1303, YES) and the predicted number of delivery delays is zero (step S1304, YES), determine the excluded P pieces of luggage as the luggage to be transferred from the commissioned delivery person to the proxy delivery person (step S1305), and end the process. If the scheduled delivery completion time is not earlier than the business end time (step S1303, NO), or if the predicted number of delivery delays is not zero (step S1304, NO), set P = P + 1 (step S1306), and return to step S1302.
[0064] As described above, the present invention has been described according to the preferred embodiments of the present invention. Here, the present invention has been described by showing specific specific examples, but various modifications and changes can be made to these specific examples without departing from the spirit and scope of the present invention described in the claims.
Explanation of Signs
[0065] 100 Information processing device 110 Control Unit 111 Delivery Status Acquisition Unit 112 Delivery Management Information Update Unit 113 Substitute Delivery Person Determination Unit 114 Confluence Location Determination Unit 1141 Route Creation Unit 1142 Determination Unit 115 Delivery Goods Determination Unit 116 Delivery Information Transmission Processing Unit 117 Business Delay Detection Unit 118 Nearest Time Calculation Unit 119 Substitute Delivery Person Candidate List Creation Unit 120 Memory Unit 130 Communication Unit
Claims
1. A route creation unit that creates a route connecting the position of a requested delivery person and the position of a proxy delivery person who delivers a part of the package to be delivered by the requested delivery person instead; A merging position determination unit that determines a merging position where the requested delivery person and the proxy delivery person merge based on the time required to move along the route, and has: The merging position is a position that satisfies a first condition and does not satisfy a second condition, The second condition is not that it does not satisfy the first condition, an information processing apparatus.
2. If the intermediate position, which is the position where the requested delivery person arrives in half the time required from the position of the requested delivery person to the position of the proxy delivery person, satisfies the first condition and does not satisfy the second condition, the merging position determination unit determines the intermediate position as the merging position. The information processing apparatus according to claim 1.
3. If the intermediate position does not satisfy the first condition or satisfies the second condition, the merging position determination unit is between the intermediate position and the position of the requested delivery person, and satisfies the first condition and does not satisfy the second condition. The information processing apparatus according to claim 2, wherein the position closest to the intermediate position among the positions is determined as the merging point.
4. The first condition includes at least one of the following conditions: 1) a road with a width of at least a first road width; 2) a road with a parking lot. The information processing apparatus according to any one of claims 1 to 3.
5. The second condition includes at least one of the following conditions: 1) a road with a width of at most a second road width; 2) a road where parking and stopping are prohibited. The information processing apparatus according to any one of claims 1 to 4.
6. In the route created by the route creation unit, the position is represented by nodes and links. The information processing apparatus according to any one of claims 1 to 5.
7. An information processing method executed by a computer, comprising: A route creation step of creating a route connecting the position of a requested delivery person and the position of a proxy delivery person who delivers a part of the package to be delivered by the requested delivery person instead; A merging position determination step of determining a merging position where the requested delivery person and the proxy delivery person merge based on the time required to move along the route; The merging position is a position that satisfies a first condition and does not satisfy a second condition, The second condition is not that it does not satisfy the first condition, an information processing method.
8. An information processing program for causing a computer to execute the information processing method according to claim 7.
9. A computer-readable storage medium storing the information processing program according to claim 8.
Citation Information
Patent Citations
Moving body merging support device, moving body merging support system, and moving body merging route determination method
JP2013181775A
Method for supplying delivery plan information
JP2002342876A