CN115828127A

CN115828127A - Distribution information processing method and device

Info

Publication number: CN115828127A
Application number: CN202211588460.1A
Authority: CN
Inventors: 刘梦晗; 高大伟
Original assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2022-12-12
Filing date: 2022-12-12
Publication date: 2023-03-21

Abstract

The invention discloses a distribution information processing method and device, and relates to the technical field of intelligent logistics. One embodiment of the method comprises: determining a reference stop point of a distribution end from historical distribution information; clustering the reference stopping points to obtain a plurality of clustering center points; constructing an equidistant electronic fence containing the clustering central points based on each clustering central point; and enabling the distribution end to take the plurality of clustering center points as distribution stop points, and distributing orders in the equidistant electronic fence corresponding to the distribution stop points. According to the embodiment of the invention, the delivery stopping points and the corresponding equidistant electronic fences are determined for the delivery ends, so that the delivery path and the delivery range of a delivery worker are optimized, the delivery time is shortened, and the delivery efficiency is improved.

Description

Distribution information processing method and device

Technical Field

The invention relates to the technical field of intelligent logistics, in particular to a distribution information processing method and device.

Background

The logistics and distribution are used as important links of shopping in the electronic shopping mall and are directly related to the shopping user experience of people.

At present, aiming at the management of distribution information (including distribution personnel, logistics information and the like), an electronic fence is generally used for dividing a distribution range, and a method for constructing the electronic fence is usually to draw a circular or polygonal electronic fence according to the longitude and latitude of a plurality of points selected from the distribution range; the deliverers generally deliver in the electronic fence, and the deliverers randomly select the stop points in the delivery process, and the randomly selected stop points may cause the deliverers to take a long time to reach each target address, which causes a problem of low delivery efficiency.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for processing delivery information, which can determine a reference stop point of a delivery end from historical delivery information; clustering the reference stopping points to obtain a plurality of clustering center points; constructing an equidistant electronic fence containing the clustering central points based on each clustering central point; and enabling the distribution end to take the plurality of clustering center points as distribution stop points, and distributing orders in the equidistant electronic fence corresponding to the distribution stop points. According to the embodiment of the invention, the delivery stopping points and the corresponding equidistant electronic fences are determined for the delivery ends, so that the delivery path and the delivery range of a delivery worker are optimized, the delivery time is shortened, and the delivery efficiency is improved.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a delivery information processing method including: acquiring a plurality of track point information of a distribution end and the stay time of the track points from historical distribution information; determining the track point with the stay time exceeding the set duration as a reference stay point corresponding to the distribution end; clustering the reference stopping points to obtain a plurality of clustering center points; constructing equidistant electronic fences containing the clustering central points based on each clustering central point; correspondingly pushing the plurality of clustering center points and the equidistant electronic fences to the distribution end, so that the distribution end distributes orders in the equidistant electronic fences by taking the plurality of clustering center points as distribution stop points.

Optionally, the clustering the plurality of reference stop points includes: dividing the historical distribution information into a plurality of information sets according to distribution batches; for an information set comprising a plurality of reference stopping points, clustering the plurality of reference stopping points comprised by the information set is executed.

Optionally, the constructing an equidistant electronic fence including the cluster center point includes: for each of the cluster center points, performing: calculating the target radius required by constructing equidistant electronic fences by taking the cluster central point as a center; determining a plurality of vertexes required for constructing an equidistant electronic fence based on the target radius; and connecting adjacent vertexes to construct the equidistant electronic fence.

Optionally, the calculating calculates a target radius required for constructing equidistant electronic fences; the method comprises the following steps: calculating the distance between the cluster center point and other stop points in the information set to which the cluster center point belongs; and calculating the target radius required by constructing the equidistant electronic fence by using a set statistical strategy and the calculated distance between the cluster central point and other reference stop points.

Optionally, the determining a plurality of vertices required for constructing equidistant electronic fences based on the target radius comprises: based on the set geographic information data navigation, the clustering center point is taken as a starting point, the distance of the target radius is moved to different directions and then the reached position is taken as a plurality of vertexes required by constructing the equidistant electronic fence

Optionally, after the constructing the equidistant electronic fence including the cluster center point, the distribution information processing method further includes: evaluating the plurality of clustering center points according to a preset evaluation strategy and the plurality of equidistant electronic fences; selecting a delivery stop point from the plurality of cluster center points according to an evaluation result; correspondingly pushing a plurality of the cluster center points and equidistant electronic fences to the distribution end comprises the following steps: and correspondingly pushing the distribution stopping points and the corresponding equidistant electronic fences to the distribution end.

Optionally, the evaluation policy includes: counting the number of delivery addresses included by each equidistant electronic fence according to historical order delivery addresses included by the historical delivery information; calculating the ratio of the sum of the delivery address quantities included in the equidistant electronic fences to the total historical order number included in the historical delivery information; and comparing the ratio with a preset first evaluation threshold value to evaluate the plurality of clustering center points.

Optionally, the delivery information processing method further includes, in the evaluation policy included in the delivery information processing method: constructing a circumscribed rectangle corresponding to the minimum circle containing all the reference stop points; calculating the ratio of the sum of the areas of the equidistant electronic fences to the area of the circumscribed rectangle; and comparing the ratio with a preset second evaluation threshold value to evaluate the plurality of clustering center points.

In order to achieve the above object, according to a second aspect of an embodiment of the present invention, there is provided a delivery information processing apparatus including: the device comprises a stay point determining module, a clustering module and a target determining module; wherein the content of the first and second substances,

the system comprises a plurality of track point modules, a stop point determining module and a stop point judging module, wherein the stop point determining module is used for acquiring a plurality of track point information of a distribution end and stop time of the plurality of track points from historical distribution information; determining the track point with the stay time exceeding the set duration as a reference stay point corresponding to the distribution end;

the clustering module is used for clustering the reference stop points to obtain a plurality of clustering center points; constructing equidistant electronic fences containing the clustering central points based on each clustering central point;

and the target determining module is used for correspondingly pushing the plurality of clustering central points and the equidistant electronic fences to the distribution end, so that the distribution end distributes orders in the equidistant electronic fences by taking the plurality of clustering central points as distribution stop points.

Optionally, the delivery information processing apparatus is configured to cluster the plurality of reference stopping points, and includes: dividing the historical distribution information into a plurality of information sets according to distribution batches; for an information set comprising a plurality of reference stop points, clustering the plurality of reference stop points comprised by the information set is performed.

Optionally, the distribution information processing apparatus is configured to construct an equidistant electronic fence including the cluster center point, and includes: for each of the cluster center points, performing: calculating the target radius required by constructing equidistant electronic fences by taking the cluster central point as a center; determining a plurality of vertexes required for constructing an equidistant electronic fence based on the target radius; and connecting adjacent vertexes to construct the equidistant electronic fence.

Optionally, the distribution information processing device is configured to calculate a target radius required for constructing the equidistant electronic fence; the method comprises the following steps: calculating the distance between the cluster center point and other stop points in the information set to which the cluster center point belongs; and calculating the target radius required by constructing the equidistant electronic fence by using a set statistical strategy and the calculated distance between the cluster central point and other reference stop points.

Optionally, the distribution information processing apparatus is configured to determine a plurality of vertices required for constructing equidistant electronic fences based on the target radius, and includes: based on the set geographic information data navigation, the clustering center point is taken as a starting point, the distance of the target radius is moved to different directions and then the reached position is taken as a plurality of vertexes required by constructing the equidistant electronic fence

Optionally, the distribution information processing apparatus is configured to, after constructing the equidistant electronic fence including the cluster center point, further include: evaluating the plurality of clustering center points according to a preset evaluation strategy and the plurality of equidistant electronic fences; selecting a delivery stop point from the plurality of cluster center points according to an evaluation result; correspondingly pushing a plurality of the cluster center points and equidistant electronic fences to the distribution end comprises the following steps: and correspondingly pushing the distribution stopping points and the corresponding equidistant electronic fences to the distribution end.

Optionally, the delivery information processing apparatus is configured to execute the evaluation policy, and includes: counting the number of delivery addresses included by each equidistant electronic fence according to historical order delivery addresses included by the historical delivery information; calculating the ratio of the sum of the delivery address quantities included in the equidistant electronic fences to the total historical order number included in the historical delivery information; and comparing the ratio with a preset first evaluation threshold value to evaluate the plurality of clustering center points.

Optionally, the delivery information processing apparatus is configured to execute the evaluation policy, and further includes: constructing a circumscribed rectangle corresponding to the minimum circle containing all the reference stop points; calculating the ratio of the sum of the areas of the equidistant electronic fences to the area of the circumscribed rectangle; and comparing the ratio with a preset second evaluation threshold value to evaluate the plurality of clustering center points.

To achieve the above object, according to a third aspect of an embodiment of the present invention, there is provided a distribution information processing electronic device including: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method as in any one of the delivery information processing methods described above.

To achieve the above object, according to a fourth aspect of embodiments of the present invention, there is provided a computer-readable medium having a computer program stored thereon, characterized in that the program, when executed by a processor, implements the method as in any one of the above delivery information processing methods.

One embodiment of the above invention has the following advantages or benefits: the reference stopping point of the distribution end can be determined from the historical distribution information; clustering the reference stop points to obtain a plurality of clustering center points; constructing an equidistant electronic fence containing the clustering central points based on each clustering central point; and enabling the distribution end to take the plurality of clustering center points as distribution stop points, and distributing orders in the equidistant electronic fence corresponding to the distribution stop points. According to the embodiment of the invention, the delivery stopping points and the corresponding equidistant electronic fences are determined for the delivery ends, so that the delivery path and the delivery range of a delivery worker are optimized, the delivery time is shortened, and the delivery efficiency is improved.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

fig. 1 is a flowchart illustrating a distribution information processing method according to an embodiment of the present invention;

fig. 2 is a schematic flowchart of a distribution information processing method according to another embodiment of the present invention;

fig. 3 is a schematic structural diagram of a distributed information processing apparatus according to an embodiment of the present invention;

FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 5 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.

Detailed Description

Exemplary embodiments of the invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

It should be noted that, in the technical solution of the present disclosure, the acquisition, storage, application, and the like of the personal information of the related user all conform to the regulations of the relevant laws and regulations, and do not violate the common customs of the public order.

As shown in fig. 1, an embodiment of the present invention provides a method for processing delivery information, where the method may include the following steps:

step S101: acquiring a plurality of trace point information of a distribution end and the staying time of the trace points from historical distribution information; determining the track point with the stay time exceeding the set duration as a reference stay point corresponding to the distribution end;

specifically, the historical delivery information is order delivery information of a certain delivery person within a set time range (for example, three months in the past, one month in the past, and the like), each delivery person carries a corresponding delivery terminal, and the delivery terminals can manage the order information and receive and send data with the service terminal. The delivery end can be an application client end which runs in mobile terminal equipment carried by a deliverer.

In an embodiment of the present invention, the trace point data corresponding to the distribution end may be obtained by a positioning software toolkit included in the distribution end, where the trace point data includes, for example, longitude and latitude information of a plurality of points and time for passing or staying the trace point; it can be understood that the times of the plurality of track points can have a sequential order, and the track point information and the stay time of the plurality of track points are stored in the historical distribution information corresponding to the distribution end. The historical delivery information is associated with the delivery range of a delivery person (associated with a delivery end), and the delivery range can be a larger range, such as a region of a city; smaller ranges are also possible, for example: a range including several cells, several buildings; the present invention does not limit the delivery range to which the history delivery information belongs.

Furthermore, from the stay time of the track points obtained from the historical distribution information corresponding to the distribution ends, it can be understood that in the process of executing the distribution tasks, distributors usually stay at a plurality of positions according to the traffic conditions in the distribution process, the scenes of the distribution tasks and the like; the method comprises the steps that target stop points are recommended to distributors, so that reference stop points meeting algorithm conditions are screened out from a plurality of track points, and the reference stop points are track points with the stop time exceeding a set duration; for example: according to the distribution scene and the distribution experience, the set time is set to be 10 minutes, 15 minutes and the like, and the accuracy and the effectiveness of calculating and recommending the target stop point are improved by acquiring the reference stop point of which the stop time exceeds the set time.

Step S102: clustering the reference stop points to obtain a plurality of clustering center points; and constructing an equidistant electronic fence containing the clustering central points based on each clustering central point.

Specifically, the multiple reference stop points obtained from the historical distribution information are clustered, and the clustering algorithm used can be HDBSCAN, K-Means and the like. The embodiment of the invention clusters a plurality of reference stop point clusters based on a plurality of reference stop points through a clustering algorithm, and further clusters according to each reference stop point cluster to obtain a cluster center point of the cluster. It is understood that the cluster center point may be a data point generated after clustering, or a data point coinciding with an existing reference stop point.

Preferably, the clustering the plurality of reference stopping points includes: dividing the historical distribution information into a plurality of information sets according to distribution batches; for an information set comprising a plurality of reference stop points, clustering the plurality of reference stop points comprised by the information set is performed. The distribution batches may be divided by distribution frequency, distribution areas, and the like, where the distribution frequency is, for example, to execute distribution tasks at a fixed time multiple times within a day (for example, the distribution frequency is three batches early, middle, and late), or to execute distribution tasks for one or more fixed area ranges; according to the distribution batches, the historical distribution information is divided into a plurality of information sets, then the reference stop points contained in the information sets are clustered, and the association degree of the clustering result and the application scene is further improved.

Further, clustering is carried out based on the reference stopping points, one or more clustering central points can be obtained, and then the equidistant electronic fence containing the clustering central points is constructed based on each clustering central point. The equidistant electronic fence described in the embodiment of the invention takes a clustering center point as a starting point, positions reached by moving the same distance to a plurality of different directions as vertexes, and the equidistant electronic fence corresponding to the clustering center point is included based on connection of the vertexes. In the prior art, points in a distribution range are generally selected at will to construct a circular electronic fence, or a polygonal electronic fence is constructed according to peripheral points of the distribution range, and the range precision of the constructed electronic fence in the prior art is low, so that the requirement on high precision of distribution information processing cannot be met.

Further, a method for constructing equidistant electronic fences comprises the following steps: for each of the cluster center points, performing: calculating the target radius required by constructing equidistant electronic fences by taking the cluster central point as a center; determining a plurality of vertexes required for constructing an equidistant electronic fence based on the target radius; and connecting adjacent vertexes to construct the equidistant electronic fence. As can be understood, for the case of obtaining a plurality of clustering center points, equidistant electronic fences corresponding to each clustering center point are constructed based on each clustering center point, and usually, the target radiuses of different equidistant electronic fences are different; the target radius is used to determine the distance from the cluster center point to each vertex of the equidistant fence. Determining a plurality of vertexes required for constructing equidistant electronic fences based on the target radius; and connecting adjacent vertexes to construct the equidistant electronic fence.

Further, a method for calculating a radius of a target required for constructing equidistant electronic fences includes: calculating the distance between the cluster center point and other stop points in the information set to which the cluster center point belongs; and calculating the target radius required by constructing the equidistant electronic fence by using a set statistical strategy and the calculated distance between the cluster central point and other reference stop points. Specifically, for a certain cluster center point, during clustering, the certain cluster center point and other reference stop points are clustered into a data point cluster (i.e., an information set to which the cluster center point belongs), further, the distance between the cluster center point and each other stop point is calculated, statistics is performed according to the obtained distance values (i.e., calculation is performed by using a set statistical strategy), and a numerical value of the target radius is obtained according to the statistical result.

In the embodiment of the present invention, one embodiment of setting the statistical policy is: and (4) sorting the distances from the cluster center point to each other reference stop point from small to large, selecting the distance values corresponding to the three points in the 90% sorting order, and taking the mean value of Euclidean distances as the target radius. Another example of setting the statistical policy is: and (4) sorting the distances from the cluster center point to each other reference stop point from small to large, selecting all the distances of the first 85 percent, and taking the mean value of Euclidean distances as the target radius. Compared with the method that some data points are used as the vertexes of the electronic fence in the distribution range, the target radius from the cluster center point to the vertex in each cluster is calculated by setting a statistical strategy, the accuracy and the reasonability of determining the distribution range are improved, and the refinement degree of managing distribution information is improved.

Further, the method for determining each vertex of the equidistant electronic fence specifically comprises the following steps: the determining a plurality of vertexes required for constructing an equidistant electronic fence based on the target radius comprises: based on the set geographic information data navigation, taking the clustering center point as a starting point, moving the distance of the target radius to the reached position in different directions, and taking the reached position as a plurality of vertexes required for constructing the equidistant electronic fence; the geographic information data may be set as road network data, map data and the like corresponding to a distribution range of historical distribution information, so as to perform navigation based on the road network data or the map data, that is, navigation is performed from a cluster center point, and a position reached after moving to a certain direction by a distance of a target radius is used as a vertex, so that it can be understood that a route through which a distribution vehicle of a distributor can pass can be determined through the geographic information and the road network data in the moving direction; in one embodiment of the present invention, the number of vertices for equidistant electronic fences can be set in the range of [30, 120] to improve the accuracy of the equidistant electronic fences.

Step S103: correspondingly pushing the plurality of clustering center points and the equidistant electronic fences to the distribution end, so that the distribution end distributes orders in the equidistant electronic fences by taking the plurality of clustering center points as distribution stop points.

Specifically, the cluster center point and the equidistant electronic fence calculated based on steps S101 to S102 are pushed to the distribution end, that is, when the distribution end distributes the order in the equidistant electronic fence, the cluster center point is recommended to be used as a distribution stop point, so as to improve the distribution efficiency and reduce the time required for distribution.

As shown in fig. 2, another distribution information processing method according to an embodiment of the present invention may include the following steps:

step S201: acquiring a plurality of trace point information of a distribution end and the staying time of the trace points from historical distribution information; determining track points with the stay time exceeding a set duration as reference stay points corresponding to the distribution end;

specifically, regarding obtaining information of a plurality of track points at the distribution end, the specific description of screening out the reference stop point is consistent with the description of step S101, and is not described herein again.

Step S202: clustering the reference stopping points to obtain a plurality of clustering center points; and constructing an equidistant electronic fence containing the clustering central points based on each clustering central point.

Specifically, the description about calculating a plurality of cluster center points for the distribution terminal and constructing equidistant electronic fences based on the cluster center points is consistent with the description of step S102, and is not repeated here.

Step S203: evaluating the clustering center points according to a preset evaluation strategy and the equidistant electronic fences; selecting a distribution stop point from the plurality of cluster central points according to an evaluation result; and correspondingly pushing the distribution stopping points and the corresponding equidistant electronic fences to the distribution end.

Preferably, after a plurality of clustering center points are calculated for the distribution end, and the equidistant electronic fence is constructed based on the clustering center points, the effectiveness of the clustering center points obtained through calculation is evaluated before the clustering center points recommend distribution stop points, so that the accuracy of determining the distribution stop points is further improved, and the distribution efficiency is improved.

