CN111782746A

CN111782746A - Distribution path planning method and device and electronic equipment

Info

Publication number: CN111782746A
Application number: CN202010596268.1A
Authority: CN
Inventors: 邹庆言; 孙芳媛; 吴金霖; 曹高立
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2020-06-28
Filing date: 2020-06-28
Publication date: 2020-10-16

Abstract

The application discloses a distribution path planning method and device and electronic equipment, and relates to the field of distribution path planning technology and cloud computing. The method comprises the following steps: acquiring address information associated with M distribution network points; the address information comprises position information of an information point POI matched with a distribution network point, and M is a positive integer greater than or equal to 2; address aggregation is carried out on a first distribution network point which takes the matched target POI in the M distribution network points as the same POI, so that N distribution areas are obtained; the first distribution network point determines a distribution network point matched with a target POI based on the position information of the matched POI, the target POI matched with the first distribution network point is a POI the distance between which and the first distribution network point is less than a preset threshold value, N is a positive integer greater than 1, and M is greater than or equal to N; and planning the distribution paths of the M distribution nodes based on the N distribution areas.

Description

Distribution path planning method and device and electronic equipment

Technical Field

The application relates to a logistics technology, in particular to the technical field of distribution path planning, and specifically relates to a distribution path planning method, a distribution path planning device and electronic equipment.

Background

At present, with the rapid development of the logistics express industry, the express business volume is larger and larger, and correspondingly, the number and scale of distribution network points are larger and larger, so that the distribution path planning is more and more important.

In an actual distribution process, in order to improve distribution efficiency, distribution nodes located closer to each other are generally distributed together, so that address aggregation needs to be performed on the distribution nodes before distribution to plan a distribution path.

In the related art, distance information between distribution network points is generally mainly considered when address aggregation is performed, and the distance information is greatly influenced by distribution density of the distribution network points and actual road information, so that the address aggregation effect is poor, and correspondingly, the distribution path planning effect is also poor.

Disclosure of Invention

The application provides a distribution path planning method and device and electronic equipment.

According to a first aspect, the present application provides a delivery path planning method, including:

acquiring address information associated with M distribution network points; the address information comprises position information of an information point POI matched with a distribution network point, and M is a positive integer greater than or equal to 2;

address aggregation is carried out on a first distribution network point which takes the matched target POI in the M distribution network points as the same POI, so as to obtain N distribution areas; the first distribution network point determines a distribution network point matched with a target POI based on the position information of the matched POI, the target POI matched with the first distribution network point is a POI the distance between which and the first distribution network point is less than a preset threshold value, N is a positive integer greater than 1, and M is greater than or equal to N;

and planning the distribution paths of the M distribution nodes based on the N distribution areas.

According to a second aspect, the present application provides a delivery path planning apparatus, comprising:

the acquisition module is used for acquiring address information associated with the M distribution network points; the address information comprises position information of an information point POI matched with a distribution network point, and M is a positive integer greater than or equal to 2;

the address aggregation module is used for carrying out address aggregation on a first distribution network point with the matched target POI in the M distribution network points as the same POI so as to obtain N distribution areas; the first distribution network point determines a distribution network point matched with a target POI based on the position information of the matched POI, the target POI matched with the first distribution network point is a POI the distance between which and the first distribution network point is less than a preset threshold value, N is a positive integer greater than 1, and M is greater than or equal to N;

and the path planning module is used for planning the distribution paths of the M distribution nodes based on the N distribution areas.

According to a third aspect, the present application provides an electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform any one of the methods of the first aspect.

According to a fourth aspect, the present application provides a non-transitory computer readable storage medium having stored thereon computer instructions for causing a computer to perform any of the methods of the first aspect.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:

fig. 1 is a schematic flow chart of a delivery path planning method according to a first embodiment of the present application;

FIG. 2 is a schematic diagram illustrating the effect of address aggregation on distribution network points based on matching target POI;

fig. 3 is a schematic diagram of a specific implementation flow of address aggregation for M distribution nodes;

FIG. 4 is a schematic diagram of a specific implementation flow for obtaining distances and times between distribution nodes;

fig. 5 is a schematic structural diagram of a delivery route planning apparatus according to a second embodiment of the present application;

