Route planning method, device, equipment and computer readable storage medium

Abstract

The present invention provides a route planning method, device, equipment and computer-readable storage medium, the method comprising: determining all current parking addresses according to historical parking addresses; matching the current delivery addresses of each package to be delivered to the first parking address that is closest to the delivery address of the package to be delivered; for each first parking address, calculating the weight value corresponding to the first parking address according to the weight value of the package to be delivered; planning the delivery route according to the weight value corresponding to the first parking address and preset constraints. Thus, the total delivery time of the package to be delivered can be reduced, the delivery efficiency can be accelerated, and the delivery according to the weight value of the package to be delivered can result in the delivery of the package with a higher priority to be delivered to the user as soon as possible, thereby improving the user experience.

Description

Technical Field

[0001] The present invention relates to the field of logistics, and in particular to a route planning method, device, equipment and computer-readable storage medium. Background Art

[0002] With the development of science and technology, online shopping has gradually become the mainstream way for users to shop. Online shopping generally involves users selecting the goods to be purchased online, and then sending them to the user's mailing address through express delivery after payment. Therefore, the time from when the user places an order and pays to when the package is received has become an extremely important factor affecting the user experience. Specifically, if the user receives the package in a relatively short period of time after placing an order and paying, the user experience is better, and the user's evaluation of the merchant is also better. Correspondingly, if the user does not receive the package for a long time after placing an order and paying, the user experience is poor, which leads to a poor evaluation of the merchant by the user, and then leads to user loss.

[0003] The current delivery method is generally that one delivery person is responsible for delivering packages in one area, and during the delivery process, a fixed delivery route is generally adopted, such as route ABCDE, where the letters represent the parking addresses in the area, and packages near each parking address are delivered at the address.

[0004] However, since the delivery route is fixed, the above delivery method may result in a long total delivery time and different delivery times for each parking address, which may lead to a poor user experience. For example, if the users corresponding to the five parking addresses A, B, C, D, and E place orders at the same time, during the delivery process using the above delivery method, the package corresponding to parking address A is always delivered to the user faster, while the package corresponding to parking address D is always delivered to the user slower, resulting in a long delivery time for parking address D and different delivery times for each parking address, which may lead to a poor user experience. Summary of the invention

[0005] The present invention provides a route planning method, device, equipment and computer-readable storage medium, which are used to solve the technical problems of long delivery time and unequal delivery time for each parking address due to fixed delivery routes.

[0006] A first aspect of the present invention is to provide a route planning method, comprising:

[0007] Determine all current parking addresses based on historical parking addresses;

[0008] According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0009] For each of the first parking addresses, calculating a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0010] A delivery route is planned according to the weight value corresponding to the first parking address and preset constraints.

[0011] Another aspect of the present invention is to provide a route planning device, comprising:

[0012] A parking address determination module is used to determine all current parking addresses based on historical parking addresses;

[0013] A parking address determination module is used to determine all current parking addresses based on historical parking addresses;

[0014] A matching module, configured to match the parcel to be delivered to a first parking address that is closest to the delivery address of the parcel to be delivered according to the delivery address of each parcel to be delivered;

[0015] A first weight calculation module, configured to calculate, for each of the first parking addresses, a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0016] A planning module is used to plan a delivery route according to the weight value corresponding to the first parking address and preset constraints.

[0017] Another aspect of the present invention is to provide a route planning device, comprising: a memory, a processor;

[0018] Memory; Memory for storing instructions executable by the processor;

[0019] Wherein, the processor is configured to execute the route planning method as described above.

[0020] Another aspect of the present invention is to provide a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement the route planning method as described above.

[0021] The route planning method, device, equipment and computer-readable storage medium provided by the present invention determine all current parking addresses according to historical parking addresses; match the parcels to be delivered to the first parking address that is closest to the delivery address of the parcels to be delivered according to the current delivery addresses of the parcels to be delivered; for each of the first parking addresses to be delivered, calculate the weight value corresponding to the first parking address according to the weight value of the parcels to be delivered; and plan the delivery route according to the weight value corresponding to the first parking address and preset constraints. This can reduce the total delivery time of the parcels to be delivered, speed up the delivery efficiency, and deliver according to the weight value of the parcels to be delivered, so that the parcels to be delivered with higher priority can be delivered to the user as soon as possible, thereby improving the user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention, and a person skilled in the art can also obtain other drawings based on these drawings.

[0023] Figure 1 A schematic diagram of the network architecture on which the present invention is based;

[0024] Figure 2 A schematic diagram of a route planning method according to the first embodiment of the present invention;

[0025] Figure 3 A schematic diagram of a route planning method according to a second embodiment of the present invention;

[0026] Figure 4 A schematic diagram of a route planning method according to a third embodiment of the present invention;

[0027] Figure 5 A schematic diagram of a process flow of a route planning method provided in Embodiment 4 of the present invention;

[0028] Figure 6 A schematic diagram of a process flow of a route planning method provided in Embodiment 5 of the present invention;

[0029] Figure 7 A flowchart of a route planning method provided in Embodiment 6 of the present invention;

[0030] Figure 8 A schematic diagram of the structure of a route planning device provided in Embodiment 7 of the present invention;

[0031] Fig. 9 This is a schematic diagram of the structure of a route planning device provided in Embodiment 8 of the present invention. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. All other embodiments obtained based on the embodiments in the present invention belong to the scope of protection of the present invention.

[0033] The current delivery method is generally that one delivery person is responsible for delivering parcels in one area, and during the delivery process, a fixed delivery route is generally used, such as ABCDE, where the letters represent the parking addresses in the area, and the parcels near the parking addresses are delivered. However, due to the fixed delivery route, the above delivery method may result in a long total delivery time and different delivery times for each parking address, which in turn leads to a poor user experience.

