WO2019095883A1 - 信息生成方法和装置 - Google Patents

信息生成方法和装置 Download PDF

Info

Publication number
WO2019095883A1
WO2019095883A1 PCT/CN2018/109122 CN2018109122W WO2019095883A1 WO 2019095883 A1 WO2019095883 A1 WO 2019095883A1 CN 2018109122 W CN2018109122 W CN 2018109122W WO 2019095883 A1 WO2019095883 A1 WO 2019095883A1
Authority
WO
WIPO (PCT)
Prior art keywords
cluster
coordinates
coordinate
path
information
Prior art date
Application number
PCT/CN2018/109122
Other languages
English (en)
French (fr)
Inventor
樊宇
Original Assignee
北京京东尚科信息技术有限公司
北京京东世纪贸易有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京京东尚科信息技术有限公司, 北京京东世纪贸易有限公司 filed Critical 北京京东尚科信息技术有限公司
Priority to US16/753,765 priority Critical patent/US20200286039A1/en
Publication of WO2019095883A1 publication Critical patent/WO2019095883A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/23—Clustering techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders

Definitions

  • the embodiments of the present invention relate to the field of computer technologies, and particularly relate to the field of Internet technologies, and in particular, to information generation methods and apparatuses.
  • Distributing refers to the logistics activities of picking, processing, packaging, dividing, assembling, etc. of items in accordance with customer requirements in an economically reasonable area, and delivering them to designated locations on time. Distribution is a special and comprehensive form of activity in logistics. It is a close combination of business flow and logistics, including business activities and logistics activities, and also includes a form of several functional elements in logistics.
  • the embodiment of the present application proposes an information generating method and apparatus.
  • an embodiment of the present application provides a method for generating information, including: acquiring order information to be delivered, wherein the order information includes delivery address information; determining coordinates of an address indicated by the delivery address information, and determining an order according to coordinates
  • the information is clustered to generate cluster clusters; the coordinates of the center points matching the coordinates of the preset addresses in each cluster cluster are taken as the starting coordinates of the path, and the following path planning steps are performed: the remaining cluster clusters and the start The coordinate of the coordinate point has the shortest center point coordinate as the second coordinate of the path, wherein the remaining cluster cluster is a cluster cluster other than the cluster cluster of each cluster cluster except the coordinates of the center point as the coordinates of the path; determining the remaining cluster cluster Whether the number reaches a preset threshold; in response to the determination result being YES, generating information indicating the delivery path; in response to the determination result being NO, using the second coordinate as the starting coordinate, and performing the path planning step.
  • the coordinates are latitude and longitude coordinates; and clustering the order information according to the coordinates, comprising: clustering the order information according to the distance between the two coordinates, wherein the distance is the longitude coordinate difference between the two coordinates The sum of the absolute values of the absolute and latitude coordinate differences.
  • the method when there are at least two cluster clusters having the shortest distance from the starting coordinates in the remaining cluster clusters, the method further includes: using the center point coordinates of the at least two cluster clusters as the path number respectively Two coordinates, and performing a path planning step, generating at least two pieces of information for indicating a candidate delivery path; and selecting information from at least two pieces of information for indicating the candidate delivery path as information for indicating the delivery path.
  • the method further includes: calculating an interval duration between two adjacent coordinate points in the path according to the pre-stored historical distribution data, wherein the historical distribution data includes coordinate information collected during the distribution process and collecting the The time of the coordinate information.
  • the order information further includes at least one of the following: commodity information, transaction information, and delivery mode information; and the method further includes: determining a total order of each cluster cluster according to each order information in each cluster cluster Information; determining, according to the total order information of each cluster cluster, the delivery duration of the coordinate points in the path corresponding to the center point coordinates of each cluster cluster.
  • the method further includes: obtaining a departure time of the preset address; determining an estimated arrival time of each coordinate point in the path according to the departure time, the interval duration, and the delivery duration; generating the indication to include the estimated arrival time Information on the delivery path.
  • the order information further includes a target delivery arrival time; and the method further includes: determining a coordinate point in the path corresponding to the cluster cluster to which the order information including the target delivery arrival time belongs, as the adjustment coordinate point; Adjusting the information of the coordinate point in the information indicating the delivery path including the estimated arrival time, generating a path to be adjusted; using the target delivery arrival time as the arrival time of the corresponding adjustment coordinate point, and adjusting the coordinate point according to the order of arrival time Sorting, generating a list of adjusted coordinate points; comparing the arrival time of the adjusted coordinate points in the adjusted coordinate point list with the estimated arrival time of the coordinate points in the path to be adjusted; if the arrival time of the adjusted coordinate points is earlier than the coordinate point
  • the estimated arrival time, the adjustment coordinate point is set as the previous coordinate point of the coordinate point, and according to the arrival time of the adjustment coordinate point, the estimated arrival time of the coordinate point and the subsequent coordinate point is adjusted, and The arrival time of the adjusted coordinate point after adjusting the coordinate point and the coordinate point after the coordinate point
  • the target delivery arrival time is used as the arrival time of the corresponding adjusted coordinate point, including: from at least two order information.
  • the earliest target delivery arrival time is selected as the arrival time of the adjusted coordinate points corresponding to the cluster cluster.
  • the embodiment of the present application provides an information generating apparatus, including: a first acquiring unit configured to acquire order information to be delivered, wherein the order information includes delivery address information; and a clustering unit configured to determine Delivering the coordinates of the address indicated by the address information, and clustering the order information according to the coordinates to generate a cluster cluster;
  • the first execution unit is configured to coordinate the coordinates of the center point of each cluster cluster with the coordinates of the preset address As the starting coordinate of the path, and performing the following path planning step: the center point coordinate of the remaining cluster cluster having the shortest distance from the starting coordinate is taken as the second coordinate of the path, wherein the remaining cluster cluster is in each cluster cluster a cluster cluster other than the cluster cluster of the coordinates of the center point as the coordinates of the path; determining whether the number of remaining cluster clusters reaches a preset threshold; and in response to the judgment result being yes, generating information indicating the delivery path; the response unit,
  • the configuration is configured to use the second coordinate as the starting coordinate in response to the determination result
  • the coordinates are latitude and longitude coordinates
  • the clustering unit is further configured to: cluster the order information according to the distance between the two coordinates, wherein the distance is an absolute value of the longitude coordinate difference between the two coordinates The sum of the absolute values of the latitude coordinate differences.
  • the apparatus when there are at least two cluster clusters having the shortest distance from the starting coordinates in the remaining cluster clusters, the apparatus further includes: a second execution unit configured to use at least two cluster clusters The central point coordinates respectively serve as the second coordinates of the path, and perform a path planning step to generate at least two pieces of information for indicating the candidate delivery path; and a selecting unit configured to select from at least two pieces of information for indicating the candidate delivery path Information as information for indicating the delivery path.
  • the apparatus further includes: a first calculating unit configured to calculate an interval duration between adjacent two coordinate points in the path according to the pre-stored historical distribution data, wherein the historical distribution data includes the delivery process The acquired coordinate information and the time at which the coordinate information was acquired.
  • the order information further includes at least one of the following: merchandise information, transaction information, and delivery method information; and the apparatus further includes: a second calculating unit configured to use each order information in each cluster cluster, The total order information of each cluster cluster is determined; the third calculating unit is configured to determine, according to the total order information of each cluster cluster, the delivery duration of the coordinate points in the path corresponding to the center point coordinates of each cluster cluster.
  • the apparatus is further configured to: obtain a departure time of the preset address; determine an estimated arrival time of each coordinate point in the path according to the departure time, the interval duration, and the delivery duration; and generate an indication for including the estimation Information on the delivery path of the arrival time.
  • the order information further includes a target delivery arrival time; and the apparatus is further configured to: determine a coordinate point in the path corresponding to the cluster cluster to which the order information including the target delivery arrival time belongs, as the adjustment coordinate point; Deleting the information for adjusting the coordinate point in the information indicating the delivery path including the estimated arrival time, generating the path to be adjusted; using the target delivery arrival time as the arrival time of the corresponding adjustment coordinate point, and adjusting according to the order of arrival time
  • the coordinate points are sorted to generate a list of adjusted coordinate points; the arrival time of the adjusted coordinate points in the adjusted coordinate point list is compared with the estimated arrival time of the coordinate points in the path to be adjusted one by one; if the arrival time of the adjusted coordinate points is earlier than
  • the estimated arrival time of the coordinate point is set to the previous coordinate point of the coordinate point, and the estimated arrival time of the coordinate point and the subsequent coordinate point is adjusted according to the arrival time of the adjusted coordinate point.
  • the apparatus when the same cluster cluster includes at least two order information including a target delivery arrival time, the apparatus is further configured to: select the earliest target delivery arrival time from the at least two order information, as the belonging The arrival time of the adjustment coordinate point corresponding to the cluster cluster.
  • an embodiment of the present application provides an electronic device, including: one or more processors; and a storage device, configured to store one or more programs, when one or more programs are executed by one or more processors Having one or more processors implement the method as described in any of the first aspects above.
  • an embodiment of the present application provides a computer readable storage medium having a computer program stored thereon.
  • the computer program is executed by a processor to implement the method as described in any of the above first aspects.
  • the information generating method and device provided by the embodiment of the present application can determine the corresponding address coordinates by acquiring the address information of the order to be delivered, thereby clustering the orders according to the address coordinates to generate different clusters. Then, the coordinates of the center point in each cluster cluster matching the coordinates of the preset address are taken as the starting coordinates of the path, and the following path planning step is performed: the center point coordinate of the remaining cluster cluster having the shortest distance from the starting coordinate The second coordinate of the path, wherein the remaining cluster cluster is a cluster cluster other than the cluster cluster of the cluster clusters except the coordinates of the center point as the coordinates of the path; determining whether the number of remaining cluster clusters reaches a preset threshold; If the determination result is yes, information for indicating the delivery route may be generated; if the determination result is no, the second coordinate may be used as the starting coordinate, and the path planning step may be continued. This will optimize the planned distribution lines and help improve distribution efficiency.
  • FIG. 1 is an exemplary system architecture diagram to which the present application can be applied;
  • FIG. 2 is a flow chart of one embodiment of an information generating method according to the present application.
  • FIG. 3 is a flow chart of still another embodiment of an information generating method according to the present application.
  • FIG. 4 is a schematic diagram of an application scenario of an information generating method according to the present application.
  • FIG. 5 is a schematic structural diagram of an embodiment of an information generating apparatus according to the present application.
  • FIG. 6 is a schematic structural diagram of a computer system suitable for implementing an electronic device of an embodiment of the present application.
  • FIG. 1 illustrates an exemplary system architecture 100 in which an information generating method or information generating apparatus of the present application can be applied.
  • system architecture 100 can include terminals 101, 102, 103, network 104, server 105, and database server 106.
  • the network 104 is used to provide a medium for communication links between the terminals 101, 102, 103, the server 105, and the database server 106.
  • Network 104 may include various types of connections, such as wired, wireless communication links, fiber optic cables, and the like.
  • the user can use the terminals 101, 102, 103 to interact with the server 105, the database server 106 via the network 104 to receive or send messages and the like.
  • Various client applications such as a shopping application, a web browser application, an order delivery application, and a map application may be installed on the terminals 101, 102, and 103.
  • the terminals 101, 102, 103 may be various electronic devices having a display screen including, but not limited to, a smartphone, a tablet, an e-book reader, a laptop portable computer, a desktop computer, and the like.
  • the database server 106 can be a server that provides various services.
  • the database server 106 can store address code files and order information to be delivered.
  • the address code file may include a program for calculating an address code of the address information.
  • the server 105 may also be a server that provides various services, such as a background server that provides support for various applications displayed on the terminals 101, 102, 103.
  • the background server may analyze the address encoded file acquired from the database server 106 and the order information to be delivered, and the like, and may transmit the processing result (for example, information for indicating the delivery route) to the terminals 101, 102, 103. In this way, the user can perform the delivery of the order in accordance with the delivery route displayed by the terminals 101, 102, and 103.
  • the information generating method provided by the embodiment of the present application is generally performed by the server 105. Accordingly, the information generating apparatus is generally disposed in the server 105.
  • system architecture 100 may not set the database server 106 when the server 105 has the functionality of the database server 106.
  • terminals, networks, servers, and database servers in Figure 1 is merely illustrative. Depending on the implementation needs, there can be any number of terminals, networks, servers, and database servers.
  • the information generating method may include the following steps:
  • Step 201 Obtain order information to be delivered.
  • the electronic device (for example, the server 105 shown in FIG. 1) on which the information generating method runs can obtain the order information to be delivered in various ways.
  • the electronic device can obtain order information from a database server (e.g., database server 106 shown in FIG. 1) that is communicatively coupled thereto by a wired connection or a wireless connection.
  • a database server e.g., database server 106 shown in FIG. 1
  • an electronic device can provide support for a shopping-like application on a terminal (eg, terminals 101, 102, 103 shown in FIG. 1). In this way, after the user places an order through the terminal, the electronic device can store the order information, so that the order information can be obtained locally.
  • the order information may include delivery address information.
  • the delivery address information is usually information for indicating a delivery destination, and may include characters such as numbers, letters, characters, and the like. For example, the delivery address information may be a **city** zone.
  • Step 202 Determine coordinates of an address indicated by the delivery address information, and cluster the order information according to the coordinates to generate a cluster cluster.
  • the electronic device may determine the coordinates of the address indicated by the delivery address information according to the delivery address information acquired in step 201.
  • the coordinates usually refer to latitude and longitude coordinates.
  • the electronic device can calculate the distance between the addresses indicated by any two delivery address information according to the value of the coordinates.
  • the order information can be clustered to generate at least one cluster of clusters. It should be noted that the parameters of the cluster (such as the distance threshold) can be set according to actual needs.
  • the distance between addresses can be a linear distance between two addresses. If the latitude and longitude coordinates of the A address are (a, b) and the latitude and longitude coordinates of the B address are (c, d), the distance between the A address and the B address is
  • the distance between the addresses may also be the sum of the absolute value of the longitude coordinate difference between the coordinates of the two addresses and the absolute value of the latitude coordinate difference. If the latitude and longitude coordinates of the A address are (a, b) and the latitude and longitude coordinates of the B address are (c, d), the distance between the A address and the B address is
  • the electronic device may determine the coordinates of the address indicated by the delivery address information by the map application. For example, the electronic device inputs the delivery address information into the map application for searching, thereby obtaining the latitude and longitude coordinates of the address indicated by the delivery address information.
  • the electronic device may perform address coding calculation on the delivery address information according to the address encoding file, obtain an address code of the address indicated by the delivery address information, and further determine a latitude and longitude coordinate of the address encoding.
  • the address encoding file may be stored locally on the electronic device or may be stored on the database server, and the specific storage location is not limited.
  • Step 203 The coordinates of the center point of each cluster cluster matching the coordinates of the preset address are taken as the starting coordinates of the path.
  • the electronic device may use the coordinates of the center point in each cluster cluster that matches the coordinates of the preset address as the starting coordinates of the path.
  • the electronic device may use the coordinates of the center point in the cluster clusters that are the same as the coordinates of the preset address as the starting coordinates of the path.
  • the electronic device may use the center point coordinates of the cluster clusters that meet the preset address (such as 10 meters) as the starting coordinates of the path. That is to say, the coordinates of the center point located near the preset address can be used as the starting coordinates of the path.
  • the preset address may be any address, such as the address of the delivery transfer station or the current address of the delivery person. After determining the starting coordinates of the path, the electronic device can perform the path planning steps of steps 204-206.
  • the indicated address is generally an address located near the preset address.
  • Step 204 The center point coordinate of the remaining cluster cluster having the shortest distance from the starting coordinate is used as the second coordinate of the path.
  • the electronic device may use the center point coordinate of the remaining cluster cluster having the shortest distance from the starting coordinate as the second coordinate of the path.
  • the remaining cluster cluster is a cluster cluster other than the cluster cluster of each cluster cluster except the coordinates of the center point as the coordinates of the path.
  • the distance here can also be the linear distance between the two coordinates, or the sum of the absolute value of the longitude difference between the two coordinates and the absolute value of the latitude difference.
  • the electronic device may be in the remaining cluster cluster (ie, cluster cluster B, In C and D), the coordinates of the center point having the shortest distance from the starting coordinates (the coordinates of the center point of the cluster A) are determined and used as the second coordinates of the path.
  • Step 205 Determine whether the number of remaining cluster clusters reaches a preset threshold.
  • the electronic device can determine whether the number of remaining cluster clusters reaches a preset threshold.
  • the preset threshold is not limited in this application, and may be 0. If the number of remaining cluster clusters reaches a preset threshold, the electronic device may perform step 206. If the number of remaining cluster clusters does not reach the preset threshold, the electronic device may perform step 207.
  • Step 206 In response to the determination result being YES, generating information indicating the delivery path.
  • the delivery path can be used to describe the order in which the coordinates (center coordinates of the clusters) pass.
  • the end point coordinate in the delivery path may be the same as the starting coordinate, that is, the delivery path is a round-trip route; the end point coordinate in the delivery path may also be different from the starting coordinate, that is, the delivery path is a one-way route.
  • the information for indicating the delivery route may include not only the coordinate points indicated by the respective coordinates of the delivery path, but also the order information in the cluster cluster corresponding to each coordinate point.
  • the orders adjacent to the delivery address can be clustered into the same cluster.
  • the delivery personnel can complete the delivery of the orders adjacent to all the delivery addresses on the coordinate point, and then travel to the next coordinate point of the delivery path, thereby avoiding unreasonable route planning. Or the omission of order information and other reasons cause the delivery personnel to travel back and forth between the two coordinate points, affecting the distribution efficiency.
  • the delivery personnel can plan according to their own experience or habits. Since the delivery addresses on the same coordinate point are adjacent, the impact on distribution efficiency is relatively small. Moreover, the number of orders corresponding to each coordinate point is much smaller than the total number of orders to be delivered, which helps the delivery personnel to quickly plan a specific delivery route, thereby improving the distribution efficiency.
  • Step 207 In response to the determination result being No, the second coordinate is taken as the starting coordinate, and the path planning step is performed.
  • the second coordinate may be used as the starting coordinate, and step 204-step is continued.
  • the path planning step of 206 For example, if the number of remaining clusters is not 0, the coordinates in the path do not include the coordinates of the center point of the remaining clusters, that is, the path has not been planned.
  • the electronic device may further set the center point coordinates of the at least two cluster clusters.
  • the second coordinates of the path, respectively, and performing the path planning step generating at least two pieces of information for indicating the candidate delivery path; selecting information from at least two pieces of information for indicating the candidate delivery path as the indication of the delivery path Information.
  • the selection here may be a random selection, or the smallest total length of the candidate delivery paths may be selected therefrom.
  • the information generating method in the present application may also determine an estimated arrival time of each coordinate point in the delivery path, thereby generating information indicating the delivery path including the estimated arrival time.
  • the information generating method in the present application may also determine an estimated arrival time of each coordinate point in the delivery path, thereby generating information indicating the delivery path including the estimated arrival time.
  • the information generating method provided in this embodiment can obtain the corresponding address coordinates by acquiring the address information of the order to be delivered, thereby clustering the orders according to the address coordinates to generate different clusters. Then, the coordinates of the center point in each cluster cluster matching the coordinates of the preset address are taken as the starting coordinates of the path, and the following path planning step is performed: the center point coordinate of the remaining cluster cluster having the shortest distance from the starting coordinate The second coordinate of the path, wherein the remaining cluster cluster is a cluster cluster other than the cluster cluster of the cluster clusters except the coordinates of the center point as the coordinates of the path; determining whether the number of remaining cluster clusters reaches a preset threshold; If the determination result is yes, information for indicating the delivery route may be generated; if the determination result is no, the second coordinate may be used as the starting coordinate, and the path planning step may be continued. This will optimize the planned distribution lines and help improve distribution efficiency.
  • the process 300 may include the following steps in addition to the steps in the process 200:
  • Step 301 Calculate an interval duration between two adjacent coordinate points in the path according to the pre-stored historical distribution data.
  • the electronic device (for example, the server 105 shown in FIG. 1) on which the information generating method runs may calculate two adjacent coordinate points in the delivery path in the generated information according to the pre-stored historical distribution data. The interval between the lengths.
  • the historical distribution data may include coordinate information collected during the delivery process and a time when the coordinate information is collected.
  • the historical distribution data may be stored locally in the electronic device, or may be stored in a terminal (such as the terminals 101, 102, 103 shown in FIG. 1) or a database server (such as the database server 106 shown in FIG. 1).
  • the terminal used by the delivery personnel can use the positioning function to collect coordinate information of the current position (near the delivery address or the delivery address) of the delivery personnel, and record the time for collecting the coordinate information.
  • the average historical interval duration between the two acquired coordinate points can be calculated by statistical analysis. Therefore, the average historical interval duration of the two acquired coordinate points that are the same as the adjacent two coordinate points in the delivery path can be used as the interval duration of the adjacent two coordinate points in the delivery path. In this way, the use of historical distribution data helps to improve the estimation accuracy of the interval duration.
  • the electronic device can determine the interval duration between the two coordinate points according to the distance between the two coordinate points and the preset traveling speed.
  • Step 302 Determine, according to each order information in each cluster cluster, a delivery duration of the coordinate points in the path corresponding to the center point coordinates of each cluster cluster.
  • the order information may further include at least one of the following: commodity information, transaction information, and delivery method information.
  • the electronic device may first determine the total order information of each cluster cluster according to each order information in each cluster cluster. Then, according to the total order information of each cluster cluster, the delivery duration of the coordinate points in the path corresponding to the center point coordinates of each cluster cluster can be determined.
  • the item information may include, but is not limited to, at least one of the following: the weight of the item, the volume of the item, the quantity of the item, and the like.
  • Transaction information can include whether the order has been paid, or the cash on delivery payment method (such as cash or online transactions).
  • Delivery methods can include delivery to a self-reporting cabinet, a mail room, or a recipient's home. It can be understood that if the number of commodities is large, the number of packages may be increased, which will increase the number of delivery personnel. If the weight of the product is heavy or bulky, it is not easy to handle. These will increase the delivery time. Since the cash on delivery order also includes the payment link during the delivery process, it is often more time consuming than the delivery of the paid order. Moreover, different cash on delivery methods and different delivery methods have different delivery times. Taking these factors into account and more in line with the actual delivery situation can help to improve the accuracy of the calculated delivery time.
  • the required order information can be selected according to the actual situation, and the corresponding weights are set, and then the delivery duration of each coordinate point in the path is calculated.
  • a large amount of historical distribution order information can also be used for model training to obtain a delivery duration estimation model.
  • the delivery duration of each coordinate point in the path corresponding to the center point coordinates of each cluster cluster can be estimated, that is, the delivery personnel may be The total elapsed time at this coordinate point.
  • Step 303 Obtain a departure time of the preset address.
  • the electronic device can obtain the departure time of the preset address in multiple manners.
  • the electronic device is positioned by the terminal or other positioning mode used by the delivery personnel, and when the delivery person leaves the preset address, the current time can be recorded, and the time is used as the departure time of the preset address.
  • the departure time of the preset address may be sent by the terminal to the electronic device.
  • the triggering method of sending may be that the delivery personnel touch a certain button on the terminal or the terminal locates that the current location is far from the preset address.
  • the foregoing departure time may be the current time or a preset time.
  • Step 304 Determine an estimated arrival time of each coordinate point in the path according to the departure time, the interval duration, and the delivery duration.
  • the electronic device may determine the estimated arrival time of each coordinate point in the path according to the departure time acquired in step 303, the interval duration in step 301, and the delivery duration in step 302.
  • the estimated arrival time for each coordinate point is mainly the estimated arrival time of the previous coordinate point of the coordinate point, the delivery time length, and the sum of the interval durations between the coordinate point and the previous coordinate point.
  • the estimated arrival time for the second coordinate point in the path is the sum of the departure time of the starting coordinate point (preset address) and the interval time between the starting coordinate point and the second coordinate point.
  • Step 305 generating information indicating the delivery path including the estimated arrival time.
  • the electronic device may generate, according to the information indicating the delivery path generated by the embodiment of FIG. 2 and the estimated arrival time of each coordinate point in the path determined in step 304, to indicate that the estimated arrival time is included. Information on the delivery path.
  • the order information may also include a target delivery arrival time, such as a delivery arrival time specified by the user when placing the order.
  • a target delivery arrival time such as a delivery arrival time specified by the user when placing the order.
  • the electronic device can also perform the following adjustment steps:
  • both the order information B1 and D1 include the target delivery arrival time (such as 11:00 and 10:00 in the morning of the same day), the electronic device can use the coordinate points B and D as the adjustment coordinate points.
  • the electronic device may delete information for indicating coordinate points B and D in the information of the delivery path including the estimated arrival time (in order, coordinate points A, B, C, and D), and generate The path to be adjusted (ie, coordinate points A and C in order).
  • the target delivery arrival time is used as the arrival time of the corresponding adjustment coordinate point, and the adjustment coordinate points are sorted according to the order of arrival time, and a list of adjustment coordinate points is generated.
  • the corresponding relationship between the adjusted coordinate point and the arrival time may be stored in the adjusted coordinate point list.
  • the electronic device may use the target delivery arrival time of 11:00 as the arrival time of the adjustment coordinate point B, and the target delivery arrival time of 10:00 as the arrival time of the adjustment coordinate point D. Since the arrival time of the coordinate point D is earlier than the arrival time of the coordinate point B, the coordinate point D is located in front of the coordinate point B in the generated adjusted coordinate point list.
  • the electronic device may first compare the arrival time of the adjusted coordinate point D in the adjusted coordinate point list with the estimated arrival time of the coordinate points A and D in the path to be adjusted.
  • the to-be-adjusted path includes the coordinate point corresponding to the preset address (ie, the starting coordinate point), such as the coordinate point A
  • the estimated arrival time of the coordinate point A is the departure time (for example, 8:00).
  • the electronic device can compare the arrival time of the adjusted coordinate point in the adjusted coordinate point list with the estimated arrival time of the coordinate point after the starting coordinate point in the path to be adjusted. That is to say, the electronic device can directly compare the arrival time of the adjustment coordinate point D with the estimated arrival time of the coordinate point C. This helps to improve processing efficiency.
  • the electronic device can adjust the coordinate point D as the previous coordinate point of the coordinate point C in the path to be adjusted.
  • the order of the coordinate points in the path to be adjusted is sequentially the coordinate points A, D, and C.
  • the estimated arrival time of the coordinate point C (for example, 10:40) is adjusted.
  • the electronic device can directly compare the arrival time of the adjusted coordinate point B with the estimated arrival time after the coordinate point C is adjusted.
  • the electronic device can adjust the coordinate point B as the next coordinate point of the coordinate point C in the path to be adjusted.
  • the order of the coordinate points in the path to be adjusted is sequentially the coordinate points A, D, C, and B.
  • the electronic device can generate information indicating the adjusted delivery path (in order, coordinate points A, D, C, and B), and the information includes the estimated arrival time of each coordinate point in the adjusted delivery path ( 8:00, 10:00, 10:40, and 11:00).
  • the electronic device may select the earliest target delivery arrival time from the at least two order information, as the corresponding cluster cluster corresponding. Adjust the arrival time of the coordinate point.
  • the arrival time for the adjustment coordinate point B may be 11 earlier than the target delivery arrival time: 00.
  • the electronic device may further send the estimated arrival time of each coordinate point to the user corresponding to the order information in the corresponding cluster cluster.
  • the estimated arrival time of each coordinate point may be updated to the logistics information of the order information in the corresponding cluster cluster. In this way, the ordering user can be made aware of the possible delivery time of the order (ie estimated arrival time), thereby improving the user experience.
  • the information generating method provided in this embodiment can be compared with the embodiment corresponding to FIG. 2, in addition to generating information for indicating the delivery route, to optimize the planning of the delivery route, and improving the delivery efficiency, the information may also include the delivery path. Estimated arrival time for each coordinate point in the middle. At the same time, the delivery arrival time (target delivery arrival time) that has been set will be considered in the delivery arrival time estimation, so that both the line and the time are taken into consideration. Thereby improving the accuracy of the delivery arrival time and improving the user experience.
  • FIG. 4 is a schematic diagram of an application scenario of the information processing method according to the embodiments of FIG. 2 and FIG.
  • the delivery personnel can transmit the delivery route generation request 411 using the terminal 41 used.
  • the server 42 may first acquire all the order information 421 to be delivered by the delivery personnel, thereby performing clustering according to the coordinates of the address indicated by the delivery address information. Then, the center point coordinates of each cluster cluster matching the coordinates of the preset address are taken as the starting coordinates of the path, and the path planning step is performed to generate information 422 for indicating the delivery path.
  • the server 42 can determine the interval duration between adjacent two coordinate points in the path and the delivery duration of each coordinate point based on the historical delivery data 423 and the order information 421, respectively. Thereafter, based on the departure time 424 of the preset address, the estimated arrival time of each coordinate point in the path can be determined. Finally, the server 42 may generate information 425 indicating the delivery path containing the estimated time of arrival and send the information 425 to the terminal 41. In this way, the delivery personnel can perform order delivery based on the information displayed on the terminal 41.
  • the present application provides an embodiment of an information generating apparatus.
  • the device embodiment corresponds to the method embodiment shown in FIG. 2, and the device can be specifically applied to various electronic devices.
  • the information generating apparatus 500 of this embodiment may include: a first obtaining unit 501 configured to acquire order information to be delivered, wherein the order information includes delivery address information; and a clustering unit 502 configured to use Determining the coordinates of the address indicated by the delivery address information, and clustering the order information according to the coordinates to generate a cluster cluster; the first execution unit 503 is configured to match the coordinates of each cluster cluster with the coordinates of the preset address The point coordinate is used as the starting coordinate of the path, and the following path planning step is performed: the center point coordinate of the remaining cluster cluster having the shortest distance from the starting coordinate is taken as the second coordinate of the path, wherein the remaining cluster cluster is each cluster a cluster cluster other than the cluster cluster in which the coordinates of the center point are the coordinates of the path; determining whether the number of remaining cluster clusters reaches a preset threshold; and in response to the judgment result being yes, generating information indicating the delivery path; The unit 504 is configured to use the second coordinate as the starting coordinate in response
  • step 201 the specific implementation manners of the first obtaining unit 501, the clustering unit 502, the first executing unit 503, and the response unit 504, and the beneficial effects generated by the first obtaining unit 501, the first obtaining unit 503, and the response unit 504, may be respectively referred to step 201 in the embodiment shown in FIG.
  • step 202, step 203 - step 206 and step 207 are not described herein again.
  • the coordinates may be latitude and longitude coordinates.
  • the clustering unit 502 may be further configured to: cluster the order information according to the distance between the two coordinates, wherein the distance is an absolute value of the longitude coordinate difference between the two coordinates and an absolute value of the latitude coordinate difference with.
  • the apparatus 500 may further include: a second execution unit (not shown) configured to The center point coordinates of the at least two cluster clusters respectively serve as the second coordinates of the path, and perform a path planning step to generate at least two pieces of information for indicating the candidate delivery path; a selection unit (not shown) configured for Information is selected from at least two pieces of information for indicating a candidate delivery path as information for indicating a delivery route.
  • a second execution unit (not shown) configured to The center point coordinates of the at least two cluster clusters respectively serve as the second coordinates of the path, and perform a path planning step to generate at least two pieces of information for indicating the candidate delivery path
  • a selection unit (not shown) configured for Information is selected from at least two pieces of information for indicating a candidate delivery path as information for indicating a delivery route.
  • the apparatus 500 may further include: a first calculating unit (not shown) configured to calculate an interval duration between adjacent two coordinate points in the path according to the pre-stored historical distribution data, wherein the history
  • the delivery data includes coordinate information collected during the delivery process and the time at which the coordinate information is acquired.
  • the order information may further include at least one of the following: item information, transaction information, and delivery mode information; and the apparatus 500 may further include: a second calculation unit (not shown) configured to be configured according to each Each order information in the cluster is used to determine total order information of each cluster cluster; a third calculating unit (not shown) is configured to determine the center of each cluster according to total order information of each cluster cluster The delivery time of the coordinate points in the path corresponding to the point coordinates.
  • the apparatus 500 may be further configured to: obtain a departure time of a preset address; determine an estimated arrival time of each coordinate point in the path according to a departure time, an interval duration, and a delivery duration; and generate an indication to include an estimated arrival Information on the delivery path of time.
  • the order information may further include a target delivery arrival time; and the apparatus 500 may be further configured to: determine coordinate points in the path corresponding to the cluster cluster to which the order information including the target delivery arrival time belongs, as an adjustment Coordinate point; delete the information for adjusting the coordinate point in the information indicating the delivery path including the estimated arrival time, and generate the path to be adjusted; use the target delivery arrival time as the arrival time of the corresponding adjustment coordinate point, and according to the arrival time Sorting the adjusted coordinate points sequentially, generating a list of adjusted coordinate points; comparing the arrival time of the adjusted coordinate points in the adjusted coordinate point list with the estimated arrival time of the coordinate points in the path to be adjusted; if the adjustment of the coordinate point is reached If the time is earlier than the estimated arrival time of the coordinate point, the adjusted coordinate point is set as the previous coordinate point of the coordinate point, and the estimation of the coordinate point and the subsequent coordinate point is adjusted according to the arrival time of the adjusted coordinate point.
  • the predicted arrival time after the adjustment of the point and the subsequent coordinate point is compared one by one until all the adjustment coordinate points in the adjustment coordinate point list are set as the coordinate points in the path to be adjusted, and information for indicating the adjusted delivery path is generated. .
  • the apparatus 500 may be further configured to: select the earliest target delivery arrival time from the at least two order information, as the belonging The arrival time of the adjustment coordinate point corresponding to the cluster cluster.
  • FIG. 6 a block diagram of a computer system 600 suitable for use in implementing the electronic device of the embodiments of the present application is shown.
  • the electronic device shown in FIG. 6 is merely an example, and should not impose any limitation on the function and scope of use of the embodiments of the present application.
  • computer system 600 includes a central processing unit (CPU) 601 that can be loaded into a program in random access memory (RAM) 603 according to a program stored in read only memory (ROM) 602 or from storage portion 608. And perform various appropriate actions and processes.
  • RAM random access memory
  • ROM read only memory
  • RAM random access memory
  • various programs and data required for the operation of the system 600 are also stored.
  • the CPU 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604.
  • An input/output (I/O) interface 605 is also coupled to bus 604.
  • the following components are connected to the I/O interface 605: an input portion 606 including a touch screen, a keyboard, a mouse, etc.; an output portion 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and a speaker; storage including a hard disk or the like Portion 608; and a communication portion 609 including a network interface card such as a LAN card, modem, or the like.
  • the communication section 609 performs communication processing via a network such as the Internet.
  • Driver 610 is also coupled to I/O interface 605 as needed.
  • a removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like, is mounted on the drive 610 as needed so that a computer program read therefrom is installed into the storage portion 608 as needed.
  • an embodiment of the present disclosure includes a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for executing the method illustrated in the flowchart.
  • the computer program can be downloaded and installed from the network via communication portion 609, and/or installed from removable media 611.
  • the computer program is executed by the central processing unit (CPU) 601
  • the above-described functions defined in the method of the present application are performed.
  • the computer readable medium of the present application may be a computer readable signal medium or a computer readable storage medium or any combination of the two.
  • the computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing.
  • a computer readable storage medium may be any tangible medium that can contain or store a program, which can be used by or in connection with an instruction execution system, apparatus or device.
  • a computer readable signal medium may include a data signal that is propagated in the baseband or as part of a carrier, carrying computer readable program code. Such propagated data signals can take a variety of forms including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer readable signal medium can also be any computer readable medium other than a computer readable storage medium, which can transmit, propagate, or transport a program for use by or in connection with the instruction execution system, apparatus, or device.
  • Program code embodied on a computer readable medium can be transmitted by any suitable medium, including but not limited to wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
  • each block of the flowchart or block diagram can represent a module, a program segment, or a portion of code that includes one or more of the logic functions for implementing the specified.
  • Executable instructions can also occur in a different order than that illustrated in the drawings. For example, two successively represented blocks may in fact be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented in a dedicated hardware-based system that performs the specified function or operation. Or it can be implemented by a combination of dedicated hardware and computer instructions.
  • the units involved in the embodiments of the present application may be implemented by software or by hardware.
  • the described unit may also be disposed in the processor, for example, as a processor including a first acquisition unit, a clustering unit, a first execution unit, and a response unit.
  • the name of these units does not constitute a limitation on the unit itself in some cases.
  • the first obtaining unit may also be described as “a unit that acquires order information to be delivered”.
  • the present application further provides a computer readable medium, which may be included in an electronic device described in the above embodiments, or may be separately present without being assembled into the electronic device.
  • the computer readable medium carries one or more programs, when the one or more programs are executed by the electronic device, causing the electronic device to: acquire order information to be delivered, wherein the order information includes delivery address information; The coordinates of the address indicated by the address information, and clustering the order information according to the coordinates to generate a cluster cluster; the coordinates of the center point of each cluster cluster matching the coordinates of the preset address are taken as the starting coordinates of the path, and are executed The following path planning step: the center point coordinate of the remaining cluster cluster having the shortest distance from the starting coordinate is used as the second coordinate of the path, wherein the remaining cluster cluster is the coordinates of the cluster point except the coordinates of the center point.
  • Clustering clusters other than the clustering cluster determining whether the number of remaining clustering clusters reaches a preset threshold; generating responsive to the determination result, generating information for indicating the delivery route; and responsive to the determining result being no, using the second coordinate as Start coordinates and perform path planning steps.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Data Mining & Analysis (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • Evolutionary Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本申请实施例公开了信息生成方法和装置。该方法的一具体实施方式包括：获取待配送的订单信息，其中，订单信息包括配送地址信息；确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇；将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标；判断剩余聚类簇的数目是否达到预设阈值；响应于判断结果为是，生成用于指示配送路径的信息；响应于判断结果为否，将第二坐标作为起始坐标，并执行路径规划步骤。该实施方式有助于优化配送线路，从而提高配送效率。

Description

信息生成方法和装置
相关申请的交叉引用
本专利申请要求于2017年11月20日提交的、申请号为201711156281.X、申请人为北京京东尚科信息技术有限公司和北京京东世纪贸易有限公司、发明名称为“信息生成方法和装置”的中国专利申请的优先权，该申请的全文以引用的方式并入本申请中。
技术领域
本申请实施例涉及计算机技术领域，具体涉及互联网技术领域，尤其涉及信息生成方法和装置。
背景技术
配送是指在经济合理区域范围内，根据客户要求，对物品进行拣选、加工、包装、分割、组配等作业，并按时送达指定地点的物流活动。配送是物流中一种特殊的、综合的活动形式，是商流与物流紧密结合，包含了商流活动和物流活动，也包含了物流中若干功能要素的一种形式。
发明内容
本申请实施例提出了信息生成方法和装置。
第一方面，本申请实施例提供了一种信息生成方法，包括：获取待配送的订单信息，其中，订单信息包括配送地址信息；确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇；将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判 断剩余聚类簇的数目是否达到预设阈值；响应于判断结果为是，生成用于指示配送路径的信息；响应于判断结果为否，将第二坐标作为起始坐标，并执行路径规划步骤。
在一些实施例中，坐标为经纬度坐标；以及根据坐标对订单信息进行聚类，包括：根据两坐标之间的距离对订单信息进行聚类，其中，距离为两坐标之间的经度坐标差的绝对值与纬度坐标差的绝对值之和。
在一些实施例中，当剩余聚类簇中存在至少两个与起始坐标的距离最短的聚类簇时，该方法还包括：将至少两个聚类簇的中心点坐标分别作为路径的第二坐标，并执行路径规划步骤，生成至少两个用于指示候选配送路径的信息；从至少两个用于指示候选配送路径的信息中选取信息，作为用于指示配送路径的信息。
在一些实施例中，该方法还包括：根据预存的历史配送数据，计算路径中相邻两个坐标点之间的间隔时长，其中，历史配送数据包括配送过程中所采集的坐标信息和采集该坐标信息的时间。
在一些实施例中，订单信息还包括以下至少一项：商品信息、交易信息和配送方式信息；以及该方法还包括：根据各聚类簇中的各订单信息，确定各聚类簇的总订单信息；根据各聚类簇的总订单信息，确定各聚类簇的中心点坐标对应的路径中的坐标点的配送时长。
在一些实施例中，该方法还包括：获取预设地址的出发时间；根据出发时间、间隔时长和配送时长，确定路径中各坐标点的预估到达时间；生成用于指示包含预估到达时间的配送路径的信息。
在一些实施例中，订单信息还包括目标配送到达时间；以及该方法还包括：确定包括目标配送到达时间的订单信息所属的聚类簇对应的路径中的坐标点，作为调整坐标点；删除用于指示包含预估到达时间的配送路径的信息中调整坐标点的信息，生成待调整路径；将目标配送到达时间作为对应的调整坐标点的到达时间，并根据到达时间的先后顺序对调整坐标点进行排序，生成调整坐标点列表；将调整坐标点列表中的调整坐标点的到达时间与待调整路径中的坐标点的预估到达时间进行逐一比较；若调整坐标点的到达时间早于坐标点的预估到达时间，则将该调整坐标点设置为该坐标点的前一坐标点，并根据该 调整坐标点的到达时间，调整该坐标点及之后的坐标点的预估到达时间，且将该调整坐标点之后的调整坐标点的到达时间与该坐标点及之后的坐标点调整后的预估到达时间进行逐一比较，直至调整坐标点列表中的所有调整坐标点均设置为待调整路径中的坐标点，生成用于指示调整后的配送路径的信息。
在一些实施例中，当同一聚类簇中包含至少两个包括目标配送到达时间的订单信息时，将目标配送到达时间作为对应的调整坐标点的到达时间，包括：从至少两个订单信息中选取最早的目标配送到达时间，作为所属聚类簇对应的调整坐标点的到达时间。
第二方面，本申请实施例提供了一种信息生成装置，包括：第一获取单元，配置用于获取待配送的订单信息，其中，订单信息包括配送地址信息；聚类单元，配置用于确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇；第一执行单元，配置用于将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判断剩余聚类簇的数目是否达到预设阈值；响应于判断结果为是，生成用于指示配送路径的信息；响应单元，配置用于响应于判断结果为否，将第二坐标作为起始坐标，并执行路径规划步骤。
在一些实施例中，坐标为经纬度坐标，以及聚类单元进一步配置用于：根据两坐标之间的距离对订单信息进行聚类，其中，距离为两坐标之间的经度坐标差的绝对值与纬度坐标差的绝对值之和。
在一些实施例中，当剩余聚类簇中存在至少两个与起始坐标的距离最短的聚类簇时，该装置还包括：第二执行单元，配置用于将至少两个聚类簇的中心点坐标分别作为路径的第二坐标，并执行路径规划步骤，生成至少两个用于指示候选配送路径的信息；选取单元，配置用于从至少两个用于指示候选配送路径的信息中选取信息，作为用于指示配送路径的信息。
在一些实施例中，该装置还包括：第一计算单元，配置用于根据 预存的历史配送数据，计算路径中相邻两个坐标点之间的间隔时长，其中，历史配送数据包括配送过程中所采集的坐标信息和采集该坐标信息的时间。
在一些实施例中，订单信息还包括以下至少一项：商品信息、交易信息和配送方式信息；以及该装置还包括：第二计算单元，配置用于根据各聚类簇中的各订单信息，确定各聚类簇的总订单信息；第三计算单元，配置用于根据各聚类簇的总订单信息，确定各聚类簇的中心点坐标对应的路径中的坐标点的配送时长。
在一些实施例中，该装置还配置用于：获取预设地址的出发时间；根据出发时间、间隔时长和配送时长，确定路径中各坐标点的预估到达时间；生成用于指示包含预估到达时间的配送路径的信息。
在一些实施例中，订单信息还包括目标配送到达时间；以及该装置还配置用于：确定包括目标配送到达时间的订单信息所属的聚类簇对应的路径中的坐标点，作为调整坐标点；删除用于指示包含预估到达时间的配送路径的信息中调整坐标点的信息，生成待调整路径；将目标配送到达时间作为对应的调整坐标点的到达时间，并根据到达时间的先后顺序对调整坐标点进行排序，生成调整坐标点列表；将调整坐标点列表中的调整坐标点的到达时间与待调整路径中的坐标点的预估到达时间进行逐一比较；若调整坐标点的到达时间早于坐标点的预估到达时间，则将该调整坐标点设置为该坐标点的前一坐标点，并根据该调整坐标点的到达时间，调整该坐标点及之后的坐标点的预估到达时间，且将该调整坐标点之后的调整坐标点的到达时间与该坐标点及之后的坐标点调整后的预估到达时间进行逐一比较，直至调整坐标点列表中的所有调整坐标点均设置为待调整路径中的坐标点，生成用于指示调整后的配送路径的信息。
在一些实施例中，当同一聚类簇中包含至少两个包括目标配送到达时间的订单信息时，该装置进一步配置用于：从至少两个订单信息中选取最早的目标配送到达时间，作为所属聚类簇对应的调整坐标点的到达时间。
第三方面，本申请实施例提供了一种电子设备，包括：一个或多 个处理器；存储装置，用于存储一个或多个程序，当一个或多个程序被一个或多个处理器执行，使得一个或多个处理器实现如上述第一方面中任一实施例所描述的方法。
第四方面，本申请实施例提供了一种计算机可读存储介质，其上存储有计算机程序。该计算机程序被处理器执行时实现如上述第一方面中任一实施例所描述的方法。
本申请实施例提供的信息生成方法和装置，通过获取待配送订单的地址信息，可以确定对应的地址坐标，从而根据地址坐标对订单进行聚类，生成不同的聚类簇。然后，将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判断剩余聚类簇的数目是否达到预设阈值；若判断结果为是，则可以生成用于指示配送路径的信息；若判断结果为否，则可以将第二坐标作为起始坐标，并继续执行上述路径规划步骤。这样可以使规划出的配送线路更加优化，从而有助于提高配送效率。
附图说明
通过阅读参照以下附图所作的对非限制性实施例所作的详细描述，本申请的其它特征、目的和优点将会变得更明显：
图1是本申请可以应用于其中的示例性系统架构图；
图2是根据本申请的信息生成方法的一个实施例的流程图；
图3是根据本申请的信息生成方法的又一个实施例的流程图；
图4是根据本申请的信息生成方法的一个应用场景的示意图；
图5是根据本申请的信息生成装置的一个实施例的结构示意图；
图6是适于用来实现本申请实施例的电子设备的计算机系统的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释相关发明，而非对该发明的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与有关发明相关的部分。
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本申请。
图1示出了可以应用本申请的信息生成方法或信息生成装置的示例性系统架构100。
如图1所示，系统架构100可以包括终端101、102、103，网络104，服务器105和数据库服务器106。网络104用以在终端101、102、103，服务器105和数据库服务器106三者之间提供通信链路的介质。网络104可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
用户可以使用终端101、102、103可以通过网络104与服务器105、数据库服务器106进行交互，以接收或发送消息等。终端101、102、103上可以安装有各种客户端应用，例如购物类应用、网页浏览器应用、订单配送应用和地图应用等。
终端101、102、103可以是具有显示屏的各种电子设备，包括但不限于智能手机、平板电脑、电子书阅读器、膝上型便携计算机和台式计算机等等。
数据库服务器106可以是提供各种服务的服务器，例如数据库服务器106上可以存储有地址编码文件和待配送的订单信息。其中，地址编码文件可以记载有用于计算地址信息的地址编码的程序。
服务器105也可以是提供各种服务的服务器，例如对终端101、102、103上显示的各种应用提供支持的后台服务器。后台服务器可以对从数据库服务器106获取的地址编码文件和待配送的订单信息进行分析等处理，并且可以将处理结果(例如用于指示配送路径的信息)发送给终端101、102、103。这样，用户可以按照终端101、102、103显示的配送路径进行订单的配送。
需要说明的是，本申请实施例所提供的信息生成方法一般由服务器105执行，相应地，信息生成装置一般设置于服务器105中。
需要指出的是，当服务器105具有数据库服务器106的功能时，系统架构100可以不设置数据库服务器106。
应该理解，图1中的终端、网络、服务器和数据库服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的终端、网络、服务器和数据库服务器。
继续参考图2，其示出了根据本申请的信息生成方法的一个实施例的流程200。该信息生成方法可以包括以下步骤：
步骤201，获取待配送的订单信息。
在本实施例中，信息生成方法运行于其上的电子设备(例如图1所示的服务器105)可以通过多种方式来获取待配送的订单信息。例如，电子设备可以通过有线连接方式或无线连接方式，从与其通信连接的数据库服务器(例如图1所示的数据库服务器106)中获取订单信息。再例如，电子设备可以对终端(例如图1所示的终端101、102、103)上的购物类应用提供支持。这样，当用户通过终端下单后，电子设备可以对订单信息进行存储，从而可以从本地获取订单信息。其中，订单信息可以包括配送地址信息。配送地址信息通常是用于指示配送目的地的信息，可以包括数字、字母、文字等字符。例如配送地址信息可以为**市**区**小区。
步骤202，确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇。
在本实施例中，电子设备可以根据步骤201获取的配送地址信息，来确定配送地址信息所指示的地址的坐标。在这里，坐标通常是指经纬度坐标。然后，电子设备根据坐标的值，可以计算任意两个配送地址信息所指示的地址之间的距离。根据地址之间的距离，可以对订单信息进行聚类，从而生成至少一个聚类簇。需要说明的是，聚类的参数(如距离阈值)可以根据实际需求设置。
作为示例，地址之间的距离可以是两地址之间的直线距离。如A地址的经纬度坐标为(a，b)，B地址的经纬度坐标为(c，d)，则A地 址与B地址之间的距离为
Figure PCTCN2018109122-appb-000001
可选地，地址之间的距离还可以是两地址的坐标之间的经度坐标差的绝对值与纬度坐标差的绝对值之和。如A地址的经纬度坐标为(a，b)，B地址的经纬度坐标为(c，d)，则A地址与B地址之间的距离为|a-c|+|b-d|。可以理解的是，配送人员在配送过程中，往往不是沿两地址之间的直线距离行驶，即行驶的路线通常为折线。所以采用这种方法来计算两地址之间的距离更加符合实际情况。
在本实施例的一些可选地实现方式中，电子设备可以通过地图应用来确定配送地址信息所指示的地址的坐标。如电子设备将配送地址信息输入到地图应用中进行搜索，从而得到配送地址信息所指示的地址的经纬度坐标。
可选地，电子设备也可以根据地址编码文件，对配送地址信息进行地址编码计算，得到配送地址信息所指示的地址的地址编码，进而可以确定该地址编码的经纬度坐标。地址编码文件可以存储在电子设备本地，也可以存储在数据库服务器上，具体存储位置不限定。
步骤203，将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标。
在本实施例中，电子设备可以将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标。例如，电子设备可以将各聚类簇中与预设地址的坐标相同的中心点坐标作为路径的起始坐标。再例如，电子设备可以将各聚类簇中与预设地址的坐标的距离满足预设阈值(如10米)的中心点坐标作为路径的起始坐标。也就是说，可以将位于预设地址附近的中心点坐标作为路径的起始坐标。其中，预设地址可以是任意地址，如配送中转站的地址或配送人员的当前地址等。在确定路径的起始坐标后，电子设备可以执行步骤204-步骤206的路径规划步骤。
可以理解的是，若某聚类簇的中心点坐标与预设地址的坐标相同，或位于预设地址的坐标附近，那么该聚类簇中的其他坐标(除去中心点坐标以外的坐标)所指示的地址一般都是位于该预设地址附近的地址。
步骤204，将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标。
在本实施例中，电子设备可以将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标。其中，剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇。这里的距离同样可以是两坐标之间的直线距离，也可以是两坐标之间的经度差的绝对值与纬度差的绝对值之和。
作为示例，若电子设备将聚类簇A、B、C和D中的聚类簇A的中心点坐标作为路径的起始坐标，那么电子设备可以在剩余聚类簇(即聚类簇B、C和D)中，确定与起始坐标(聚类簇A的中心点坐标)的距离最短的中心点坐标，并将其作为路径的第二坐标。
步骤205，判断剩余聚类簇的数目是否达到预设阈值。
在本实施例中，电子设备在每次确定了路径的下一个坐标后，可以判断剩余聚类簇的数目是否达到预设阈值。其中，预设阈值在本申请中不限制，如可以为0。如果剩余聚类簇的数目达到预设阈值，则电子设备可以执行步骤206。如果剩余聚类簇的数目没有达到预设阈值，则电子设备可以执行步骤207。
可以理解的是，如果剩余聚类簇的数目为0，说明已将所有聚类簇的中心点坐标作为路径的坐标。也就是说，通过该路径可以完成所有待配送的订单的配送任务。
步骤206，响应于判断结果为是，生成用于指示配送路径的信息。
在本实施例中，若电子设备在步骤205的判断结果为是，即剩余聚类簇的数目达到预设阈值，则可以生成用于指示配送路径的信息。配送路径可以用于描述经过各坐标(聚类簇的中心点坐标)的先后顺序。其中，配送路径中的终点坐标可以与起始坐标相同，即配送路径为往返路线；配送路径中的终点坐标也可以与起始坐标不同，即配送路径为单程路线。在这里，用于指示配送路径的信息不仅可以包括配送路径的各坐标指示的坐标点，还可以包括各坐标点对应的聚类簇中的订单信息。
可以理解的是，通过坐标对订单信息进行聚类后，可以将配送地 址相邻的订单聚类为同一聚类簇。这样，对于配送路径的每个坐标点，配送人员可以将该坐标点上的所有配送地址相邻的订单配送完成后，再行驶到配送路径的下一个坐标点，从而避免因线路规划不合理，或订单信息遗漏等原因导致配送人员在两个坐标点间往返，影响配送效率。另外，对于配送路径的每个坐标点上的具体配送路径，配送人员可以根据个人经验或习惯自行规划。由于同一坐标点上的配送地址相邻，所以对配送效率的影响相对较小。而且每个坐标点对应的订单的数量也会远小于待配送订单的总体数量，这样有助于配送人员可以快速地规划出具体的配送路径，从而提高配送效率。
步骤207，响应于判断结果为否，将第二坐标作为起始坐标，并执行路径规划步骤。
在本实施例中，若电子设备在步骤205中的判断结果为否，即剩余聚类簇的数目没有达到预设阈值，则可以将第二坐标作为起始坐标，并继续执行步骤204-步骤206的路径规划步骤。例如，若剩余聚类簇的数目不为0，说明路径中的坐标没有包括剩余聚类簇的中心点坐标，即路径还没有规划完成。
在本实施例的一些可选地实现方式，当剩余聚类簇中存在至少两个与起始坐标的距离最短的聚类簇时，电子设备还可以将至少两个聚类簇的中心点坐标分别作为路径的第二坐标，并执行上述路径规划步骤，生成至少两个用于指示候选配送路径的信息；从至少两个用于指示候选配送路径的信息中选取信息，作为用于指示配送路径的信息。这里的选取可以是随机选取，也可以是从中选取候选配送路径的总长度最小的。
进一步地，本申请中的信息生成方法还可以确定配送路径中每个坐标点的预估到达时间，从而生成用于指示包含预估到达时间的配送路径的信息。具体可以参见图3所示实施例中的相关描述，此处不再赘述。
本实施例提供的信息生成方法，通过获取待配送订单的地址信息，可以确定对应的地址坐标，从而根据地址坐标对订单进行聚类，生成不同的聚类簇。然后，将各聚类簇中与预设地址的坐标匹配的中心点 坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判断剩余聚类簇的数目是否达到预设阈值；若判断结果为是，则可以生成用于指示配送路径的信息；若判断结果为否，则可以将第二坐标作为起始坐标，并继续执行上述路径规划步骤。这样可以使规划出的配送线路更加优化，从而有助于提高配送效率。
进一步参见图3，其示出了本申请提供的信息生成方法的又一个实施例的流程300。该流程300除了包括流程200中的步骤外，还可以包括以下步骤：
步骤301，根据预存的历史配送数据，计算路径中相邻两个坐标点之间的间隔时长。
在本实施例，信息生成方法运行于其上的电子设备(例如图1所示的服务器105)可以根据预存的历史配送数据，计算上述生成的信息中的配送路径中相邻两个坐标点之间的间隔时长。其中，历史配送数据可以包括配送过程中所采集的坐标信息和采集该坐标信息的时间。在这里，历史配送数据可以存储在电子设备本地，也可以存储在终端(例如图1所示的终端101、102、103)或数据库服务器(例如图1所示的数据库服务器106)。
例如，配送人员在订单配送过程中，其所使用的终端可以利用定位功能采集配送人员当前位置(配送地址或配送地址附近)的坐标信息，并记录采集该坐标信息的时间。这样，通过统计分析可以计算所采集的两个坐标点之间的平均历史间隔时长。从而可以将与配送路径中相邻两个坐标点分别相同的所采集的两个坐标点的平均历史间隔时长作为配送路径中相邻两个坐标点的间隔时长。这样，利用历史配送数据有助于提高间隔时长的预估准确度。
需要说明的是，对于新的配送地址，由于历史配送数据中缺少相关的数据，所以电子设备可以根据两坐标点之间的距离和预设行驶速度，来确定两坐标点之间的间隔时长。
步骤302，根据各聚类簇中的各订单信息，确定各聚类簇的中心 点坐标对应的路径中的坐标点的配送时长。
在本实施例中，订单信息还可以包括以下至少一项：商品信息、交易信息和配送方式信息。此时，电子设备首先可以根据各聚类簇中的各订单信息，确定各聚类簇的总订单信息。然后可以根据各聚类簇的总订单信息，确定各聚类簇的中心点坐标对应的路径中的坐标点的配送时长。
在本实施例中，商品信息可以包括(但不限于)以下至少一项：商品的重量、商品的体积、商品的数量等。交易信息可以包括订单是否已付款、货到付款的付款方式(如现金或网上交易)。配送方式可以包括配送至自提柜、收发室或收件人家中等。可以理解的是，若商品的数量较多，可能会增加包裹的数量，这就会增加配送人员的搬运次数。若商品的重量较重或体积较大，这样不便于搬运。这些都会增加配送时长。由于货到付款的订单在配送过程中还包括支付环节，所以往往要比已付款的订单的配送耗时要多。而且不同的货到付款方式以及不同的配送方式，花费的配送时长也不同。考虑这些因素，更加符合实际配送情况，可以有助于提高计算得到的配送时长的准确度。
在这里，可以根据实际情况来选取所需的订单信息，并设置相应的权值，进而计算得到路径中的每个坐标点的配送时长。作为示例，还可以利用大量的历史配送订单信息进行模型训练，得到配送时长预估模型。这样，将各聚类簇中的订单信息输入该配送时长预估模型后，可以预估出各聚类簇的中心点坐标所对应的路径中的各坐标点的配送时长，即配送人员可能在该坐标点上的总耗时长。
步骤303，获取预设地址的出发时间。
在本实施例中，电子设备可以通过多种方式来获取预设地址的出发时间。例如电子设备通过配送人员所使用的终端或其他定位方式进行定位，发现配送人员离开预设地址时，可以记录当前的时间，并将该时间作为预设地址的出发时间。再例如上述预设地址的出发时间可以是终端发送给电子设备的。发送的触发方式可以是配送人员触碰该终端上的某按键或者终端定位到当前位置已远离预设地址。需要说明的是，上述出发时间可以是当前时间，也可以是预设时间。
步骤304，根据出发时间、间隔时长和配送时长，确定路径中各坐标点的预估到达时间。
在本实施例中，电子设备可以根据步骤303获取的出发时间、步骤301中的间隔时长以及步骤302中的配送时长，来确定路径中的各坐标点的预估到达时间。对于每个坐标点的预估到达时间主要为该坐标点的前一坐标点的预估到达时间、配送时长以及该坐标点与前一坐标点之间的间隔时长的总和。对于路径中的第二坐标点的预估到达时间为起始坐标点(预设地址)的出发时间与起始坐标点和第二坐标点之间的间隔时长的总和。
步骤305，生成用于指示包含预估到达时间的配送路径的信息。
在本实施例中，电子设备可以根据图2实施例生成的用于指示配送路径的信息和步骤304中确定的该路径中各坐标点的预估到达时间，生成用于指示包含预估到达时间的配送路径的信息。
在本实施例的一些可选地实现方式中，订单信息还可以包括目标配送到达时间，如用户在下单时指定的配送到达时间。此时，电子设备还可以进行如下调整步骤：
1)、确定包括目标配送到达时间的订单信息所属的聚类簇对应的路径中的坐标点，作为调整坐标点。
例如，订单信息A1、A2所属的聚类簇对应路径中的第一个(起始)坐标点A；订单信息B1、B2所属的聚类簇对应路径中的第二个坐标点B；订单信息C1、C2所属的聚类簇对应路径中的第三个坐标点C；订单信息D1、D2所属的聚类簇对应路径中的第四个坐标点D。若订单信息B1和D1中均包括目标配送到达时间(如分别为同日上午的11:00和10:00)，那么电子设备可以将坐标点B和D作为调整坐标点。
2)、删除用于指示包含预估到达时间的配送路径的信息中调整坐标点的信息，生成待调整路径。
例如，对于1)中的示例，电子设备可以将用于指示包含预估到达时间的配送路径(依次为坐标点A、B、C和D)的信息中坐标点B和D的信息删除，生成待调整路径(即依次为坐标点A和C)。
3)、将目标配送到达时间作为对应的调整坐标点的到达时间，并根据到达时间的先后顺序对调整坐标点进行排序，生成调整坐标点列表。其中，调整坐标点列表中可以存储有调整坐标点与到达时间的对应关系。
例如，对于1)中的示例，电子设备可以将目标配送到达时间11:00作为调整坐标点B的到达时间，且将目标配送到达时间10:00作为调整坐标点D的到达时间。由于坐标点D的到达时间比坐标点B的到达时间早，所以在生成的调整坐标点列表中坐标点D位于坐标点B的前面。
4)、将调整坐标点列表中的调整坐标点的到达时间与待调整路径中的坐标点的预估到达时间进行逐一比较。若调整坐标点的到达时间早于坐标点的预估到达时间，则将该调整坐标点设置为该坐标点的前一坐标点，并根据该调整坐标点的到达时间，调整该坐标点及之后的坐标点的预估到达时间，且将该调整坐标点之后的调整坐标点的到达时间与该坐标点及之后的坐标点调整后的预估到达时间进行逐一比较，直至调整坐标点列表中的所有调整坐标点均设置为待调整路径中的坐标点，生成用于指示调整后的配送路径的信息。
例如，对于1)中的示例，电子设备可以先将调整坐标点列表中的调整坐标点D的到达时间与待调整路径中的坐标点A和D的预估到达时间进行逐一比较。需要说明的是，当待调整路径中包含预设地址对应的坐标点(即起始坐标点)时，如坐标点A，由于坐标点A的预估到达时间即为出发时间(如8:00)，所以电子设备可以将调整坐标点列表中的调整坐标点的到达时间与待调整路径中起始坐标点之后的坐标点的预估到达时间进行逐一比较。也就是说，电子设备可以直接将调整坐标点D的到达时间与坐标点C的预估到达时间进行比较。这样，有助于提高处理效率。
假设坐标点C的预估到达时间为10:30。由于10:00早于10:30，所以电子设备可以将调整坐标点D作为待调整路径中坐标点C的前一坐标点。此时，待调整路径中坐标点的顺序依次为坐标点A、D和C。并且根据调整坐标点D的到达时间、配送时长以及调整坐标点D 和坐标点C之间的间隔时长，调整坐标点C的预估到达时间(如10:40)。接着，由于11:00晚于10:00，为了进一步地提高处理效率，电子设备可以将调整坐标点B的到达时间直接与坐标点C调整后的预估到达时间进行比较。由于11:00晚于10:40，所以电子设备可以将调整坐标点B作为待调整路径中坐标点C的后一坐标点。此时，待调整路径中坐标点的顺序依次为坐标点A、D、C和B。这样，电子设备可以生成用于指示调整后的配送路径(依次为坐标点A、D、C和B)的信息，且该信息中包含调整后的配送路径中各坐标点的预估到达时间(依次为8:00、10:00、10:40和11:00)。
需要说明的是，当同一聚类簇中包含至少两个包括目标配送到达时间的订单信息时，电子设备可以从至少两个订单信息中选取最早的目标配送到达时间，作为所属聚类簇对应的调整坐标点的到达时间。
例如，对于1)中的示例，若订单信息B1、B2的目标配送到达时间分别为11:00和12:00，那么对于调整坐标点B的到达时间可以为目标配送到达时间较早的11:00。
可选地，电子设备还可以将各坐标点的预估到达时间发送给对应的聚类簇中的订单信息所对应的用户。或者还可以将各坐标点的预估到达时间更新至对应的聚类簇中的订单信息的物流信息中。这样，可以使下单用户了解订单的可能配送时间(即预估到达时间)，从而提高用户体验。
本实施例提供的信息生成方法，与图2对应的实施例相比，除了可以生成用于指示配送路径的信息，以优化配送路径的规划，提高配送效率以外，该信息中还可以包含配送路径中各坐标点的预估到达时间。同时，在配送到达时间预估上还会考虑已经设定的配送到达时间(目标配送到达时间)，使线路与时间两者兼顾。从而提高配送到达时间的准确度，提高用户体验。
继续参见图4，图4是根据图2和图3实施例的信息处理方法的应用场景的一个示意图。在图4的应用场景中，配送人员可以利用所使用的终端41发送配送路径生成请求411。服务器42在接收到终端41发送的配送路径生成请求411后，首先可以获取该配送人员的所有 待配送的订单信息421，从而根据配送地址信息所指示的地址的坐标进行聚类。然后，将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行路径规划步骤，生成用于指示配送路径的信息422。接着，服务器42可以根据历史配送数据423、订单信息421，分别确定路径中相邻两个坐标点间的间隔时长、各坐标点的配送时长。之后，根据预设地址的出发时间424，可以确定路径中各坐标点的预估到达时间。最后，服务器42可以生成用于指示包含预估到达时间的配送路径的信息425，并将该信息425发送给终端41。这样，配送人员可以根据终端41上显示的信息，进行订单配送。
进一步参见图5，作为对上述各图所示方法的实现，本申请提供了一种信息生成装置的一个实施例。该装置实施例与图2所示的方法实施例相对应，该装置具体可以应用于各种电子设备中。
如图5所示，本实施例的信息生成装置500可以包括：第一获取单元501，配置用于获取待配送的订单信息，其中，订单信息包括配送地址信息；聚类单元502，配置用于确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇；第一执行单元503，配置用于将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判断剩余聚类簇的数目是否达到预设阈值；响应于判断结果为是，生成用于指示配送路径的信息；响应单元504，配置用于响应于判断结果为否，将第二坐标作为起始坐标，并执行路径规划步骤。
在本实施例中，第一获取单元501、聚类单元502、第一执行单元503和响应单元504的具体实现方式及产生的有益效果，可以分别参见图2所示实施例中的步骤201、步骤202、步骤203-步骤206和步骤207的相关描述，此处不再赘述。
在本实施例的一些可选的实现方式中，上述坐标可以为经纬度坐标。此时，聚类单元502可以进一步配置用于：根据两坐标之间的距离对订单信息进行聚类，其中，距离为两坐标之间的经度坐标差的绝 对值与纬度坐标差的绝对值之和。
可选地，当剩余聚类簇中存在至少两个与起始坐标的距离最短的聚类簇时，该装置500还可以包括：第二执行单元(图中未示出)，配置用于将至少两个聚类簇的中心点坐标分别作为路径的第二坐标，并执行路径规划步骤，生成至少两个用于指示候选配送路径的信息；选取单元(图中未示出)，配置用于从至少两个用于指示候选配送路径的信息中选取信息，作为用于指示配送路径的信息。
进一步地，该装置500还可以包括：第一计算单元(图中未示出)，配置用于根据预存的历史配送数据，计算路径中相邻两个坐标点之间的间隔时长，其中，历史配送数据包括配送过程中所采集的坐标信息和采集该坐标信息的时间。
可选地，订单信息还可以包括以下至少一项：商品信息、交易信息和配送方式信息；以及该装置500还可以包括：第二计算单元(图中未示出)，配置用于根据各聚类簇中的各订单信息，确定各聚类簇的总订单信息；第三计算单元(图中未示出)，配置用于根据各聚类簇的总订单信息，确定各聚类簇的中心点坐标对应的路径中的坐标点的配送时长。
作为示例，该装置500还可以配置用于：获取预设地址的出发时间；根据出发时间、间隔时长和配送时长，确定路径中各坐标点的预估到达时间；生成用于指示包含预估到达时间的配送路径的信息。
在一些应用场景中，订单信息还可以包括目标配送到达时间；以及该装置500还可以配置用于：确定包括目标配送到达时间的订单信息所属的聚类簇对应的路径中的坐标点，作为调整坐标点；删除用于指示包含预估到达时间的配送路径的信息中调整坐标点的信息，生成待调整路径；将目标配送到达时间作为对应的调整坐标点的到达时间，并根据到达时间的先后顺序对调整坐标点进行排序，生成调整坐标点列表；将调整坐标点列表中的调整坐标点的到达时间与待调整路径中的坐标点的预估到达时间进行逐一比较；若调整坐标点的到达时间早于坐标点的预估到达时间，则将该调整坐标点设置为该坐标点的前一坐标点，并根据该调整坐标点的到达时间，调整该坐标点及之后的坐 标点的预估到达时间，且将该调整坐标点之后的调整坐标点的到达时间与该坐标点及之后的坐标点调整后的预估到达时间进行逐一比较，直至调整坐标点列表中的所有调整坐标点均设置为待调整路径中的坐标点，生成用于指示调整后的配送路径的信息。
可选地，当同一聚类簇中包含至少两个包括目标配送到达时间的订单信息时，该装置500可以进一步配置用于：从至少两个订单信息中选取最早的目标配送到达时间，作为所属聚类簇对应的调整坐标点的到达时间。
下面参考图6，其示出了适于用来实现本申请实施例的电子设备的计算机系统600的结构示意图。图6示出的电子设备仅仅是一个示例，不应对本申请实施例的功能和使用范围带来任何限制。
如图6所示，计算机系统600包括中央处理单元(CPU)601，其可以根据存储在只读存储器(ROM)602中的程序或者从存储部分608加载到随机访问存储器(RAM)603中的程序而执行各种适当的动作和处理。在RAM 603中，还存储有系统600操作所需的各种程序和数据。CPU 601、ROM 602以及RAM 603通过总线604彼此相连。输入/输出(I/O)接口605也连接至总线604。
以下部件连接至I/O接口605：包括触摸屏、键盘、鼠标等的输入部分606；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分607；包括硬盘等的存储部分608；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分609。通信部分609经由诸如因特网的网络执行通信处理。驱动器610也根据需要连接至I/O接口605。可拆卸介质611，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器610上，以便于从其上读出的计算机程序根据需要被安装入存储部分608。
特别地，根据本公开的实施例，上文参考流程图描述的过程可以被实现为计算机软件程序。例如，本公开的实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分609从网络上被下载和安装，和/或从 可拆卸介质611被安装。在该计算机程序被中央处理单元(CPU)601执行时，执行本申请的方法中限定的上述功能。需要说明的是，本申请的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本申请中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。而在本申请中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本申请各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，该模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合， 可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本申请实施例中所涉及到的单元可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元也可以设置在处理器中，例如，可以描述为：一种处理器包括第一获取单元、聚类单元、第一执行单元和响应单元。其中，这些单元的名称在某种情况下并不构成对该单元本身的限定，例如，第一获取单元还可以被描述为“获取待配送的订单信息的单元”。
作为另一方面，本申请还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的电子设备中所包含的；也可以是单独存在，而未装配入该电子设备中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被该电子设备执行时，使得该电子设备：获取待配送的订单信息，其中，订单信息包括配送地址信息；确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇；将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判断剩余聚类簇的数目是否达到预设阈值；响应于判断结果为是，生成用于指示配送路径的信息；响应于判断结果为否，将第二坐标作为起始坐标，并执行路径规划步骤。
以上描述仅为本申请的较佳实施例以及对所运用技术原理的说明。本领域技术人员应当理解，本申请中所涉及的发明范围，并不限于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离上述发明构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本申请中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (12)

  1. 一种信息生成方法，包括：
    获取待配送的订单信息，其中，所述订单信息包括配送地址信息；
    确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇；
    将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，所述剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判断剩余聚类簇的数目是否达到预设阈值；响应于判断结果为是，生成用于指示配送路径的信息；
    响应于判断结果为否，将第二坐标作为起始坐标，并执行所述路径规划步骤。
  2. 根据权利要求1所述的方法，其中，所述坐标为经纬度坐标；以及
    所述根据坐标对订单信息进行聚类，包括：
    根据两坐标之间的距离对订单信息进行聚类，其中，所述距离为两坐标之间的经度坐标差的绝对值与纬度坐标差的绝对值之和。
  3. 根据权利要求1所述的方法，其中，当剩余聚类簇中存在至少两个与起始坐标的距离最短的聚类簇时，所述方法还包括：
    将至少两个聚类簇的中心点坐标分别作为路径的第二坐标，并执行所述路径规划步骤，生成至少两个用于指示候选配送路径的信息；
    从所述至少两个用于指示候选配送路径的信息中选取信息，作为用于指示配送路径的信息。
  4. 根据权利要求1所述的方法，其中，所述方法还包括：
    根据预存的历史配送数据，计算路径中相邻两个坐标点之间的间 隔时长，其中，所述历史配送数据包括配送过程中所采集的坐标信息和采集该坐标信息的时间。
  5. 根据权利要求4所述的方法，其中，所述订单信息还包括以下至少一项：商品信息、交易信息和配送方式信息；以及
    所述方法还包括：
    根据各聚类簇中的各订单信息，确定各聚类簇的总订单信息；
    根据各聚类簇的总订单信息，确定各聚类簇的中心点坐标对应的路径中的坐标点的配送时长。
  6. 根据权利要求5所述的方法，其中，所述方法还包括：
    获取所述预设地址的出发时间；
    根据所述出发时间、间隔时长和配送时长，确定路径中各坐标点的预估到达时间；
    生成用于指示包含预估到达时间的配送路径的信息。
  7. 根据权利要求6所述的方法，其中，所述订单信息还包括目标配送到达时间；以及
    所述方法还包括：
    确定包括目标配送到达时间的订单信息所属的聚类簇对应的路径中的坐标点，作为调整坐标点；
    删除所述用于指示包含预估到达时间的配送路径的信息中调整坐标点的信息，生成待调整路径；
    将目标配送到达时间作为对应的调整坐标点的到达时间，并根据到达时间的先后顺序对调整坐标点进行排序，生成调整坐标点列表；
    将所述调整坐标点列表中的调整坐标点的到达时间与所述待调整路径中的坐标点的预估到达时间进行逐一比较；
    若调整坐标点的到达时间早于坐标点的预估到达时间，则将该调整坐标点设置为该坐标点的前一坐标点，并根据该调整坐标点的到达时间，调整该坐标点及之后的坐标点的预估到达时间，且将该调整坐 标点之后的调整坐标点的到达时间与该坐标点及之后的坐标点调整后的预估到达时间进行逐一比较，直至所述调整坐标点列表中的所有调整坐标点均设置为所述待调整路径中的坐标点，生成用于指示调整后的配送路径的信息。
  8. 根据权利要求7所述的方法，其中，当同一聚类簇中包含至少两个包括目标配送到达时间的订单信息时，所述将目标配送到达时间作为对应的调整坐标点的到达时间，包括：
    从至少两个订单信息中选取最早的目标配送到达时间，作为所属聚类簇对应的调整坐标点的到达时间。
  9. 一种信息生成装置，包括：
    第一获取单元，配置用于获取待配送的订单信息，其中，所述订单信息包括配送地址信息；
    聚类单元，配置用于确定配送地址信息所指示的地址的坐标，并根据坐标对订单信息进行聚类，生成聚类簇；
    第一执行单元，配置用于将各聚类簇中与预设地址的坐标匹配的中心点坐标作为路径的起始坐标，并执行如下路径规划步骤：将剩余聚类簇中与起始坐标的距离最短的中心点坐标作为路径的第二坐标，其中，所述剩余聚类簇为各聚类簇中除中心点坐标作为路径的坐标的聚类簇以外的聚类簇；判断剩余聚类簇的数目是否达到预设阈值；响应于判断结果为是，生成用于指示配送路径的信息；
    响应单元，配置用于响应于判断结果为否，将第二坐标作为起始坐标，并执行所述路径规划步骤。
  10. 根据权利要求9所述的装置，其中，所述坐标为经纬度坐标；以及
    所述聚类单元进一步配置用于：
    根据两坐标之间的距离对订单信息进行聚类，其中，所述距离为两坐标之间的经度坐标差的绝对值与纬度坐标差的绝对值之和。
  11. 一种电子设备，包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序；
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求1-8中任一所述的方法。
  12. 一种计算机可读存储介质，其上存储有计算机程序，其中，所述计算机程序被处理器执行时实现如权利要求1-8中任一所述的方法。
PCT/CN2018/109122 2017-11-20 2018-09-30 信息生成方法和装置 WO2019095883A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/753,765 US20200286039A1 (en) 2017-11-20 2018-09-30 Information generation method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711156281.XA CN109816132A (zh) 2017-11-20 2017-11-20 信息生成方法和装置
CN201711156281.X 2017-11-20

Publications (1)

Publication Number Publication Date
WO2019095883A1 true WO2019095883A1 (zh) 2019-05-23

Family

ID=66538826

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/109122 WO2019095883A1 (zh) 2017-11-20 2018-09-30 信息生成方法和装置

Country Status (3)

Country Link
US (1) US20200286039A1 (zh)
CN (1) CN109816132A (zh)
WO (1) WO2019095883A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110689254A (zh) * 2019-09-23 2020-01-14 拉扎斯网络科技（上海）有限公司 数据处理方法、装置、电子设备和计算机可读存储介质
CN111080198A (zh) * 2019-11-29 2020-04-28 浙江大搜车软件技术有限公司 车辆物流路径生成的方法、装置、计算机设备及存储介质

Families Citing this family (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110231044B (zh) * 2019-06-10 2020-09-04 北京三快在线科技有限公司 一种路径规划方法及装置
CN112085426A (zh) * 2019-06-14 2020-12-15 北京京东尚科信息技术有限公司 订单下发控制方法、装置、存储介质及电子设备
CN112200336A (zh) * 2019-06-20 2021-01-08 北京京东振世信息技术有限公司 一种车辆行驶路径规划的方法和装置
CN112183799A (zh) * 2019-07-01 2021-01-05 北京京东振世信息技术有限公司 用于合成任务单的任务分配方法及装置
CN112556707A (zh) * 2019-09-25 2021-03-26 北京京东振世信息技术有限公司 路径规划方法和装置
CN112579660A (zh) * 2019-09-29 2021-03-30 北京京东振世信息技术有限公司 计算时效的方法、装置、设备和计算机可读介质
US11823250B2 (en) * 2019-09-30 2023-11-21 EMC IP Holding Company LLC Data driven estimation of order delivery date
CN111126688B (zh) * 2019-12-19 2023-05-26 北京顺丰同城科技有限公司 配送路线确定方法、装置、电子设备及可读存储介质
CN111178810B (zh) * 2019-12-31 2023-06-20 北京百度网讯科技有限公司 用于生成信息的方法和装置
CN113128744A (zh) * 2020-01-15 2021-07-16 北京沃东天骏信息技术有限公司 配送规划方法和装置
CN113139137B (zh) * 2020-01-19 2022-05-03 北京三快在线科技有限公司 确定poi坐标的方法、装置、存储介质及电子设备
CN111428925B (zh) * 2020-03-20 2022-07-19 北京百度网讯科技有限公司 用于确定配送路径的方法和装置
CN111507577A (zh) * 2020-03-25 2020-08-07 哈尔滨工业大学（威海） 一种基于K-means聚类算法的众包任务分配方法
CN111461430A (zh) * 2020-03-31 2020-07-28 北京百度网讯科技有限公司 用于生成路线信息的方法及装置
CN113689021B (zh) * 2020-05-19 2024-04-30 百度在线网络技术（北京）有限公司 用于输出信息的方法和装置
CN113762566A (zh) * 2020-09-17 2021-12-07 北京京东振世信息技术有限公司 一种计算送达时间的方法和装置
CN112766859A (zh) * 2021-01-28 2021-05-07 深圳市跨越新科技有限公司 基于道路分割的运单分组方法、系统、终端及存储介质
CN112801593A (zh) * 2021-02-09 2021-05-14 北京橙心无限科技发展有限公司 生成配送方案的方法和装置
CN112906980B (zh) * 2021-03-19 2024-02-27 杉数科技(北京)有限公司 订单处理方法、装置、系统及可读存储介质
CN113095553A (zh) * 2021-03-29 2021-07-09 北京沃东天骏信息技术有限公司 调度方法、装置、电子设备及存储介质
CN113506056A (zh) * 2021-06-23 2021-10-15 广州佳帆计算机有限公司 穿梭车路径规划方法及装置
CN113848885A (zh) * 2021-09-07 2021-12-28 深圳优地科技有限公司 机器人送单方法、装置、设备及计算机可读存储介质
CN113903117B (zh) * 2021-10-11 2023-07-21 苏州益多多信息科技有限公司 一种多彩种彩票的出票格式校验系统、方法及介质
CN113919595A (zh) * 2021-11-22 2022-01-11 杭州拼便宜网络科技有限公司 店铺配送路径规划方法、装置、设备和存储介质
CN114418510A (zh) * 2022-03-29 2022-04-29 小柿子(北京)汽车供应链管理有限公司 货物运输管理方法、系统、平台和存储介质
CN114493056B (zh) * 2022-04-18 2022-06-21 小柿子(北京)汽车供应链管理有限公司 货物运输方法、系统、计算机设备和存储介质
CN115439071A (zh) * 2022-11-09 2022-12-06 成都运荔枝科技有限公司 一种冷链物流运输订单处理方法和系统
CN117313979B (zh) * 2023-11-30 2024-02-20 湖南木屋网络科技有限公司 一种配送路线的规划方法及装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104102953A (zh) * 2014-06-24 2014-10-15 四川省烟草公司广安市公司 一种物流送货线路优化生成方法及系统
US20170061349A1 (en) * 2015-08-31 2017-03-02 Wal-Mart Stores, Inc. Methods and systems in evaluating and selecting a combination of shipping packages
CN107133752A (zh) * 2016-02-29 2017-09-05 阿里巴巴集团控股有限公司 用于物流配送的数据处理、基于配送方的移动终端进行物流配送的方法和装置

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103383756A (zh) * 2013-07-22 2013-11-06 浙江省烟草公司绍兴市公司 一种烟草物流配送路径规划方法
CN104732289B (zh) * 2015-03-20 2018-05-01 深圳支付界科技有限公司 一种配送路径规划方法及系统
CN105184412B (zh) * 2015-09-21 2018-11-23 北京农业信息技术研究中心 基于地理位置的物流配送路径规划方法和系统
CN106651231B (zh) * 2015-10-29 2021-06-11 株式会社日立制作所 路径规划方法和路径规划装置
CN107203956A (zh) * 2016-03-18 2017-09-26 北京京东尚科信息技术有限公司 改善投递效率的智能投递系统、手持机及用户终端
CN105956723A (zh) * 2016-07-19 2016-09-21 成都镜杰科技有限责任公司 基于数据挖掘的物流信息管理方法
CN106779183B (zh) * 2016-11-29 2020-12-29 北京小度信息科技有限公司 订单组配送顺序规划方法、路线规划方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104102953A (zh) * 2014-06-24 2014-10-15 四川省烟草公司广安市公司 一种物流送货线路优化生成方法及系统
US20170061349A1 (en) * 2015-08-31 2017-03-02 Wal-Mart Stores, Inc. Methods and systems in evaluating and selecting a combination of shipping packages
CN107133752A (zh) * 2016-02-29 2017-09-05 阿里巴巴集团控股有限公司 用于物流配送的数据处理、基于配送方的移动终端进行物流配送的方法和装置

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110689254A (zh) * 2019-09-23 2020-01-14 拉扎斯网络科技（上海）有限公司 数据处理方法、装置、电子设备和计算机可读存储介质
CN111080198A (zh) * 2019-11-29 2020-04-28 浙江大搜车软件技术有限公司 车辆物流路径生成的方法、装置、计算机设备及存储介质
CN111080198B (zh) * 2019-11-29 2023-06-09 浙江大搜车软件技术有限公司 车辆物流路径生成的方法、装置、计算机设备及存储介质

Also Published As

Publication number Publication date
US20200286039A1 (en) 2020-09-10
CN109816132A (zh) 2019-05-28

Similar Documents

Publication Publication Date Title
WO2019095883A1 (zh) 信息生成方法和装置
US9858614B2 (en) Future order throttling
US11755906B2 (en) System for dynamic estimated time of arrival predictive updates
US10915853B2 (en) System for dynamic effort-based delivery value predictive updates
US11222352B2 (en) Automatic billing payment system
KR102665720B1 (ko) 동적 페어링 기능 최적화를 위한 시스템 및 방법
WO2019114391A1 (zh) 信息输出方法和装置
US20140180848A1 (en) Estimating Point Of Sale Wait Times
CN107845016B (zh) 信息输出方法和装置
US20210090017A1 (en) Feedback-based management of delivery orders
AU2014293388A1 (en) Computing distances of devices
US20160314482A1 (en) Determination of resource provider conditions using transaction data
CN112288552A (zh) 拼单方法、服务器、客户端及系统
CN111028048A (zh) 资源信息的推送方法及客户端、服务端
CN116090942A (zh) 基于物联网的多场景机器人配送方法及系统
CN107944697A (zh) 基于供需关系的热地图计算方法和系统、服务器、介质
KR20200055353A (ko) 배송 시스템, 배송 관리 시스템, 배송 관리 장치 및 배송 관리 방법
WO2019015254A1 (zh) 信息处理方法和装置
WO2019033676A1 (zh) 订单处理方法和装置
US20230169573A1 (en) Automated product recommendation
CN109426878A (zh) 用于输出信息的方法和装置
US11393015B1 (en) Interface for item acquisition
US20220292450A1 (en) Delivery support device, delivery support method, and storage medium
CN109034934A (zh) 用于一键购买的方法及其设备
TWI760987B (zh) 多點目的地抵達時間分析之電腦實施系統以及電腦實施方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18877497

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 22/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18877497

Country of ref document: EP

Kind code of ref document: A1