CN113792900A - Distribution route generation method and device, computer storage medium and electronic device - Google Patents
Distribution route generation method and device, computer storage medium and electronic device Download PDFInfo
- Publication number
- CN113792900A CN113792900A CN202010537212.9A CN202010537212A CN113792900A CN 113792900 A CN113792900 A CN 113792900A CN 202010537212 A CN202010537212 A CN 202010537212A CN 113792900 A CN113792900 A CN 113792900A
- Authority
- CN
- China
- Prior art keywords
- delivery
- distribution
- route
- target
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 230000004044 response Effects 0.000 claims description 6
- 230000004931 aggregating effect Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 20
- 238000012545 processing Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 5
- 230000002159 abnormal effect Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Abstract
The disclosure relates to the technical field of logistics transportation, and provides a distribution route generation method, a distribution route generation device, a computer storage medium and an electronic device, wherein the distribution route generation method comprises the following steps: determining a parcel distribution sequence according to the distribution time requirements of a plurality of target parcels, and determining the parcel distribution sequence as a route sequence of a distribution destination corresponding to each target parcel; generating a plurality of distribution routes which take the current express collecting point as a starting point and pass through a plurality of distribution destinations according to a route sequence; selecting a route meeting preset conditions from the multiple distribution routes as a target distribution route; the preset condition includes one of the following: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold. The distribution time of the distribution vehicles can be shortened, the problems that distribution is time-consuming and labor-consuming and the efficiency is low due to the fact that a novice distributor is unfamiliar with the route are solved, and the distribution efficiency is guaranteed.
Description
Technical Field
The present disclosure relates to the field of logistics transportation technologies, and in particular, to a distribution route generation method, a distribution route generation apparatus, a computer storage medium, and an electronic device.
Background
With the rapid development of economy and the popularization of the internet, especially the rise of electronic commerce, the traditional consumption mode of people is changed, the demands of people are increased day by day, and the development of the express industry is driven. The development of the express industry shortens the distance between people and brings great convenience to the life of people. Among other things, the efficiency of delivering orders is a focus of concern.
At present, related packages are delivered mainly through delivery experiences of delivery personnel and manual telephone notification, so that for a novice delivery vehicle, due to unfamiliarity with a route environment, a delivery route cannot be reasonably planned, delivery is time-consuming and labor-consuming, and delivery difficulty is high.
In view of the above, there is a need in the art to develop a new method and apparatus for generating a distribution route.
It is to be noted that the information disclosed in the background section above is only used to enhance understanding of the background of the present disclosure.
Disclosure of Invention
The present disclosure is directed to a delivery route generation method, a delivery route generation apparatus, a computer storage medium, and an electronic device, so as to avoid, at least to some extent, the disadvantages of low intelligence and efficiency in the related art.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to a first aspect of the present disclosure, there is provided a delivery route generation method including: determining a parcel distribution sequence according to the distribution time requirements of a plurality of target parcels, and determining the parcel distribution sequence as a route sequence of a distribution destination corresponding to each target parcel; generating a plurality of distribution routes which take the current express collecting point as a starting point and pass through the plurality of distribution destinations according to the route sequence; selecting a route meeting preset conditions from the plurality of distribution routes as a target distribution route; the preset condition comprises one of the following conditions: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
In an exemplary embodiment of the present disclosure, the method further comprises: obtaining a plurality of delivery destinations corresponding to a plurality of target packages with the same package delivery sequence; determining whether the plurality of delivery destinations are within a preset range according to the geographical position information of each delivery destination; and classifying and aggregating delivery destinations within a preset range.
In an exemplary embodiment of the present disclosure, the method further comprises: determining a delivery destination of the first route as a delivery destination of the first route, wherein the delivery order of the packages is located at the head; determining the delivery destination of the package with the delivery sequence at the ith position as the delivery destination of the ith route; wherein i is a positive integer greater than 1; determining a delivery destination with the package delivery sequence at the last position as a delivery destination; and generating a plurality of distribution routes which take the current express collecting point as a starting point and sequentially pass through the distribution destination of the first route, the distribution destination … … of the ith route to the distribution destination according to the location-based service.
In an exemplary embodiment of the present disclosure, prior to determining a package delivery sequence based on delivery time requirements of a plurality of target packages, the method further comprises: determining a predicted number of parcels to be delivered at each time according to the load weight of a delivery vehicle and the average weight of a plurality of parcels to be delivered, as well as the volume of the delivery vehicle and the average volume of the plurality of parcels to be delivered; and when the parcel number estimated value is smaller than the total number of the parcels to be delivered, randomly selecting the target parcels from the parcels to be delivered according to the parcel number estimated value.
In an exemplary embodiment of the present disclosure, the determining a predicted number of parcels per delivery based on a weight of a delivery vehicle and an average weight of a plurality of parcels to be delivered, and a volume of the delivery vehicle and an average volume of the plurality of parcels to be delivered, comprises: determining a first parcel number estimated value of each distribution according to the load weight of the distribution vehicle and the average weight of a plurality of parcels to be distributed; determining a second parcel number estimate for each delivery based on the volume of the delivery vehicle and the average volume of the plurality of parcels to be delivered; and carrying out weighted average on the first parcel number estimated value and the second parcel number estimated value to obtain the parcel number estimated value of each distribution.
In an exemplary embodiment of the present disclosure, the method further comprises: acquiring the current real-time position of the delivery vehicle, and determining the distance between the current real-time position and the delivery destination of each target package; when the distance is smaller than a distance threshold value, sending pickup notification information to a pickup person of the target package; determining the pickup mode of each target package according to the feedback response information of the pickup person to the pickup notification information; and marking the pickup mode of each target parcel.
In an exemplary embodiment of the present disclosure, the method further comprises: acquiring road condition information of the target driving route; determining the running time of the distribution vehicle from the current real-time position to each distribution destination according to the road condition information and the distance; and when the travel time is less than a time threshold, sending a pickup notification message to a pickup of the target package.
According to a second aspect of the present disclosure, there is provided a delivery route generation apparatus including: the system comprises a first determining module, a second determining module and a sending module, wherein the first determining module is used for determining a package distribution sequence according to distribution time requirements of a plurality of target packages and determining the package distribution sequence as a route sequence of a distribution destination corresponding to each target package; the route generating module is used for generating a plurality of distribution routes which take the current express collecting point as a starting point and pass through the plurality of distribution destinations according to the route sequence; the route selection module is used for selecting a route meeting preset conditions from the plurality of distribution routes as a target distribution route; the preset condition comprises one of the following conditions: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
According to a third aspect of the present disclosure, there is provided a computer storage medium having stored thereon a computer program which, when executed by a processor, implements the delivery route generation method of the first aspect described above.
According to a fourth aspect of the present disclosure, there is provided an electronic device comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the delivery route generation method of the first aspect via execution of the executable instructions.
As can be seen from the foregoing technical solutions, the distribution route generation method, the distribution route generation apparatus, the computer storage medium, and the electronic device in the exemplary embodiments of the present disclosure have at least the following advantages and positive effects:
in the technical solutions provided by some embodiments of the present disclosure, a package distribution sequence is determined according to distribution time requirements of a plurality of target packages, and the package distribution sequence is determined as a route sequence of a distribution destination corresponding to each target package, so that packages with relatively tight time requirements can be preferentially distributed, and distribution delay is avoided. Furthermore, a plurality of distribution routes passing through the plurality of distribution destinations according to the route sequence by taking the current express collecting point as a starting point are generated, so that a plurality of distribution routes from the starting point to the end point can be determined, the technical problems that in the related technology, a new distributor can only carry out parcel distribution by depending on self experience, and the distribution is time-consuming and labor-consuming and low in efficiency due to the fact that the new distributor is unfamiliar with the routes are solved, and the distribution intelligent degree and the distribution efficiency are improved. On the other hand, selecting a route meeting a preset condition from the plurality of delivery routes as a target delivery route; the preset condition comprises one of the following conditions: the length of the distribution route is smaller than the length threshold, the running time of the distribution route is smaller than the time threshold, and the number of intersections of the distribution route is smaller than the number threshold, so that the optimal route meeting the distribution requirement can be automatically pushed for the distributor, and the distribution efficiency is further improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 illustrates a flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure;
FIG. 2 illustrates a sub-flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure;
FIG. 3 illustrates a sub-flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure;
FIG. 4 illustrates a sub-flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure;
FIG. 5 illustrates a sub-flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure;
FIG. 6 is a sub-flow diagram illustrating a delivery route generation method in an exemplary embodiment of the present disclosure;
FIG. 7 illustrates a sub-flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure;
fig. 8 is a schematic structural diagram of a delivery route generation apparatus in an exemplary embodiment of the present disclosure;
FIG. 9 shows a schematic diagram of a structure of a computer storage medium in an exemplary embodiment of the disclosure;
fig. 10 shows a schematic structural diagram of an electronic device in an exemplary embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.
The terms "a," "an," "the," and "said" are used in this specification to denote the presence of one or more elements/components/parts/etc.; the terms "comprising" and "having" are intended to be inclusive and mean that there may be additional elements/components/etc. other than the listed elements/components/etc.; the terms "first" and "second", etc. are used merely as labels, and are not limiting on the number of their objects.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
At present, related packages are delivered mainly through delivery experiences of delivery personnel and manual telephone notification, so that for novice delivery personnel, due to unfamiliarity with route environments, delivery routes cannot be reasonably planned, delivery consumes time and labor, and delivery difficulty is high.
In the embodiments of the present disclosure, a delivery route generation method is provided first, which overcomes, at least to some extent, the drawback of the low efficiency of the delivery route generation method provided in the prior art.
Fig. 1 is a flow chart illustrating a delivery route generation method according to an exemplary embodiment of the present disclosure, where an execution subject of the delivery route generation method may be a server that delivers a target package.
Referring to fig. 1, a delivery route generation method according to one embodiment of the present disclosure includes the steps of:
step S110, determining a parcel distribution sequence according to distribution time requirements of a plurality of target parcels, and determining the parcel distribution sequence as a route sequence of a distribution destination corresponding to each target parcel;
step S120, generating a plurality of distribution routes which take the current express collecting point as a starting point and pass through a plurality of distribution destinations according to a route sequence;
step S130, selecting a route meeting preset conditions from a plurality of delivery routes as a target delivery route; the preset condition includes one of the following: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
In the technical solution provided in the embodiment shown in fig. 1, on one hand, the delivery sequence of the packages is determined according to the delivery time requirements of a plurality of target packages, and the delivery sequence of the packages is determined as the route sequence of the delivery destination corresponding to each target package, so that packages with relatively tight time requirements can be delivered preferentially, and delivery delay is avoided. Furthermore, a plurality of distribution routes passing through a plurality of distribution destinations according to a passing sequence by taking a current express collecting point as a starting point are generated, so that the plurality of distribution routes from the starting point to the end point can be determined, the technical problems that in the related technology, a new distributor can only carry out parcel distribution by depending on self experience, the distribution is time-consuming and labor-consuming and the distribution efficiency is low due to the fact that the new distributor is unfamiliar with the routes are solved, and the distribution intelligent degree and the distribution efficiency are improved. On the other hand, selecting a route meeting preset conditions from the multiple distribution routes as a target distribution route; the preset condition includes one of the following: the length of the distribution route is smaller than the length threshold, the running time of the distribution route is smaller than the time threshold, and the number of intersections of the distribution route is smaller than the number threshold, so that the optimal route meeting the distribution requirement can be automatically pushed for the distributor, and the distribution efficiency is further improved.
The following describes the specific implementation of each step in fig. 1 in detail:
in an exemplary embodiment of the present disclosure, reference may be made to fig. 2, where fig. 2 shows a sub-flow diagram of a distribution route generation method in an exemplary embodiment of the present disclosure, and specifically shows a sub-flow diagram of determining a target package, which includes steps S201 to S202, and a specific implementation is explained below with reference to fig. 2.
In step S201, a predicted value of the number of parcels to be delivered at each time is determined according to the weight of the delivery vehicle and the average weight of the parcels to be delivered, and the volume of the delivery vehicle and the average volume of the parcels to be delivered.
For example, referring to fig. 3, fig. 3 shows a sub-flowchart of a distribution route generation method in an exemplary embodiment of the present disclosure, specifically, a sub-flowchart of determining a predicted value of the number of parcels to be distributed according to the weight of the distribution vehicle and the average weight of the parcels to be distributed, and the volume of the distribution vehicle and the average volume of the parcels to be distributed, including steps S301 to S303, and step S202 is explained below with reference to fig. 3.
In step S301, a first estimated number of parcels to be delivered per delivery is determined based on the weight of the delivery vehicle and the average weight of the plurality of parcels to be delivered.
For example, the total weight of the parcels to be delivered may be determined according to the weight of each parcel to be delivered, and then the average weight of the parcels to be delivered may be determined according to the ratio of the total weight of the parcels to be delivered to the total number of the parcels to be delivered. For example, the average weight of a plurality of packages to be dispensed (a1, a2, A3, a4, a5, B, C, D, E) may be 60 kg.
For example, when the delivery vehicle has a weight of 600kg, then determining the first predicted number of parcels delivered at each time may be: 600/60 is 10.
In step S302, a second estimated number of parcels per delivery is determined based on the volume of the delivery vehicle and the average volume of the plurality of parcels to be delivered.
For example, the volume of each parcel to be delivered may be determined according to the product of the length, the width and the height of each parcel to be delivered, and then the ratio of the total volume of the parcels to be delivered to the total number of the parcels to be delivered is determined as the average volume of the parcels to be delivered. Illustratively, the calculated average volume of the plurality of parcels to be dispensed may be 0.5 cubic meters.
For example, when the volume of the delivery vehicle is 2 cubic meters, then the second predicted number of packages per delivery may be: 2/0.5-4.
In step S303, the first estimated parcel number value and the second estimated parcel number value are weighted and averaged to obtain an estimated parcel number value for each delivery.
After the first and second predicted parcel number values are obtained, the first and second predicted parcel number values may be weighted averaged to obtain a predicted parcel number value for each delivery. For example, the estimated number of parcels per delivery may be: (10+ 4)/2-7.
Referring next to fig. 2, in step S202, when the estimated parcel number is smaller than the total number of the parcels to be delivered, a plurality of target parcels are randomly selected from the parcels to be delivered according to the estimated parcel number.
In an exemplary embodiment of the present disclosure, after obtaining the estimated number of parcels, when the estimated number of parcels is smaller than the total number of the parcels to be delivered, a plurality of target parcels may be randomly selected from the parcels to be delivered according to the estimated number of parcels. Referring to the above explanation of step S203, when the estimated number of parcels is 7 and the total number of parcels to be delivered is 9 (including parcels to be delivered a1, a2, A3, a4, a5, B, C, D, E), then, for example, the randomly determined target parcel may include: packages to be delivered A1, A2, A3, A4, A5, B, C. It should be noted that, if the estimated value of the number of packages is greater than or equal to the total number of the packages to be delivered, all the packages to be delivered may be delivered directly.
Referring next to fig. 1, in step S110, a package delivery order is determined according to delivery time requirements of a plurality of target packages, and the package delivery order is determined as a route order of delivery destinations corresponding to the target packages.
For example, the delivery time requirement of a plurality of target packages for each target package may be determined by the order information of each target package, wherein the delivery time requirement may be, for example: delivery within 12 hours, delivery within 2 days, delivery within 3 days, etc. Therefore, the packages with relatively tight time requirements can be preferentially distributed, and distribution delay is avoided.
The parcel delivery sequence of the destination parcel whose delivery time requirement is relatively urgent may be ranked first, and the parcel delivery sequence of the destination parcel whose delivery time requirement is relatively loose may be ranked later, for example, when the delivery time requirements of the destination parcels a1, a2, A3, a4 and a5 are: delivery is carried out within 12 hours; the delivery time requirements for target package B are: delivery is achieved within 2 days; the delivery time requirements for target package C are: when the delivery is reached within 3 days, the delivery sequence of the packages can be determined as follows: destination parcel a1, a2, A3, a4, a 5/destination parcel B/destination parcel C.
For example, after determining the delivery sequence of the packages, referring to fig. 4, fig. 4 shows a sub-flowchart of a delivery route generation method in an exemplary embodiment of the present disclosure, specifically shows a sub-flowchart of classifying and aggregating delivery destinations within a preset range, including steps S401 to S403, and the following is explained with reference to fig. 4.
In step S401, delivery destinations corresponding to a plurality of target packages having the same package delivery order are acquired.
After the distribution sequence of the packages is determined, distribution destinations corresponding to a plurality of target packages with the same distribution sequence of the packages can be obtained. Then, referring to the explanation related to step S110, the delivery destinations corresponding to the target packages a1, a2, A3, a4 and a5 may be obtained, for example, the delivery destination corresponding to the target package a1 may be d11, the delivery destination corresponding to the target package a2 may be d12, the delivery destination corresponding to the target package A3 may be d13, the delivery destination corresponding to the target package a4 may be d13, and the delivery destination corresponding to the target package a5 may be d 15.
In step S402, it is determined whether the plurality of delivery destinations are within a preset range according to the geographical location information of each delivery destination.
Further, it may be determined whether the plurality of delivery destinations are within a preset range according to geographical location information of each delivery destination. The geographical location information may be a longitude and latitude value of a delivery destination.
For example, whether any two delivery destinations are within the preset range may be determined according to whether the sum of the latitude and longitude differences between any two delivery destinations is less than the difference threshold. Specifically, the longitude and latitude of each target delivery area may be obtained, one of the delivery destinations may be selected as a reference destination, the longitude and latitude of the one of the delivery destinations may be used as a reference value, a difference between the longitude and latitude of the other delivery destinations and the reference value (i.e., a sum of a longitude difference and a latitude difference) is calculated, and when the difference is smaller than a difference threshold, the other delivery destinations and the reference destination may be determined to be within a preset range. For example, when the latitude and longitude of delivery destination d11 of target package a1 is: the east longitude 107.4 degrees, the north latitude 33.4 degrees, and the longitude and latitude of the delivery destination d12 of the target parcel A2 are as follows: the difference between the longitude and latitude of 107.3 degrees for the east longitude and 33.3 degrees for the north latitude is 0.2 degrees, and for example, when the difference is 0.3 degrees, it may be determined that the delivery destination d11 and the delivery destination d12 are within a preset range.
For example, it may be determined that the delivery destinations d11, d12, d13, d14, and d15 are within a preset range.
In step S403, the delivery addresses within the preset range are categorized and aggregated.
Further, the delivery destinations within the preset range may be classified and aggregated. For example, the delivery destinations d11, d12, d13, d14, and d15 may be grouped and aggregated to obtain the delivery destination d 1. Further, when the destination of delivery of the target package B is d2 and the destination of delivery of the target package C is d3, the plurality of delivery destinations finally obtained may include: d1, d2, and d 3. Therefore, the same position or the similar position can be marked as the same position, the packages of a plurality of delivery destinations within the preset range can be delivered at the same time, and the delivery efficiency is improved.
For example, after the delivery addresses within the preset range are classified and aggregated, the route sequence of the delivery destinations corresponding to the target packages may be determined according to the package delivery sequence. For example, the delivery destination whose package delivery order is the first route may be determined as the delivery destination of the first route, the delivery destination whose package delivery order is the ith (i is a positive integer greater than 1, and may be 2,3,4, etc.) may be determined as the delivery destination … … of the ith route, and the delivery destination whose package delivery order is the last route may be determined as the delivery destination of the last route, i.e., the delivery destination.
Referring next to fig. 1, in step S120, a plurality of delivery routes passing through a plurality of delivery destinations in route order are generated with the current express pickup point as a starting point.
Furthermore, a plurality of distribution routes from a current express acquisition point as a starting point to a first delivery destination, a second delivery destination … … to a delivery destination in sequence can be generated according to Location Based Service (LBS), so that the plurality of distribution routes from the starting point to the destination can be determined, the technical problems that in the related art, due to the fact that a novice distributor can only carry out package delivery by relying on self experience, the distribution is time-consuming and labor-consuming and low in efficiency due to the fact that the distributor is not familiar with the routes are solved, and the distribution intelligentization degree and the distribution efficiency are improved.
First, a distribution route from the current express pick-up point to the first delivery destination (d1) may be generated, and examples thereof may include a route L11 (the shortest route), a route L12 (the shortest route), and a route L13 (the route with the smallest number of traffic lights). Further, the delivery person can select one of the three routes to reach the delivery destination d1 according to actual needs.
Further, a delivery route from the delivery destination d1 to the delivery destination d2 of the second route may be generated with the delivery destination d1 as a starting point, and illustratively, the route may include a route L21 (a route having the shortest path length), a route L22 (a route having the shortest travel time), and a route L23 (a route having the smallest number of traffic lights). Further, the delivery person can select one of the three routes to reach the delivery destination d2 according to actual needs.
Similarly, a delivery route from the delivery destination d2 to the third delivery destination d3 may be generated, and illustratively, the delivery route may include a route L31 (the route with the shortest length), a route L32 (the route with the shortest travel time), and a route L33 (the route with the smallest number of traffic lights).
Further, for example, the distribution routes from the current package point to the distribution end point sequentially passing through the distribution destination of the first route and the distribution destination … … of the second route may include 3 × 3 — 27 routes (e.g., L11-L21-L31, L11-L22-L31 … … L13-L23-L33).
In step S130, a route satisfying a preset condition is selected from the plurality of delivery routes as a target delivery route; the preset condition includes one of the following: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
Further, for example, when the actual delivery demand of the delivery personnel is "the length of the delivery route is less than the length threshold (or the path length is shortest)", the delivery route "L11-L21-L31" may be determined as the target delivery route, and the target delivery route "L11-L21-L31" may be traveled to complete the package delivery. When the actual delivery demand of the delivery operator is "the travel time of the delivery route is less than the time threshold (or the travel time is shortest)", the delivery route "L12-L22-L32" may be determined as the target delivery route, and the delivery route "L12-L22-L32" may be traveled to complete the package delivery. When the actual delivery demand of the deliverer is that the number of intersections of the delivery route is smaller than the number threshold (or the number of traffic lights is minimum), the delivery route "L13-L23-L33" can be determined as the target delivery route, and the package delivery is completed by driving according to the target delivery route "L13-L23-L33", so that the optimal route meeting the delivery demand can be automatically pushed for the deliverer, and the delivery efficiency is further improved.
In an exemplary embodiment of the present disclosure, reference may be made to fig. 5, where fig. 5 illustrates a sub-flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure, and specifically illustrates a sub-flow diagram of determining a target delivery route, which includes steps S501 to S506, and a specific implementation is explained below with reference to fig. 5.
In step S501, a target parcel number estimated value for each delivery is determined according to the load weight of the delivery vehicle and the average weight of the plurality of target parcels, as well as the volume of the delivery vehicle and the average volume of the plurality of target parcels;
in step S502, when the estimated value of the number of parcels is smaller than the total number of the parcels to be delivered, randomly determining a plurality of target parcels from the parcels to be delivered;
in step S503, determining a parcel distribution order according to distribution time requirements of a plurality of target parcels of each target parcel;
in step S504, the distribution destinations in the same package distribution sequence and within the preset range are classified and aggregated;
in step S505, a route sequence of a plurality of delivery destinations corresponding to a plurality of target packages is determined according to a package delivery sequence, and a plurality of delivery routes passing through the plurality of delivery destinations in the route sequence are generated with a current express acquisition point as a starting point;
in step S506, a target distribution route is selected from the plurality of distribution routes.
After the target delivery route is determined, in the process of delivering the package by the delivery personnel, referring to fig. 6, fig. 6 shows a sub-flow diagram of a delivery route generation method in an exemplary embodiment of the present disclosure, specifically shows a sub-flow diagram of sending pickup notification information to a pickup of the target package, including steps S601-S604, and the following describes a specific implementation manner with reference to fig. 6.
In step S601, the current real-time position of the delivery vehicle is acquired, and the distance between the current real-time position and the delivery destination of each target package is determined.
In an exemplary embodiment of the disclosure, a current real-time position of the delivery vehicle may also be obtained through a GPS (global positioning System, GPS for short) or the like, and when a current target position of the delivery vehicle is the delivery destination d1 on the first route, a distance between the current real-time position and the delivery destination d1 on the first route may be calculated, and the distance may be 500 meters, for example.
In step S602, when the distance is smaller than the distance threshold, pickup notification information is sent to the pickup of the target package.
When the distance is smaller than the distance threshold value, pickup notification information can be sent to a pickup of the target package, wherein the pickup notification information can be a voice notification message. It should be noted that the pickup notification information may also be a short message notification message, a WeChat message, or the like, which may be set by the user according to the actual situation, and belongs to the protection scope of the present disclosure. Therefore, the system can inform each pickup person in advance, solves the problem that in the prior art, each pickup person is informed by a telephone only after a delivery person arrives at a delivery destination, so that delivery is time-consuming and labor-consuming, and ensures delivery efficiency.
For example, if the distance threshold is 800 meters, it may be determined that the distance is less than the distance threshold, and a pickup notification message may be sent to the pickup of the target package.
For example, the traffic information of the target distribution route may also be obtained in real time, where the traffic information refers to the condition of the road (e.g., road surface, traffic flow, etc.). Further, the travel time of the delivery vehicle from the current real-time position to the delivery destination may be determined according to the road condition information and the distance, and the determined travel time may be 3 minutes, for example. The time threshold may be 5 minutes, and if the time threshold is less than 5 minutes, a voice notification message may be sent to the pickup of the targeted package.
In step S603, the pickup manner of each target package is determined based on the feedback response information of the pickup person to the pickup notification information.
After the pickup notification message is sent to the pickup person, the pickup mode of each target package can be determined according to the feedback response information of the pickup person to the pickup notification message. For example, taking the pickup notification information as a voice notification message as an example, when the pickup of the target package a1 answers the voice notification message and the feedback response information is "pickup by oneself", it can be determined that the pickup manner of the target package a1 is: the self-taking method of the target parcel A2 comprises the following steps: temporarily putting a collection point, and taking the target package A3 in the following mode: abnormal conditions (not answered).
In step S604, the pickup mode of each target parcel is marked.
After the pickup mode of each target package is determined, the pickup mode can be returned to the distribution server, so that the distribution server marks the pickup mode. For example, the delivery server may mark the pickup of the target package a1 as follows: the self-taking method of the target parcel A2 comprises the following steps: temporarily putting a collection point, and taking the target package A3 in the following mode: abnormal conditions (not answered).
Therefore, after the delivery destination is reached, the delivery staff can only carry out manual telephone notification on the recipients of the target packages marked as 'no answer', and the delivery staff do not need to carry out one-by-one notification on the pickup persons of all the target packages, so that the technical problems that in the prior art, the pickup persons completely depend on the manual notification of the delivery staff to take the pickup persons, the time and the labor are wasted, the efficiency is low are solved, the delivery time of the delivery staff is saved, and the delivery intelligent degree and the delivery efficiency are improved.
In an exemplary embodiment of the present disclosure, referring to fig. 7, fig. 7 shows a sub-flow diagram of a distribution route generation method in an exemplary embodiment of the present disclosure, specifically shows a sub-flow diagram of determining a pickup manner of a pickup person, including steps S701 to S707, and the following explains a specific implementation manner with reference to fig. 7.
In step S701, the travel time of the delivery vehicle from the current position to the delivery destination is acquired;
in step S702, when the running time meets a preset time threshold, sending a voice notification message to a pickup of the target package;
in step S703, whether the pickup person answers the voice notification message is determined;
in step S704, if answer is received, the pickup mode (including "pickup by itself" and "temporarily put a collection point") is returned to the distribution system;
in step S705, if the answer is not received, the abnormal condition is returned to the distribution system;
in step S706, the delivery system marks the pickup mode;
in step S707, the delivery person performs package delivery processing according to the marking.
On one hand, the method can shorten the delivery time of delivery vehicles, greatly improve the delivery unit quantity and relieve the delivery pressure of the explosion unit in a large promotion period; furthermore, the problems that a delivery worker is unfamiliar with a route by a novice delivery worker, so that delivery is time-consuming, labor-consuming and low in efficiency can be solved, and delivery efficiency is guaranteed. On the other hand, the training period of the new-hand delivery personnel can be shortened, the delivery cost is reduced, the new-hand delivery personnel can adapt to the route as soon as possible, and the service quality and the customer satisfaction are improved.
The present disclosure also provides a delivery route generating apparatus, and fig. 8 is a schematic structural diagram of the delivery route generating apparatus in an exemplary embodiment of the present disclosure; as shown in fig. 8, the delivery route generation apparatus 800 may include a determination module 801, a route generation module 802, and a route selection module 803. Wherein:
the determining module 801 is configured to determine a delivery sequence of the packages according to the delivery time requirements of the plurality of target packages, and determine the delivery sequence of the packages as a route sequence of delivery destinations corresponding to the target packages.
In an exemplary embodiment of the disclosure, the determining module is configured to obtain a plurality of delivery destinations corresponding to a plurality of target packages having the same package delivery sequence; determining whether the plurality of distribution destinations are within a preset range according to the geographical position information of each distribution destination; and classifying and aggregating delivery destinations within a preset range.
In an exemplary embodiment of the present disclosure, the determining module is configured to determine a predicted number of parcels per delivery based on a weight of a delivery vehicle and an average weight of the plurality of parcels to be delivered, and a volume of the delivery vehicle and an average volume of the plurality of parcels to be delivered; and when the predicted value of the number of the parcels is smaller than the total number of the parcels to be delivered, randomly selecting a plurality of target parcels from the parcels to be delivered according to the predicted value of the number of the parcels.
In an exemplary embodiment of the disclosure, the determining module is configured to determine a first predicted number of parcels per delivery based on a weight of a delivery vehicle and an average weight of a plurality of parcels to be delivered; determining a second parcel number estimate for each delivery based on the volume of the delivery vehicle and the average volume of a plurality of parcels to be delivered; and carrying out weighted average on the first parcel number estimated value and the second parcel number estimated value to obtain a parcel number estimated value of each distribution.
The route generating module 802 is configured to generate a plurality of distribution routes that pass through a plurality of distribution destinations according to a route sequence with a current express pickup point as a starting point.
In an exemplary embodiment of the present disclosure, the route generation module is configured to determine a delivery destination at which the delivery order of the packages is first as a delivery destination of a first route; determining a delivery destination with the package delivery sequence positioned at the ith position as a delivery destination of the ith route; wherein i is a positive integer greater than 1; determining a delivery destination with the package delivery sequence at the last position as a delivery destination; according to the location-based service, a plurality of distribution routes are generated which sequentially pass through the distribution destination of the first route, the distribution destination … … of the ith route to the distribution destination, with the current package acquisition point as a starting point.
A route selecting module 803, configured to select a route that meets a preset condition from the multiple distribution routes as a target distribution route; the preset condition includes one of the following: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
In an exemplary embodiment of the present disclosure, the route selection module is configured to obtain a current real-time location of the delivery vehicle, and determine a distance between the current real-time location and a delivery destination of each target package; when the distance is smaller than the distance threshold value, sending pickup notification information to a pickup person of the target package; determining the pickup mode of each target package according to the feedback response information of the pickup person to the pickup notification information; and marking the pickup mode of each target package.
In an exemplary embodiment of the present disclosure, the route selection module is configured to obtain road condition information of a target driving route; determining the running time of the distribution vehicle from the current real-time position to each distribution destination according to the road condition information and the distance; and when the travel time is less than the time threshold, sending a pickup notification message to the pickup of the target package.
The specific details of each module in the distribution route generating device have been described in detail in the corresponding distribution route generating method, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-LOM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer storage medium capable of implementing the above method. On which a program product capable of implementing the above-described method of the present specification is stored. In some possible embodiments, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to perform the steps according to various exemplary embodiments of the disclosure described in the "exemplary methods" section above of this specification, when the program product is run on the terminal device.
Referring to fig. 9, a program product 900 for implementing the above method according to an embodiment of the present disclosure is described, which may employ a portable compact disc read only memory (CD-LOM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a random access memory (LAM), a read only memory (LOM), an erasable programmable read only memory (EPLOM or flash memory), an optical fiber, a portable compact disk read only memory (CD-LOM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, LF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 1000 according to this embodiment of the disclosure is described below with reference to fig. 10. The electronic device 1000 shown in fig. 10 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 10, the electronic device 1000 is embodied in the form of a general purpose computing device. The components of the electronic device 1000 may include, but are not limited to: the at least one processing unit 1010, the at least one memory unit 1020, a bus 1030 connecting different system components (including the memory unit 1020 and the processing unit 1010), and a display unit 1040.
Wherein the storage unit stores program code that is executable by the processing unit 1010 to cause the processing unit 1010 to perform steps according to various exemplary embodiments of the present disclosure described in the above section "exemplary methods" of the present specification. For example, the processing unit 1010 may perform the following as shown in fig. 1: step S110, determining a parcel distribution sequence according to distribution time requirements of a plurality of target parcels, and determining the parcel distribution sequence as a route sequence of a distribution destination corresponding to each target parcel; step S120, generating a plurality of distribution routes which take the current express collecting point as a starting point and pass through a plurality of distribution destinations according to a route sequence; selecting a route meeting preset conditions from the multiple distribution routes as a target distribution route; in step S130, the preset condition includes one of the following: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
The storage unit 1020 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)10201 and/or a cache memory unit 10202, and may further include a read-only memory unit (ROM) 10203.
The memory unit 1020 may also include a program/utility 10204 having a set (at least one) of program modules 10205, such program modules 10205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 1000 may also communicate with one or more external devices 1100 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 1000, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 1000 to communicate with one or more other computing devices. Such communication may occur through input/output (I/O) interfaces 1050. Also, the electronic device 1000 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 1060. As shown, the network adapter 1060 communicates with the other modules of the electronic device 1000 over the bus 1030. It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with the electronic device 1000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-LOM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Furthermore, the above-described figures are merely schematic illustrations of processes included in methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (10)
1. A delivery route generation method, comprising:
determining a parcel distribution sequence according to the distribution time requirements of a plurality of target parcels, and determining the parcel distribution sequence as a route sequence of a distribution destination corresponding to each target parcel;
generating a plurality of distribution routes which take the current express collecting point as a starting point and pass through the plurality of distribution destinations according to the route sequence;
selecting a route meeting preset conditions from the plurality of distribution routes as a target distribution route; the preset condition comprises one of the following conditions: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
2. The method of claim 1, further comprising:
obtaining a plurality of delivery destinations corresponding to a plurality of target packages with the same package delivery sequence;
determining whether the plurality of delivery destinations are within a preset range according to the geographical position information of each delivery destination;
and classifying and aggregating delivery destinations within a preset range.
3. The method of claim 1, further comprising:
determining a delivery destination of the first route as a delivery destination of the first route, wherein the delivery order of the packages is located at the head;
determining the delivery destination of the package with the delivery sequence at the ith position as the delivery destination of the ith route; wherein i is a positive integer greater than 1;
determining a delivery destination with the package delivery sequence at the last position as a delivery destination;
and generating a plurality of distribution routes which take the current express collecting point as a starting point and sequentially pass through the distribution destination of the first route, the distribution destination … … of the ith route to the distribution destination according to the location-based service.
4. The method of claim 1, wherein prior to determining a package delivery sequence based on delivery time requirements of a plurality of target packages, the method further comprises:
determining a predicted number of parcels to be delivered at each time according to the load weight of a delivery vehicle and the average weight of a plurality of parcels to be delivered, as well as the volume of the delivery vehicle and the average volume of the plurality of parcels to be delivered;
and when the parcel number estimated value is smaller than the total number of the parcels to be delivered, randomly selecting the target parcels from the parcels to be delivered according to the parcel number estimated value.
5. The method of claim 4, wherein determining a predicted number of parcels per delivery based on a weight of a delivery vehicle and an average weight of a plurality of parcels to be delivered, and a volume of the delivery vehicle and an average volume of the plurality of parcels to be delivered comprises:
determining a first parcel number estimated value of each distribution according to the load weight of the distribution vehicle and the average weight of a plurality of parcels to be distributed;
determining a second parcel number estimate for each delivery based on the volume of the delivery vehicle and the average volume of the plurality of parcels to be delivered;
and carrying out weighted average on the first parcel number estimated value and the second parcel number estimated value to obtain the parcel number estimated value of each distribution.
6. The method of claim 4, further comprising:
acquiring the current real-time position of the delivery vehicle, and determining the distance between the current real-time position and the delivery destination of each target package;
when the distance is smaller than a distance threshold value, sending pickup notification information to a pickup person of the target package;
determining the pickup mode of each target package according to the feedback response information of the pickup person to the pickup notification information;
and marking the pickup mode of each target parcel.
7. The method of claim 6, further comprising:
acquiring road condition information of the target driving route;
determining the running time of the distribution vehicle from the current real-time position to each distribution destination according to the road condition information and the distance;
and when the travel time is less than a time threshold, sending a pickup notification message to a pickup of the target package.
8. A delivery route generation device characterized by comprising:
the system comprises a first determining module, a second determining module and a sending module, wherein the first determining module is used for determining a package distribution sequence according to distribution time requirements of a plurality of target packages and determining the package distribution sequence as a route sequence of a distribution destination corresponding to each target package;
the route generating module is used for generating a plurality of distribution routes which take the current express collecting point as a starting point and pass through the plurality of distribution destinations according to the route sequence;
the route selection module is used for selecting a route meeting preset conditions from the plurality of distribution routes as a target distribution route; the preset condition comprises one of the following conditions: the length of the delivery route is less than a length threshold, the travel time of the delivery route is less than a time threshold, and the number of intersections of the delivery route is less than a number threshold.
9. A computer storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the delivery route generation method of any one of claims 1 to 7.
10. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the delivery route generation method of any of claims 1-7 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010537212.9A CN113792900A (en) | 2020-06-12 | 2020-06-12 | Distribution route generation method and device, computer storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010537212.9A CN113792900A (en) | 2020-06-12 | 2020-06-12 | Distribution route generation method and device, computer storage medium and electronic device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113792900A true CN113792900A (en) | 2021-12-14 |
Family
ID=79181198
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010537212.9A Pending CN113792900A (en) | 2020-06-12 | 2020-06-12 | Distribution route generation method and device, computer storage medium and electronic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113792900A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115641747A (en) * | 2022-12-23 | 2023-01-24 | 中电信数字城市科技有限公司 | Parking navigation method and system and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007008671A (en) * | 2005-06-30 | 2007-01-18 | Canon Marketing Japan Inc | Device and method for determining delivery order, program and recording medium |
| CN106779183A (en) * | 2016-11-29 | 2017-05-31 | 北京小度信息科技有限公司 | Order is assembled and send sequential program(me) method, route planning method and device |
| KR101797153B1 (en) * | 2017-03-24 | 2017-11-14 | 합동물류 (주) | System and method of client socianl network service notice based on parcel service delivery route and time of arrival |
| CN110163441A (en) * | 2019-05-24 | 2019-08-23 | 国网北京市电力公司 | The transmission method and device of order distribution route |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
-
2020
- 2020-06-12 CN CN202010537212.9A patent/CN113792900A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007008671A (en) * | 2005-06-30 | 2007-01-18 | Canon Marketing Japan Inc | Device and method for determining delivery order, program and recording medium |
| CN106779183A (en) * | 2016-11-29 | 2017-05-31 | 北京小度信息科技有限公司 | Order is assembled and send sequential program(me) method, route planning method and device |
| KR101797153B1 (en) * | 2017-03-24 | 2017-11-14 | 합동물류 (주) | System and method of client socianl network service notice based on parcel service delivery route and time of arrival |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
| CN110163441A (en) * | 2019-05-24 | 2019-08-23 | 国网北京市电力公司 | The transmission method and device of order distribution route |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115641747A (en) * | 2022-12-23 | 2023-01-24 | 中电信数字城市科技有限公司 | Parking navigation method and system and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10639995B2 (en) | Methods, circuits, devices, systems and associated computer executable code for driver decision support | |
| US10976170B2 (en) | Electric vehicle routing system | |
| CN107464018B (en) | Distribution path optimization method and device, computer equipment and storage medium | |
| US9945678B2 (en) | Navigation system with arrival time mechanism and method of operation thereof | |
| US10119826B2 (en) | System and method for accelerating route search | |
| JP6423520B2 (en) | System and method for managing service supply status | |
| CN101971181B (en) | For the method and system of dynamic self-adapting road network hierarchy and route selection | |
| US8392116B2 (en) | Navigation device and method for predicting the destination of a trip | |
| CN110031016B (en) | Route planning method and device, electronic equipment and storage medium | |
| JP5705494B2 (en) | In-vehicle navigation device and in-vehicle storage battery charge / discharge control method | |
| CN103218769A (en) | Taxi order allocation method | |
| US20180314998A1 (en) | Resource Allocation in a Network System | |
| CN103097862A (en) | Navigation system with traffic estimation mechanism and method of operation thereof | |
| CN101634570A (en) | GPS navigation system and navigation method used by same | |
| CN104596522B (en) | A kind of navigation remaining time acquisition methods and device | |
| CN101340461A (en) | Method for obtaining weather forecast information of designated region | |
| EP3556601A1 (en) | Vehicle routing | |
| CN102971646A (en) | Navigation system with route planning and method of operation thereof | |
| US20180216948A1 (en) | Route recommendation in map service | |
| CN113792900A (en) | Distribution route generation method and device, computer storage medium and electronic device | |
| CN111582527A (en) | Travel time estimation method and device, electronic equipment and storage medium | |
| Narkhede et al. | Bus tracking system based on location aware services | |
| CN101660916A (en) | Method and system for managing middle points | |
| CN103839424B (en) | A kind of taxi empty navigational system and method based on recruiting car expectation value | |
| CN113624245B (en) | Navigation method and device, computer storage medium and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |