WO2016172974A1

WO2016172974A1 - Service processing method and device

Info

Publication number: WO2016172974A1
Application number: PCT/CN2015/078132
Authority: WO
Inventors: 勾军委; 陈龙
Original assignee: 华为技术有限公司
Priority date: 2015-04-30
Filing date: 2015-04-30
Publication date: 2016-11-03
Also published as: CN107533688A; CN107533688B

Abstract

The present invention relates to the field of communications. Provided are a service processing method and device, capable of generating a path according to a destination node. The method comprises: a device acquires geographic coordinates of an initial start node; the device acquires geographic coordinates of N destination nodes; the device generates, according to the geographic coordinates of the initial start node and N geographic coordinates of the N destination nodes, a planning route; and the device makes, according to a current position and destination nodes in the planning route, a customer notification policy.

Description

Business processing method and device

Technical field

The present invention relates to the field of communications, and in particular, to a service processing method and device.

Background technique

With the rapid development and fierce competition of e-commerce, how to quickly deliver goods to users has become the core competitiveness of the company. Usually, the courier needs to sort out the delivery order according to the delivery address on the receipt of the goods, and deliver the goods one by one to the user.

The above process requires the courier to take time to complete, and the delivery order sorted by the courier may lead to an increase in the delivery distance of the courier, resulting in an increase in delivery time. In addition, if the courier is not sure of the time required to reach the destination point, the customer is notified in advance, causing the customer to wait too long at the destination point.

Summary of the invention

Embodiments of the present invention provide a service processing method and device, which can save time according to a destination node generating a path and a policy for notifying a client.

In order to achieve the above object, embodiments of the present invention adopt the following technical solutions:

In a first aspect, a service processing method is disclosed, the method comprising:

The device acquires the geographic coordinates of the initial departure node;

The device acquires geographic coordinates of N destination nodes; the N is an integer greater than or equal to 2;

The device generates a planned route according to the geographic coordinates of the initial departure node and the N geographic coordinates of the N destination nodes;

The device formulates a policy for notifying the client according to the current location and the destination node in the planned route.

In conjunction with the first aspect, in a first possible implementation of the first aspect,

The first set includes the initial starting node, and the second set includes the N destination nodes, and the generating the planned route according to the geographic coordinates of the initial starting node and the N geographic coordinates specifically includes:

Using the initial departure node as a current departure node;

A destination node K having the shortest distance from the current departure node in the second set is selected, and a sub-path whose starting point is the current departure node and whose destination is the destination node K is generated.

In conjunction with the first aspect, in a second possible implementation of the first aspect,

After the generating starting point is the current starting node and the ending point is the sub-path of the destination node K, the method further includes:

Updating the current departure node to the destination node K, obtaining N sub-paths, and generating the planning path according to the N sub-paths.

In conjunction with the first aspect, in a third possible implementation of the first aspect,

If the length of the first path is smaller than the length of the first planned path, updating the first planned path to the first path;

The first planned path is a planned path from the initial starting node to the first node, and the first path is a path from the initial starting node to the first node except the first plan A path outside the path, the first node being any destination node in the planned route.

In conjunction with the first aspect, in a fourth possible implementation of the first aspect,

Before the obtaining the geographic coordinates of the N destination nodes, the method further includes:

Receiving, by the device, order information input by a user, where the order information includes a receiving address of the customer;

The device determines the N destination nodes based on at least one of the customer's shipping addresses.

In conjunction with the first aspect, in a fifth possible implementation of the first aspect,

The device formulating a policy for notifying the client according to the current location and the destination node in the planned route includes:

The device determines a current location and determines a next destination node according to the current location; the next destination node is one of the N destination nodes included in the planned route, the user does not arrive, and is closest to the current location of the user. Destination node

The device formulates a policy for notifying the client according to the distance between the current location and the next destination node.

In conjunction with the first aspect, in a sixth possible implementation of the first aspect,

The determining, by the device, the policy for notifying the client according to the distance between the current location and the next destination node includes:

The device determines the geographic coordinates of the current location, the geographic coordinates of the next destination node, and obtains the number of clients U in the next destination node;

The device calculates a distance Y between the current node and the next destination node according to the geographic coordinates of the current location and the geographic coordinates of the next destination node; and calculates a required distance to reach the next destination node. Time T1, T1=Y/v; calculating the time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, the v The speed of travel for the user;

If the T1 is less than the T2, the device notifies the client in the next destination node.

In conjunction with the first aspect, in a seventh possible implementation of the first aspect,

The formula for informing the client according to the distance between the current location and the next destination node specifically includes:

The device calculates a distance Y between the current node and the next destination node according to the geographic coordinates of the current location and the geographic coordinates of the next destination node; and calculates a required distance to reach the next destination node. Time T1, T1=Y/v; calculating the time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, the v The travel speed of the user;

If the T1 is greater than or equal to the T2, the device notifies the client in the next node after a preset duration; the preset duration is T1-T2;

In conjunction with the first aspect, in an eighth possible implementation of the first aspect,

Before the device acquires the geographic coordinates of the N destination nodes, the method further includes:

Determining a number of customers corresponding to each of the N destination nodes;

Determining the order of the N destination nodes in descending order of the number of clients, and generating the planning path according to the order of the N destination nodes.

In conjunction with the first aspect, in a ninth possible implementation of the first aspect,

The method also includes determining the quantity of the customer's goods,

Then, the device formulates a policy for notifying the client according to the current location and the destination node in the planned route, including:

The order of the customers is determined in descending order of the quantity of the goods of the customer, and the customer is notified according to the order of the customers.

In a second aspect, an apparatus is disclosed, comprising:

An obtaining unit, configured to acquire geographic coordinates of an initial starting node;

The acquiring unit is further configured to acquire geographic coordinates of the N destination nodes; the N is an integer greater than or equal to 2;

a generating unit, configured to generate a planned route according to geographic coordinates of the initial departure node and N geographic coordinates of the N destination nodes;

The policy making unit is configured to formulate a policy for notifying the client according to the current location and the destination node in the planned route.

In conjunction with the second aspect, in a first possible implementation of the second aspect,

The first set includes the initial departure node, and the second set includes the N destination nodes,

The generating unit is specifically configured to use the initial starting node as a current starting node:

In conjunction with the second aspect, in a second possible implementation of the second aspect,

The generating unit is further configured to: after generating a sub-path whose starting point is the current starting node and the end point is the destination node K, update the current starting node to the destination node K, and obtain N sub-paths, according to the The N subpaths generate the planned path.

In conjunction with the second aspect, in a third possible implementation of the second aspect,

In conjunction with the second aspect, in a fourth possible implementation of the second aspect,

Also includes a receiving unit,

The receiving unit is configured to receive, after acquiring geographic coordinates of the N destination nodes, order information input by the user, where the order information includes a receipt address of all customers;

The obtaining unit is further configured to determine the N destination nodes according to the at least one receiving address of the client.

In conjunction with the second aspect, in a fifth possible implementation of the second aspect,

The policy making unit is configured to determine a current location and determine a next destination node according to the current location; the next destination node is one of the N destination nodes included in the planned route, the user does not arrive, and the user The current location is the closest destination node;

A policy for notifying the client is formulated according to the distance between the current location and the next destination node.

In conjunction with the second aspect, in a sixth possible implementation of the second aspect,

The device further includes a notification unit, and the policy making unit is specifically configured to:

Determining the geographic coordinates of the current location, the geographic coordinates of the next destination node; acquiring the number of clients U in the next destination node;

Obtaining a distance Y between the current node and the next destination node according to the geographic coordinates of the current location, geographic coordinates of the next destination node, and calculating a time T1 required to reach the next destination node , T1=Y/v; calculating a time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, and the v is the user's Speed of travel

If the T1 is smaller than the T2, the notification unit notifies the client in the next destination node.

In conjunction with the second aspect, in a seventh possible implementation of the second aspect,

Obtaining a distance Y between the current node and the next destination node according to the geographic coordinates of the current location, geographic coordinates of the next destination node, and calculating a time T1 required to reach the next destination node , T1=Y/v; calculating a time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, the v is the The speed of the user's travel;

If the T1 is greater than or equal to the T2, the notification unit notifies the client in the next node after a preset duration; the preset duration is T1-T2;

In conjunction with the second aspect, in an eighth possible implementation of the second aspect,

The obtaining unit is further configured to determine, before acquiring geographic coordinates of the N destination nodes, a number of clients corresponding to each of the N destination nodes;

The generating unit is further configured to determine an order of the N destination nodes according to a descending order of the number of clients, and generate the planning path according to an order of the N destination nodes.

In conjunction with the second aspect, in a ninth possible implementation of the second aspect,

The obtaining unit is further configured to determine the quantity of the customer's goods;

The policy making unit is further configured to determine a customer order in descending order of the quantity of goods of the customer;

The notification unit is further configured to notify the client according to the customer sequence.

In a third aspect, an apparatus is disclosed comprising:

a locator for obtaining geographic coordinates of the initial departure node;

The locator is further configured to acquire geographic coordinates of the N destination nodes;

a processor, configured to generate a planned route according to the geographic coordinates of the initial departure node and the N geographic coordinates of the N destination nodes; according to the current location and the plan The destination node in the route formulates a policy for notifying the customer;

Wherein, the N is an integer greater than or equal to 2.

In conjunction with the third aspect, in a first possible implementation of the third aspect,

The processor is specifically configured to: use the initial starting node as a current starting node;

In conjunction with the third aspect, in a second possible implementation of the third aspect,

The processor is further configured to: after generating a sub-path whose starting point is the current starting node and the end point is the destination node K, update the current starting node to the destination node K, and obtain N sub-paths, according to the The N subpaths generate the planned path.

In conjunction with the third aspect, in a third possible implementation of the third aspect,

The processor is further configured to: if the length of the first path is smaller than the length of the first planned path, update the first planned path to the first path;

In conjunction with the third aspect, in a fourth possible implementation manner of the third aspect, the device further includes an input module,

The processor is further configured to: before receiving the geographic coordinates of the N destination nodes, receive, by the input module, the order information received by the user, where the order information includes a receipt address of all the customers;

The processor is further configured to determine the N destination nodes according to at least one of the customer's delivery addresses.

In conjunction with the third aspect, in a fifth possible implementation of the third aspect,

The processor is further configured to determine a current location and determine a next destination node according to the current location; the next destination node is N destination sections included in the planned route a destination node in the point that the user has not arrived and is closest to the current location of the user;

In conjunction with the third aspect, in a sixth possible implementation of the third aspect,

The device further includes a notification module, and the processor is specifically configured to:

In conjunction with the third aspect, in a seventh possible implementation of the third aspect,

In conjunction with the third aspect, in an eighth possible implementation of the third aspect,

The processor is further configured to: determine, before acquiring geographic coordinates of the N destination nodes, The number of clients corresponding to each of the N destination nodes;

In conjunction with the third aspect, in a ninth possible implementation of the third aspect,

The processor is further configured to determine a quantity of the customer's goods, and determine a customer order in descending order of the quantity of the goods of the customer;

The service processing method and device provided by the embodiment of the present invention can generate a planned route according to the N geographic coordinates of the initial departure node and the N destination nodes. Further, it is possible to formulate a policy for notifying the customer according to the current location and the planned route, and automatically notify the customer at a suitable time. Compared with the prior art couriers, it takes time to sort out the delivery order, and it will lead to an increase in the delivery distance of the courier, which will increase the delivery time. The method provided by the invention can generate a delivery route for the courier, thereby saving time for the user. In addition, the strategy of notifying the customer is made to avoid the customer spending too much time waiting for the courier, and the courier spends too much time waiting for the customer, saving time.

DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present invention, and other drawings can be obtained from those skilled in the art without any creative work.

1 is a schematic flowchart of a service processing method according to Embodiment 1 of the present invention;

2 is a schematic diagram of a route provided by Embodiment 1 of the present invention;

3 is a schematic flowchart of a service processing method according to Embodiment 2 of the present invention;

4 is a schematic flowchart of a service processing method according to Embodiment 3 of the present invention;

FIG. 5 is a schematic flowchart of a service processing method according to Embodiment 4 of the present invention;

6 is a structural block diagram of a device according to Embodiment 5 of the present invention;

FIG. 7 is a block diagram showing another structure of a device according to Embodiment 5 of the present invention; FIG.

FIG. 8 is a structural block diagram of a device according to Embodiment 6 of the present invention.

detailed description

The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, but not all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

Usually, the following processes are carried out from the time the user places an order to the delivery of the goods to the user:

1. The courier sorts the goods;

2, the courier gets a small ticket;

3, the courier sorted into a delivery list;

4, the courier sorts the delivery order;

5. The courier communicates with a user in advance.

In the above process, steps 2, 3, 4, and 5 are completed by the courier, and each step takes a lot of time. Moreover, the delivery order planned by the courier may lead to an increase in the delivery distance of the courier, and also increase the delivery time, which may directly lead to the loss of the user.

In addition, if the courier arrives in advance, waiting for the user to take the goods will take a lot of time, which will affect the delivery efficiency of the courier. Or the user comes out in advance, waiting for the courier, affecting the user experience, and also leading to user loss.

The invention provides a business processing method, which can prepare a delivery route for the courier in advance, so that the delivery efficiency of the courier is greatly improved. In addition, the distance from the destination can be automatically calculated according to the location service, and then the customer can be notified by phone or SMS to save the waiting time and improve the user experience.

Of course, the method provided by the present invention is not only applied to express delivery, but also can be applied to other scenarios, such as a company shuttle, the master can use the invention to notify company employees along the line; the airport line, etc., where the route is known and the audience is clear Both apply.

Example 1:

An embodiment of the present invention provides a service processing method, where an execution subject is a device. As shown in FIG. 1 , the method includes the following steps:

101. The device acquires geographic coordinates of an initial departure node.

The initial departure node may be the initial starting point of the user, or may be the starting point when the user wants to re-plan the route halfway. For example, if the courier departs from the logistics company, the destination node that needs to send the delivery goods includes: A, B, C, D, E. At this time, the initial departure node is the address of the logistics company, and the device acquires the geography of the logistics company. coordinate. If the courier completes the delivery of the goods at both A and B in a certain path, and wants to re-plan the route, then B is the initial departure node, and the device will obtain the geographic coordinates of B. The geographic coordinates may be latitude and longitude, or may be a coordinate that is located by a GPRS (General Packet Radio Service), and may be a coordinate determined by other positioning, which is not limited herein.

In a specific implementation, the courier may trigger the device to obtain the geographic coordinates of the current location (ie, the initial departure node) by performing a preset operation on the device. For example, the courier clicks the "route planning" button on the device, triggers the device to obtain the geographic coordinates of the current location, and then inputs the order information to the device by manual input or scanning.

Of course, it is also possible for the courier to manually enter the name of the current location, and the device converts the name of the current location into a corresponding geographic coordinate.

102. The device acquires geographic coordinates of N destination nodes, where N is an integer greater than or equal to 2.

In a specific implementation, the device receives the order information input by the user, and the order information includes the receipt information of all the customers, such as: the receiving address, the consignee name, the consignee contact method, and the receiving method.

The device converts all the shipping addresses included in the order information into geographical coordinates, and groups them according to the geographical coordinates of all the receiving addresses, and obtains N sets of receiving addresses, wherein each set of receiving addresses corresponds to one destination node. For example, the receiving address near the "** building" can be divided into a group, the destination node corresponding to the receiving address of the group is "** building", the geographical coordinates of the destination node corresponding to the group receiving address It is the geographical coordinates of the “** Building”. In this way, the device obtains the geographic coordinates corresponding to the N destination nodes. The courier can input the receipt information of each user to the device by manual input or scanning.

The order information also includes the telephone number of the user under each destination node. It should be noted that a user under one node can be considered as a user within a preset range involved in the node, that is, a user whose address is within a preset range involved in the node, and is a user under the node. The preset range may be a circle centered on the node and a circle having a preset length as a radius. Of course, other types of regions may also be used, which are not limited herein.

103. The device generates a planned route according to geographic coordinates of the initial departure node and N geographic coordinates of the N destination nodes.

In a specific implementation, the generating a planned route according to the geographic coordinates of the initial departure node and the N geographic coordinates specifically includes:

Two sets are preset, wherein the first set includes the initial departure node, and the second set includes the N destination nodes.

a. using the initial departure node as the current departure node;

b. Select the destination node K in the second set that has the shortest distance from the current departure node, and generate a sub-path whose starting point is the current departure node and the end point is the destination node K.

Further, after the generating starting point is the current starting node and the ending point is the sub-path of the destination node K, the method further includes:

In a specific implementation, the N sub-paths are obtained, and the generating the planning path includes:

A. Select the destination node K in the second set that has the shortest distance from the current departure node, delete the destination node K from the second set, join the first set, and generate a starting point for the current departure. The node end point is a sub-path of the destination node K; and the current departure node is updated to the destination node K; the current departure node is an initial departure node or an updated current departure node;

B. Repeat step A above until all nodes in the second set are added to the first set.

C. generating the planned route according to each sub-path generated by performing step A above. The starting point of the planned route is the initial starting node, and the Xth node of the planned route is the Xth performing target node K selected in the above step.

For example, as shown in FIG. 2, a route diagram is shown, where A is an initial departure node, and B, C, D, E, and F are five destination nodes. 2, the distance from the initial departure node A to the destination node B is 6, the distance from the initial departure node A to the destination node C is 3, and the initial departure node A is considered to be the remaining destination nodes D, E, and F. The distance value is ∞, that is, from the initial departure node A cannot directly reach the remaining destination nodes D, E, F.

The service processing method provided by the present invention will be described below in conjunction with Table 1.

Table 1

It should be noted that, if the length of the first path is smaller than the length of the first planned path, the first planned path is updated to the first path.

That is, in the process of sequentially selecting points in the second set into the first set to generate a planned route, the path length from the initial starting node to any point in the first set needs to be kept smaller than the initial starting node to the point. The shortest path, if the planned path length from the initial departure node to the point is greater than the other path from the initial departure node to the point, the planned route needs to be updated.

Of course, when the length of the first path is smaller than the length of the first planned path, the planned path may not be updated, but the distance value from the initial starting node to the point may be modified. Thus, the recorded distance value from the departure node to each node is the length of the shortest path, so that the shortest path is generated using the recorded data the next time the path is planned.

For example, in combination with FIG. 2 and Table 1, if the selected destination node a is performed in the second step (ie, step 3 of Table 1), the shortest path from the initial node A to the destination node B may be A→B. =6, the path from the initial node A to the destination node B in the planned route generated by the previous two execution steps a is A→C→B=6, and the distance value from the initial node A to the destination node B is not modified. The third step is to perform the step a (ie, step 4 of Table 1). The selected destination node is D, and the shortest path from the initial node A to the destination node D may be A→C→D=3+3=6 (A→ B→D is also the path from the initial node A to the destination node D, but A→B→D=11 is not the shortest path), and the planned route generated by the first three steps is executed. The path from the initial node A to the destination node B is A→C→B→D=3+2+5=10, and the distance value from the initial node A to the destination node D is modified to be 6 (A→C→D). . The fourth step is to perform the step a (ie, step 5 of Table 1). The selected destination node is E, and the shortest path from the initial node A to the destination node E may be A→C→E=3+4=7, the first 4 The path from the initial node A to the destination node B in the planned route generated by the second execution step a is A→C→B→D→E=3+2+5+2=12, and then the modification from the initial node A to the destination node E The distance value is 7 (A→C→E), so that the optimal path can be planned by borrowing the recorded distance value when planning the route next time.

Thus, the method provided by the present invention is capable of generating a delivery route for a courier, thereby saving time for the user.

104. The device formulates a policy for notifying a client according to a current location and a destination node in the planned route.

Specifically, the device determines a current location, and formulates a policy for notifying the client according to the distance between the current location and the next node, where the next node is the N destination nodes included in the planned route, and the user is The destination node that is currently traveling.

In a specific implementation, the formula for notifying the client according to the distance between the current location and the next node includes:

S1. Determine a geographic coordinate of the current location, a geographic coordinate of the next node, and obtain a number U of clients in the next node.

The current location is the current location of the courier, and may be a destination node in the planned route, or may be any location on the way of the courier delivery, which is not limited herein.

It should be noted that, in step 102, the order information input by the courier includes all the customer's receiving information. When the device divides all the customer's receiving addresses into N groups, after determining N destination nodes, each customer's Other receipt information is classified into a database corresponding to each destination node. For example, if the customer M is classified into the destination node "** building" according to the customer's delivery address "**街**", the customer M's contact information, name, and receipt method are also required. The goods information is stored in the database corresponding to the destination node "** Building".

S2. Calculating a distance Y between the current node and the next node according to the geographic coordinates of the current location, geographic coordinates of the next node, and calculating a time T1 required to reach the next node, T1=Y/v; calculates the time T2 required to notify the client in the next node, T2=U*t. The v is the travel speed of the user (ie, the speed of the courier), and t is the time required to notify a customer.

It should be noted that the travel speed v of the user and the time t required to notify a customer are all preset experience values, wherein the travel speed v of the user may be the average speed of the delivery of the delivery person. The time t required to notify a customer may be the time required for the courier to usually call a customer to pick up the goods, such as: 30 seconds.

If T1 is greater than or equal to T2, steps S1-S2 are performed again; if T1 < T2, the client in the next node is immediately notified in sequence.

Or, if T1 is greater than or equal to T2, the device starts to notify the client in the next node sequentially after the interval T1-T2; if T1 is less than T2, the device immediately notifies the client in the next destination node .

When T1 is greater than or equal to T2, it means that the time required for the courier to reach the next node is greater than the time required by the user to notify the customer under the node, then the courier does not need to call the customer immediately to pick up the goods, so as to prevent the customer from reaching the next time. The courier has not arrived at the node and the customer has waited too long. When T1 is less than T2, it means that the time required for the courier to reach the next destination node is less than the time required by the user to notify the customer under the node, then the courier needs to call the customer immediately to pick up the goods to ensure that the courier arrives at the said When you next go to the destination node, you don't have to wait for the customer for too long.

The service processing method provided by the embodiment of the present invention can formulate a policy for notifying the customer, so that the customer avoids spending too much time waiting for the courier, and the courier spends too much time waiting for the customer, saving time.

In a preferred embodiment of the present invention, before the device acquires the geographic coordinates of the N destination nodes, the method further includes:

Determining a number of clients corresponding to each of the N destination nodes; determining an order of the N destination nodes in descending order of the number of clients, according to the The sequence of the N destination nodes is generated to generate the planned path.

In this way, priority can be given to the destination node with more customers when generating the planning path, which enables most customers to collect goods in a short time, which is beneficial to improve the quality of service.

In another preferred embodiment of the present invention, the method further includes determining a quantity of the customer's goods, and then the apparatus formulating a policy for notifying the customer according to the current location and the destination node in the planned route includes:

In this way, when the customer is notified, the customer with more goods is preferentially notified, so that the customer with more goods can receive the goods preferentially, which is beneficial to improve the service quality.

Example 2:

The embodiment of the invention provides a service processing method. As shown in FIG. 3, the method includes the following steps:

201. The device enters the order information and obtains the geographic coordinates of the initial departure node.

In the specific implementation, the courier can manually input the order information, or can scan the order ticket entry order information through the scanner on the device. The order information includes: a shipping address (such as: ** District ** Street **), the customer's contact information (such as: mobile phone number or fixed-line number), and the customer's receiving method (such as: the user goes Pick-up at the delivery point is delivered by the courier to the courier box).

202. The device performs information conversion.

Specifically, the device converts all shipping addresses into geographic coordinates, which may be GPS-recognized latitude and longitude.

203. The device generates N destination nodes according to the shipping address.

In a specific implementation, the device divides all the receiving addresses into N groups according to the geographical coordinates of all the receiving addresses obtained in step 202, and the receiving addresses whose geographic coordinates are close to the geographical coordinates of the marked locations can be grouped into one group. The destination node corresponding to the delivery address may be the location of the logo to facilitate the customer to pick up the goods. Of course, the destination node corresponding to the group receiving address may also be other locations, which is not limited herein. Record the group receipt at the same time The destination node corresponding to the address, and obtain the geographic coordinates of the destination node.

In this way, the device can acquire the N destination nodes and the geographic coordinates of the N destination nodes.

204. The device stores the order information of the customer under each destination node in a database of the destination node.

Specifically, step 203 only groups all the customer's delivery addresses. After determining the node to which the customer belongs, the other order information of the customer is also stored in the database corresponding to the node. For example, if the client M is classified under the destination node "**Build", then the device needs to store the other order information of the client M in the destination node according to the correspondence between the customer's delivery address and other information of the customer in step 201. In the database corresponding to the "Building", of course, to ensure the one-to-one correspondence between the customer's order information, such as: the correspondence between the customer M's telephone, name, and delivery address, etc. must correspond to the corresponding relationship in step 201. the same.

205. The device generates a planned route according to geographic coordinates of the initial departure node and N geographic coordinates of the N destination nodes.

The planned route includes the departure node and the N destination nodes.

The method provided by the invention can generate a delivery route for the courier, thereby saving time for the user.

206. The device formulates a policy for notifying a client according to a current location and a destination node in the planned route.

The method provided by the embodiment of the present invention formulates a policy for notifying the customer, so that the customer avoids spending too much time waiting for the courier, and the courier spends too much time waiting for the customer, saving time.

Determining the number of customers corresponding to each of the N destination nodes; Determining the order of the N destination nodes in descending order of the number of clients, and generating the planning path according to the order of the N destination nodes. In this way, the destination node with a large number of customers is planned in the position of the planning path, which enables most customers to collect and obtain in a relatively short time, which is beneficial to improve the quality of service.

The order of the customers is determined in descending order of the quantity of the goods of the customer, and the customer is notified according to the order of the customers. In this way, customers who have more goods can collect the goods in a shorter period of time, which is conducive to improving the quality of service.

Example 3:

The embodiment of the invention provides a service processing method. As shown in FIG. 4, the method includes the following steps:

301. The device acquires the geographic coordinates of the current location.

In the specific implementation, the courier dispatches the acquisition according to the route planned by the device, and uses the positioning service to obtain the geographical coordinates of the current location in the process of advancement. The location service can be implemented by software or hardware. The software positioning needs to rely on the network to communicate with the server, and the hardware positioning does not need to communicate with the server to complete the positioning function.

302. The device calculates a distance between the current location and the next destination node.

The next node is a destination node that is sent by the user at the current time among the N destination nodes included in the planned route.

In a specific implementation, the device may calculate the distance between the current location and the next destination node according to the geographic coordinates of the current location and the geographic coordinates of the next destination node. The specific algorithm is not limited herein.

303. The device determines whether a notification condition is currently met.

The notification condition may be: whether the time T1 required to reach the next destination node is less than the time T2 of notifying the client.

The T1=Y/v, and the T2=U*t. The U is the number of customers in the next destination node, and the v is the speed of the express delivery (eg, the average speed of the courier). t is the time required to notify a customer.

If T1 is less than T2, the above notification condition is satisfied, then step 304 is performed.

If T1 is greater than or equal to T2, that is, the above notification condition is not satisfied, then step 301 is performed. That is, the courier continues to drive, obtains a new current location, and again determines whether the notification condition is met. In this way, continuously calculating the current position (because the courier is on the move, the current position is constantly updated) and the distance from the next destination node, can help the courier to start notifying the customer at the exact moment, so as not to cause the customer to reach the next purpose. The node waits for the courier to wait too long, or the courier arrives at the next destination node and waits for the client to wait too long.

Of course, when T1 is greater than or equal to T2, that is, if the above notification condition is not satisfied, the interval T1-T2 is sequentially notified to the client in the next node, that is, the interval T1-T2, and then step 401 is performed.

304. The device acquires order information of all customers under the next destination node.

In a specific implementation, the device retrieves user information under the node from the database according to the node information of the next destination node. Since the equipment has entered the order information of all the customers before, and each customer is divided into N destination nodes, the order information of all the customers under each destination node is stored in the database of the corresponding destination node. Therefore, the device queries the database corresponding to the next destination node according to the node information of the next destination node, and obtains the order information of all the clients under the next destination node stored therein.

305. The device determines a delivery method of the customer.

Specifically, after step 304 obtains the order information of all the clients under the next destination node, the step 304 notifies each client under the destination node one by one. The client in step 305 can be any client under the destination node. For a customer, determine whether the delivery method included in the customer's order information is a delivery courier box.

If the customer's delivery method is to deliver the courier box, step 306 is performed; if not, step 307 is performed.

306. The device short message notifies the client.

In turn, execution 305 can be continued to notify another customer.

307. The device notifies the customer according to the contact information of the customer.

If the customer's contact information is a landline, the customer's landline number is dialed to notify the customer to pick up the next destination node in step 304; if the customer's contact information is a mobile phone, the customer's mobile number is dialed to notify the customer to proceed to step 304. The next destination node picks up the goods. Optionally, if the customer's contact information has both a mobile phone number and a landline number, the customer's landline number can be preferentially notified to the customer.

308. Repeat steps 305-308 until the courier reaches the destination node.

The destination node is the next destination node described in step 304.

It should be noted that after the device detects that the courier arrives at the destination node, the device may continue to notify the remaining unannounced customers through the above steps 305-307, or may send a short message to notify the remaining unannounced customers.

In this way, the device notifies the customer in order, so that the courier may complete the delivery communication on the way to the next destination node. If there are more users under the node, the courier can set the distance from the current location to the next destination node and directly dial the phone. If you have not notified after reaching the destination, you can choose to continue to call or SMS notification. You can choose to continue to make a call or SMS notification, or the device can choose to continue to make calls or SMS notifications according to the courier's pre-operation. .

Example 4:

The embodiment of the invention provides a service processing method. As shown in FIG. 5, the method includes the following steps:

The device provided by the embodiment of the invention includes: an input module, a core service module, a database, a positioning module, a telephone module, and a short message module. The input module may be an LCD (Liquid Crystal Display) or a camera.

401. The input module of the device receives the order information input by the user.

Wherein, if the input module is an LCD, the user can manually input all the guests. The order information of the household, if the input module is a camera, the user may use the camera of the device to scan all the order tickets and enter the order information of all the customers.

402. The core service module of the device receives order information of all customers sent by the input module.

In addition, the core service module of the device also needs to send the receipt address of all customers to the positioning module to obtain the geographic coordinates corresponding to each receipt address.

403. The positioning module of the device converts the receipt address of all customers into geographic coordinates.

The device converts all the receiving addresses included in the order information into geographical coordinates, and groups them according to the geographical coordinates of all the receiving addresses, and obtains N sets of receiving addresses, wherein each set of receiving addresses corresponds to one destination node. For example, the shipping address near the "** Building" can be divided into a group, and the destination node corresponding to the receiving address of the group is "** "Building", the geographic coordinates of the destination node corresponding to the receiving address of the group is the geographic coordinates of the "** building". In this way, the device obtains the geographic coordinates corresponding to the N destination nodes. The courier can manually input or scan. Enter the receipt information for each user to the device.

404. The positioning module of the device sends all obtained geographic coordinates to the core service module.

405. The core service module of the device stores related information in a database.

In a specific implementation, the core business module stores the customer order information and the geographic coordinates corresponding to the receipt addresses of all customers into the database. Of course, it is necessary to ensure the correspondence between the receipt address of each customer, the geographical coordinates of the delivery address, the contact information, and the name of the consignee.

406. The positioning module of the device acquires geographic coordinates of the initial departure node.

407. The core service module of the device generates a planned route.

In a specific implementation, the core service module determines N destination nodes, and generates a planned route according to geographic coordinates of the initial departure node and geographic coordinates of the N destination nodes. Specifically include:

Two sets are preset, wherein the first set = {the initial departure node}, the second set = {the N destination nodes}.

a. selecting the destination node K in the second set that has the shortest distance from the current departure node, deleting the destination node K from the second set, adding the first set, and generating a starting point for the current departure. The node end point is a sub-path of the destination node K; and the current departure node is updated to the destination node K; the current departure node is an initial departure node or an updated current departure node;

c. generating the planned route according to the sub-path generated by performing the above step a, the starting point of the planned route is the initial starting node, and the Xth node of the planned route is selected by performing the above steps for the Xth time. Destination node K.

The method provided by the invention can generate a delivery route for the courier, thereby serving the user Save time.

408. The positioning module of the device acquires geographic coordinates of the current location.

The current location is a current location of the courier on the way from the initial departure node and delivering the delivery item according to the planned route. In addition, the positioning module also needs to send the geographic coordinates of the current location to the core service module.

409. The core service module of the device determines a next destination node.

Specifically, the core service module compares the geographic coordinates of the current location with the geographic coordinates of each destination node in the database, and determines the nearest destination node as the next destination node.

410. The core service module of the device acquires node information of a next destination node.

Specifically, the core acquires order information of all customers under the next node in the database.

411. Send a short message to notify the customer through the short message module.

Here, the notified customer is the delivery method: delivery courier box.

412. The core service module of the device determines whether the notification condition is met.

The T1=Y/v, and the T2=U*t. The U is the number of customers in the next destination node, the v is the travel speed of the express delivery (eg, the average speed of the courier), and the t is the time required to notify one customer.

If T1 is less than T2, that is, the above notification condition is satisfied, then step 413 is performed.

If T1 is greater than or equal to T2, that is, the above notification condition is not satisfied, then step 408 and step 412 are performed.

Of course, if T1 is greater than or equal to T2, the above notification condition is not satisfied, and step 413 may be performed after the interval T1-T2.

413. The core service module notifies the customer through the telephone module.

Thus, after obtaining the order information of all the customers under the next destination node in step 410, the device notifies each customer under the destination node one by one.

According to steps 408-413, a policy for notifying the customer is formulated to avoid excessive customer spending. Time waits for the courier, the courier spends too much time waiting for the customer, saving time.

Example 5:

The embodiment of the present invention provides an apparatus 50. As shown in FIG. 6, the apparatus includes: an obtaining unit 501, a generating unit 502, and a policy making unit 503.

The obtaining unit 501 is configured to acquire geographic coordinates of the initial departure node. The obtaining unit 501 integrates the functions of the positioning module of the device provided by Embodiment 4 of the present invention.

In a specific implementation, the courier may trigger the acquiring unit 501 to obtain the geographic coordinates of the current location (that is, the initial departure node) by performing a preset operation on the device. For example, the courier clicks the "route planning" button on the device, triggers the device to obtain the geographic coordinates of the current location, and then inputs the order information to the device by manual input or scanning.

Of course, the name of the current location may be manually input by the courier, and the acquiring unit 501 of the device converts the name of the current location into a corresponding geographic coordinate.

The obtaining unit 501 is further configured to acquire geographic coordinates of the N destination nodes.

The generating unit 502 is configured to generate a planned route according to the geographic coordinates of the initial departure node and the N geographic coordinates of the N destination nodes. The generating unit 502 integrates the functions of the core service module of the device provided by Embodiment 4 of the present invention. The apparatus 50 provided by the present invention is capable of generating a delivery route for a courier, thereby saving time for the user.

In a specific implementation, the first set includes the initial starting node, the second set includes the N destination nodes, and the generating unit 502 is specifically configured to: use the initial starting node as a current starting node; The destination node K having the shortest distance from the current departure node in the two sets generates a sub-path whose starting point is the current departure node and whose destination is the destination node K.

The generating unit 502 is further configured to: after generating a sub-path whose starting point is the current starting node and the end point is the destination node K, update the current starting node to the destination node K, and obtain N sub-paths, according to The N subpaths generate the planned path.

The policy making unit 503 is configured to formulate a policy for notifying the client according to the current location and the destination node in the planned route.

As shown in FIG. 7, the device 50 further includes a receiving unit 504 and a notification unit 505.

The receiving unit 503 is configured to receive order information input by a user before acquiring geographic coordinates of the N destination nodes, where the order information includes a receipt address of all customers. The receiving unit 504 integrates the input module of the device provided by Embodiment 4 of the present invention. Features.

The obtaining unit 501 is configured to determine the N destination nodes according to the at least one receiving address of the client.

In a specific implementation, the obtaining unit 501 divides the receiving addresses of all the customers into N groups, and determines N destination nodes, and each group receiving address corresponds to one destination node. The grouping unit 504 is here equivalent to the core service module of the device provided by the embodiment 4 of the present invention: grouping the customer receiving addresses into groups.

The policy making unit 503 is configured to: formulate a policy for notifying a client according to a distance between a current location and a next destination node, where the next destination node is the N destination nodes included in the planned route, and the user is in the The destination node that is currently traveling. The policy formulation unit 503 is here equivalent to the core service module of the device provided by Embodiment 4 of the present invention: providing a function for formulating a policy.

The policy making unit 503 is specifically configured to:

S1. The device determines a geographic coordinate of the current location, a geographic coordinate of the next destination node, and acquires a number U of clients in the next destination node.

It should be noted that the order information input by the courier includes all the customer's receipt information. When the device divides the customer's delivery address into N groups, after determining the N destination nodes, the other customers' receipts will be The goods information is classified into a database corresponding to each destination node. For example, if the customer M is classified into the destination node "** building" according to the customer's delivery address "**街**", the customer M's contact information, name, and receipt method are also required. The goods information is stored in the database corresponding to the destination node "** Building".

S2. The device calculates a distance Y between the current node and the next destination node according to the geographic coordinates of the current location and the geographic coordinates of the next destination node; and calculates the arrival to the next destination node. The required time T1, T1=Y/v; calculating the time T2 required to notify the client in the next destination node, T2=U*t, where t To inform a customer of the time required, the v is the speed of travel of the user.

If T1 is greater than or equal to T2, the policy formulation unit 503 performs the steps S1-S2 again.

If T1 is less than T2, the notification unit 505 immediately notifies the clients in the next destination node in sequence.

The policy making unit 503 is specifically configured to:

S1. The device determines the geographic coordinates of the current location, the geographic coordinates of the next destination node; and obtains the number of clients U in the next destination node;

S2. The device calculates a distance Y between the current node and the next destination node according to the geographic coordinates of the current location and the geographic coordinates of the next destination node; and calculates the arrival to the next destination node. The required time T1, T1=Y/v; calculating the time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, Said v is the travel speed of the user;

If T1 is greater than or equal to T2, the policy making unit 503 starts to notify the clients in the next node sequentially after the interval T1-T2;

The device 50 provided by the present invention can formulate a strategy for notifying the customer, avoiding the customer spending too much time waiting for the courier, and the courier spending too much time waiting for the customer, saving time.

The obtaining unit 501 is further configured to determine, before acquiring geographic coordinates of the N destination nodes, a number of clients corresponding to each of the N destination nodes.

The generating unit 502 is further configured to determine an order of the N destination nodes according to a descending order of the number of clients, and generate the planning path according to an order of the N destination nodes. Priority is given to the destination node with a large number of customers when generating the planning path. More customers can receive the goods preferentially, which is conducive to improving the quality of service.

The obtaining unit 501 is further configured to determine the quantity of the customer's goods;

The policy making unit 503 is further configured to determine the order of the customers in descending order of the quantity of the goods of the customer.

The notification unit 505 is further configured to notify the client according to the customer sequence. Priority is given to customers who have more goods, which will help improve service quality.

Example 6

The embodiment of the present invention further provides a device 60. As shown in FIG. 8, the device 60 includes a processor 601, a memory 602, an input module 603, an output module 604, a power source 605, a notification module 606, and a locator 607.

Processor 601 is the control center of device 60, which connects various portions of the entire device 60 using various interfaces and lines, by running or executing software programs and/or modules stored in the storage unit, and recalling data stored in memory 602. To perform various functions of the device 60 and/or process data. The processor unit may be composed of an integrated circuit (IC), for example, may be composed of a single packaged IC, or may be composed of a plurality of packaged ICs that have the same function or different functions. For example, the processor unit may include only a central processing unit (CPU), or may be a GPU, a digital signal processor (DSP), and a control chip (for example, a baseband) in the communication unit. A combination of chips). In the embodiment of the present invention, the CPU may be a single operation core, and may also include multiple operation cores. The device 60 can be an electronic device.

The memory 602 can be used to store software programs and modules, and the processor 601 executes various functional applications of the device 60 and implements data processing by running software programs and modules stored in the storage units. The memory 602 mainly includes a program storage area and a data storage area, wherein the program storage area can store an operating system, an application required for at least one function, such as a sound playing program, an image playing program, and the like; and the data storage area can be stored according to the device 60. Use the created data (such as audio data, phone book, etc.). In a specific embodiment of the present invention, the storage unit may include a volatile memory, such as non-volatile dynamic random access memory (Nonvolatile Random Access) Memory, referred to as NVRAM, Phase Change RAM (PRAM), Magnetoresistive Random Access Memory (MRAM), etc., may also include non-volatile memory, such as at least one disk. A storage device, an electrically erasable programmable read-only memory (EEPROM), a flash memory device such as a NOR flash memory or a NAND flash memory. The non-volatile memory stores operating systems and applications executed by the processing unit. The processing unit loads the running program and data from the non-volatile memory into the memory and stores the digital content in a plurality of storage devices. The operating system includes various components and/or drivers for controlling and managing conventional system tasks such as memory management, storage device control, power management, and the like, as well as facilitating communication between various hardware and software. In the embodiment of the present invention, the operating system may be an Android system of Google Inc., an iOS system developed by Apple Inc., or a Windows Phone operating system developed by Microsoft Corporation, or an embedded operating system such as Vxworks.

In a specific embodiment of the present invention, the memory is mainly used for storing the parsed audio code stream and the waveform/spectrum/time correspondence table; the lyric file and the lyrics text and time correspondence table, and the intercepted new audio file.

The input module 603 is used to implement user interaction with the device 60 and/or information input into the device 60. For example, the input module 603 can receive numbers, characters, gesture information, and the like input by the user to generate signal inputs related to user settings or function controls. In an embodiment of the invention, the input unit may be a touch panel or other human-computer interaction interface. A touch panel, also known as a touch screen or touch screen, collects operational actions that the user touches or approaches on. For example, the user uses an action of any suitable object or accessory such as a finger or a stylus on or near the touch panel, and drives the corresponding connecting device according to a preset program. Optionally, the touch panel may include two parts: a touch detection device and a touch controller. Wherein the touch detection device detects a touch operation of the user, converts the detected touch operation into an electrical signal, and transmits the electrical signal to the touch controller; the touch controller receives the electrical signal from the touch detection device, and Convert it to contact coordinates and send it to the processing module. Touch control The controller can also receive commands from the processing unit and execute them. In addition, touch panels can be implemented in various types such as resistive, capacitive, infrared, and surface acoustic waves.

Output module 604 includes, but is not limited to, a graphics output unit and a sound output unit. The graphic output unit is used to output text, images, UI interfaces, and the like. The graphic output unit may include a display panel, for example, configured by using an LCD (Liquid Crystal Display), an OLED (Organic Light-Emitting Diode), a field emission display (FED), or the like. Display panel. Alternatively, the image output unit may comprise a reflective display, such as an electrophoretic display, or a display utilizing an Interferometric Modulation of Light. In a specific embodiment of the present invention, the touch panel used by the input unit can also serve as a display panel of the output unit. For example, when the touch panel detects a touch or proximity gesture operation thereon, it is transmitted to the processing unit to determine the type of the touch event, and then the processing unit provides a corresponding visual output on the display panel according to the type of the touch event. Although in the above figures, the input unit and the output unit are implemented as two separate components to implement the input and output functions of the device 60, in some embodiments, the touch panel can be integrated with the display panel to implement the device 60. Input and output functions. For example, the image output unit may display various graphical user interfaces (GUIs) as virtual control components, including but not limited to windows, scroll axes, icons, and scrapbooks, for the user to touch. The way to operate.

In the embodiment of the present invention, the output module 604 is configured to display waveforms/spectral maps of the audio interception, time axis, and highlight lyrics selected by the left and right drag frames. The audio output unit includes a digital-to-analog converter for converting the audio signal output by the processing unit from a digital format to an analog format and rendering the waveform/spectral waveform.

Power source 605 is used to power different components of device 60 to maintain its operation. As a general understanding, the power source can be a built-in battery, such as a conventional lithium ion battery, a nickel metal hydride battery, etc., and also includes an external power source that directly supplies power to the device 60, such as an AC adapter. In some embodiments of the invention, the power source can also be made wider A general definition, for example, may also include a power management system, a charging system, a power failure detection circuit, a power converter or inverter, a power status indicator (such as a light emitting diode), and associated with power generation, management, and distribution of device 60. Any other components of the union.

The notification module 606 can be a short message module or a phone module for implementing functions such as sending a short message and dialing a phone. The locator 607 can be a module that integrates GPRS functions for implementing a positioning function and converting a physical address into a geographic coordinate.

The locator 607 is configured to acquire geographic coordinates of the initial departure node; acquire geographic coordinates of the N destination nodes.

The processor 601 generates a planned route according to the geographic coordinates of the initial departure node and the N geographic coordinates of the N destination nodes; and formulates a policy for notifying the client according to the current location and the destination node in the planned route. The N is an integer greater than or equal to 2.

The processor 601 is specifically configured to: use the initial starting node as a current starting node; select a destination node K in the second set that has the shortest distance from the current starting node, and generate a starting point of the current starting node and an ending point. The sub-path of the destination node K. The first set includes the initial departure node, and the second set includes the N destination nodes.

The processor 601 is further configured to: after generating a sub-path whose starting point is the current starting node and the end point is the destination node K, update the current starting node to the destination node K, and obtain N sub-paths, according to The N subpaths generate the planned path.

In a specific implementation, the generating, by the processor 601, the planned route may include the following steps:

a. The initial departure node is taken as the current departure node.

b. selecting the destination node K in the second set that has the shortest distance from the current departure node, deleting the destination node K from the second set, adding the first set, and generating a starting point for the current departure The node end point is a sub-path of the destination node K; the current departure node is updated to the destination node K.

c. Repeat step b above until all nodes in the second set are added Go to the first set.

d. generating the planned route according to the sub-path generated by performing the above step b, the starting point of the planned route is the initial starting node, and the Xth node of the planned route is selected by performing the above steps for the Xth time. Destination node K.

The device converts all the receiving addresses included in the order information into geographical coordinates, and groups them according to the geographical coordinates of all the receiving addresses, and obtains N sets of receiving addresses, wherein each set of receiving addresses corresponds to one destination node. For example, the receiving address near the "** building" can be divided into a group, the destination node corresponding to the receiving address of the group is "** building", the geographical coordinates of the destination node corresponding to the group receiving address It is the geographical coordinates of the “** Building”. In this way, the device obtains the geographic coordinates corresponding to the N destination nodes. The courier can input the receipt information of each user to the device by manual input or scanning.

For example, as shown in Figure 2, a route diagram, where A is the initial departure Nodes, B, C, D, E, and F are five destination nodes. 2, the distance from the initial departure node A to the destination node B is 6, the distance from the initial departure node A to the destination node C is 3, and the initial departure node A is considered to be the remaining destination nodes D, E, and F. The distance value is ∞, that is, from the initial departure node A cannot directly reach the remaining destination nodes D, E, F. The service processing method provided by the present invention in combination with Table 1 may include the following steps:

1. In the first set S, A is selected. At this time, S={A}, and A is the current node to determine the next node of the route. At this time, the second set U={B, C, D, E, F} And

The distance from C to A is the smallest.

2. The first set S is selected into C. At this time, S={A, C}, and C is the next node of the current starting node; at this time, the second set U={B, D, E, F}, As can be seen from Figure 2:

C→B=2, C→D=3, C→E=4, and the distance from B to C is the smallest.

3. The first set S is selected into B. At this time, S={A, C, B}, and B is the next node of the current departure node to determine the route; at this time, the second set U={E, F}, by the figure 2 It can be seen that D→E=2, D→F=3, and the distance value of E to D is the smallest.

4. The first set S is selected into D. At this time, S={A, C, B, D}, and D is the next node of the current departure node to determine the route; U={E, F}, as shown in Fig. 2: D→E=2, D→F=3, and the distance from E to D is the smallest.

5. Select the first set SE, at this time S={A, C, B, D, E}, and determine the next node of the route with E as the current starting node; U={F}.

6. The first set S is selected into F. At this time, S={A, C, B, D, E, F}, the planned route is: A→C→B→D→E→F; the U set is empty. , end the process.

The processor 601 is further configured to: if the length of the first path is smaller than the length of the first planned path, update the first planned path to the first path.