[0034] In order to solve the above technical problems, the present invention provides a route planning method, device, equipment and computer-readable storage medium. The route planning method provided by the present invention can be applied in multiple scenarios. For example, it can be applied in the scenario of e-commerce package delivery to reduce the total package delivery time and improve the efficiency of e-commerce package delivery. It can also be applied in the scenario of letter mailing to reduce the total letter delivery time and improve the efficiency of letter delivery. In other words, the route planning method provided by the present invention can be applied in any scenario of item delivery with multiple delivery addresses to reduce the total delivery time and thus improve the user experience.

[0035] It should be noted that, in order to better explain the present invention, Figure 1 This is a schematic diagram of the network architecture on which the present invention is based, such as Figure 1 As shown, the execution subject of the route planning method provided by the present invention is a route planning device 1, which can be implemented by software and / or hardware. The route planning device 1 can exchange information with the electronic terminal 2 of the delivery person by wired and / or wireless means. As an implementable method, the route planning device 1 can also exchange information with the database 3 by wired and / or wireless means, so that the planned route can be stored in the database 3, so that when the location information of the subsequent packages to be delivered is consistent, the delivery can be carried out directly according to the historically planned route.

[0036] Figure 2 A schematic diagram of a route planning method according to the first embodiment of the present invention is shown in FIG. Figure 2 As shown, the method includes:

[0037] Step 101: determine all current parking addresses based on historical parking addresses.

[0038] In this embodiment, in order to realize the planning of the delivery route, it is first necessary to determine all the parking addresses to be stopped, wherein the parking address to be stopped is the address in the delivery route where the delivery person has parked for more than a preset time threshold, so that the delivery person can stop at the address to be delivered to deliver the package corresponding to the address to be delivered. Specifically, the parking address to be stopped can be determined by historical parking addresses. The historical parking addresses can be multiple addresses where the delivery person has parked for delivery within a preset historical period. The determination of the parking address to be stopped by the historical parking addresses can improve the efficiency of determining the parking address to be stopped.

[0039] Step 102: According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered.

[0040] In this embodiment, after the parking address is determined, the delivery address of the local package to be delivered can be determined, and the point of interest (POI) corresponding to each package to be delivered is displayed on the map according to the delivery address. It can be understood that if the parking address is closest to the package to be delivered, the delivery speed is the fastest. Therefore, in order to improve the delivery speed of the package to be delivered, the package to be delivered can be allocated to the first parking address that is closest to the POI on the map.

[0041] Step 103: For each of the first parking addresses, a weight value corresponding to the first parking address is calculated according to the weight value of the package to be delivered.

[0042] In this embodiment, since different parcels to be delivered have different priorities, for example, if the user corresponding to the parcel to be delivered is a user with a higher membership level, the parcel to be delivered has a higher priority; if the items in the parcel to be delivered are fresh food with a shorter shelf life, the parcel to be delivered has a higher priority. Therefore, in order to ensure that the parcel to be delivered with a higher priority can be delivered to the user faster, after matching the parcel to be delivered to the first parking address closest to the delivery address of the parcel to be delivered according to the current delivery address of each parcel to be delivered, for each first parking address to be delivered, the weight value of the first parking address to be delivered can be calculated according to the weight value of the parcel to be delivered corresponding to the first parking address to be delivered. Then, the delivery priority of the first parking address to be delivered can be determined according to the weight value.

[0043] Step 104: planning a delivery route according to the weight value corresponding to the first parking address and preset constraints.

[0044] In this embodiment, after determining the weight value of each first parking address, the delivery route can be planned according to the weight value and the preset constraint conditions. It can be understood that the first parking address with a higher weight value has a higher priority, and the first parking address with a lower weight value has a lower priority. Accordingly, the first parking address with a higher priority is delivered first.

[0045] The route planning method provided in this embodiment determines all current parking addresses based on historical parking addresses; matches the parcels to be delivered to the first parking address that is closest to the delivery address of the parcels to be delivered based on the current delivery addresses of the parcels to be delivered; calculates the weight value corresponding to each of the first parking addresses based on the weight value of the parcels to be delivered; and plans the delivery route based on the weight value corresponding to the first parking address and preset constraints. This can reduce the total delivery time of the parcels to be delivered, speed up the delivery efficiency, and deliver according to the weight value of the parcels to be delivered, so that the parcels to be delivered with higher priority can be delivered to the user as soon as possible, thereby improving the user experience.

[0046] Figure 3 The following is a flow chart of a route planning method provided in Embodiment 2 of the present invention. Based on the above embodiment, the method includes:

[0047] Step 201: determine whether the distance between any two historical parking addresses is less than a preset threshold;

[0048] Step 202: If yes, any two historical parking addresses are merged to obtain at least one first parking address;

[0049] Step 203: for each first parking address, determine whether the probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold;

[0050] Step 204: If yes, determine whether the first parking address is located on a road with a specification of not less than two lanes in both directions;

[0051] Step 205: If not, use the first parking address as the address to be parked;

[0052] Step 206: According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0053] Step 207: for each of the first parking addresses, calculate a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0054] Step 208: planning a delivery route according to the weight value corresponding to the first parking address and preset constraints.

[0055] In this embodiment, in order to determine the parking address to be delivered, the historical parking addresses in the historical delivery route can be first obtained. It is understandable that if the delivery is performed to two historical parking addresses whose distance is less than the preset threshold, it may cause the route to be repeated and reduce the delivery efficiency. Therefore, in order to improve the delivery efficiency, the historical parking addresses can be streamlined and optimized first. For each historical parking address, it is determined whether the distance between any two is less than the preset threshold. If so, any two historical parking addresses are merged to obtain at least one first parking address. It should be noted that for the merged first parking address, its probability of appearing in the historical delivery route is the sum of the probabilities of the two historical parking addresses before the merger. For each first parking address, it is determined whether the probability of the first parking address appearing in the historical delivery route exceeds the preset probability threshold. If so, it indicates that the historical parking address may correspond to multiple users to be delivered, so it can be retained, and it is determined whether the first parking address is located on a road with a specification of not less than two lanes in both directions. It is understandable that if the first parking address is on a road with a specification of not less than two lanes in both directions, it is considered that the first parking address may be caused by waiting for a traffic light or parking for an emergency, so it can be discarded. Accordingly, if the first parking address is not located on a road with a specification of not less than two lanes in both directions, it can be used as the parking address to be delivered. According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address to be delivered that is closest to the delivery addresses of the packages to be delivered; for each first parking address to be delivered, the weight value corresponding to the first parking address to be delivered is calculated according to the weight value of the package to be delivered; and the delivery route is planned according to the weight value corresponding to the first parking address to be delivered and the preset constraint conditions.

[0056] The route planning method provided in this embodiment determines whether the distance between any two historical parking addresses is less than a preset threshold value; if so, any two historical parking addresses are merged to obtain at least one first parking address; for each first parking address, it is determined whether the probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold; if so, it is determined whether the first parking address is located on a road with a specification of not less than two lanes in both directions; if not, the first parking address is used as the to-be-parked address, so that the to-be-parked address in the delivery route can be accurately determined, which provides a basis for subsequent delivery route planning and can further improve the delivery speed.

[0057] Accordingly, based on any of the above embodiments, after determining, for each first parking address, whether the probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold, the method further includes:

[0058] If not, delete the first parking address.

[0059] In this embodiment, for each first parking address, it is determined whether the probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold. If not, it indicates that there are fewer users to be delivered corresponding to the first parking address and the probability of appearance is random. Therefore, in order to increase the delivery speed, the first parking address can be deleted.

[0060] The route planning method provided in this embodiment deletes the first parking address by determining that the probability of the first parking address appearing in the historical delivery route is lower than a preset probability threshold, thereby improving the delivery speed.

[0061] Accordingly, based on any of the above embodiments, after determining whether the first parking address is located on a road with a specification of not less than two lanes in both directions, the method further includes:

[0062] If not, delete the first parking address.

[0063] In this embodiment, it is determined whether the first parking address is located on a road with a specification of not less than two lanes in both directions. If not, the first parking address is deleted. It can be understood that if the first parking address is on a road with a specification of not less than two lanes in both directions, it is considered that the first parking address may be caused by waiting for a traffic light or parking for an emergency, and therefore, it can be discarded.

[0064] The route planning method provided in this embodiment can accurately determine the parking address in the delivery route by deleting the first parking address if the first parking address is on a road with specifications of not less than two lanes in both directions, thereby providing a basis for subsequent delivery route planning and improving the delivery speed.

[0065] Accordingly, based on any of the above embodiments, the step of merging any two historical parking addresses to obtain at least one first parking address includes:

[0066] Any two historical parking addresses are merged, and one of the two historical parking addresses is randomly selected as the first parking address.

[0067] In this embodiment, in order to improve the delivery efficiency, the historical parking addresses can be streamlined and optimized first. For each historical parking address, it is determined whether the distance between any two is less than a preset threshold. If so, any two historical parking addresses are merged to obtain at least one first parking address. Specifically, one of any two historical parking addresses can be randomly selected as the first parking address.

[0068] The route planning method provided in this embodiment combines any two historical parking addresses and randomly selects one of the two historical parking addresses as the first parking address, thereby being able to quickly determine the first parking address and improving the efficiency of route planning.

[0069] Further, based on any of the above embodiments, the method includes:

[0070] Get the historical delivery routes within the preset first time threshold;

[0071] Determine an address in the historical delivery route whose stay time exceeds a preset second time threshold as the historical parking address;

[0072] Determine all current parking addresses based on historical parking addresses;

[0073] According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0074] For each of the first parking addresses, calculating a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0075] A delivery route is planned according to the weight value corresponding to the first parking address and preset constraints.

[0076] In this embodiment, in order to determine the parking address to be parked, firstly, the historical parking addresses in the historical delivery routes can be obtained. Specifically, the historical delivery routes within the preset first time threshold can be obtained. Among them, the first time threshold can be set by the user. For example, it can be set to 15 days, that is, the historical delivery routes of the delivery vehicle 15 days before the current date are obtained. Since the delivery vehicle can have a variety of parking reasons during the delivery process, for example, when the delivery vehicle passes a red light, it can stop; when the delivery person checks the next delivery address, it can stop; when the delivery person arrives at a delivery address for delivery, it can stop. It can be understood that among the above-mentioned multiple parking scenarios, only the parking time is longer during parking delivery. Therefore, in order to determine the historical parking address, the address in the historical delivery route where the parking time exceeds the preset second time threshold can be obtained and used as the historical delivery address.

[0077] The route planning method provided in this embodiment obtains historical delivery routes within a preset first time threshold; determines the addresses in the historical delivery routes whose stay time exceeds a preset second time threshold as the historical parking addresses, so that the historical parking addresses can be determined quickly and accurately, which provides a basis for the subsequent determination of the address to be parked and improves the efficiency of route planning.

[0078] Figure 4 A schematic diagram of a route planning method according to a third embodiment of the present invention is provided. Based on any of the above embodiments, Figure 4 As shown, the method includes:

[0079] Step 301, determining all current parking addresses according to historical parking addresses;

[0080] Step 302: Using geo-fencing technology to form a virtual geographic boundary on the map for the delivery coverage area of ​​the delivery vehicle;

[0081] Step 303: using each road in the delivery coverage area with a specification of not less than two-way four lanes as a virtual fence, and dividing the delivery coverage area into at least one secondary area according to each virtual fence;

[0082] Step 304: Match each package to be delivered to a secondary area closest to the delivery address of the package to be delivered according to the location information of the delivery address of each package to be delivered on the map;

[0083] Step 305: For each of the first parking addresses, calculate a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0084] Step 306: Plan a delivery route according to the weight value corresponding to the first parking address and preset constraints.