fig. 6 is a block diagram of an electronic device for implementing a delivery route planning method according to an embodiment of the present application.

Detailed Description

The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. 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 present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

First embodiment

As shown in fig. 1, the present application provides a delivery path planning method, which includes the following steps:

step S101: acquiring address information associated with M distribution network points; the address information comprises position information of an information point POI matched with a distribution network point, and M is a positive integer greater than or equal to 2.

In the embodiment, the delivery path planning method relates to the field of cloud computing, in particular to the technical field of delivery path planning, and can be applied to electronic equipment, wherein the electronic equipment can be a server, and the server can be a cloud server.

The distribution network point may be a distribution express delivery point, or may be a point where express is collected for distribution, and is not specifically limited herein. The distribution network point may be a location where the user is located.

The M distribution nodes may be all distribution nodes in a distribution network, the distribution network may be a distribution whole network, or may be a distribution sub-network after the distribution whole network is partitioned, and this is not particularly limited. For example, the entire distribution network is a distribution network constructed based on a province, and after a province is distributed and partitioned, a plurality of distribution subnets may be obtained, and the distribution subnets may be distribution networks constructed based on a downtown area in the province. Of course, the range of the distribution network may be large or small, and the distribution network may be set according to actual situations, and is not specifically limited herein.

Each of the M distribution nodes may be associated with respective address Information, and the address Information may include address description Information of the distribution node, location Information of a Point of Information (POI) matched with the distribution node, and the like.

The address description information may include address attribution information, road information, and the like, and the address attribution information may include administrative division information. For example, the address description information is a certain city block of a certain province, wherein a certain city block of a certain province is administrative division information, and a certain street block is road information.

The distribution network point-matched POI refers to a landmark point relatively close to the matching network point, for example, a landmark point within 1 km from the matching network point may be included, the landmark point may be a cell, a mall, an amusement park, or the like, and the number of distribution network point-matched POIs may include at least one.

The manner of obtaining the address information associated with the M distribution nodes may be various, for example, longitude and latitude information of the M distribution nodes may be obtained, and then the inverse geocode interface is called to obtain the address information associated with the M distribution nodes. For another example, the distribution information reported by each distribution network point may be directly obtained, where the distribution information may include address information associated with each distribution network point.

Step S102, address aggregation is carried out on a first distribution network point with the matched target POI in the M distribution network points as the same POI, so that N distribution areas are obtained; the first distribution network point determines a distribution network point matched with a target POI based on the position information of the matched POI, the target POI matched with the first distribution network point is a POI the distance between which and the first distribution network point is smaller than a preset threshold value, N is a positive integer larger than 1, and M is larger than or equal to N.

Before step 102, the method may further include a determination process, which aims to determine whether the POI matched with each of the M distribution nodes includes a target POI, where the target POI matched with a distribution node refers to a POI whose distance from the distribution node is less than a preset threshold, and the preset threshold may be very small, for example, 0.1 meter.

Specifically, for each of the M distribution nodes, it may be determined whether the POI matched with the distribution node includes the target POI, that is, whether the distribution node hits the POI, based on the location information of the POI matched with the distribution node. Preferably, the distribution network point can be 0 away from the target POI, that is, the distribution network point is located within the range of the target POI.

More specifically, the location information of the POI may include longitude and latitude coordinate points of the POI, and the distances between the distribution network point and each matched POI may be respectively calculated based on the longitude and latitude coordinate points of the distribution network point and the longitude and latitude coordinate points of the matched POI, and if there is a distance smaller than a preset threshold in the calculated distances, it is indicated that the distribution network point hits the POI, that is, the distribution network point is located within a range of a target POI, for example, the distribution network point is located in a residential district or a commercial lot. The target POI is a POI of which the distance to a distribution network point is smaller than a preset threshold value.

For each distribution network point, after determining whether the distribution network point hits the POI, the distribution network point which hits the POI can be obtained, and these distribution network points can be referred to as first distribution network points. Accordingly, distribution sites that miss POIs may also be obtained, and these distribution sites may be referred to as second distribution sites.

The distribution nodes that hit the POI with the same UID may be address aggregated according to the Identification information of the target POI, such as a User Identification (UID), that is, the distribution nodes that hit the same POI are aggregated together to form a distribution area.

