Delivery management system, delivery management method, and delivery management program
The delivery management system addresses inefficiencies in delivery time prediction by using location and movement history data to calculate and distribute travel times efficiently, excluding non-delivery stops and accurately allocating times to nearest destinations.
Patent Information
- Application Number
- JP2021170236
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-10-18
- Publication Date
- 2025-11-12
- Estimated Expiration
- 2041-10-18
AI Technical Summary
Existing delivery management systems fail to efficiently account for varying delivery times due to factors like topography and residential density, leading to increased workload in managing individual delivery times that fluctuate daily.
A delivery management system that includes a delivery destination information storage unit, movement history storage unit, and control unit to calculate delivery times by dividing areas based on direction, identifying nearest destinations, and allocating chronological intervals.
Enables efficient evaluation of delivery times by excluding non-delivery stops and accurately distributing travel times to nearest destinations, reducing workload and improving time management.
Smart Images

Figure 0007767695000001 
Figure 0007767695000002 
Figure 0007767695000003
Abstract
Description
[Technical Field]
[0001] The present invention relates to a delivery management system, a delivery management method, and a delivery management program for evaluating the time required for delivery. [Background technology]
[0002] When delivering multiple packages to each destination, the delivery is made by visiting the destination addresses in sequence. Therefore, a work management system for predicting the required time and completion time of the work has been considered (see, for example, Patent Document 1). In the technology described in this document, a control unit of the work management system calculates a morning delivery rate based on the section number where the delivery has been completed, and calculates an afternoon delivery rate by subtracting the morning delivery rate and support rate. The control unit calculates the actual morning delivery work time by subtracting the support work time, the morning round-trip driving time, and the morning non-delivery time from the departure / return time. Furthermore, the control unit calculates the morning work efficiency by dividing this actual morning delivery work time by the calculated morning delivery rate. The control unit calculates the expected afternoon delivery work time by multiplying this morning work efficiency by the calculated afternoon delivery rate. [Prior art documents] [Patent documents]
[0003] [Patent Document 1] Japanese Patent Application Laid-Open No. 2012-160007 Summary of the Invention [Problem to be solved by the invention]
[0004] However, even if the number of deliveries (mail items) is the same, the time required for delivery varies depending on factors such as the topography and residential density of the delivery area. Furthermore, if the required delivery time for each delivery destination can be managed, the overall required time can be predicted. However, measuring the required delivery time for each delivery destination individually, which fluctuates daily, increases the workload. [Means for solving the problem]
[0005] A delivery management system that solves the above problem includes a delivery destination information storage unit that records location information of delivery destinations, a movement history storage unit that records the location of deliverers in chronological order, and a control unit that calculates the delivery time for each delivery destination.The control unit then executes a delivery management process in which, for each location recorded in the movement history storage unit, the control unit divides a map into multiple areas according to the direction, identifies the nearest delivery destination for each area using the delivery destination information storage unit, and allocates the chronological time intervals to the nearest delivery destinations. [Effects of the Invention]
[0006] According to the present invention, the time required for delivery can be efficiently evaluated. [Brief explanation of the drawings]
[0007] [Figure 1] FIG. 1 is a schematic configuration diagram illustrating a configuration of a system according to an embodiment. [Figure 2] FIG. 2 is an explanatory diagram of a hardware configuration according to the embodiment. [Figure 3] 1A is an explanatory diagram of each data storage unit of an embodiment, where FIG. 1B is an explanatory diagram of a map storage unit, FIG. 1C is an explanatory diagram of a movement history storage unit, and FIG. 1D is an explanatory diagram of a required time storage unit. [Figure 4] FIG. [Figure 5] FIG. [Figure 6] FIG. [Figure 7] FIG. 10 is an explanatory diagram of location information at the time of delivery according to an embodiment. [Figure 8] 10A, 10B, 10C, 10D are explanatory diagrams of the process of specifying a delivery destination in an embodiment, where FIG. 10A is an explanatory diagram of position p1, FIG. 10B is an explanatory diagram of position p2, FIG. 10C is an explanatory diagram of position p3, and FIG. 10D is an explanatory diagram of position p4. DETAILED DESCRIPTION OF THE INVENTION
[0008] An embodiment of a delivery management system, a delivery management method, and a delivery management program will be described using Figures 1 to 8. In this embodiment, a delivery management system used to evaluate the time required to deliver mail while visiting multiple delivery destinations will be described. In this embodiment, a section that collectively serves multiple nearby households is used as the delivery destination. As shown in FIG. 1, the delivery management system of this embodiment uses a user terminal 10, a management terminal 11, and a support server 20.
[0009] (Hardware configuration description) 2, the hardware configuration of the information processing device H10 that constitutes the user terminal 10, management terminal 11, and support server 20 will be described. The information processing device H10 includes a communication device H11, an input device H12, a display device H13, a storage device H14, and a processor H15. Note that this hardware configuration is an example, and it can also be realized by other hardware.
[0010] The communication device H11 is an interface that establishes a communication route with other devices and executes data transmission and reception, and is, for example, a network interface or a wireless interface.
[0011] The input device H12 is a device that accepts input of various information, such as a mouse, a keyboard, a camera (photographing device), etc. The display device H13 is a display or the like that displays various information.
[0012] The storage device H14 is a storage device that stores data and various programs for executing various functions of the user terminal 10, the management terminal 11, and the support server 20. Examples of the storage device H14 include a ROM, a RAM, and a hard disk.
[0013] The processor H15 uses programs and data stored in the storage device H14 to control each process in the user terminal 10, the management terminal 11, and the support server 20. Examples of the processor H15 include a CPU and an MPU. The processor H15 loads programs stored in a ROM or the like into a RAM and executes various processes for each process.
[0014] The processor H15 is not limited to a processor that performs all of its processing using software. For example, the processor H15 may include a dedicated hardware circuit (e.g., an application-specific integrated circuit (ASIC)) that performs hardware processing for at least part of the processing it performs. That is, the processor H15 may be configured as a circuit including: (1) a processor that operates according to a computer program; (2) a dedicated hardware circuit that executes part of various processes; or (3) a combination thereof. The processor includes a CPU and memory such as RAM and ROM, and the memory stores program code or instructions configured to cause the CPU to execute processing. The memory, i.e., computer-readable medium, includes any available medium that can be accessed by a general-purpose or dedicated computer.
[0015] (Delivery management system functions) Next, the functions of the user terminal 10, the management terminal 11, and the support server 20 as a delivery management system will be described with reference to FIG.
[0016] The user terminal 10 is a computer terminal carried by the person in charge of delivery (deliverer). This user terminal 10 is equipped with a location information acquisition means. The location information acquisition means can be, for example, the Global Navigation Satellite System (GSNN). Using this location information acquisition means, the location of the person in charge is periodically identified and stored as a movement history in association with the current time. The user terminal 10 then uploads the movement history information to the support server 20. The management terminal 11 is a computer terminal used by a manager of delivery operations.
[0017] The support server 20 is a computer system that manages delivery operations. The support server 20 includes a control unit 21, a delivery destination information storage unit 22, a map storage unit 23, a movement history storage unit 24, and a required time storage unit 25.
[0018] The control unit 21 executes the delivery management program to function as a mapping unit 211, a speed analysis unit 212, a delivery destination analysis unit 213, and a time evaluation unit 214. The mapping unit 211 acquires movement history information from the user terminal 10 and executes a process of recording the movement history information in the movement history storage unit 24 .
[0019] The speed analysis unit 212 executes a process of analyzing the driving speed in the movement history. Then, the driving speed is used to identify the area where delivery was made. The speed analysis unit 212 stores data on threshold speeds for determining whether to stop for delivery or to wait at a traffic light. The delivery destination analysis unit 213 executes a process to identify the sorting entrance to which the delivery was made based on the positional relationship between the movement history and the sorting entrance. The delivery destination analysis unit 213 stores data on the threshold distance for identifying the sorting entrance. The time evaluation unit 214 uses the movement history information to execute a process of evaluating the time required for delivery to each sorting port.
[0020] As shown in Figure 3(a), delivery destination information storage unit 22 stores delivery destination information 220 related to addresses where delivery may be made. This delivery destination information 220 is recorded when a resident's address is registered. This delivery destination information 220 stores data related to an area identifier, a delivery destination identifier, an address, and coordinates.
[0021] The area identifier data area stores data on an identifier for identifying each area (delivery district) of the delivery target. The delivery destination identifier data area stores data related to identifiers for identifying each section gate included in this area. As delivery destination identifiers, section gate numbers arranged in the order of delivery are used.
[0022] In the address data area, data relating to the address of the sorting entrance is recorded. The coordinate data area stores data relating to coordinates that identify the location of the section entrance on the map. The coordinates may be, for example, latitude and longitude.
[0023] As shown in Figure 3(b), map information 230 of the delivery area (delivery district) is recorded in the map storage unit 23. This map information 230 is recorded when the delivery area is registered. This map information 230 records data related to geofences for coordinates (latitude, longitude), and this geofence can identify boundary areas.
[0024] Boundary areas are areas that individually determine which section entrances are the targets for calculating delivery times. For example, in areas where the boundaries between section entrances are close, or in areas around post offices where delivery staff are present for purposes other than delivery, the time spent in these areas may be miscalculated as being in a nearby section entrance. Therefore, to prevent misevaluation of time spent in these areas, virtual geographical boundaries (geofences) are set around areas such as post offices, and areas outside the boundary area are identified in the movement history for evaluation. In other words, to prevent miscalculation, the boundary area within the geofence is set as outside the evaluation area.
[0025] As shown in Fig. 3(c), movement history information 240 relating to the location of the person in charge at the time of delivery is recorded in the movement history storage unit 24. This movement history information 240 is recorded when movement history information is acquired from the user terminal 10. This movement history information 240 records data relating to the person in charge identifier, area identifier, delivery date, time, location, and aggregation target determination.
[0026] The person in charge identifier data area stores data relating to an identifier for identifying the person in charge of delivery. The area identifier data area stores data relating to an identifier for identifying the area (delivery district) in which the person in charge made a delivery.
[0027] The delivery date data area records data relating to the date of delivery. The time data area records data relating to the time when the location information was acquired. The location data area stores data about the location of the person in charge. The location can be, for example, latitude and longitude. By arranging each location in chronological order using time, the movement history of the person in charge can be identified.
[0028] The aggregation target determination data area stores a flag to determine whether or not to use the data in calculating delivery time. If the data is to be used in calculating delivery time, a target flag is stored, and if the data is not to be used in calculating delivery time, an exclusion flag is stored.
[0029] As shown in Figure 3(d), the required time storage unit 25 stores required time management information 250 relating to the time required for delivery for each delivery destination. This required time management information 250 is recorded when a required time evaluation process is performed. This required time management information 250 stores data relating to the delivery date, area identifier, delivery destination identifier, and required time.
[0030] The delivery date data area records data relating to the date of delivery. The area identifier data area stores data relating to an identifier for identifying the area (delivery district) where delivery was made.
[0031] The delivery destination identifier data area stores data relating to identifiers for identifying each sorting slot included in this area. The required time data area records data relating to the time required for delivery to this sorting port.
[0032] (Delivery management processing) Next, the delivery management process will be described with reference to Figures 4 to 8. In this embodiment, the delivery management process includes average speed processing (Figure 4), four-quadrant processing (Figure 5), and tallying processing (Figure 6).
[0033] (average speed processing) First, we will explain average speed processing using Figure 4. Here, we will assume that the person in charge makes deliveries by motorcycle. In average speed processing, the delivery destination during delivery is extracted. In this case, while traveling to the delivery area, the person may stop at intersections or waiting at traffic lights unrelated to the delivery destination. Therefore, such stops are excluded using the average speed of the movement history.
[0034] First, the control unit 21 of the support server 20 executes a location history acquisition process (step S101). Specifically, the person in charge accesses the support server 20 using the user terminal 10. Then, the person in charge inputs a person in charge identifier and an area identifier on the access screen displayed on the user terminal 10. In this case, the mapping unit 211 of the control unit 21 generates movement history information 240 including the person in charge identifier and the area identifier. Next, the mapping unit 211 acquires the location history information from the user terminal 10, associates it with the person in charge identifier and the area identifier, and records it in the movement history information 240 of the movement history storage unit 24.
[0035] Next, the control unit 21 of the support server 20 executes a process of acquiring a sorting port (step S102). Specifically, the mapping unit 211 of the control unit 21 acquires, from the delivery destination information storage unit 22, the delivery destination information 220 in which the area identifier is recorded.
[0036] Next, the control unit 21 of the support server 20 executes a mapping process (step S103). Specifically, the mapping unit 211 of the control unit 21 acquires a map including the movement history of the movement history information 240 from the map storage unit 23. Next, the mapping unit 211 arranges on the map a movement route that chronologically connects the positions of the movement history information 240. Furthermore, the mapping unit 211 arranges section entrances on this map.
[0037] Next, the control unit 21 of the support server 20 sequentially identifies each location that constitutes the movement history as a location to be evaluated, and repeats the following process. Here, the control unit 21 of the support server 20 executes a process of calculating an average speed (step S104). Specifically, the speed analysis unit 212 of the control unit 21 identifies a preceding position and a succeeding position of the evaluation target position. If only one of the preceding position and the succeeding position is identified, only the identified position is used. Next, the distance between the preceding position and the evaluation target position, and the distance between the evaluation target position and the succeeding position are calculated. Next, the speed analysis unit 212 calculates each of the movement speeds from the preceding position to the evaluation target position and from the evaluation target position to the succeeding position using each of the time intervals between the preceding position, the evaluation target position, and the succeeding position. Then, the speed analysis unit 212 calculates the movement speed at the evaluation target position using the average value of each movement speed.
[0038] Next, the control unit 21 of the support server 20 executes a determination process as to whether or not the coordinates of the processing target position are within the boundary area (step S105). Specifically, the speed analysis unit 212 of the control unit 21 determines whether or not the coordinates of the processing target position are within the boundary area of the map information 230.
[0039] If it is determined that the location is within the boundary area (YES in step S105), the control unit 21 of the support server 20 executes a process of excluding the location from the aggregation target (step S106). Specifically, the speed analysis unit 212 of the control unit 21 records an exclusion flag in the movement history information 240 for the location to be evaluated, thereby excluding the location from the aggregation target.
[0040] On the other hand, if it is determined that the movement speed is outside the boundary area (if "NO" in step S105), the control unit 21 of the support server 20 executes a determination process to determine whether the movement speed is equal to or greater than the threshold speed (step S107). Specifically, the speed analysis unit 212 of the control unit 21 compares the calculated movement speed with the threshold speed.
[0041] When it is determined that the moving speed is equal to or greater than the threshold speed (YES in step S107), the control unit 21 of the support server 20 executes a process of excluding the user from the aggregation target (step S106). On the other hand, if it is determined that the movement speed is less than the threshold speed ("NO" in step S107), the control unit 21 of the support server 20 executes a counting target process (step S108). Specifically, the speed analysis unit 212 of the control unit 21 records a target flag in the movement history information 240 for this evaluation target location, thereby making it a counting target.
[0042] Next, the control unit 21 of the support server 20 executes a process of changing the most recent position to a target for aggregation (step S109). Specifically, the speed analysis unit 212 of the control unit 21 changes the non-target flag recorded in the movement history information 240 to a target flag, thereby making the most recent position a target for aggregation. Then, the control unit 21 of the support server 20 repeats this process until it is completed for all positions.
[0043] (4-quadrant processing) Next, the four-quadrant processing will be explained with reference to FIG.
[0044] First, the control unit 21 of the support server 20 executes a process of acquiring a processing target (step S201). Specifically, the delivery destination analysis unit 213 of the control unit 21 acquires a location for which a target flag is recorded in the movement history information 240 of the movement history storage unit 24.
[0045] Here, the control unit 21 of the support server 20 sequentially identifies the position of the processing target in chronological order, and repeats the following processing. First, the control unit 21 of the support server 20 executes a process of dividing into four quadrants (step S202). Specifically, the delivery destination analysis unit 213 of the control unit 21 divides the processing target location into four regions (four quadrants) of equal area, with the processing target location at the center. For example, by setting longitude lines and latitude lines for the processing target location according to the direction, the first to fourth quadrants are set with the processing target location at the center.
[0046] Next, the control unit 21 of the support server 20 executes a process of identifying the nearest address within the threshold distance in each quadrant (step S203). Specifically, the delivery destination analysis unit 213 of the control unit 21 identifies the nearest section entrance within the threshold distance in each of the first to fourth quadrants.
[0047] Next, the control unit 21 of the support server 20 executes a process of distributing the travel time to each of the nearest section entrances (step S204). Specifically, the delivery destination analysis unit 213 of the control unit 21 calculates the travel time using the difference between the time of the most recent preceding location and the time of the target location. The delivery destination analysis unit 213 then distributes the calculated travel time equally to the section entrances identified in each quadrant. For example, if the nearest delivery destinations are identified in all quadrants, 1 / 4 of the travel time is distributed to each section entrance. On the other hand, if there is a quadrant where no nearest section entrance exists, the travel time is distributed equally based on the number of identified section entrances. Note that if no nearest section entrance exists in all quadrants, this travel time is carried over to the next distribution. The delivery destination analysis unit 213 then adds the calculated travel time to the required time in the required time management information 250, associated with the section entrance.
[0048] As shown in FIG. 7, it is assumed that there are delivery destinations 501 to 504 on delivery route R1 on map 500. For example, in Figure 8(a), at location p1, within the threshold distance range a1, delivery destination 503 is identified in the first quadrant and delivery destination 502 is identified in the fourth quadrant. Then, the travel time from the most recent location where travel time was allocated to location p1 is allocated equally between delivery destinations 503 and 502.
[0049] In Figure 8(b), at position p2, within the threshold distance range a2, delivery destination 503 is identified in the second quadrant. In this case, the travel time from the most recent position to which travel time was allocated to position p2 is allocated to delivery destination 503.
[0050] In Figure 8(c), at location p3, within the threshold distance range a3, delivery destinations 501 and 502 are included in the third quadrant, but the nearest delivery destination 502 is identified. Also, in the fourth quadrant, delivery destination 504 is identified. In this case, the travel time from the most recent location where travel time was allocated to location p3 is allocated in half to delivery destinations 502 and 504.
[0051] In Figure 8(d), at position p4, within the threshold distance range a4, delivery destination 504 is identified in the first quadrant, delivery destination 502 in the second quadrant, and delivery destination 501 in the third quadrant. In this case, the travel time from the most recent position where travel time was distributed to position p4 is allocated in three equal parts to delivery destinations 501, 502, and 504. The control unit 21 of the support server 20 repeats the above process for all positions to be processed.
[0052] (aggregation processing) Next, the tallying process will be described with reference to Fig. 6. This process is performed when the management terminal 11 accesses the support server 20.
[0053] Here, the control unit 21 of the support server 20 sequentially identifies the sorting slots recorded in the delivery destination information storage unit 22 as processing targets, and repeats the following processing. First, the control unit 21 of the support server 20 executes a process of tallying up delivery times (step S301). Specifically, the time evaluation unit 214 of the control unit 21 acquires the required times recorded in the required time storage unit 25 for the target sorting gate. Then, the time evaluation unit 214 calculates an aggregated time by adding up the acquired required times.
[0054] Next, the control unit 21 of the support server 20 executes a statistical value calculation process (step S302). Specifically, the time evaluation unit 214 of the control unit 21 calculates the number of deliveries for the target sorting port. Here, the required time storage unit 25 is used to count the number of days for which deliveries have been made to the target sorting port. The time evaluation unit 214 then calculates the statistical value of the required time (delivery required time) by dividing the total time by the number of deliveries.
[0055] When the process for each sorting port has been repeated, the control unit 21 of the support server 20 executes an output process (step S303). Specifically, the time evaluation unit 214 of the control unit 21 generates a list including the required delivery time for each sorting port, and outputs the list to the management terminal 11.
[0056] According to this embodiment, the following effects can be obtained. (1) In this embodiment, the control unit 21 of the support server 20 executes a process of calculating an average speed (step S104), thereby making it possible to calculate the speed at each position on the moving route during delivery.
[0057] (2) In this embodiment, if it is determined that the location is within the boundary area (if "YES" in step S105), the control unit 21 of the support server 20 executes a process of excluding the location from the aggregation target (step S106). This allows a geofence to be set on the map, and a desired range can be evaluated.
[0058] (3) In this embodiment, the control unit 21 of the support server 20 executes a determination process to determine whether the moving speed is equal to or greater than the threshold speed (step S107). If it is determined that the moving speed is equal to or greater than the threshold speed (if "YES" in step S107), the control unit 21 of the support server 20 executes a process to exclude the moving speed from the aggregation target (step S106). This makes it possible to distinguish between movement to a delivery area and movement for delivery work in a delivery area based on the moving speed.
[0059] (4) In this embodiment, if it is determined that the travel speed is less than the threshold speed ("NO" in step S107), the control unit 21 of the support server 20 executes the aggregation target process (step S108). This allows the travel history to be used for evaluating the delivery time along the travel route to be identified.
[0060] (5) In this embodiment, the control unit 21 of the support server 20 executes a process of changing the most recent location to the target of aggregation (step S109). As a result, even if the movement speed immediately after arriving at the delivery area is equal to or greater than the threshold speed, it can be treated as a movement history during delivery.
[0061] (6) In this embodiment, the control unit 21 of the support server 20 performs a process of dividing the delivery into four quadrants (step S202), a process of identifying the nearest address within a threshold distance in each quadrant (step S203), and a process of distributing travel time to the nearest sectional entrances (step S204). This allows the travel time to be distributed to sectional entrances surrounding the travel route. For example, when delivering to a sectional entrance with a large area, if there is another sectional entrance nearby, it may be mistakenly recognized as a delivery to another sectional entrance. By recognizing sectional entrances for each quadrant, it is possible to identify sectional entrances with a large area in some quadrants. Furthermore, because sectional entrances with a large area are identified as the nearest sectional entrance in a quadrant for a long period of time, it is possible to calculate a long delivery time corresponding to the recognition period.
[0062] (7) In this embodiment, the control unit 21 of the support server 20 executes a process of tallying delivery times (step S301) and a process of calculating statistical values (step S302). This allows the time required for delivery to each sorting port to be calculated, and the delivery load to be adjusted.
[0063] This embodiment can be modified as follows: This embodiment and the following modifications can be combined and implemented within the scope of technical compatibility. In the above embodiment, delivery management processing is performed in the delivery of mail, but the application of the present invention is not limited to delivery of mail.
[0064] In the above embodiment, the control unit 21 of the support server 20 executes a process of determining whether the speed is equal to or greater than the threshold speed (step S107). Here, the threshold speed may be changed depending on the situation. For example, the control unit 21 of the support server 20 acquires traffic information from a traffic information site and changes the threshold speed depending on the traffic volume and congestion situation. In this case, when the traffic volume is heavy, the threshold speed is lowered.
[0065] In the above embodiment, the control unit 21 of the support server 20 executes a division process into four quadrants (step S202). Here, as long as it is possible to divide the target location into multiple regions of the same area according to the direction, centered on the target location, the division is not limited to four quadrants. Furthermore, as long as it is possible to divide the target location equally according to the direction, it does not have to be parallel to the lines of longitude and latitude.
[0066] In the above embodiment, a geofence is set around a post office. The area where a geofence is set is not limited to the area around a post office. For example, a geofence may be set in an area where no sorting gate exists. [Explanation of symbols]
[0067] 10...user terminal, 11...management terminal, 20...support server, 21...control unit, 211...mapping unit, 212...speed analysis unit, 213...delivery destination analysis unit, 214...time evaluation unit, 22...delivery destination information storage unit, 23...map storage unit, 24...movement history storage unit, 25...required time storage unit.
Claims
1. a delivery destination information storage unit that stores location information of sorting outlets as delivery destinations; a movement history storage unit that records the location of the deliverer in chronological order; A control unit that calculates the delivery time required for delivery for each sorting port, The control unit Dividing the range of the threshold distance of the map into a plurality of regions according to the direction for each piece of location information recorded in the movement history storage unit; For each of the areas, the delivery destination information storage unit is used to identify the nearest sorting gate; A delivery management system characterized by executing a delivery management process that distributes travel time calculated from the time difference between chronological location locations recorded in the travel history memory unit to the specified multiple section entrances and calculates the delivery time required for each section entrance.
2. The control unit Calculating a moving speed at the location; The delivery management system according to claim 1, characterized in that the delivery management process is executed using the location of a vehicle moving at a speed equal to or less than a threshold speed.
3. The delivery management system further includes a map storage unit that stores information for identifying an evaluation target area for performing the delivery management process, The delivery management system according to claim 1 or 2, characterized in that the control unit executes the delivery management process using a location included in the evaluation target area identified by the map storage unit.
4. a delivery destination information storage unit that stores location information of sorting outlets as delivery destinations; a movement history storage unit that records the location of the deliverer in chronological order; A method for managing delivery using a delivery management system including a control unit that calculates the delivery time required for each delivery slot, The control unit Dividing the range of the threshold distance of the map into a plurality of regions according to the direction for each piece of location information recorded in the movement history storage unit; For each of the areas, the delivery destination information storage unit is used to identify the nearest sorting gate; A delivery management method characterized by executing a delivery management process that distributes travel time calculated from the time difference between chronological location locations recorded in the travel history memory unit to the specified multiple section entrances and calculates the delivery time required for each section entrance.
5. a delivery destination information storage unit that stores location information of sorting outlets as delivery destinations; a movement history storage unit that records the location of the deliverer in chronological order; A program for performing delivery management using a delivery management system including a control unit that calculates the delivery time required for each delivery slot, The control unit Dividing the range of the threshold distance of the map into a plurality of regions according to the direction for each piece of location information recorded in the movement history storage unit; For each of the areas, the delivery destination information storage unit is used to identify the nearest sorting gate; A delivery management program characterized by causing the section entrance to function as a means for executing a delivery management process that distributes travel time calculated from the time difference between chronological location locations recorded in the travel history memory unit to the specified plurality of section entrances and calculates the delivery time required for each section entrance.
Citation Information
Patent Citations
Delivery routing device
JP2006079478A
System, method and program for managing work
JP2011180782A
Work management system, work management method and work management program
JP2012160007A
Driving evaluation device
WO2020031828A1
Route evaluating device
WO2020045259A1