[0085] In this embodiment, after all current parking addresses are determined based on historical parking addresses, the parcels to be delivered can be matched to the nearest delivery location based on the address information of the parcels to be delivered. Specifically, the delivery coverage of the delivery vehicle can be obtained on the map, and the delivery vehicle coverage area can be formed into a virtual boundary on the map using the ground fence technology. It can be understood that in order to ensure the safety of user pickup, users should not be allowed to cross the two-way four-lane to pick up the items, or the delivery personnel should not cross the two-way four-lane to deliver the items. Therefore, each road in the delivery coverage area with a specification not less than the two-way four-lane can be used as a virtual fence, and the delivery coverage area can be divided into at least one secondary area based on each of the virtual fences. According to the location information of the delivery address of each parcel to be delivered on the map, each parcel to be delivered is matched to the secondary area closest to the delivery address of the parcel to be delivered. Taking a practical application as an example, without crossing the geographic fence, each parcel to be delivered POI is matched to the first parking address with the closest straight-line distance. If the POI of the package to be delivered does not match the first parking address, the road location closest to the POI of the package to be delivered is used as the new first parking address, and the package to be delivered is matched to the new first parking address. This ensures that if there is a POI of the package to be delivered in each secondary area, there must be a parking address.

[0086] The route planning method provided in this embodiment forms a virtual geographical boundary of the delivery coverage area of ​​the delivery vehicle on the map through the geo-fencing technology; each road with a specification of not less than two-way four-lane in the delivery coverage area is used as a virtual fence, and the delivery coverage area is divided into at least one secondary area according to each virtual fence; according to the location information of the delivery address of each package to be delivered on the map, each package to be delivered is matched to the secondary area closest to the delivery address of the package to be delivered, so that the package to be delivered can be quickly and accurately matched to the nearest delivery location, thereby improving the planning efficiency of the delivery route.

[0087] Further, based on any of the above embodiments, the method includes:

[0088] Determine all current parking addresses based on historical parking addresses;

[0089] Use geo-fencing technology to create a virtual geographic boundary on the map for the delivery vehicle’s delivery coverage area;

[0090] Using each road with a specification of not less than two-way four lanes in the delivery coverage area as a virtual fence, and dividing the delivery coverage area into at least one secondary area according to each virtual fence;

[0091] According to the location information of the delivery address of each package to be delivered on the map, each package to be delivered is matched to the secondary area closest to the delivery address of the package to be delivered;

[0092] Determine whether there is any secondary area that does not match the package to be delivered;

[0093] If yes, then delete the secondary area that does not match the package to be delivered;

[0094] For each of the first parking addresses, calculating a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0095] A delivery route is planned according to the weight value corresponding to the first parking address and preset constraints.

[0096] In this embodiment, after the division of the secondary areas is implemented and each package to be delivered is matched to the secondary area closest to the delivery address of the package to be delivered, in order to facilitate the management efficiency of the secondary areas and improve the delivery efficiency, it can be determined whether there is any secondary area with an unmatched package to be delivered. If so, it will be deleted.

[0097] The route planning method provided in this embodiment determines whether there is any secondary area that does not match the package to be delivered; if so, the secondary area that does not match the package to be delivered is deleted, thereby improving the management efficiency of the secondary area on the basis of reducing the delivery time.

[0098] Further, based on any of the above embodiments, the method includes:

[0099] Determine all current parking addresses based on historical parking addresses;

[0100] Use geo-fencing technology to create a virtual geographic boundary on the map for the delivery vehicle’s delivery coverage area;

[0101] Using each road with a specification of not less than two-way four lanes in the delivery coverage area as a virtual fence, and dividing the delivery coverage area into at least one secondary area according to each virtual fence;

[0102] According to the location information of the delivery address of each package to be delivered on the map, each package to be delivered is matched to the secondary area closest to the delivery address of the package to be delivered;

[0103] Determine whether the number of parking addresses in the secondary area exceeds a preset threshold;

[0104] If yes, the secondary area is divided into at least one sub-area, so that each sub-area includes only one parking address;

[0105] If the number of the parking addresses in the secondary area is equal to a preset threshold, the secondary area is used as the sub-area;

[0106] If the number of parking addresses in the secondary area is less than a preset threshold, the secondary area is regarded as a blank area;

[0107] For each of the first parking addresses, calculating a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0108] A delivery route is planned according to the weight value corresponding to the first parking address and preset constraints.

[0109] In this embodiment, after the division of the secondary area is realized and each package to be delivered is matched to the secondary area closest to the delivery address of the package to be delivered, in order to further reduce the delivery time, it can be determined whether the number of parking addresses in the secondary area exceeds the preset threshold. If so, the geo-fencing technology can be used to divide the secondary area into several sub-areas, so that there is one and only one parking address in each sub-area, and the POI of the package to be delivered corresponding to the parking address is in the same sub-area. If the number of parking addresses in the secondary area is equal to the preset threshold, the secondary area is used as a sub-area. If the number of parking addresses in the secondary area is less than the preset threshold, the secondary area is used as a blank area. It can be understood that if there is no parking address in the secondary area, there is definitely no POI of the package to be delivered, so the secondary area is set as a blank area. It should be noted that the preset threshold is 1.

[0110] The route planning method provided in this embodiment determines whether the number of parking addresses in the secondary area exceeds a preset threshold; if so, the secondary area is divided into at least one sub-area so that each sub-area includes only one parking address; if the number of parking addresses in the secondary area is equal to the preset threshold, the secondary area is used as the sub-area; if the number of parking addresses in the secondary area is less than the preset threshold, the secondary area is used as a blank area, thereby improving the management efficiency of the secondary area on the basis of reducing the delivery time.

[0111] Figure 5 A flowchart of a route planning method provided in Embodiment 4 of the present invention is provided. Based on any of the above embodiments, Figure 5 As shown, the method includes:

[0112] Step 401, determining all current parking addresses according to historical parking addresses;

[0113] Step 402: According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0114] Step 403: taking the sum of the weight values ​​of all the packages to be delivered corresponding to the first parking address as the weight value corresponding to the first parking address;

[0115] Step 404: planning a delivery route according to the weight value corresponding to the first parking address and preset constraints.