For example, there are 10 distribution nodes, and if there are 3 distribution nodes that hit the POI whose identification information is UID1 and 4 distribution nodes that hit the POI whose identification information is UID2, the distribution nodes that hit the POI whose identification information is UID1 are grouped together to form one distribution area, and the distribution nodes that hit the POI whose identification information is UID2 are grouped together to form another distribution area. And for those distribution network points which miss the POI, the distribution network points can be aggregated according to the distance information among the distribution network points, and finally N distribution areas are obtained.

Referring to fig. 2, fig. 2 is a schematic diagram illustrating the effect of address aggregation on distribution nodes based on matching target POIs, and as shown in fig. 2, it can be seen that distribution nodes hitting the same POI can all be aggregated together well.

Step S103, planning the distribution paths of the M distribution nodes based on the N distribution areas.

In step S103, the distribution route is planned mainly to solve a Vehicle Routing Problem (VRP), and when the VRP problem is handled, there are usually many requirements and limitations of other conditions, for example, the distribution network spread is large, the workload of drivers needs to be balanced for different distribution routes, and the distribution network responsible for each distribution driver needs to be aggregated as much as possible without crossing the distribution areas of others.

In this scenario, address aggregation for distribution nodes is usually the first step in solving the VRP problem to perform distribution path planning. The same driver is usually not scheduled for delivery for different delivery areas that are very far away, whereas the same driver is usually scheduled for delivery for different delivery areas that are not very far away.

After address aggregation, the road network interface may be called to respectively obtain the distances between two different distribution areas in the N distribution areas, for example, there are 5 distribution areas, which are the distribution area 1, the distribution area 2, the distribution area 3, the distribution area 4, and the distribution area 5, and the road network interface may be called to respectively obtain the distance between the distribution area 1 and the distribution area 2, the distance between the distribution area 2 and the distribution area 3, the distance between the distribution area 3 and the distribution area 4, and the like.

For the distances between different distribution points in the same distribution area and the distances between different distribution areas with longer distances, the simulation data can be used for replacing the distances, for example, the distances between the distribution areas 4 and 5 are longer, the simulation data can be used for replacing the distances, and a road network interface does not need to be called.

Therefore, after the addresses of the distribution network points are aggregated, the distribution efficiency can be improved, the execution time for solving the VRP algorithm is reduced, and the calling times of the road network interface are reduced.

Furthermore, the distribution paths of the M distribution nodes may be planned based on distance information and time information between two different distribution areas in the N distribution areas, where the time information refers to time required for distribution from one distribution area to another distribution area.

In order to make the distribution path planning more accurate and reasonable, distance information and time information between different distribution points in each distribution area can be calculated so as to simulate the distribution path of a driver in the distribution area. Then, the distribution paths of the M distribution nodes may be planned based on the distance information and the time information between two different distribution areas in the N distribution areas, and the distance information and the time information between different distribution nodes in each of the N distribution areas.

In this embodiment, address aggregation is performed on the first distribution network point where the target POI matched with the M distribution network points is the same POI, so as to obtain N distribution areas, and thus, when address aggregation is performed, whether different distribution network points are located in the same POI can be considered, and distribution network points located in the same POI are aggregated. Therefore, the distribution density of the distribution network points and the influence of actual road information can be avoided, the address aggregation effect can be improved, and the distribution route planning effect can be improved. The embodiment solves the problem that the distribution path planning effect is poor due to the poor address aggregation effect in the prior art.

Optionally, step S101 specifically includes:

acquiring longitude and latitude information of M distribution network points;

and calling an inverse geocoding interface to obtain address information associated with the M distribution network points based on the latitude and longitude information.

In this embodiment, when the user only provides the longitude and latitude information of the distribution network and cannot acquire the chinese address information of the distribution network, the address aggregation needs to be performed on the distribution network based on the longitude and latitude information provided by the user.

However, the current service for address aggregation mainly performs address aggregation for chinese address information provided by users. And if the distance information between distribution network points is based on, the distribution density of the distribution network points and the actual road information have a great influence.

Therefore, in this embodiment, all the distribution network points are traversed by obtaining the longitude and latitude information of the M distribution network points, and for each distribution network point, the inverse geocode interfaces are requested one by one based on the longitude and latitude information of the distribution network point, so as to obtain the address information associated with the distribution network point.

Therefore, the method can also carry out address aggregation on the M distribution network points under the scene that the Chinese address information of the distribution network points cannot be obtained, and meanwhile, the method can also take into account whether different distribution network points are positioned in the same POI and aggregate the distribution network points positioned in the same POI. Therefore, the distribution density of the distribution network points and the influence of actual road information can be avoided, the address aggregation effect can be improved, and the distribution route planning effect can be improved.

Optionally, step S102 specifically includes:

performing first address aggregation on a first distribution network point with the matched target POI in the M distribution network points as the same POI to obtain at least one distribution area;

under the condition that the M distribution nodes comprise at least two second distribution nodes, performing second address aggregation on the at least two second distribution nodes based on first distance information between the at least two second distribution nodes to obtain at least one distribution area; the second distribution network point determines a distribution network point which is not matched with the target POI based on the position information of the matched POI;

the N distribution areas comprise distribution areas obtained by first address aggregation and distribution areas obtained by second address aggregation.

In this embodiment, the first distribution information may be address aggregated based on the identification information of the target POI matched by the first distribution node. Specifically, at least one delivery area may be generated by aggregating first delivery nodes that hit the same POI, that is, target POIs matching the same UID, where identification information of the target POIs matching different delivery nodes aggregated in each delivery area is the same, and identification information of the target POIs corresponding to different delivery areas is different, for example, identification information of the target POI corresponding to delivery area 1 is UID1, and identification information of the target POI corresponding to delivery area 2 is UID 2.

Under the condition that each delivery network point of the M delivery network points hits the POI, the M delivery network points can be directly aggregated according to a first address aggregation mode, wherein the first address aggregation mode refers to that the delivery network points hit the same POI, namely the target POI matched with the same UID, are aggregated together according to the identification information of the target POI.

And when there is a distribution network point which misses the POI in the M distribution network points, that is, the M distribution network points include the second distribution network point, address aggregation needs to be performed on the second distribution network point according to a second address aggregation manner, where the second address aggregation manner refers to address aggregation performed on at least two second distribution network points based on the first distance information between the at least two second distribution network points.

Specifically, address aggregation is performed on at least two second distribution nodes according to the distance threshold, for example, with one second distribution node as a central point, the second distribution nodes within a circle range of 200 meters from the central point may be aggregated into one distribution area.

Referring to fig. 3, fig. 3 is a schematic diagram of a specific implementation process of address aggregation for M distribution nodes, and as shown in fig. 3, the specific implementation process is as follows:

step S301, acquiring longitude and latitude information of a distribution network point;

step S302, traversing longitude and latitude coordinates of the current distribution network point;

step S303, based on longitude and latitude coordinates of the current distribution network point, calling an inverse geocode interface to acquire position information of the POI matched with the distribution network point and road information of the distribution network point;

step S304, judging whether the distribution network points hit the POI or not; if yes, go to step S305; if not, go to step 306;

step S305, establishing a mapping relation between the target POI and a distribution network point according to the UID of the target POI;

step S306, placing the missed delivery network points in another set, such as a noUIDList set;

step S307, judging whether all distribution nodes request reverse geocode interfaces; if yes, go to step S308; if not, jumping to step S302;

step S308, address aggregation is carried out on distribution network points which map the same target POI based on the mapping relation between the target POI and the distribution network points;

step S309, traversing the nouillist set, and performing address aggregation on distribution network points in the nouillist set according to a distance threshold;

step S310, judging whether the distribution network points which are not aggregated in the nouillist set are 0 or not; if yes, go to step S311; if not, jumping to step S309;

step S311, saving the address aggregation result, and ending the address aggregation process.

In the embodiment, two address aggregation modes are adopted to perform address aggregation on the M distribution network points, so that whether different distribution network points are located in the same POI or not can be considered, the distribution network points located in the same POI are aggregated, the address aggregation effect can be improved, and the distribution route planning effect is improved.

Optionally, the address information associated with each of the M distribution network points includes address attribution information of the distribution network point;

performing second address aggregation on at least two second distribution mesh points based on first distance information between the at least two second distribution mesh points, including:

and performing second address aggregation on the second distribution nodes with the same address attribution information based on the first distance information between at least two second distribution nodes.

Each driver usually has its own distribution range, and the distribution network points of different administrative districts are usually distributed by different drivers, so that the address attribution information of the distribution network points needs to be considered when address aggregation is carried out, and the distribution network points of different administrative districts are prevented from being aggregated together.

Specifically, according to the first distance information of the second distribution network points, some second distribution network points with the same address attribution information, the distance between which is smaller than a preset threshold value, are aggregated together.

In this embodiment, when address aggregation is performed on the second distribution network points, whether the second distribution network points aggregated together are the same administrative district is considered, so that the aggregation of the distribution network points in different administrative districts is avoided, the address aggregation effect can be further improved, and the distribution path planning effect can be further improved.

Optionally, step S103 specifically includes:

acquiring second distance information and third distance information;

planning distribution paths of the M distribution nodes based on the second distance information and the third distance information;

the second distance information comprises the distance between a first central distribution network point and a second central distribution network point, the first central distribution network point and the second central distribution network point are respectively target distribution network points of two different distribution areas in the N distribution areas, and the target distribution network points are the distribution network points which are closest to the central point in the distribution areas;

the third distance information includes manhattan distances of two different distribution nodes in each of the N distribution areas.

In this embodiment, when solving the VRP problem, distance information and time information between different distribution nodes need to be acquired to perform path planning on the distribution nodes.

Specifically, the distances between two distribution nodes in different distribution areas may be replaced by the distances between a first central distribution node and a second central distribution node, where the first central distribution node and the second central distribution node are respectively the distribution nodes closest to the respective central points in the two different distribution areas. And the distance between two different distribution points respectively for the interior of the distribution area can be replaced by a manhattan distance.

In addition, the distance between two distribution network points in different distribution areas with relatively close distances can be obtained by calling a road network interface, and specifically, the distance between a first central distribution network point and a second central distribution network point is obtained by calling the road network interface. And the distance between two distribution points in different distribution areas with relatively far distances can be replaced by the manhattan distance between the first central distribution point and the second central distribution point.

In order to ensure that the straight-line distance threshold can be calculated quickly, the distance between two distribution nodes in different distribution areas exceeding the straight-line distance threshold does not need to call a road network interface for obtaining, and the distance can be replaced by the Manhattan distance. And judging whether the number of the distribution areas exceeds a specified threshold value, if so, randomly sampling and extracting the distribution areas with the specified threshold value number. And using these delivery areas, a linear distance threshold is calculated. The linear distance threshold represents that, if the distance between two distribution areas exceeds the linear distance threshold, the distance between the two distribution areas is relatively far.

In addition, time information among different distribution nodes can be acquired, and distribution paths of the M distribution nodes are planned based on the distance information and the time information.

Referring to fig. 4, fig. 4 is a schematic diagram of a specific implementation process for acquiring distances and times between distribution nodes, and as shown in fig. 4, the specific implementation process is as follows:

step S401, calculating a central distribution network point of each distribution area;

step S402, judging whether the distribution area is larger than a specified threshold value; if yes, go to step S403; if not, go to step S404;

step S403, randomly extracting a specified threshold number of distribution areas;

step S404, calculating a linear distance threshold;

step S405, traversing the internal distribution network point pairs in each distribution area, and calculating the Manhattan distance and the first time between the distribution network point pairs one by one; wherein the first time is the manhattan distance between the internal distribution network point pairs in the distribution area/the minimum moving speed of the driver;

step S406, traversing the central distribution network point pairs in different distribution areas to obtain the positions of the central distribution network point pairs;

step S407, judging whether the linear distance of the center distribution network point pair exceeds a linear distance threshold value; if not, go to step S408; if yes, go to step S409;

step 408, calling a road network interface to obtain the distance and time between the central distribution network point pairs;

step 409, calculating the Manhattan distance and the second time between the central distribution network point pairs; the second time is the Manhattan distance between the central distribution network point pairs in different distribution areas/the maximum moving speed of the driver;

step S410, judging whether distance and time calculation among all central distribution network point pairs is finished; if yes, go to step S411; if not, jumping to step S406;