Specifically, after constructing the equidistant electronic fence containing the cluster center point, the method further comprises: evaluating the clustering center points according to a preset evaluation strategy and the equidistant electronic fences; selecting a delivery stop point from the plurality of cluster center points according to an evaluation result; correspondingly pushing a plurality of the cluster center points and equidistant electronic fences to the distribution end comprises the following steps: and correspondingly pushing the distribution stopping points and the corresponding equidistant electronic fences to the distribution end. For example: calculating to obtain 5 cluster central points, evaluating each cluster central point according to a preset evaluation strategy and the equidistant electronic fences, and obtaining 4 cluster central points which can be used as delivery stop points according to evaluation results; selecting a delivery stop point from a plurality of cluster center points; or according to the evaluation result, all the 5 cluster central points can be used as distribution stop points.

Embodiments of the invention provide three evaluation strategies:

the first evaluation strategy: counting the number of delivery addresses included by each equidistant electronic fence according to historical order delivery addresses included by the historical delivery information; calculating the ratio of the sum of the delivery address quantities included in the equidistant electronic fences to the total historical order number included in the historical delivery information; and comparing the ratio with a preset first evaluation threshold value to evaluate the plurality of clustering center points.

Specifically, the evaluation policy is to evaluate based on the order quantity, for example: calculating the total number of historical orders contained in the historical delivery information of the delivery end, and calculating the number of delivery addresses (namely the delivery addresses of the orders) falling into one or more equidistant electronic fences; for example, the number of the calculated and constructed equidistant electronic fences is 3, in an embodiment of the present invention, the sum of the numbers of the delivery addresses in each equidistant electronic fence may be calculated, and the ratio of the sum of the numbers of the delivery addresses to the total number of the historical orders is calculated, for example, the ratio of the sum of the numbers of the calculated delivery addresses in the equidistant electronic fence 1 to the total number of the historical orders is calculated to be 40%; comparing the ratio with a preset first evaluation threshold (for example, set to 35%), and determining that the cluster center point in the equidistant electronic fence 1 can be recommended as a delivery stop point if the ratio exceeds 35%; in another embodiment of the present invention, the sum of the number of delivery addresses in all equidistant electronic fences (e.g., denoted by m) can be calculated; the total number of historical orders is represented by n, for example; and calculating a ratio n/m, and determining that all cluster center points can be recommended as delivery stop points under the condition that the ratio n/m exceeds 90% on the assumption that a preset first evaluation threshold value is 90%. So that the distribution end distributes the orders in the equidistant electronic fence based on the distribution stopping point.

Second evaluation strategy: constructing a circumscribed rectangle corresponding to the minimum circle containing all the reference stop points; calculating the ratio of the sum of the areas of the equidistant electronic fences to the area of the circumscribed rectangle; and comparing the ratio with a preset second evaluation threshold value to evaluate the plurality of clustering center points.

Specifically, the evaluation strategy is based on the areas of equidistant electronic fences for evaluation, and the area of a circumscribed rectangle corresponding to the smallest circle containing all the reference stopping points is obtained first, and then the sum of the areas of a plurality of equidistant electronic fences determined by the embodiment of the invention is calculated; for example: determining 3 equidistant electronic fences, calculating the area of each equidistant electronic fence, further, calculating the sum of the areas of two of the equidistant electronic fences according to an application scene and the coincidence degree between the equidistant electronic fences, and also calculating the sum of the areas of all the equidistant electronic fences, taking the calculation of the sum of the areas of all the equidistant electronic fences as an example, for example: and calculating the sum of the areas of the equidistant electronic fences as x, and the area of the circumscribed rectangle corresponding to the smallest circle as y, then calculating the ratio of x/y, and determining that the cluster center point included in each equidistant electronic fence can be recommended as a delivery stop point when the ratio exceeds a second evaluation threshold (for example, 80%), so that the delivery end delivers orders in the equidistant electronic fences on the basis of the delivery stop point.