[0116] In this embodiment, all current parking addresses are determined based on historical parking addresses, and after matching the parcels to be delivered to the first parking address that is closest to the delivery address of the parcels to be delivered based on the current delivery addresses of the parcels to be delivered, in order to distinguish the priorities of the first parking addresses, it is necessary to calculate the weight values ​​of the first parking addresses. Specifically, the weight values ​​of all the parcels to be delivered in the first parking address can be determined, and the sum of the weight values ​​of the parcels to be delivered is used as the weight value corresponding to the first parking address, and the delivery route is planned according to the weight values ​​corresponding to the first parking addresses and the preset constraints.

[0117] The route planning method provided in this embodiment can calculate the weight value of each first parking address by taking the sum of the weight values ​​of all the packages to be delivered corresponding to the first parking address as the weight value corresponding to the first parking address, thereby providing a basis for subsequent route planning based on priority delivery according to the weight value.

[0118] Further, based on any of the above embodiments, the method includes:

[0119] Determine all current parking addresses based on historical parking addresses;

[0120] According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0121] Calculating the weight value of the package to be delivered according to the package information corresponding to the package to be delivered by using a preset weight calculation formula;

[0122] For each of the first parking addresses, calculating a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0123] A delivery route is planned according to the weight value corresponding to the first parking address and preset constraints.

[0124] In this embodiment, all current parking addresses are determined based on historical parking addresses, and based on the current delivery addresses of each package to be delivered, the package to be delivered is matched to the first parking address that is closest to the delivery address of the package to be delivered. In order to distinguish the priority of each first parking address, it is necessary to calculate the weight value of each first parking address. Specifically, the weight value of the package to be delivered can be calculated according to the package information corresponding to the package to be delivered by a preset weight calculation formula. The package information corresponding to the package to be delivered includes factors such as the account level of the package, the urgency of the package, and the historical average delivery time of the account corresponding to the package.

[0125] The route planning method provided in this embodiment calculates the weight value of the package to be delivered according to the package information corresponding to the package to be delivered through a preset weight calculation formula, thereby realizing the calculation of the weight value of each package to be delivered, and providing a basis for subsequent route planning for priority delivery according to the weight value.

[0126] Figure 6 A flowchart of a route planning method provided in Embodiment 5 of the present invention is provided. Based on any of the above embodiments, Figure 6 As shown, the method includes:

[0127] Step 501, determining all current parking addresses according to historical parking addresses;

[0128] Step 502: According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0129] Step 503: for each of the first parking addresses, calculate a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0130] Step 504: Taking the first parking address as a starting point, determining a delivery order for the first parking address in descending order of weight values ​​corresponding to the first parking address;

[0131] Step 505: planning the delivery sequence of the first parking address in each sub-area according to the preset constraint conditions and operations research technology, so that the total driving length of the delivery route is less than a preset first length threshold, the driving length of the same route in the delivery route is less than a preset second length threshold, the next delivery sub-area is adjacent to the current delivery sub-area, and the delivery route can pass through all the sub-areas;

[0132] Step 506: Calculate the delivery route according to the delivery order of the first parking address in each sub-area by using the map navigation route technology.

[0133] In this embodiment, after determining the weight value of each first parking address, the delivery route planning can be performed according to the weight value and the preset constraint conditions. Among them, the preset constraint conditions are that the preset driving length cannot be exceeded (considering the cost and the fuel cost of the delivery vehicle); the length of driving the same road section does not exceed the preset value (avoiding repeated detours); the unit area of ​​the next delivery is adjacent to the current unit area or separated by a blank area (avoiding detours and long driving time on the road); passing through all unit areas (ensuring that all packages on the delivery vehicle can be delivered). Specifically, the first parking address closest to the distribution station is taken as the starting point, and the delivery order of the first parking address is determined in descending order according to the weight value corresponding to the first parking address, and the delivery order of the first parking address in each sub-area is planned according to the preset constraint conditions and operations research technology. The delivery route is calculated according to the delivery order of the first parking address in each sub-area through the map navigation route technology, and the delivery route is planned.

[0134] The route planning method provided in this embodiment determines the delivery order of the first parking address as the starting point according to the weight values ​​corresponding to the first parking address from large to small; plans the delivery order of the first parking address in each sub-area according to preset constraints and operations research technology, so that the total driving length of the delivery route is less than a preset first length threshold, the driving length of the same route in the delivery route is less than a preset second length threshold, the next delivery sub-area is adjacent to the current delivery sub-area, and the delivery route can pass through all the sub-areas; calculates the delivery route according to the delivery order of the first parking address in each sub-area through map navigation route technology, thereby realizing the planning of the delivery route based on the authority value, reducing the delivery time, improving the delivery efficiency and improving the user experience.

[0135] Figure 7 A flowchart of a route planning method provided in Embodiment 6 of the present invention is provided, based on any of the above embodiments. Figure 7 As shown, the method includes:

[0136] Step 601, determining all current parking addresses according to historical parking addresses;

[0137] Step 602: According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0138] Step 603: for each of the first parking addresses, calculate a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0139] Step 604: planning a delivery route according to the weight value corresponding to the first parking address and preset constraints;

[0140] Step 605: Push the delivery route to the electronic terminal of the delivery person, so that the delivery person can deliver the packages to be delivered according to the delivery route.

[0141] In this embodiment, after the delivery route is planned, the delivery route can be pushed to the electronic terminal of the delivery person, so that the delivery person can deliver the packages to be delivered according to the delivery route displayed on the electronic terminal.

[0142] The route planning method provided in this embodiment pushes the delivery route to the delivery person's electronic terminal so that the delivery person can deliver the packages to be delivered according to the delivery route, thereby reducing the delivery time, improving the delivery efficiency and improving the user experience.

[0143] Further, based on any of the above embodiments, the method includes:

[0144] Determine all current parking addresses based on historical parking addresses;

[0145] According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered;

[0146] For each of the first parking addresses, calculating a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0147] Planning a delivery route according to the weight value corresponding to the first parking address and preset constraints;

[0148] The delivery route and the address information of all the packages to be delivered are associated and uploaded to the server for storage, so that when the address information of the packages to be delivered received subsequently is consistent with the address information of the packages to be delivered currently, delivery is directly performed according to the delivery route corresponding to the address information of all the packages to be delivered currently.

[0149] In this embodiment, after the delivery route is planned, the delivery route can be uploaded to the database for storage. In the subsequent delivery process of the parcel to be delivered, the address information of the parcel to be delivered can be compared with the address information stored in the database. If the similarity with the address information corresponding to any delivery route stored in the database exceeds a preset threshold, the delivery route can be used for delivery. This can save costs and improve route planning efficiency.

[0150] The route planning method provided in this embodiment associates the delivery route and the address information of all the packages to be delivered and uploads them to the server for storage, so that when the address information of the packages to be delivered received later is consistent with the address information of the packages to be delivered, the packages are directly delivered according to the delivery route corresponding to the address information of all the packages to be delivered. This can save costs and improve route planning efficiency.

[0151] Figure 8 This is a schematic diagram of the structure of a route planning device provided in Embodiment 7 of the present invention, such as Figure 8 As shown, the device comprises:

[0152] A parking address determination module 71 is used to determine all current parking addresses based on historical parking addresses;

[0153] A matching module 72, configured to match the parcel to be delivered to a first parking address that is closest to the delivery address of the parcel to be delivered according to the delivery address of each parcel to be delivered;

[0154] A first weight calculation module 73, configured to calculate, for each of the first parking addresses, a weight value corresponding to the first parking address according to the weight value of the package to be delivered;

[0155] The planning module 74 is used to plan a delivery route according to the weight value corresponding to the first parking address and preset constraints.

[0156] The route planning device provided in this embodiment determines all current parking addresses based on historical parking addresses; matches the parcel to be delivered to the first parking address that is closest to the delivery address of the parcel to be delivered based on the current delivery address of each parcel to be delivered; calculates the weight value corresponding to each first parking address based on the weight value of the parcel to be delivered; and plans the delivery route based on the weight value corresponding to the first parking address and preset constraints. This can reduce the total delivery time of the parcel to be delivered, speed up the delivery efficiency, and deliver according to the weight value of the parcel to be delivered, so that the parcels to be delivered with higher priority can be delivered to the user as soon as possible, thereby improving the user experience.

[0157] Further, based on any of the above embodiments, the device further includes:

[0158] A historical delivery route acquisition module is used to acquire historical delivery routes within a preset first time threshold;

[0159] The historical parking address determination module is used to determine an address in the historical delivery route whose stay time exceeds a preset second time threshold as the historical parking address.

[0160] Further, based on any of the above embodiments, the module for determining the address to be parked includes:

[0161] A first judging unit, used to judge whether the distance between any two historical parking addresses is less than a preset threshold;

[0162] a merging unit, configured to merge the arbitrary two historical parking addresses to obtain at least one first parking address;

[0163] a second judgment unit, configured to judge, for each of the first parking addresses, whether a probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold;

[0164] A third judgment unit is used to judge whether the first parking address is located on a road with a specification of not less than two lanes in both directions;

[0165] The to-be-parked address determining unit is configured to, if not, use the first parking address as the to-be-parked address.

[0166] Further, based on any of the above embodiments, the module for determining the address to be parked further includes:

[0167] The first deleting unit is used for deleting the first parking address if no.

[0168] Further, based on any of the above embodiments, the module for determining the address to be parked further includes:

[0169] The second deleting unit is used for deleting the first parking address if no.

[0170] Further, based on any of the above embodiments, the merging unit is used for:

[0171] Any two historical parking addresses are merged, and one of the two historical parking addresses is randomly selected as the first parking address.

[0172] Further, based on any of the above embodiments, the matching module includes:

[0173] A virtual geographic boundary forming unit, used to form a virtual geographic boundary of the delivery coverage area of ​​the delivery vehicle on a map through geographic fencing technology;

[0174] A division unit, configured to use each road with a specification of not less than two-way four lanes in the delivery coverage area as a virtual fence, and divide the delivery coverage area into at least one secondary area according to each virtual fence;

[0175] The matching unit is used to match each of the packages to be delivered to a secondary area closest to the delivery address of the packages to be delivered according to the location information of the delivery address of the packages to be delivered on the map.

[0176] Further, based on any of the above embodiments, the matching module further includes:

[0177] A fourth determination unit is used to determine whether there is any secondary area that does not match the package to be delivered;

[0178] The third deleting unit is configured to delete the secondary area that is not matched with the package to be delivered.

[0179] Further, based on any of the above embodiments, the device further includes:

[0180] A judgment module, used to judge whether the number of first parking addresses in the secondary area exceeds a preset threshold;

[0181] a segmentation module, configured to segment the secondary area into at least one sub-area, so that each of the sub-areas includes only one first parking address;

[0182] a sub-area determination module, configured to use the secondary area as the sub-area if the number of first parking addresses in the secondary area is equal to a preset threshold;

[0183] The blank area determination module is used to treat the secondary area as a blank area if the number of the to-be-parked addresses in the secondary area is less than a preset threshold.

[0184] Further, based on any of the above embodiments, the device further includes:

[0185] The second weight calculation module is used to calculate the weight value of the package to be delivered according to the package information corresponding to the package to be delivered through a preset weight calculation formula.

[0186] Further, based on any of the above embodiments, the first weight calculation module includes:

[0187] A calculation unit is used to take the sum of the weight values ​​of all the packages to be delivered corresponding to the first parking address as the weight value corresponding to the first parking address.

[0188] Further, based on any of the above embodiments, the planning module includes:

[0189] A first order determining unit, configured to take the first parking address as a starting point and determine a delivery order of the first parking address in descending order of weight values ​​corresponding to the parking address;