in step S411, the distance between two distribution nodes in different distribution areas is replaced with the distance between the central distribution node pair.

In the embodiment, the distance information between the internal distribution network point pairs in the distribution area is calculated, so that the distribution path of a driver in the distribution area can be simulated, and the distribution path planning is more accurate and reasonable.

It should be noted that, the distribution route planning method in the present application may be implemented in combination with each other or separately, and the present application is not limited thereto.

Second embodiment

As shown in fig. 5, the present application provides a delivery route planning apparatus 500, including:

an obtaining module 501, configured to obtain address information associated with M distribution nodes; the address information comprises position information of an information point POI matched with a distribution network point, and M is a positive integer greater than or equal to 2;

an address aggregation module 502, configured to perform address aggregation on a first distribution network point where a target POI matched in the M distribution network points is the same POI, to obtain N distribution areas; the first distribution network point determines a distribution network point matched with a target POI based on the position information of the matched POI, the target POI matched with the first distribution network point is a POI the distance between which and the first distribution network point is less than a preset threshold value, N is a positive integer greater than 1, and M is greater than or equal to N;

a path planning module 503, configured to plan distribution paths of the M distribution nodes based on the N distribution areas.

Optionally, the obtaining module 501 includes:

the system comprises a first acquisition unit, a second acquisition unit and a control unit, wherein the first acquisition unit is used for acquiring longitude and latitude information of M distribution network points;

and the calling unit is used for calling the inverse geocoding interface to obtain the address information associated with the M distribution network points based on the latitude and longitude information.

Optionally, the address aggregation module 502 includes:

the first address aggregation unit is used for carrying out first address aggregation on first distribution nodes of which the matched target POI is the same POI in the M distribution nodes to obtain at least one distribution area;

a second address aggregation unit, configured to, when the M distribution nodes include at least two second distribution nodes, perform second address aggregation on the at least two second distribution nodes based on first distance information between the at least two second distribution nodes, to obtain at least one distribution area; the second distribution network point determines a distribution network point which is not matched with the target POI based on the position information of the matched POI;

and the second address aggregation unit is specifically used for performing second address aggregation on the second distribution nodes having the same address attribution information based on the first distance information between at least two second distribution nodes.

Optionally, the path planning module 503 includes:

a second acquisition unit configured to acquire second distance information and third distance information;

the path planning unit is used for planning the distribution paths of the M distribution nodes based on the second distance information and the third distance information;

The distribution path planning apparatus 500 provided by the present application can implement each process implemented by the above distribution path planning method embodiment, and can achieve the same beneficial effects, and for avoiding repetition, the details are not repeated here.

According to an embodiment of the present application, an electronic device and a computer-readable storage medium are also provided.

Fig. 6 is a block diagram of an electronic device according to a delivery route planning method according to an embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present application that are described and/or claimed herein.

As shown in fig. 6, the electronic apparatus includes: one or more processors 601, memory 602, and interfaces for connecting the various components, including a high-speed interface and a low-speed interface. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input/output apparatus (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). In fig. 6, one processor 601 is taken as an example.

The memory 602 is a non-transitory computer readable storage medium as provided herein. The memory stores instructions executable by the at least one processor to cause the at least one processor to perform the delivery route planning method provided by the present application. The non-transitory computer-readable storage medium of the present application stores computer instructions for causing a computer to perform the delivery path planning method provided by the present application.

The memory 602, as a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the delivery route planning method in the embodiment of the present application (for example, the obtaining module 501, the address aggregation module 502, and the route planning module 503 shown in fig. 5). The processor 601 executes various functional applications and data processing of the distribution path planning apparatus by running non-transitory software programs, instructions and modules stored in the memory 602, so as to implement the distribution path planning method in the above method embodiment.

The memory 602 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the electronic device of the delivery path planning method, and the like. Further, the memory 602 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory 602 may optionally include memory located remotely from the processor 601, and these remote memories may be connected to the electronic devices of the delivery path planning method via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The electronic device of the delivery path planning method may further include: an input device 603 and an output device 604. The processor 601, the memory 602, the input device 603 and the output device 604 may be connected by a bus or other means, and fig. 6 illustrates the connection by a bus as an example.