The third evaluation strategy: combining the first evaluation strategy and the second evaluation strategy. Specifically, in the case that the evaluation conditions of the first evaluation strategy are met and the evaluation conditions of the second evaluation strategy are met, the cluster center points are all recommended as the delivery stopping points when delivery tasks are executed in the range of the equidistant electronic fence, so that the delivery ends deliver orders in the equidistant electronic fence based on the delivery stopping points.

The first evaluation threshold and the second evaluation threshold may be set to different values according to the compared object and the application scene, and the specific values of the first evaluation threshold and the second evaluation threshold are not limited in the present invention.

As shown in fig. 3, an embodiment of the present invention provides a distribution information processing apparatus 300, including: a stay point determining module 301, a clustering module 302 and a target determining module 302; wherein the content of the first and second substances,

the stay point determining module 301 is configured to obtain information of multiple track points at the distribution end and stay time at the multiple track points from historical distribution information; determining the track point with the stay time exceeding the set duration as a reference stay point corresponding to the distribution end;

the clustering module 302 is configured to cluster the plurality of reference stop points to obtain a plurality of clustering center points; constructing equidistant electronic fences containing the clustering central points based on each clustering central point;

the target determining module 303 is configured to correspondingly push the plurality of cluster center points and the equidistant electronic fences to the distribution end, so that the distribution end distributes the orders in the equidistant electronic fences by using the plurality of cluster center points as distribution stop points.

An embodiment of the present invention further provides an electronic device for processing distribution information, including: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are enabled to realize the method provided by any one of the above embodiments.

The embodiment of the invention also provides a computer readable medium, on which a computer program is stored, and the program is executed by a processor to implement the distribution information processing method provided by any one of the above embodiments.

Fig. 4 illustrates an exemplary system architecture 400 to which the distributed information processing method or the distributed information processing apparatus of the embodiment of the present invention can be applied.

As shown in fig. 4, the system architecture 400 may include

terminal devices

401, 402, 403, a network 404, and a server 405. The network 404 serves as a medium for providing communication links between the

terminal devices

401, 402, 403 and the server 405. Network 404 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.

A user may use

terminal devices

401, 402, 403 to interact with a server 405 over a network 404 to receive or send messages or the like. The

terminal devices

401, 402, 403 may have various client applications installed thereon, such as an e-mall client application, a logistics application client, and the like.

The

terminal devices

401, 402, 403 may be various electronic devices having display screens and supporting various client applications, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 405 may be a server providing various services, such as a background management server providing support for client applications used by users with the

terminal devices

401, 402, 403. The background management server may process the received request for determining the delivery stop point for any delivery terminal, and push the calculated delivery stop point to the terminal device (which has a corresponding delivery terminal).

It should be noted that the distributed information processing method provided in the embodiment of the present invention is generally executed by the server 405, and accordingly, the distributed information processing apparatus is generally provided in the server 405.

It should be understood that the number of terminal devices, networks, and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for an implementation.

Referring now to FIG. 5, shown is a block diagram of a computer system 500 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.

The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 501.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer 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 of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer 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. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer 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 computer readable signal medium may also be any computer readable medium that is not a computer 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 computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules and/or units described in the embodiments of the present invention may be implemented by software, and may also be implemented by hardware. The described modules and/or units may also be provided in a processor, which may be described as: a processor includes a determine dwell point module, a cluster module, and a determine target module; the names of these modules do not form a limitation on the module itself in some cases, for example, a clustering module may also be described as a module that clusters a plurality of the reference stops to obtain a plurality of cluster center points.

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not assembled into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring a plurality of trace point information of a distribution end and the staying time of the trace points from historical distribution information; determining the track point with the stay time exceeding the set duration as a reference stay point corresponding to the distribution end; clustering the reference stop points to obtain a plurality of clustering center points; constructing equidistant electronic fences containing the clustering central points based on each clustering central point; correspondingly pushing the plurality of clustering center points and the equidistant electronic fences to the distribution end, so that the distribution end distributes orders in the equidistant electronic fences by taking the plurality of clustering center points as distribution stop points.