[0190] A second sequence determination unit is used to plan the delivery sequence of the first to-be-parked addresses in each sub-area according to preset constraints and operations research techniques, so that the total driving length of the delivery route is less than a preset first length threshold, the driving length of the same route in the delivery route is less than a preset second length threshold, the next delivery sub-area is adjacent to the current delivery sub-area, and the delivery route can pass through all the sub-areas;

[0191] The planning unit is used to calculate the delivery route according to the delivery sequence of the parking addresses in each sub-area by using the map navigation route technology.

[0192] Further, based on any of the above embodiments, the device further includes:

[0193] The push module is used to push the delivery route to the electronic terminal of the delivery person, so that the delivery person can deliver the packages to be delivered according to the delivery route.

[0194] Further, based on any of the above embodiments, the device further includes:

[0195] The uploading module is used to associate the delivery route and the address information of all the packages to be delivered to the server for storage, so that when the address information of the packages to be delivered received subsequently is consistent with the address information of the packages to be delivered currently, the packages are directly delivered according to the delivery route corresponding to the address information of all the packages to be delivered currently.

[0196] Fig. 9 A schematic diagram of the structure of a route planning device provided in Embodiment 8 of the present invention is shown in FIG. Fig. 9 As shown, the device includes: a memory 81, a processor 82;

[0197] Memory 81; Memory 81 for storing instructions executable by the processor 82;

[0198] The processor 82 is configured to execute the route planning method as described in any of the above embodiments.

[0199] Yet another embodiment of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement the route planning method as described in any of the above embodiments.

[0200] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the device described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0201] Those skilled in the art can understand that all or part of the steps of implementing the above-mentioned method embodiments can be completed by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the steps of the above-mentioned method embodiments are executed; and the aforementioned storage medium includes: ROM, RAM, disk or optical disk and other media that can store program codes.

[0202] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A route planning method, characterized in that: include: Determine all current parking addresses based on historical parking addresses; According to the current delivery addresses of the packages to be delivered, the packages to be delivered are matched to the first parking address that is closest to the delivery address of the packages to be delivered; For each of the first parking addresses, calculating a weight value corresponding to the first parking address according to the weight value of the package to be delivered; Planning a delivery route according to the weight value corresponding to the first parking address and preset constraints; The planning of the delivery route according to the weight value corresponding to the first parking address and the preset constraint conditions includes: Taking the first parking address as the starting point, determining the delivery order of the first parking address according to the weight values ​​corresponding to the first parking address from large to small; According to the preset constraints and operations research techniques, the delivery sequence of the first parking address in each sub-area is planned, so that the total driving length of the delivery route is less than a preset first length threshold, the driving length of the same route in the delivery route is less than a preset second length threshold, the next delivery sub-area is adjacent to the current delivery sub-area, and the delivery route can pass through all the sub-areas; The delivery route is calculated according to the delivery order of the parking addresses in each sub-area by using the map navigation route technology.

2. The method according to claim 1, characterized in that Before determining all current parking addresses according to historical parking addresses, the following steps are included: Get the historical delivery routes within the preset first time threshold; An address in the historical delivery route whose stay time exceeds a preset second time threshold is determined as the historical parking address.

3. The method according to claim 2, characterized in that The method of determining all current parking addresses based on historical parking addresses includes: Determine whether the distance between any two historical parking addresses is less than a preset threshold; If so, any two historical parking addresses are merged to obtain at least one first parking address; For each first parking address, determining whether the probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold; If yes, determine whether the first parking address is located on a road with a specification of not less than two lanes in both directions; If not, the first parking address is used as the address to be parked.

4. The method according to claim 3, characterized in that After determining, for each first parking address, whether the probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold, the method further includes: If not, delete the first parking address.

5. The method according to claim 3, characterized in that: After determining whether the first parking address is located on a road with a specification of not less than two lanes in both directions, the method further includes: If not, delete the first parking address.

6. The method according to claim 3, characterized in that Merge any two historical parking addresses to obtain at least one first parking address, including: Any two historical parking addresses are merged, and one of the two historical parking addresses is randomly selected as the first parking address.

7. The method according to claim 1, characterized in that The method of matching the parcel to be delivered to a first parking address that is closest to the delivery address of the parcel to be delivered according to the current delivery address of each parcel to be delivered includes: Use geo-fencing technology to create a virtual geographic boundary on the map for the delivery vehicle’s delivery coverage area; Using each road with a specification of not less than two-way four lanes in the delivery coverage area as a virtual fence, and dividing the delivery coverage area into at least one secondary area according to each virtual fence; According to the location information of the delivery address of each package to be delivered on the map, each package to be delivered is matched to a secondary area that is closest to the delivery address of the package to be delivered.

8. The method according to claim 7, characterized in that After matching each package to be delivered to a secondary area closest to the delivery address of the package to be delivered according to the location information of the delivery address of each package to be delivered on the map, the method further includes: Determine whether there is any secondary area that does not match the package to be delivered; If so, the secondary area that does not match the package to be delivered is deleted.

9. The method according to claim 7, characterized in that: After matching the parcel to be delivered to the first parking address closest to the delivery address of the parcel to be delivered according to the current delivery address of each parcel to be delivered, the method further includes: Determining whether the number of first parking addresses in the secondary area exceeds a preset threshold; If yes, the secondary area is divided into at least one sub-area, so that each of the sub-areas includes only one first parking address; If the number of first parking addresses in the secondary area is equal to a preset threshold, the secondary area is used as the sub-area; If the number of the parking addresses in the secondary area is less than a preset threshold, the secondary area is regarded as a blank area.

10. The method according to claim 1, characterized in that Before calculating the weight value corresponding to each first parking address according to the weight value of the package to be delivered, the method further includes: The weight value of the package to be delivered is calculated according to the package information corresponding to the package to be delivered by a preset weight calculation formula.

11. The method according to claim 1 or 10, characterized in that: The step of calculating, for each of the first parking addresses, a weight value corresponding to the first parking address according to the weight value of the package to be delivered, includes: The sum of the weight values ​​of all the packages to be delivered corresponding to the first parking address is used as the weight value corresponding to the first parking address.