Of course, when the length of the first path is smaller than the length of the first planned path, Instead of updating the planning path, the distance value from the initial departure node to the point is modified. Thus, the recorded distance value from the departure node to each node is the length of the shortest path, so that the shortest path is generated using the recorded data the next time the path is planned. For example, in combination with FIG. 2 and Table 1, if the selected destination node a is performed in the second step (ie, step 3 of Table 1), the shortest path from the initial node A to the destination node B may be A→B. =6, the path from the initial node A to the destination node B in the planned route generated by the previous two execution steps a is A→C→B=6, and the distance value from the initial node A to the destination node B is not modified. The third step is to perform the step a (ie, step 4 of Table 1). The selected destination node is D, and the shortest path from the initial node A to the destination node D may be A→C→D=3+3=6 (A→ B→D is also the path from the initial node A to the destination node D, but A→B→D=11 is not the shortest path. The path from the initial node A to the destination node B in the planned route generated in the first three execution steps a is A→C→B→D=3+2+5=10, the distance value from the initial node A to the destination node D is modified to be 6 (A→C→D). The fourth step is to perform the step a (ie, step 5 of Table 1). The selected destination node is E, and the shortest path from the initial node A to the destination node E may be A→C→E=3+4=7, the first 4 The path from the initial node A to the destination node B in the planned route generated by the second execution step a is A→C→B→D→E=3+2+5+2=12, and then the modification from the initial node A to the destination node E The distance value is 7 (A→C→E), so that the optimal path can be planned by borrowing the recorded distance value when planning the route next time.

The processor 601 is further configured to receive, by using the input module 603, the order information input by the user before acquiring the geographic coordinates of the N destination nodes, where the order information includes a receipt address of all customers.

The processor 601 is further configured to divide the receiving addresses of all the customers into N groups, and determine N destination nodes, where each group receiving address corresponds to one destination node.

The processor 601 is further configured to: formulate a policy for notifying a client according to a distance between a current location and a next destination node, where the next destination node is the N destination nodes included in the planned route, and the user is in the The destination node that is currently traveling.

The processor 601 is specifically configured to:

S1. The device determines geographic coordinates of the current location, the next destination node Geographical coordinates; obtaining the number of customers U in the next destination node;

If T1 is greater than or equal to T2, the processor 601 performs the steps S1-S2 again;

If T1 is less than T2, the notification module 606 immediately notifies the clients in the next destination node.

The processor 601 is specifically configured to:

If T1 is greater than or equal to T2, the notification module 606 starts to notify the client in the next node sequentially after the interval T1-T2; if T1 is less than T2, the notification module 606 immediately notifies the next destination node in sequence. customer of.

The device provided by the embodiment of the invention can generate a delivery route for the courier, thereby saving time for the user. In addition, the development of a strategy to notify customers, so that customers do not spend too much time waiting for couriers, couriers spend too much time waiting for customers, saving time.

The above is only a specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope of the present invention. It should be covered by the scope of the present invention. Therefore, the scope of the invention should be determined by the scope of the claims.

Claims

A service processing method, the method comprising:

The device acquires the geographic coordinates of the initial departure node;

The device acquires geographic coordinates of N destination nodes; the N is an integer greater than or equal to 2;

The device generates a planned route according to the geographic coordinates of the initial departure node and the N geographic coordinates of the N destination nodes;

The device formulates a policy for notifying the client according to the current location and the destination node in the planned route.
The method according to claim 1, wherein the first set comprises the initial departure node, the second set comprises the N destination nodes, and the N coordinates according to the geographic coordinates of the initial departure node The geographical coordinate generation planning route specifically includes:

Using the initial departure node as a current departure node;

A destination node K having the shortest distance from the current departure node in the second set is selected, and a sub-path whose starting point is the current departure node and whose destination is the destination node K is generated.
The method according to claim 2, wherein after the generating starting point is the current starting node and the ending point is a sub-path of the destination node K, the method further includes:

Updating the current departure node to the destination node K, obtaining N sub-paths, and generating the planning path according to the N sub-paths.
The method according to claim 2 or 3, wherein if the length of the first path is smaller than the length of the first planned path, updating the first planned path to the first path;

The first planned path is a planned path from the initial starting node to the first node, and the first path is a path from the initial starting node to the first node except the first plan A path outside the path, the first node being any destination node in the planned route.
The method according to claim 1, wherein before the acquiring the geographic coordinates of the N destination nodes, the method further comprises:

Receiving, by the device, order information input by a user, where the order information includes a receiving address of the customer;

The device determines the N destination nodes based on at least one of the customer's shipping addresses.
The method according to claim 1 or 5, wherein the device formulates a policy for notifying the client according to the current location and the destination node in the planned route, including:

The device determines a current location and determines a next destination node according to the current location; the next destination node is one of the N destination nodes included in the planned route, the user does not arrive, and is closest to the current location of the user. Destination node

The device formulates a policy for notifying the client according to the distance between the current location and the next destination node.
The method according to claim 1 or claim 6, wherein the determining, by the device, the policy for notifying the client according to the distance between the current location and the next destination node comprises:

The device determines the geographic coordinates of the current location, the geographic coordinates of the next destination node, and obtains the number of clients U in the next destination node;

The device calculates a distance Y between the current node and the next destination node according to the geographic coordinates of the current location and the geographic coordinates of the next destination node; and calculates a required distance to reach the next destination node. Time T1, T1=Y/v; calculating the time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, the v The speed of travel for the user;

If the T1 is less than the T2, the device notifies the client in the next destination node.
The method according to claim 1 or claim 6, wherein the formulating the policy for notifying the client according to the distance between the current location and the next destination node comprises:

The device determines the geographic coordinates of the current location, the geographic coordinates of the next destination node, and obtains the number of clients U in the next destination node;

Determining, according to the geographic coordinates of the current location, the location of the next destination node Calculating a distance Y between the current node and the next destination node; calculating a time T1, T1=Y/v required to reach the next destination node; and calculating a notification to the next destination node The time T2, T2=U*t required by the customer, wherein t is the time required to notify a customer, and v is the traveling speed of the user;

If the T1 is greater than or equal to the T2, the device notifies the client in the next node after a preset duration; the preset duration is T1-T2;

If the T1 is less than the T2, the device notifies the client in the next destination node.
The method according to claim 1, wherein before the acquiring the geographic coordinates of the N destination nodes, the method further comprises:

Determining a number of customers corresponding to each of the N destination nodes;

Determining the order of the N destination nodes in descending order of the number of clients, and generating the planning path according to the order of the N destination nodes.
The method of claim 1 wherein said method further comprises determining a quantity of goods of the customer,

Then, the device formulates a policy for notifying the client according to the current location and the destination node in the planned route, including:

The order of the customers is determined in descending order of the quantity of the goods of the customer, and the customer is notified according to the order of the customers.
An apparatus, comprising:

An obtaining unit, configured to acquire geographic coordinates of an initial starting node;

The acquiring unit is further configured to acquire geographic coordinates of the N destination nodes; the N is an integer greater than or equal to 2;

a generating unit, configured to generate a planned route according to geographic coordinates of the initial departure node and N geographic coordinates of the N destination nodes;

The policy making unit is configured to formulate a policy for notifying the client according to the current location and the destination node in the planned route.
The device according to claim 11, wherein the first set comprises the initial departure node, and the second set comprises the N destination nodes,

The generating unit is specifically configured to: use the initial starting node as a current starting node;

A destination node K having the shortest distance from the current departure node in the second set is selected, and a sub-path whose starting point is the current departure node and whose destination is the destination node K is generated.
The device according to claim 12, wherein the generating unit is further configured to: after generating a sub-path with the starting point being the current starting node and the ending point being the destination node K, updating the current starting node to The destination node K obtains N sub-paths, and generates the planned path according to the N sub-paths.
The device according to claim 12 or 13, wherein if the length of the first path is smaller than the length of the first planned path, updating the first planned path to the first path;

The first planned path is a planned path from the initial starting node to the first node, and the first path is a path from the initial starting node to the first node except the first plan A path outside the path, the first node being any destination node in the planned route.
The device according to claim 11, further comprising a receiving unit,

The receiving unit is configured to receive, after acquiring geographic coordinates of the N destination nodes, order information input by the user, where the order information includes a receipt address of all customers;

The obtaining unit is further configured to determine the N destination nodes according to the at least one receiving address of the client.
Device according to claim 11 or 15, characterized in that

The policy making unit is configured to determine a current location and determine a next destination node according to the current location; the next destination node is one of the N destination nodes included in the planned route, the user does not arrive, and the user The current location is the closest destination node;

A policy for notifying the client is formulated according to the distance between the current location and the next destination node.
The device according to claim 11 or 16, wherein the device further comprises a notification unit, and the policy making unit is specifically configured to:

Determining the geographic coordinates of the current location, the geographic coordinates of the next destination node; acquiring the number of clients U in the next destination node;

Obtaining a distance Y between the current node and the next destination node according to the geographic coordinates of the current location, geographic coordinates of the next destination node, and calculating a time T1 required to reach the next destination node , T1=Y/v; calculating a time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, and the v is the user's Speed of travel

If the T1 is smaller than the T2, the notification unit notifies the client in the next destination node.
The device according to claim 11 or 16, wherein the device further comprises a notification unit, and the policy making unit is specifically configured to:

Determining the geographic coordinates of the current location, the geographic coordinates of the next destination node; acquiring the number of clients U in the next destination node;

Obtaining a distance Y between the current node and the next destination node according to the geographic coordinates of the current location, geographic coordinates of the next destination node, and calculating a time T1 required to reach the next destination node , T1=Y/v; calculating a time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, the v is the The speed of the user's travel;

If the T1 is greater than or equal to the T2, the notification unit notifies the client in the next node after a preset duration; the preset duration is T1-T2;

If the T1 is smaller than the T2, the notification unit notifies the client in the next destination node.
The device according to claim 11, wherein the obtaining unit is further configured to: before acquiring geographic coordinates of the N destination nodes, determine a number of clients corresponding to each of the N destination nodes;

The generating unit is further configured to determine an order of the N destination nodes according to a descending order of the number of clients, and generate the planning path according to an order of the N destination nodes.
Apparatus according to claim 11 wherein said acquisition unit Also used to determine the quantity of the customer's goods;

The policy making unit is further configured to determine a customer order in descending order of the quantity of goods of the customer;

The notification unit is further configured to notify the client according to the customer sequence.
An apparatus, comprising:

a locator for obtaining geographic coordinates of the initial departure node;

The locator is further configured to acquire geographic coordinates of the N destination nodes;

The processor generates a planned route according to the geographic coordinates of the initial departure node and the N geographic coordinates of the N destination nodes; and formulates a policy for notifying the client according to the current location and the destination node in the planned route;

Wherein, the N is an integer greater than or equal to 2.
The device according to claim 21, wherein the first set comprises the initial departure node, and the second set comprises the N destination nodes,

The processor is specifically configured to: use the initial starting node as a current starting node;

A destination node K having the shortest distance from the current departure node in the second set is selected, and a sub-path whose starting point is the current departure node and whose destination is the destination node K is generated.
The device according to claim 22, wherein the processor is further configured to: after generating a sub-path with the starting point being the current starting node and the ending point being the destination node K, updating the current starting node to The destination node K obtains N sub-paths, and generates the planned path according to the N sub-paths.
The device according to claim 22 or 23, wherein the processor is further configured to: if the length of the first path is smaller than the length of the first planned path, update the first planned path to the first a path

The first planned path is a planned path from the initial starting node to the first node, and the first path is a path from the initial starting node to the first node except the first plan A path outside the path, the first node being any destination node in the planned route.
The device according to claim 21, wherein said device further comprises an input module,

The processor is further configured to: before receiving the geographic coordinates of the N destination nodes, receive, by the input module, the order information received by the user, where the order information includes a receipt address of all the customers;

The processor is further configured to determine the N destination nodes according to at least one of the customer's delivery addresses.
The device according to claim 21 or 25, characterized in that

The processor is further configured to: determine a current location and determine a next destination node according to the current location; the next destination node is one of N destination nodes included in the planned route, the user does not reach, and the user The current location is the closest destination node;

A policy for notifying the client is formulated according to the distance between the current location and the next destination node.
The device according to claim 21 or 26, wherein the device further comprises a notification module, the processor is specifically configured to:

Determining the geographic coordinates of the current location, the geographic coordinates of the next destination node; acquiring the number of clients U in the next destination node;

Obtaining a distance Y between the current node and the next destination node according to the geographic coordinates of the current location, geographic coordinates of the next destination node, and calculating a time T1 required to reach the next destination node , T1=Y/v; calculating a time T2, T2=U*t required to notify the client in the next destination node, wherein t is the time required to notify a client, and the v is the user's Speed of travel

If the T1 is smaller than the T2, the notification unit notifies the client in the next destination node.
The device according to claim 21 or 26, wherein the device further comprises a notification module, the processor is specifically configured to:

Determining the geographic coordinates of the current location, the geographic coordinates of the next destination node; acquiring the number of clients U in the next destination node;

Obtaining a distance Y between the current node and the next destination node according to the geographic coordinates of the current location, geographic coordinates of the next destination node, and calculating a time T1 required to reach the next destination node , T1=Y/v; calculation notification of the next destination section The time T2, T2=U*t required by the customer in the point, wherein t is the time required to notify a customer, and the v is the traveling speed of the user;

If the T1 is greater than or equal to the T2, the notification unit notifies the client in the next node after a preset duration; the preset duration is T1-T2;

If the T1 is smaller than the T2, the notification unit notifies the client in the next destination node.
The device according to claim 21, wherein the processor is further configured to: before acquiring geographic coordinates of the N destination nodes, determine a number of clients corresponding to each of the N destination nodes;

Determining the order of the N destination nodes in descending order of the number of clients, and generating the planning path according to the order of the N destination nodes.
The device according to claim 21, wherein the processor is further configured to determine a quantity of the customer's goods, and determine a customer order in descending order of the quantity of the goods of the customer;

The notification unit is further configured to notify the client according to the customer sequence.