According to the embodiment of the invention, the reference stop point of the distribution end is determined from the historical distribution information; clustering the reference stop points to obtain a plurality of clustering center points; constructing an equidistant electronic fence containing the clustering central points based on each clustering central point; and enabling the distribution end to take the plurality of clustering center points as distribution stop points, and distributing orders in the equidistant electronic fence corresponding to the distribution stop points. According to the embodiment of the invention, the delivery stopping points and the corresponding equidistant electronic fences are determined for the delivery ends, so that the delivery path and the delivery range of a delivery worker are optimized, the delivery time is reduced, and the delivery efficiency is improved.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A distribution information processing method, comprising:

acquiring a plurality of trace point information of a distribution end and the staying time of the trace points from historical distribution information;

determining the track point with the stay time exceeding the set duration as a reference stay point corresponding to the distribution end;

clustering the reference stopping points to obtain a plurality of clustering center points; constructing equidistant electronic fences containing the clustering central points based on each clustering central point;

correspondingly pushing the plurality of clustering center points and the equidistant electronic fences to the distribution end, so that the distribution end distributes orders in the equidistant electronic fences by taking the plurality of clustering center points as distribution stop points.

2. The method of claim 1,

the clustering the plurality of reference stop points comprises:

dividing the historical distribution information into a plurality of information sets according to distribution batches;

for an information set comprising a plurality of reference stop points, clustering the plurality of reference stop points comprised by the information set is performed.

3. The method of claim 2,

the constructing of the equidistant electronic fence including the cluster center point comprises:

for each of the cluster center points, performing:

calculating the target radius required by constructing equidistant electronic fences by taking the cluster central point as a center;

determining a plurality of vertexes required for constructing an equidistant electronic fence based on the target radius; and connecting adjacent vertexes to construct the equidistant electronic fence.

4. The method of claim 3,

calculating the target radius required by constructing equidistant electronic fences; the method comprises the following steps:

calculating the distance between the cluster center point and other stop points in the information set to which the cluster center point belongs;

and calculating the target radius required by constructing the equidistant electronic fence by using a set statistical strategy and the calculated distance between the cluster central point and other reference stop points.

5. The method of claim 3,

the determining a plurality of vertices required for constructing equidistant electronic fences based on the target radius comprises:

and based on the set geographic information data navigation, taking the cluster central point as a starting point, moving the distance of the target radius to the reached position in different directions, and taking the reached position as a plurality of vertexes required for constructing the equidistant electronic fence.

6. The method of claim 1, further comprising, after constructing equidistant electronic fences containing the cluster center points:

evaluating the clustering center points according to a preset evaluation strategy and the equidistant electronic fences;

selecting a delivery stop point from the plurality of cluster center points according to an evaluation result;

correspondingly pushing a plurality of the cluster central points and equidistant electronic fences to the distribution end comprises the following steps:

and correspondingly pushing the distribution stopping points and the corresponding equidistant electronic fences to the distribution end.

7. The method of claim 6, wherein evaluating the policy comprises:

counting the number of delivery addresses included by each equidistant electronic fence according to historical order delivery addresses included by the historical delivery information;

calculating the ratio of the sum of the delivery address quantities included by the equidistant electronic fences to the historical delivery information-included historical order total quantity;

and comparing the ratio with a preset first evaluation threshold value to evaluate the plurality of clustering center points.

8. The method of claim 1 or 7, wherein the evaluating policy further comprises:

constructing a circumscribed rectangle corresponding to the minimum circle containing all the reference stopping points;

calculating the ratio of the sum of the areas of the equidistant electronic fences to the area of the circumscribed rectangle;

and comparing the ratio with a preset second evaluation threshold value to evaluate the plurality of clustering center points.

9. A distributed information processing apparatus, comprising: the device comprises a stay point determining module, a clustering module and a target determining module; wherein the content of the first and second substances,

10. An electronic device, comprising:

one or more processors;

a storage device to store one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.

11. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-8.