12. The method according to any one of claims 1 to 10, characterized in that: After planning the delivery route according to the weight value corresponding to the first parking address and the preset constraint conditions, the method further includes: The delivery route is pushed to the electronic terminal of the delivery person, so that the delivery person can deliver the packages to be delivered according to the delivery route.

13. The method according to any one of claims 1 to 10, characterized in that: After planning the delivery route according to the weight value corresponding to the first parking address and the preset constraint conditions, the method further includes: The delivery route and the address information of all the packages to be delivered are associated and uploaded to the server for storage, so that when the address information of the packages to be delivered received subsequently is consistent with the address information of the packages to be delivered currently, delivery is directly performed according to the delivery route corresponding to the address information of all the packages to be delivered currently.

14. A route planning device, characterized in that: include: A parking address determination module is used to determine all current parking addresses based on historical parking addresses; A matching module, configured to match the parcel to be delivered to a first parking address that is closest to the delivery address of the parcel to be delivered according to the delivery address of each parcel to be delivered; A first weight calculation module, configured to calculate, for each of the first parking addresses, a weight value corresponding to the first parking address according to the weight value of the package to be delivered; A planning module, used for planning a delivery route according to the weight value corresponding to the first parking address and preset constraints; The planning module includes: A first order determining unit, configured to take the first parking address as a starting point and determine a delivery order of the first parking address in descending order of weight values ​​corresponding to the parking address; A second sequence determination unit is used to plan the delivery sequence of the first to-be-parked addresses in each sub-area according to preset constraints and operations research techniques, so that the total driving length of the delivery route is less than a preset first length threshold, the driving length of the same route in the delivery route is less than a preset second length threshold, the next delivery sub-area is adjacent to the current delivery sub-area, and the delivery route can pass through all the sub-areas; The planning unit is used to calculate the delivery route according to the delivery sequence of the parking addresses in each sub-area by using the map navigation route technology.

15. The device according to claim 14, characterized in that The device also includes: A historical delivery route acquisition module is used to acquire historical delivery routes within a preset first time threshold; The historical parking address determination module is used to determine an address in the historical delivery route whose stay time exceeds a preset second time threshold as the historical parking address.

16. The device according to claim 15, characterized in that The parking address determination module includes: A first judging unit, used to judge whether the distance between any two historical parking addresses is less than a preset threshold; a merging unit, configured to merge the arbitrary two historical parking addresses to obtain at least one first parking address; a second judgment unit, configured to judge, for each of the first parking addresses, whether a probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold; A third judgment unit is used to judge whether the first parking address is located on a road with a specification of not less than two lanes in both directions; The to-be-parked address determining unit is configured to, if not, use the first parking address as the to-be-parked address.

17. The device according to claim 16, characterized in that The parking address determination module further includes: The first deleting unit is used to determine whether the probability of the first parking address appearing in the historical delivery route exceeds a preset probability threshold, and if not, delete the first parking address.

18. The device according to claim 16, characterized in that The module for determining the parking address to be parked further includes: The second deleting unit is used to determine whether the first parking address is located on a road with a specification not less than two lanes in both directions. If not, the first parking address is deleted.

19. The device according to claim 16, characterized in that Merging cells are used to: Any two historical parking addresses are merged, and one of the two historical parking addresses is randomly selected as the first parking address.

20. The device according to claim 14, characterized in that The matching module comprises: A virtual geographic boundary forming unit, used to form a virtual geographic boundary of the delivery coverage area of ​​the delivery vehicle on a map through geographic fencing technology; A division unit, configured to use each road with a specification of not less than two-way four lanes in the delivery coverage area as a virtual fence, and divide the delivery coverage area into at least one secondary area according to each virtual fence; The matching unit is used to match each of the packages to be delivered to a secondary area closest to the delivery address of the packages to be delivered according to the location information of the delivery address of the packages to be delivered on the map.

21. The device according to claim 20, characterized in that The matching module also includes: A fourth determination unit is used to determine whether there is any secondary area that does not match the package to be delivered; The third deleting unit is configured to delete the secondary area that is not matched with the package to be delivered.

22. The device according to claim 20, characterized in that The device also includes: A judgment module, used to judge whether the number of first parking addresses in the secondary area exceeds a preset threshold; a segmentation module, configured to segment the secondary area into at least one sub-area, so that each of the sub-areas includes only one first parking address; a sub-area determination module, configured to use the secondary area as the sub-area if the number of first parking addresses in the secondary area is equal to a preset threshold; The blank area determination module is used to treat the secondary area as a blank area if the number of the to-be-parked addresses in the secondary area is less than a preset threshold.

23. The device according to claim 14, characterized in that The device also includes: The second weight calculation module is used to calculate the weight value of the package to be delivered according to the package information corresponding to the package to be delivered through a preset weight calculation formula.

24. The device according to claim 14 or 23, characterized in that The first weight calculation module includes: A calculation unit is used to take the sum of the weight values ​​of all the packages to be delivered corresponding to the first parking address as the weight value corresponding to the first parking address.

25. The device according to any one of claims 14 to 23, characterized in that The device also includes: The push module is used to push the delivery route to the electronic terminal of the delivery person, so that the delivery person can deliver the packages to be delivered according to the delivery route.

26. The device according to any one of claims 15 to 23, characterized in that The device also includes: The uploading module is used to associate the delivery route and the address information of all the packages to be delivered to the server for storage, so that when the address information of the packages to be delivered received subsequently is consistent with the address information of the packages to be delivered currently, the packages are directly delivered according to the delivery route corresponding to the address information of all the packages to be delivered currently.

27. A route planning device, characterized in that: include: Memory, processor; Memory; a memory for storing instructions executable by the processor; The processor is configured to execute the route planning method as described in any one of claims 1-13.

28. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the route planning method according to any one of claims 1 to 13.

29. A computer program product, comprising a computer program, which, when executed by a processor, implements the route planning method according to any one of claims 1 to 13.

Images