The input device 603 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic equipment of the delivery path planning method, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointer, one or more mouse buttons, a track ball, a joystick, or other input devices. The output devices 604 may include a display device, auxiliary lighting devices (e.g., LEDs), and tactile feedback devices (e.g., vibrating motors), among others. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device can be a touch screen.

Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.

The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

In this embodiment, address aggregation is performed on the first distribution network point where the target POI matched with the M distribution network points is the same POI, so as to obtain N distribution areas, and thus, when address aggregation is performed, whether different distribution network points are located in the same POI can be considered, and distribution network points located in the same POI are aggregated. Therefore, the distribution density of the distribution network points and the influence of actual road information can be avoided, the address aggregation effect can be improved, and the distribution route planning effect can be improved. Therefore, the technical means can well solve the problem that the distribution route planning effect is poor due to the poor address aggregation effect in the prior art.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.

The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A delivery path planning method, characterized in that the method comprises:

address aggregation is carried out on a first distribution network point which takes the matched target POI in the M distribution network points as the same POI, so that N distribution areas are obtained; the first distribution network point determines a distribution network point matched with a target POI based on the position information of the matched POI, the target POI matched with the first distribution network point is a POI the distance between which and the first distribution network point is less than a preset threshold value, N is a positive integer greater than 1, and M is greater than or equal to N;

2. The method of claim 1, wherein the obtaining address information associated with the M distribution nodes comprises:

acquiring longitude and latitude information of the M distribution network points;

3. The method according to claim 1, wherein the address aggregation of a first distribution network point of the M distribution network points where the matching target POI is the same POI to obtain N distribution areas comprises:

when the M distribution nodes comprise at least two second distribution nodes, performing second address aggregation on the at least two second distribution nodes based on first distance information between the at least two second distribution nodes to obtain at least one distribution area; the second distribution network point determines a distribution network point which is not matched with a target POI based on the position information of the matched POI;

4. The method as claimed in claim 3, wherein the address information associated with each of the M distribution sites comprises address attribution information of the distribution site;

the second address aggregation of the at least two second distribution mesh points based on the first distance information between the at least two second distribution mesh points comprises:

and performing second address aggregation on the second distribution nodes with the same address attribution information based on the first distance information between the at least two second distribution nodes.

5. The method of claim 1, wherein planning the delivery paths of the M delivery nodes based on the N delivery areas comprises:

acquiring second distance information and third distance information;

the second distance information includes distances between a first central distribution network point and a second central distribution network point, the first central distribution network point and the second central distribution network point are respectively target distribution network points of two different distribution areas in the N distribution areas, and the target distribution network points are distribution network points closest to a central point in the distribution areas;

6. A delivery path planning apparatus, comprising:

the address aggregation module is used for carrying out address aggregation on a first distribution network point with the matched target POI as the same POI in the M distribution network points so as to obtain N distribution areas; the first distribution network point determines a distribution network point matched with a target POI based on the position information of the matched POI, the target POI matched with the first distribution network point is a POI the distance between which and the first distribution network point is less than a preset threshold value, N is a positive integer greater than 1, and M is greater than or equal to N;

7. The apparatus of claim 6, wherein the obtaining module comprises:

the first acquisition unit is used for acquiring longitude and latitude information of the M distribution network points;

and the calling unit is used for calling an inverse geocoding interface to obtain the address information associated with the M distribution network points based on the latitude and longitude information.

8. The apparatus of claim 6, wherein the address aggregation module comprises:

a second address aggregation unit, configured to, when the M distribution nodes include at least two second distribution nodes, perform second address aggregation on the at least two second distribution nodes based on first distance information between the at least two second distribution nodes, to obtain at least one distribution area; the second distribution network point determines a distribution network point which is not matched with a target POI based on the position information of the matched POI;

9. The apparatus according to claim 8, wherein the address information associated with each of the M distribution sites comprises address attribution information of the distribution site;

the second address aggregation unit is specifically configured to perform second address aggregation on the second distribution nodes having the same address affiliation information based on the first distance information between the at least two second distribution nodes.

10. The apparatus of claim 6, wherein the path planning module comprises:

a path planning unit, configured to plan a distribution path of the M distribution nodes based on the second distance information and the third distance information;

11. An electronic device, comprising:

at least one processor; and

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 5.

12. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 5.