WO2019047524A1 - 信息处理方法和装置 - Google Patents

信息处理方法和装置 Download PDF

Info

Publication number
WO2019047524A1
WO2019047524A1 PCT/CN2018/082688 CN2018082688W WO2019047524A1 WO 2019047524 A1 WO2019047524 A1 WO 2019047524A1 CN 2018082688 W CN2018082688 W CN 2018082688W WO 2019047524 A1 WO2019047524 A1 WO 2019047524A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
delivered
identifier
group
delivery
Prior art date
Application number
PCT/CN2018/082688
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/636,074 priority Critical patent/US20200193372A1/en
Publication of WO2019047524A1 publication Critical patent/WO2019047524A1/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/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases
    • G06F16/285—Clustering or classification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases
    • 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/083—Shipping
    • G06Q10/0838—Historical data
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/12—Hotels or restaurants

Definitions

  • the present application relates to the field of computer technology, and in particular to the field of Internet technologies, and in particular, to an information processing method and apparatus.
  • the purpose of the embodiments of the present application is to provide an improved information processing method and apparatus to solve the technical problems mentioned in the above background art.
  • an embodiment of the present application provides an information processing method, including: acquiring a to-be-delivered order set, where the to-be-distributed order includes a delivery address; and for each to-be-delivered order in the to-be-distributed order set, The delivery address included in the to-be-distributed order is mapped into a coordinate point, and based on the mapped coordinate point, the delivery area identifier corresponding to the to-be-distributed order is determined in the preset distribution area identification set; The order to be delivered corresponding to the same delivery area identifier is divided into the same order group to be delivered; a group identifier is set for each of the divided order groups to be delivered, and the group identifier is generated corresponding to the delivery order group to be delivered. The correspondence between the area identifiers.
  • each of the delivery area identification sets has a corresponding coordinate point sequence
  • each of the coordinate point sequences is a point on a boundary of the delivery area indicated by the delivery area identifier
  • the delivery area identifier also has a corresponding geometric figure that is a closed pattern formed by joining adjacent coordinate points in the sequence of coordinate points.
  • determining the delivery area identifier corresponding to the to-be-distributed order in the preset distribution area identifier set based on the mapped coordinate points includes: using the mapped coordinate point as a starting point, in the second Drawing a ray in the horizontal direction on the dimension plane, and determining, for each distribution area identifier in the distribution area identifier set, the total number of intersections of the edge of the geometric figure corresponding to the distribution area identifier and the ray, if the total number is an odd number And the distribution area identifier is used as the delivery area identifier corresponding to the order to be delivered.
  • the distribution area identification set has a corresponding data structure, the data structure including a leaf node and a non-leaf node, wherein the leaf node is a node that does not include a child node, and each non-leaf node includes at least two child nodes;
  • Each leaf node and each non-leaf node included in the data structure respectively correspond to different rectangular frames, and the location information of the corresponding rectangular frame is stored; the corresponding rectangular frame of each leaf node is the distribution in the distribution area identifier set.
  • a minimum circumscribed rectangle of the geometry corresponding to the area identifier for each non-leaf node of the non-leaf node, a rectangular box corresponding to each sub-node included in the non-leaf node is included in the non-leaf node Inside the rectangular box.
  • determining, according to the mapped coordinate points, determining a delivery area identifier corresponding to the to-be-distributed order in the preset distribution area identifier set further comprising: forming the coordinate point based on the mapping and the data structure The position information of the rectangular frame corresponding to the non-leaf node and the leaf node respectively is included, and the target leaf node is determined in the data structure, wherein the rectangular frame corresponding to the target leaf node is a rectangle in which the mapped coordinate point is located a frame is drawn from the mapped coordinate point as a starting point, and a ray is drawn in a horizontal direction on the two-dimensional plane to determine the total number of intersections of the drawn ray and the edge of the geometric figure in the rectangular frame corresponding to the target leaf node. For example, if the determined total number is an odd number, the delivery area identifier corresponding to the geometry in the rectangular frame corresponding to the target leaf node is used as the delivery area identifier corresponding to the order to be delivered
  • the order to be delivered in the set of orders to be delivered is derived from an order set, and each order in the order set includes identification information, and the set of orders to be delivered is generated by the following steps: for each order in the order set And determining whether the preset identifier in the preset identifier set exists in the identifier information included in the order, and if not, the order is classified into the to-be-delivered order set.
  • each of the delivery area identification sets has a corresponding delivery mode identification, the delivery mode identification being a delivery mode identification for indicating self-delivery or a delivery mode identification for indicating third-party logistics delivery
  • the means for indicating the delivery mode identifier from the delivery and the delivery mode identifier for indicating the third-party logistics distribution respectively correspond to different group identification generation modes.
  • setting a group identifier for each of the divided order groups to be delivered includes: for each of the divided order groups to be delivered, according to the group corresponding to the delivery mode identifier associated with the order group to be delivered
  • the identifier generation method generates a group identifier, and sets the generated group identifier to the group identifier of the order group to be delivered.
  • each order to be delivered in the set of orders to be delivered further includes an order identifier; and the method further includes: generating, for each of the divided order groups to be delivered, a group identifier of the order group to be delivered and the The correspondence between the order identifiers of the orders to be delivered included in the order group to be delivered.
  • the method further includes: determining, in response to receiving the prompt information of the order identifier including the abnormal order, the target to-be-distributed order group in which the abnormal order is located, from the divided group of each to-be-distributed order, The abnormal order is removed from the target to-be-distributed order group, and the correspondence between the order identifier of the abnormal order and the group identifier of the target to-be-ordered order group is cancelled, wherein the abnormal order is the divided order to be delivered Orders in the group that cannot be delivered.
  • each of the delivery area identification sets has a corresponding delivery staff identification; and the method further includes: for each of the delivery area identification sets, the delivery area identification The group identifier is sent to the terminal device of the dispatcher indicated by the dispatcher identifier corresponding to the delivery area identifier.
  • the method further includes: determining, in response to receiving the receipt information including the dispatcher identifier and the group identifier, whether the dispatcher identifier and the group identifier included in the receipt information have an association relationship, and if so, Returns the order group to be delivered indicated by the group identifier included in the goods receipt information.
  • an embodiment of the present application provides an information processing apparatus, where the apparatus includes: an obtaining unit configured to acquire a set of orders to be delivered, wherein the order to be delivered includes a receiving address; and the determining unit is configured to be used for Each of the orders to be delivered in the distribution order set maps the delivery address included in the order to be delivered into coordinate points, and determines the to-be-distributed in the preset distribution area identification set based on the mapped coordinate points.
  • the to-be-scheduled order group sets the group identifier, and generates a correspondence between the group identifier and the delivery area identifier corresponding to the order group to be delivered.
  • each of the delivery area identification sets has a corresponding coordinate point sequence
  • each of the coordinate point sequences is a point on a boundary of the delivery area indicated by the delivery area identifier
  • the delivery area identifier also has a corresponding geometric figure that is a closed pattern formed by joining adjacent coordinate points in the sequence of coordinate points.
  • the determining unit includes: a first determining subunit configured to draw a ray in a horizontal direction on the two-dimensional plane starting from the mapped coordinate point, and in the set of the distribution area identifier
  • Each distribution area identifier determines a total number of intersections of edges of the geometric figure corresponding to the delivery area identifier and the ray, and if the total number is an odd number, the distribution area identifier is used as a delivery area corresponding to the order to be delivered Logo.
  • the distribution area identification set has a corresponding data structure, the data structure including a leaf node and a non-leaf node, wherein the leaf node is a node that does not include a child node, and each non-leaf node includes at least two child nodes;
  • Each leaf node and each non-leaf node included in the data structure respectively correspond to different rectangular frames, and the location information of the corresponding rectangular frame is stored; the corresponding rectangular frame of each leaf node is the distribution in the distribution area identifier set.
  • a minimum circumscribed rectangle of the geometry corresponding to the area identifier for each non-leaf node of the non-leaf node, a rectangular box corresponding to each sub-node included in the non-leaf node is included in the non-leaf node Inside the rectangular box.
  • the determining unit further includes: a second determining subunit, configured to: according to the mapped coordinate point and the position information of the rectangular frame corresponding to the non-leaf node and the leaf node included in the data structure respectively Determining a target leaf node in the data structure, wherein a rectangular frame corresponding to the target leaf node is a rectangular frame in which the mapped coordinate point is located; and a third determining subunit configured to use the mapped The coordinate point is the starting point, and a ray is drawn in the horizontal direction on the two-dimensional plane to determine the total number of intersections of the drawn ray and the edge of the geometrical figure in the rectangular frame corresponding to the target leaf node, if the total number determined If it is an odd number, the delivery area identifier corresponding to the geometry in the rectangular frame corresponding to the target leaf node is used as the delivery area identifier corresponding to the order to be delivered.
  • a second determining subunit configured to: according to the mapped coordinate point and the position information of the rectangular frame corresponding
  • the order to be delivered in the set of orders to be delivered is derived from an order set, and each order in the order set includes identification information, and the set of orders to be delivered is generated by the following steps: for each order in the order set And determining whether the preset identifier in the preset identifier set exists in the identifier information included in the order, and if not, the order is classified into the to-be-delivered order set.
  • each of the delivery area identification sets has a corresponding delivery mode identification, the delivery mode identification being a delivery mode identification for indicating self-delivery or a delivery mode identification for indicating third-party logistics delivery
  • the means for indicating the delivery mode identifier from the delivery and the delivery mode identifier for indicating the third-party logistics distribution respectively correspond to different group identification generation modes.
  • the generating unit includes: a setting subunit configured to generate, for each of the divided order groups to be delivered, according to a group identifier generating manner corresponding to the delivery mode identifier associated with the order group to be delivered Group ID and set the generated group ID to the group ID of the order group to be delivered.
  • each of the orders to be delivered in the set of orders to be delivered further includes an order identifier; and the apparatus further includes: a first generating unit configured to generate the waiting for each of the divided order groups to be delivered The correspondence between the group ID of the delivery order group and the order ID of the order to be delivered included in the order group to be delivered.
  • the apparatus further includes: a removing unit configured to determine, in response to receiving the prompt information of the order identifier including the abnormal order, determining, from the determined group of each order to be delivered, the abnormal order The target to be delivered order group, the abnormal order is removed from the target to-be-scheduled order group, and the correspondence between the order identifier of the abnormal order and the group identifier of the target to-be-ordered order group is canceled, wherein the abnormal order is An order in the assigned order group to be delivered that cannot be delivered.
  • each of the delivery area identification sets has a corresponding delivery staff identification; and the apparatus further includes: a first transmitting unit configured to identify each of the delivery area identification sets And sending the group identifier corresponding to the delivery area identifier to the terminal device of the delivery person indicated by the delivery person identifier corresponding to the delivery area identifier.
  • the apparatus further includes: a second sending unit configured to determine a dispatcher identifier and a group identifier included in the receipt information in response to receiving the receipt information including the dispatcher identifier and the group identifier Whether there is an association relationship, and if so, return the order group to be delivered indicated by the group identifier included in the receipt information.
  • a second sending unit configured to determine a dispatcher identifier and a group identifier included in the receipt information in response to receiving the receipt information including the dispatcher identifier and the group identifier Whether there is an association relationship, and if so, return the order group to be delivered indicated by the group identifier included in the receipt information.
  • an embodiment of the present application provides an electronic device, where the electronic device includes: one or more processors; a storage device, configured to store one or more programs; and when the one or more programs are The plurality of processors are executed such that the one or more processors described above implement the method as described in any one of the first aspects.
  • the embodiment of the present application provides a computer readable storage medium, where a computer program is stored, and when the program is executed by a processor, the method described in any one of the first aspects is implemented.
  • the information processing method and device provided by the embodiment of the present application, by acquiring the set of orders to be delivered, mapping the receiving address included in each of the acquired orders to be delivered into coordinate points, so as to be based on the coordinate points.
  • a delivery area identifier corresponding to the to-be-distributed order is determined in the preset distribution area identification set.
  • the order to be delivered corresponding to the same delivery area identifier in the to-be-distributed order set is divided into the same order group to be delivered, and a group identifier is set for each of the divided order groups to be generated, so as to generate the group identifier and the waiting group
  • the correspondence between the delivery area identifiers corresponding to the delivery order group Thereby, the determination of the delivery area identifier corresponding to the delivery order is effectively utilized, and the targeted information generation is realized.
  • the correspondence between the generated group identifier and the delivery area identifier is applied to the delivery person receiving link, and the delivery staff can quickly obtain the order group to be delivered indicated by the group identifier through the group identification, and can also Knowing the delivery area where the delivery address of the order to be delivered is located, the delivery time of the delivery person can be shortened to improve the delivery efficiency of the delivery staff.
  • 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 processing method according to the present application.
  • FIG. 3 is a schematic diagram of a method for determining a delivery area identifier corresponding to an order to be delivered according to the present application
  • Figure 4a is a schematic illustration of a data structure in accordance with the present application.
  • FIG. 4b is a schematic diagram of a rectangular frame corresponding to a leaf node and a non-leaf node included in the data structure shown in FIG. 4a;
  • FIG. 5 is a schematic diagram of an application scenario of an information processing method according to the present application.
  • FIG. 6 is a flow chart of still another embodiment of an information processing method according to the present application.
  • FIG. 7 is a schematic structural diagram of an embodiment of an information processing apparatus according to the present application.
  • FIG. 8 is a schematic structural diagram of a computer system suitable for implementing an electronic device of an embodiment of the present application.
  • Fig. 1 shows an exemplary system architecture 100 in which an embodiment of the information processing method or information processing apparatus of the present application can be applied.
  • the system architecture 100 can include an information processing terminal 101, a network 102, and a server 103.
  • the network 102 is used to provide a medium for a communication link between the information processing terminal 101 and the server 103.
  • Network 102 can include a variety of connection types, such as wired, wireless communication links, fiber optic cables, and the like.
  • the user can use the information processing terminal 101 to interact with the server 103 via the network 102 to receive or transmit information and the like.
  • Various communication client applications such as a web browser application, an information processing application, and the like, may be installed on the information processing terminal 101.
  • the information processing terminal 101 can acquire, for example, a set of orders to be delivered from the server 103, and process the set of orders to be delivered.
  • the information processing terminal 101 can be a variety of electronic devices including, but not limited to, smartphones, tablets, laptop portable computers, desktop computers, and the like.
  • the information processing terminal 101 may be, for example, a terminal device placed in a delivery site.
  • the server 103 may be a server that provides various services, such as a server that stores a collection of orders to be delivered.
  • the information processing method provided by the embodiment of the present application is generally performed by the information processing terminal 101. Accordingly, the information processing device is generally disposed in the information processing terminal 101.
  • FIG. 1 the number of information processing terminals, networks, and servers in FIG. 1 is merely illustrative. Depending on the needs of the implementation, there can be any number of information processing ends, networks, and servers.
  • the server 103 may not be included in the system architecture 100.
  • the process 200 of the information processing method includes the following steps:
  • Step 201 Acquire a collection of orders to be delivered.
  • the set of orders to be delivered may be stored in advance in a server remotely connected to an electronic device (for example, the information processing terminal 101 shown in FIG. 1) on which the information processing method operates.
  • the electronic device may obtain the set of orders to be delivered from the server by using a wired connection or a wireless connection.
  • the electronic device may also locally acquire the set of orders to be delivered.
  • the order to be delivered may include a delivery address.
  • the order to be delivered in the set of orders to be delivered may be derived from an order set.
  • Each order in the order set can include identification information.
  • the foregoing set of orders to be delivered may be generated by determining, for each order in the order set, whether there is a preset identifier in the preset identifier set in the identifier information included in the order, and if not, the order is Belongs to the collection of orders to be delivered. It should be noted that the foregoing set of items to be delivered may be generated by the above electronic device or the above-mentioned server by performing the step, and the embodiment does not limit the content.
  • the above order set may be stored in advance in the above electronic device or in the above server.
  • the identification information included in the order may include, for example, a payment method identifier, a delivery method identifier, a luxury order identifier, a high order identifier, and the like.
  • the payment method identifier may include, for example, at least one of the following: a payment method identifier for characterizing that the payment method is online payment, a payment method identifier for characterizing that the payment method is cash on delivery, and a payment method for characterizing that the payment method is cash payment. logo and more.
  • the distribution mode identifier may include, for example, at least one of the following: a distribution mode identifier for characterizing the delivery mode as a self-raising mode, a delivery mode identifier for characterizing the delivery mode, and a distribution method for the third-party logistics distribution.
  • Way identification may, for example, include a luxury order identification for characterizing that the order is a luxury order and/or a luxury order identification for characterizing that the order is not a luxury order.
  • the high order identification may, for example, include a high order identification for characterizing that the order is a high order order and/or a high order order identifier for characterizing that the order is not a high order.
  • the preset identifier set may include, for example, at least one of the following: a delivery mode identifier for characterizing that the delivery mode is a self-raising method, a luxury order identifier for characterizing that the order is a luxury order, and a high amount for characterizing the order.
  • a delivery mode identifier for characterizing that the delivery mode is a self-raising method
  • a luxury order identifier for characterizing that the order is a luxury order
  • a high amount for characterizing the order The high order ID of the order and so on. It should be noted that the preset identifier set may be adjusted according to actual needs, and the embodiment does not limit the content.
  • Step 202 For each order to be delivered in the set of orders to be delivered, map the receiving address included in the order to be delivered into coordinate points, and based on the mapped coordinate points, in the preset distribution area identification set. A delivery area identifier corresponding to the order to be delivered is determined.
  • the electronic device may map the receiving address included in the order to be delivered into The coordinate point, and based on the mapped coordinate point, determines a delivery area identifier corresponding to the to-be-distributed order in the preset distribution area identification set.
  • the coordinate point obtained by the mapping may be a latitude and longitude coordinate point.
  • the electronic device may map the receiving address included in the order to be delivered into a coordinate point by using a preset Geographic Information System (GIS).
  • GIS Geographic Information System
  • Geographic information systems are sometimes referred to as “geoscience information systems.” It is a specific and very important spatial information system. It is a technical system for collecting, storing, managing, computing, analyzing, displaying and describing geographically distributed data in all or part of the Earth's surface (including the atmosphere) under the support of computer hardware and software systems.
  • the electronic device may locally store a list of information for recording a correspondence between the coordinate point and the delivery area identifier, and each piece of information in the information list may include a coordinate point and a delivery area identifier corresponding to the coordinate point.
  • the electronic device may search for the same target coordinate point in the information list as the coordinate point, and if found, the above The electronic device may identify the delivery area corresponding to the target coordinate point as the delivery area identifier corresponding to the order to be delivered.
  • each of the delivery area identifiers in the distribution area identifier set may have a corresponding coordinate point sequence, and each coordinate point in the coordinate point sequence may be indicated by the delivery area identifier.
  • a point on the boundary of the delivery area, the distribution area identifier may also have a corresponding geometric figure, which may be a closed pattern formed by joining adjacent coordinate points in the sequence of coordinate points.
  • the coordinate point in the sequence of coordinate points may be a latitude and longitude coordinate point.
  • the electronic device for each of the to-be-distributed orders in the set of orders to be delivered, the electronic device, after mapping the receiving address included in the order to be delivered into a coordinate point, the electronic The device may determine the delivery area identifier corresponding to the to-be-distributed order by: drawing a ray in a horizontal direction on the two-dimensional plane starting from the mapped coordinate point, for each of the distribution area identification sets The delivery area identifier determines a total number of intersections of edges of the geometric figure corresponding to the delivery area identifier and the ray. If the total number is an odd number, the delivery area identifier is used as a delivery area identifier corresponding to the to-be-distributed order.
  • FIG. 3 shows a schematic diagram of a method for determining a delivery area identifier corresponding to an order to be delivered.
  • a coordinate point 301, an irregular geometry 302 having a plurality of sides, and a ray 303 starting from the coordinate point 301 are shown in FIG.
  • the coordinate point 301 is a coordinate point obtained by mapping the delivery address included in the delivery order A.
  • the geometry 302 corresponds to the delivery area identification B.
  • the total number of intersections of the rays 303 and the sides of the geometry 302 is an odd number 3, and the coordinate points 301 can be characterized within the geometry 302 such that the electronic device can use the delivery area identification B as the delivery area identification corresponding to the order A to be dispensed.
  • the foregoing distribution area identifier set may have a corresponding data structure, where the data structure may include a leaf node and a non-leaf node, where the leaf node is a node that does not include a child node, and each The non-leaf nodes may include at least two child nodes.
  • Each leaf node and each non-leaf node included in the data structure may respectively correspond to different rectangular frames, and may store location information of the corresponding rectangular frame.
  • the rectangular frame corresponding to each of the leaf nodes may be a minimum circumscribed rectangle of the geometric figure corresponding to the delivery area identifier in the distribution area identifier set.
  • a rectangular frame corresponding to each sub-node included in the non-leaf node may be included in a rectangular frame corresponding to the non-leaf node.
  • the positional information of the rectangular frame may include, for example, the coordinates of the upper left vertex and the lower right vertex of the rectangular frame and/or the coordinates of the upper right vertex and the lower left vertex.
  • the data structure may be, for example, a directed graph, a tree structure, or an R-tree spatial index structure.
  • the R tree uses the concept of spatial segmentation.
  • the R-tree adopts a method called MBR (Minimal Bounding Rectangle), which uses a rectangle to frame the space from the leaf nodes. The more the node goes up, the larger the space is framed. segmentation.
  • MBR Minimal Bounding Rectangle
  • Figure 4a shows a schematic diagram of the data structure.
  • the data structure includes leaf nodes L1, L2, L3, L4, L5, L6, L7, L8, L9 and non-leaf nodes M1, M2, M3, M4, T1, T2.
  • the non-leaf nodes M1 and M2 are child nodes of the non-leaf node T1.
  • the non-leaf nodes M3, M4 are child nodes of the non-leaf node T2.
  • the leaf nodes L1, L2, L3 are child nodes of the non-leaf node M1.
  • the leaf nodes L4, L5 are child nodes of the non-leaf node M2.
  • the leaf nodes L6, L7 are child nodes of the non-leaf node M3.
  • the leaf nodes L8, L9 are child nodes of the non-leaf node M4.
  • FIG. 4b shows a schematic diagram of a rectangular frame corresponding to a leaf node and a non-leaf node included in the data structure shown in FIG. 4a.
  • the rectangular frames A, B, and C are rectangular frames sequentially corresponding to the leaf nodes L1, L2, and L3 and the rectangular frame P1 is a rectangular frame corresponding to the non-leaf node M1, and the rectangular frames A, B, and C are included.
  • the rectangular frames D and E are rectangular frames sequentially corresponding to the leaf nodes L4 and L5
  • the rectangular frame P2 is a rectangular frame corresponding to the non-leaf node M2, and the rectangular frames D and E are included in the rectangular frame P2.
  • the rectangular frame P5 is a rectangular frame corresponding to the non-leaf node T1, and the rectangular frames P1, P2 are included in the rectangular frame P5.
  • the rectangular frames F and G are rectangular frames sequentially corresponding to the leaf nodes L6 and L7
  • the rectangular frame P3 is a rectangular frame corresponding to the non-leaf node M3, and the rectangular frames F and G are included in the rectangular frame P3.
  • the rectangular frames H and I are rectangular frames sequentially corresponding to the leaf nodes L8 and L9
  • the rectangular frame P4 is a rectangular frame corresponding to the non-foliar node M4, and the rectangular frames H and I are included in the rectangular frame P4.
  • the rectangular frame P6 is a rectangular frame corresponding to the non-leaf node T2, and the rectangular frames P3 and P4 are included in the rectangular frame P6.
  • the electronic device for each of the to-be-distributed orders in the set of orders to be delivered, the electronic device, after mapping the receiving address included in the order to be delivered into a coordinate point, the electronic The device may further determine a delivery area identifier corresponding to the to-be-distributed order by performing the following steps: based on the mapped coordinate point and the position information of the rectangular frame corresponding to the non-leaf node and the leaf node included in the data structure, Determining a target leaf node in the data structure, wherein the rectangular frame corresponding to the target leaf node may be a rectangular frame in which the mapped coordinate point is located; using the mapped coordinate point as a starting point, along the two-dimensional plane Draw a ray in the horizontal direction to determine the total number of intersections of the drawn ray and the edge of the geometric figure in the rectangular frame corresponding to the target leaf node.
  • the distribution area identifier corresponding to the geometry in the rectangular frame is used as the delivery area corresponding to the order to be delivered Identity.
  • the electronic device can determine the corresponding delivery area identification for each order to be delivered in a short time by performing the step.
  • the electronic device may determine a rectangular frame in which the coordinate point J is located in the rectangular frames P5 and P6 corresponding to the non-leaf nodes T1 and T2, respectively.
  • the electronic device may determine a rectangular frame in which the coordinate point J is located in the rectangular frames P1 and P2 corresponding to the child nodes M1 and M2 of the non-leaf node T1, respectively. Then, in response to the electronic device determining that the coordinate point J is in the rectangular frame P1, the electronic device may determine the coordinate point J in the rectangular frames A, B, and C corresponding to the child nodes L1, L2, and L3 of the non-leaf node M1, respectively. Rectangular box. Finally, in response to the electronic device determining that the coordinate point J is within the rectangular frame A, the electronic device may determine the leaf node L1 as the target leaf node.
  • the positional information of the rectangular frame P5 includes the coordinates (x1, y1) of the upper right vertex of the rectangular frame P5 and the coordinates (x2, y2) of the lower left vertex.
  • the coordinate of the coordinate point J is (x, y). If x2 ⁇ x ⁇ x1 and y1 ⁇ y ⁇ y2, the electronic device can determine that the coordinate point J is within the rectangular frame P5.
  • Step 203 The orders to be delivered corresponding to the same delivery area identifier in the set of orders to be delivered are divided into the same order group to be delivered.
  • the electronic device may identify the same delivery area identifier in the set of orders to be delivered.
  • the order to be delivered is divided into the same order group to be delivered, thereby obtaining at least one order group to be delivered.
  • Step 204 Set a group identifier for each of the divided order groups to be delivered, and generate a correspondence between the group identifier and the delivery area identifier corresponding to the to-be-delivered order group.
  • the electronic device may set a group identifier for each of the divided order groups to be delivered, and generate the group identifier and the to-be-set The correspondence between the delivery area identifiers corresponding to the delivery order group.
  • the electronic device may record the correspondence between the group identifier and the delivery area identifier by using a key-value pair, for example, using the group identifier as a key, and using the delivery area identifier as a value to form a key-value pair.
  • the electronic device described above may be remotely connected to a server for generating a preset group identification.
  • the electronic device may send the delivery area identifier corresponding to the order group to be delivered to the group identity generation server, so that the group identity generation server returns a group identifier, and the electronic device may set the group identifier as the to-be-sold order.
  • the group ID of the group may be remotely connected to a server for generating a preset group identification.
  • the electronic device may send the delivery area identifier corresponding to the order group to be delivered to the group identity generation server, so that the group identity generation server returns a group identifier, and the electronic device may set the group identifier as the to-be-sold order.
  • the group ID of the group may be remotely connected to a server for generating a preset group identification.
  • each of the delivery area identifiers may have a corresponding delivery mode identifier
  • the delivery mode identifier may be, for example, a delivery mode identifier for indicating self-delivery or A shipping method identifier used to indicate third-party logistics distribution.
  • the distribution mode identifier used to indicate the self-delivery and the delivery mode identifier used to indicate the third-party logistics distribution may respectively correspond to different group identification generation manners.
  • the electronic device may generate a group identifier according to the group identifier generation manner corresponding to the delivery mode identifier associated with the order group to be delivered, and set the generated group identifier to be the The group ID of the fulfillment order group.
  • the first character of the group identifier is the first preset character, the first character is followed by the current timestamp, and the current timestamp is followed by the preset number of digits (for example, 5). Etc.)
  • the serial number For example, the first character of the group identifier is the second preset character, the first character is followed by the current time stamp, and the current time stamp is followed by the preset number of digits. serial number.
  • the first preset character and the second preset character may be different from each other.
  • the first preset character and the second preset character may be, for example, letters or numbers. It should be noted that the first preset character, the second preset character, and the preset number of digits are modified according to actual needs, and the embodiment does not limit the content.
  • each of the to-be-delivered orders in the set of orders to be delivered may further include an order identifier.
  • the electronic device may further generate a correspondence between the group identifier of the order group to be delivered and the order identifier of the order to be delivered included in the order group to be delivered.
  • the electronic device may record, by means of a key-value pair, a correspondence between the group identifier and an order identifier of an order to be delivered included in the order group to be delivered.
  • the group identifier is used as a key
  • the order identifier list formed by the order identifiers of the respective orders to be delivered included in the order group to be delivered is a value, and constitutes a key value pair.
  • the electronic device in response to the electronic device receiving the prompt information of the order identifier including the abnormal order, may determine the abnormal order from each of the divided order groups to be delivered.
  • the target delivery order group is located, the abnormal order is removed from the target delivery order group, and the correspondence between the order identifier of the abnormal order and the group identifier of the target delivery order group is cancelled.
  • the abnormal order may be an order that cannot be delivered in the divided order group to be delivered. For example, an order for a refund after the user has paid for it or an order without a corresponding stock.
  • the group identifier of the target to-be-distributed order group and the order identifier of the order to be delivered included in the target to-be-scheduled order group are stored in a key-value pair manner, and the electronic device can be shifted from the value of the key-value pair.
  • the order ID of the exception order is assumed that the group identifier of the target to-be-distributed order group and the order identifier of the order to be delivered included in the target to-be-scheduled order group are stored in a key-value pair manner, and the electronic device can be shifted from the value of the key-value pair.
  • the order ID of the exception order is assumed that the group identifier of the target to-be-distributed order group and the order identifier of the order to be delivered included in the target to-be-scheduled order group are stored in a key-value pair manner, and the electronic device can be shifted from the value of the key-value pair.
  • FIG. 5 is a schematic diagram of an application scenario of the information processing method according to the embodiment.
  • the set of orders to be delivered is pre-stored locally in the information processing terminal, and the order to be delivered includes a delivery address.
  • the information processing terminal can locally acquire the set of orders to be delivered.
  • the information processing end may map the receiving address included in the order to be delivered into a latitude and longitude coordinate point through a preset GIS system.
  • the information processing end may divide the orders to be delivered corresponding to the same delivery area identifier in the set of orders to be delivered into the same order group to be delivered, and obtain the order groups T1, T2, and T3 to be delivered.
  • the order group T1 to be delivered corresponds to the delivery area identifier F1
  • the order group T2 to be delivered corresponds to the delivery area identifier F3
  • the order group T3 to be delivered corresponds to the delivery area identifier F4.
  • the information processing end may set a group identifier T11 for the order group T1 to be delivered, a group identifier T21 for the order group T2 to be delivered, and a group identifier T31 for the order group T3 to be delivered, and
  • the value pair manner generates a correspondence relationship between the group identifier T11 and the delivery area identifier F1, a correspondence relationship between the group identification T21 and the delivery area identifier F3, and a correspondence relationship between the group identification T31 and the delivery area identification F4.
  • the method provided by the above embodiment of the present application effectively utilizes the determination of the delivery area identifier corresponding to the order to be delivered, and achieves targeted information generation.
  • the correspondence between the generated group identifier and the delivery area identifier is applied to the delivery person receiving link, and the delivery staff can quickly obtain the order group to be delivered indicated by the group identifier through the group identification, and can also Knowing the delivery area where the delivery address of the order to be delivered is located, the delivery time of the delivery person can be shortened to improve the delivery efficiency of the delivery staff.
  • the process 600 of the information processing method includes the following steps:
  • Step 601 Acquire a collection of orders to be delivered.
  • Step 602 For each order to be delivered in the set of orders to be delivered, map the receiving address included in the order to be delivered into coordinate points, and based on the mapped coordinate points, in the preset distribution area identification set. A delivery area identifier corresponding to the order to be delivered is determined.
  • Step 603 The orders to be delivered corresponding to the same delivery area identifier in the set of orders to be delivered are divided into the same order group to be delivered.
  • Step 604 Set a group identifier for each of the divided order groups to be delivered, and generate a correspondence between the group identifier and the delivery area identifier corresponding to the order group to be delivered.
  • each of the delivery area identification sets may have a corresponding delivery staff identification.
  • step 601, step 602, step 603, and step 604 and the technical effects thereof may be referred to the relevant descriptions of step 201, step 202, step 203, and step 204 in the corresponding embodiment of FIG. 2, respectively. No longer.
  • Step 605 For each distribution area identifier in the distribution area identifier set, send the group identifier corresponding to the delivery area identifier to the terminal device of the delivery person indicated by the delivery staff identifier corresponding to the delivery area identifier.
  • the electronic device may identify the delivery area identifier by using a wired connection manner or a wireless connection manner for each of the delivery area identifiers in the distribution area identifier set.
  • the group identifier is sent to the terminal device of the dispatcher indicated by the dispatcher identifier corresponding to the delivery area identifier.
  • Step 606 in response to receiving the receipt information including the dispatcher identifier and the group identifier, determining whether the dispatcher identifier and the group identifier included in the receipt information have an association relationship.
  • the electronic device may further receive the receipt information including the dispatcher identifier and the group identifier sent by the dispatcher through the terminal device. If the electronic device receives the receipt information, the electronic device may determine whether the distribution identifier and the group identifier included in the receipt information have an association relationship. As an example, the electronic device may first determine a target delivery area identifier corresponding to the delivery staff identifier in the distribution area identifier set, and then in the corresponding relationship between the group identifier of the generated order group to be delivered and the delivery area identifier. The group identifier corresponding to the target delivery area identifier is determined, and finally the group identifier is compared with the group identifier included in the receipt information. If the two are the same, the electronic device may determine that the dispatcher identifier and the group identifier included in the receipt information have an association relationship.
  • the group identifier of the order group to be delivered may be used to generate a barcode.
  • the barcode generator application may be pre-installed on the electronic device, and the electronic device may use the application to generate a barcode including the group identifier.
  • the above-mentioned receipt information may be, for example, that the dispatcher uses the terminal device to scan the barcode generated by the group identification.
  • Step 607 Return the order group to be delivered indicated by the group identifier included in the receipt information.
  • the electronic device in response to the electronic device determining that the dispatcher identifier included in the receipt information has an association relationship with the group identifier, the electronic device may return an order to be delivered indicated by the group identifier included in the receipt information. group.
  • the flow 600 of the information processing method in the present embodiment highlights the steps of transmitting the group identification and the step of receiving the receipt information, as compared with the embodiment corresponding to FIG.
  • the delivery staff identification By pre-binding the delivery staff identification with the delivery area identification, it is avoided that the delivery person picks the order (for example, some delivery personnel will pick the order according to the size of the cargo, the distance of the delivery area, etc.).
  • the group ID By sending the group ID to the corresponding dispatcher's terminal device, it is convenient for the dispatcher to clearly understand which order group to be delivered is responsible for delivery.
  • After receiving the receipt information it is determined whether the distribution identifier and the group identification included in the receipt information have an association relationship to avoid returning the wrong order group to be delivered.
  • the dispatcher can obtain each of the distributions that are responsible for the delivery in a short period of time. Orders to be delivered. As the delivery time is shortened, the distribution efficiency of the delivery staff will be further improved.
  • the present application provides an embodiment of an information processing apparatus, and the apparatus embodiment corresponds to the method embodiment shown in FIG. Used in a variety of electronic devices.
  • the information processing apparatus 700 shown in this embodiment includes an acquisition unit 701, a determination unit 702, a division unit 703, and a generation unit 704.
  • the obtaining unit 701 is configured to obtain a set of orders to be delivered, wherein the order to be delivered includes a receiving address
  • the determining unit 702 is configured to: the order to be delivered for each order to be delivered in the set of orders to be delivered
  • the included delivery address is mapped into a coordinate point, and based on the mapped coordinate point, the delivery area identifier corresponding to the to-be-distributed order is determined in the preset delivery area identification set
  • the dividing unit 703 is configured to be used
  • the order to be delivered corresponding to the same delivery area identifier in the distribution order set is divided into the same order group to be delivered
  • the generating unit 704 is configured to set a group identifier for each of the divided order groups to be distributed, and generate the group Corresponding to the correspondence between the distribution area identifier corresponding to the order group to be delivered
  • step 201 the specific processing of the information processing apparatus 700, the obtaining unit 701, the determining unit 702, the dividing unit 703, and the generating unit 704, and the technical effects thereof can be referred to step 201 in the corresponding embodiment of FIG. 2, respectively.
  • the related descriptions of step 202, step 203 and step 204 are not described herein again.
  • each of the delivery area identifiers may have a corresponding coordinate point sequence, and each coordinate point in the coordinate point sequence may be indicated by the delivery area identifier.
  • a point on the boundary of the delivery area, the distribution area identifier may also have a corresponding geometric figure, which may be a closed pattern formed by connecting adjacent coordinate points in the sequence of coordinate points.
  • the determining unit 702 may include: a first determining subunit (not shown in the figure) configured to use the mapped coordinate point as a starting point in two dimensions. Drawing a ray in a horizontal direction on the plane, and determining, for each distribution area identifier in the distribution area identification set, a total number of intersections of edges of the geometric figure corresponding to the distribution area identifier and the ray, if the total number is an odd number, Then, the delivery area identifier is used as the delivery area identifier corresponding to the to-be-distributed order.
  • the distribution area identifier set may have a corresponding data structure, and the data structure may include a leaf node and a non-leaf node, where the leaf node may be a node that does not include a child node, and each The non-leaf nodes may include at least two child nodes; each leaf node and each non-leaf node included in the data structure may respectively correspond to different rectangular frames, and store corresponding position information of the rectangular frame;
  • the corresponding rectangular frame may be a minimum circumscribed rectangle of the geometrical figure corresponding to the delivery area identifier in the distribution area identifier set; for each non-leaf node of each non-leaf node, each sub-node included in the non-leaf node respectively The corresponding rectangular frame may be included in the rectangular frame corresponding to the non-leaf node.
  • the determining unit 702 may further include: a second determining subunit (not shown) configured to use the mapped coordinate points and the data structure.
  • the position information of the rectangular frame corresponding to the non-leaf node and the leaf node respectively is determined, and the target leaf node is determined in the data structure, wherein the rectangular frame corresponding to the target leaf node may be a rectangle where the mapped coordinate point is located a third determining subunit (not shown) configured to draw a ray in a horizontal direction on the two-dimensional plane starting from the mapped coordinate point to determine the drawn ray and the target leaf
  • the total number of intersections of the edges of the geometric shapes in the rectangular frame corresponding to the node is used as The delivery area identifier corresponding to the order to be delivered.
  • the order to be delivered in the set of orders to be delivered may be derived from an order set, and each order in the order set may include identification information, and the set of orders to be delivered may be generated by the following steps: For each order in the order set, it is determined whether the preset identifier in the preset identifier set exists in the identification information included in the order, and if not, the order is classified into the order to be delivered.
  • each of the delivery area identifiers may have a corresponding delivery mode identifier
  • the delivery mode identifier may be a delivery mode identifier used to indicate self-delivery or used for And a delivery mode identifier indicating the third-party logistics distribution, wherein the delivery mode identifier used to indicate the self-delivery and the delivery mode identifier used to indicate the third-party logistics delivery can respectively correspond to different group identification generation modes.
  • the generating unit 704 may include: a setting subunit (not shown) configured to be used for each of the divided order groups to be delivered.
  • the group identifier generation manner corresponding to the delivery mode identifier associated with the order group generates a group identifier, and the generated group identifier is set as the group identifier of the order group to be delivered.
  • each of the to-be-delivered orders in the set of orders to be delivered may further include an order identifier; and the apparatus 700 may further include: a first generating unit (not shown), The configuration is configured to generate, for each of the divided order groups to be delivered, a correspondence between a group identifier of the order group to be delivered and an order identifier of the order to be delivered included in the order group to be delivered.
  • the apparatus 700 may further include: a removing unit (not shown) configured to respond to receiving the prompt information of the order identifier including the abnormal order, from Determining the target to-be-scheduled order group in which the abnormal order is located in each of the divided order groups to be dispensed, removing the abnormal order from the target to-be-sold order group, and canceling the order ID of the abnormal order and the target to-be-distributed order
  • a removing unit (not shown) configured to respond to receiving the prompt information of the order identifier including the abnormal order, from Determining the target to-be-scheduled order group in which the abnormal order is located in each of the divided order groups to be dispensed, removing the abnormal order from the target to-be-sold order group, and canceling the order ID of the abnormal order and the target to-be-distributed order.
  • each of the delivery area identifiers may have a corresponding delivery identifier; and the apparatus 700 may further include: a first sending unit (not shown in the figure) And configured to send, for each of the delivery area identifiers, the group identifier corresponding to the delivery area identifier to the terminal device of the dispatcher indicated by the delivery staff identifier corresponding to the delivery area identifier.
  • the apparatus 700 may further include: a second sending unit (not shown) configured to receive the receiving information including the dispatcher identifier and the group identifier in response to receiving And determining whether the dispatcher identifier and the group identifier included in the receipt information have an association relationship, and if yes, returning the order group to be delivered indicated by the group identifier included in the receipt information.
  • a second sending unit (not shown) configured to receive the receiving information including the dispatcher identifier and the group identifier in response to receiving And determining whether the dispatcher identifier and the group identifier included in the receipt information have an association relationship, and if yes, returning the order group to be delivered indicated by the group identifier included in the receipt information.
  • FIG. 8 a block diagram of a computer system 800 suitable for use in implementing the electronic device of the embodiments of the present application is shown.
  • the electronic device shown in FIG. 8 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 800 includes a central processing unit (CPU) 801 that can be loaded into a program in random access memory (RAM) 803 according to a program stored in read only memory (ROM) 802 or from storage portion 808. And perform various appropriate actions and processes.
  • RAM random access memory
  • ROM read only memory
  • RAM 803 various programs and data required for the operation of the system 800 are also stored.
  • the CPU 801, the ROM 802, and the RAM 803 are connected to each other through a bus 804.
  • An input/output (I/O) interface 805 is also coupled to bus 804.
  • the following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, etc.; an output portion 807 including, for example, a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and a storage portion 808 including a hard disk or the like. And a communication portion 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the Internet.
  • Driver 810 is also coupled to I/O interface 805 as needed.
  • a removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like, is mounted on the drive 810 as needed so that a computer program read therefrom is installed into the storage portion 808 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 809, and/or installed from removable media 811.
  • the central processing unit (CPU) 801 the above-described functions defined in the system of the present application are executed.
  • the computer readable medium illustrated in 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 diagrams can represent a module, a program segment, or a portion of code that includes one or more Executable instructions.
  • the functions noted in the blocks may 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 or flowcharts, and combinations of blocks in the block diagrams or flowcharts can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be used A combination of dedicated hardware and computer instructions is implemented.
  • the units involved in the embodiments of the present application may be implemented by software or by hardware.
  • the described unit may also be provided in the processor, for example, as a processor including an acquisition unit, a determination unit, a division unit, and a generation unit.
  • the name of these units does not constitute a limitation on the unit itself in some cases.
  • the obtaining unit may also be described as “a unit that acquires a set of orders 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.
  • the electronic device includes: acquiring a set of orders to be delivered, wherein the order to be delivered includes a receiving address; For each order to be delivered in the set of orders to be delivered, the receiving address included in the order to be delivered is mapped into coordinate points, and based on the mapped coordinate points, the preset shipping area identification set is determined
  • the distribution area identifier corresponding to the order to be delivered; the order to be delivered corresponding to the same delivery area identifier in the to-be-distributed order set is divided into the same order group to be delivered; the group identifier is set for each of the divided order groups to be delivered, and A correspondence between the group identifier and the delivery area identifier corresponding to the order group to be delivered is generated.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Remote Sensing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本申请实施例公开了信息处理方法和装置。该方法的一具体实施方式包括：获取待配送订单集合，其中，待配送订单包括收货地址；对于待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识；将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组；为划分出的每个待配送订单组设置组标识，并生成该组标识与该待配送订单组所对应的配送区域标识之间的对应关系。该实施方式实现了富于针对性的信息生成。

Description

信息处理方法和装置
相关申请的交叉引用
本专利申请要求于2017年9月8日提交的、申请号为201710805880.3、申请人为北京京东尚科信息技术有限公司和北京京东世纪贸易有限公司、发明名称为“信息处理方法和装置”的中国专利申请的优先权，该申请的全文以引用的方式并入本申请中。
技术领域
本申请涉及计算机技术领域，具体涉及互联网技术领域，尤其涉及信息处理方法和装置。
背景技术
目前，配送员在给客户送货前，通常需要在配送站点按订单或者包裹全部扫描一次才能完成收货。当订单量较大的时候，对每个订单都进行扫描，将会占用配送员较长的时间，影响配送员的配送效率。
因此，如何有效利用待配送订单集合，生成用于配送员收货环节的信息，以缩短配送员的收货时间，是一个值得研究的问题。
发明内容
本申请实施例的目的在于提出一种改进的信息处理方法和装置，来解决以上背景技术部分提到的技术问题。
第一方面，本申请实施例提供了一种信息处理方法，该方法包括：获取待配送订单集合，其中，待配送订单包括收货地址；对于待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识；将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组； 为划分出的每个待配送订单组设置组标识，并生成该组标识与该待配送订单组所对应的配送区域标识之间的对应关系。
在一些实施例中，配送区域标识集合中的每个配送区域标识具有对应的坐标点序列，该坐标点序列中的各个坐标点是该配送区域标识所指示的配送区域的边界上的点，该配送区域标识还具有对应的几何图形，该几何图形是通过对该坐标点序列中的相邻坐标点进行连接所形成的封闭式的图形。
在一些实施例中，基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识，包括：以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，对于配送区域标识集合中的每个配送区域标识，确定该配送区域标识所对应的几何图形的边与该射线的交点的总数目，若该总数目为奇数，则将该配送区域标识作为与该待配送订单对应的配送区域标识。
在一些实施例中，配送区域标识集合具有对应的数据结构，该数据结构包括叶子节点和非叶子节点，其中，叶子节点是不包括子节点的节点，每个非叶子节点包括至少两个子节点；该数据结构所包括的各个叶子节点和各个非叶子节点分别对应不同的矩形框，且存储有所对应的矩形框的位置信息；该各个叶子节点分别对应的矩形框是配送区域标识集合中的配送区域标识所对应的几何图形的最小外接矩形；对于该各个非叶子节点中的每个非叶子节点，该非叶子节点所包括的各个子节点分别对应的矩形框包含在该非叶子节点所对应的矩形框内。
在一些实施例中，基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识，还包括：基于该经映射所得的坐标点和上述数据结构所包括的非叶子节点和叶子节点分别对应的矩形框的位置信息，在上述数据结构中确定目标叶子节点，其中，该目标叶子节点所对应的矩形框是该经映射所得的坐标点所在的矩形框；以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，确定所画的射线与该目标叶子节点所对应的矩形框内的几何图形的边的交点的总数目，若所确定的总数目为奇数，则将与该目标叶子节点对应的矩形框内的几何图形所对应的配送区域标 识作为与该待配送订单对应的配送区域标识。
在一些实施例中，待配送订单集合中的待配送订单来源于订单集合，订单集合中的每个订单包括标识信息，待配送订单集合是通过以下步骤生成的：对于订单集合中的每个订单，确定该订单所包括的标识信息中是否存在预置标识集合中的预置标识，若否，则将该订单归入待配送订单集合。
在一些实施例中，配送区域标识集合中的每个配送区域标识具有对应的配送方式标识，该配送方式标识为用于指示自配送的配送方式标识或用于指示第三方物流配送的配送方式标识，该用于指示自配送的配送方式标识和该用于指示第三方物流配送的配送方式标识分别对应不同的组标识生成方式。
在一些实施例中，为划分出的每个待配送订单组设置组标识，包括：对于划分出的每个待配送订单组，按照与该待配送订单组相关联的配送方式标识所对应的组标识生成方式生成组标识，并将所生成的组标识设置为该待配送订单组的组标识。
在一些实施例中，待配送订单集合中的每个待配送订单还包括订单标识；以及上述方法还包括：对于划分出的每个待配送订单组，生成该待配送订单组的组标识与该待配送订单组所包括的待配送订单的订单标识之间的对应关系。
在一些实施例中，上述方法还包括：响应于接收到包括异常订单的订单标识的提示信息，则从所划分出的各个待配送订单组中确定该异常订单所在的目标待配送订单组，从该目标待配送订单组中移除该异常订单，并取消该异常订单的订单标识与该目标待配送订单组的组标识之间的对应关系，其中，该异常订单是所划分出的待配送订单组中的、不能被配送的订单。
在一些实施例中，配送区域标识集合中的每个配送区域标识具有对应的配送员标识；以及上述方法还包括：对于配送区域标识集合中的每个配送区域标识，将该配送区域标识所对应的组标识发送至该配送区域标识所对应的配送员标识所指示的配送员的终端设备。
在一些实施例中，上述方法还包括：响应于接收到包括配送员标 识和组标识的收货信息，则确定该收货信息所包括的配送员标识和组标识是否具有关联关系，若是，则返回该收货信息所包括的组标识所指示的待配送订单组。
第二方面，本申请实施例提供了一种信息处理装置，该装置包括：获取单元，配置用于获取待配送订单集合，其中，待配送订单包括收货地址；确定单元，配置用于对于待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识；划分单元，配置用于将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组；生成单元，配置用于为划分出的每个待配送订单组设置组标识，并生成该组标识与该待配送订单组所对应的配送区域标识之间的对应关系。
在一些实施例中，配送区域标识集合中的每个配送区域标识具有对应的坐标点序列，该坐标点序列中的各个坐标点是该配送区域标识所指示的配送区域的边界上的点，该配送区域标识还具有对应的几何图形，该几何图形是通过对该坐标点序列中的相邻坐标点进行连接所形成的封闭式的图形。
在一些实施例中，上述确定单元包括：第一确定子单元，配置用于以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，对于配送区域标识集合中的每个配送区域标识，确定该配送区域标识所对应的几何图形的边与该射线的交点的总数目，若该总数目为奇数，则将该配送区域标识作为与该待配送订单对应的配送区域标识。
在一些实施例中，配送区域标识集合具有对应的数据结构，该数据结构包括叶子节点和非叶子节点，其中，叶子节点是不包括子节点的节点，每个非叶子节点包括至少两个子节点；该数据结构所包括的各个叶子节点和各个非叶子节点分别对应不同的矩形框，且存储有所对应的矩形框的位置信息；该各个叶子节点分别对应的矩形框是配送区域标识集合中的配送区域标识所对应的几何图形的最小外接矩形；对于该各个非叶子节点中的每个非叶子节点，该非叶子节点所包括的 各个子节点分别对应的矩形框包含在该非叶子节点所对应的矩形框内。
在一些实施例中，上述确定单元还包括：第二确定子单元，配置用于基于该经映射所得的坐标点和上述数据结构所包括的非叶子节点和叶子节点分别对应的矩形框的位置信息，在上述数据结构中确定目标叶子节点，其中，该目标叶子节点所对应的矩形框是该经映射所得的坐标点所在的矩形框；第三确定子单元，配置用于以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，确定所画的射线与该目标叶子节点所对应的矩形框内的几何图形的边的交点的总数目，若所确定的总数目为奇数，则将与该目标叶子节点对应的矩形框内的几何图形所对应的配送区域标识作为与该待配送订单对应的配送区域标识。
在一些实施例中，待配送订单集合中的待配送订单来源于订单集合，订单集合中的每个订单包括标识信息，待配送订单集合是通过以下步骤生成的：对于订单集合中的每个订单，确定该订单所包括的标识信息中是否存在预置标识集合中的预置标识，若否，则将该订单归入待配送订单集合。
在一些实施例中，配送区域标识集合中的每个配送区域标识具有对应的配送方式标识，该配送方式标识为用于指示自配送的配送方式标识或用于指示第三方物流配送的配送方式标识，该用于指示自配送的配送方式标识和该用于指示第三方物流配送的配送方式标识分别对应不同的组标识生成方式。
在一些实施例中，上述生成单元包括：设置子单元，配置用于对于划分出的每个待配送订单组，按照与该待配送订单组相关联的配送方式标识所对应的组标识生成方式生成组标识，并将所生成的组标识设置为该待配送订单组的组标识。
在一些实施例中，待配送订单集合中的每个待配送订单还包括订单标识；以及上述装置还包括：第一生成单元，配置用于对于划分出的每个待配送订单组，生成该待配送订单组的组标识与该待配送订单组所包括的待配送订单的订单标识之间的对应关系。
在一些实施例中，上述装置还包括：移除单元，配置用于响应于 接收到包括异常订单的订单标识的提示信息，则从所划分出的各个待配送订单组中确定该异常订单所在的目标待配送订单组，从该目标待配送订单组中移除该异常订单，并取消该异常订单的订单标识与该目标待配送订单组的组标识之间的对应关系，其中，该异常订单是所划分出的待配送订单组中的、不能被配送的订单。
在一些实施例中，配送区域标识集合中的每个配送区域标识具有对应的配送员标识；以及上述装置还包括：第一发送单元，配置用于对于配送区域标识集合中的每个配送区域标识，将该配送区域标识所对应的组标识发送至该配送区域标识所对应的配送员标识所指示的配送员的终端设备。
在一些实施例中，上述装置还包括：第二发送单元，配置用于响应于接收到包括配送员标识和组标识的收货信息，则确定该收货信息所包括的配送员标识和组标识是否具有关联关系，若是，则返回该收货信息所包括的组标识所指示的待配送订单组。
第三方面，本申请实施例提供了一种电子设备，该电子设备包括：一个或多个处理器；存储装置，用于存储一个或多个程序；当上述一个或多个程序被上述一个或多个处理器执行，使得上述一个或多个处理器实现如第一方面中任一实现方式描述的方法。
第四方面，本申请实施例提供了一种计算机可读存储介质，其上存储有计算机程序，上述程序被处理器执行时实现如第一方面中任一实现方式描述的方法。
本申请实施例提供的信息处理方法和装置，通过获取待配送订单集合，将所获取的待配送订单集合中的每个待配送订单所包括的收货地址映射成坐标点，以便基于该坐标点在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识。而后将该待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组，为划分出的每个待配送订单组设置组标识，以便生成该组标识与该待配送订单组所对应的配送区域标识之间的对应关系。从而有效利用了对待配送订单所对应的配送区域标识的确定，实现了富于针对性的信息生成。
而且，将所生成的组标识与配送区域标识之间的对应关系应用于配送员收货环节，配送员通过组标识便能快速地获取到该组标识所指示的待配送订单组，并且还能得知待配送订单的收货地址所在的配送区域，进而可以缩短配送员的收货时间以提高配送员的配送效率。
附图说明
通过阅读参照以下附图所作的对非限制性实施例所作的详细描述，本申请的其它特征、目的和优点将会变得更明显：
图1是本申请可以应用于其中的示例性系统架构图；
图2是根据本申请的信息处理方法的一个实施例的流程图；
图3是根据本申请的用于确定与待配送订单对应的配送区域标识的方法的示意图；
图4a是根据本申请的数据结构的示意图；
图4b是图4a所示的数据结构所包括的叶子节点和非叶子节点分别对应的矩形框的示意图；
图5是根据本申请的信息处理方法的一个应用场景的示意图；
图6是根据本申请的信息处理方法的又一个实施例的流程图；
图7是根据本申请的信息处理装置的一个实施例的结构示意图；
图8是适于用来实现本申请实施例的电子设备的计算机系统的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释相关发明，而非对该发明的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与有关发明相关的部分。
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本申请。
图1示出了可以应用本申请的信息处理方法或信息处理装置的实 施例的示例性系统架构100。
如图1所示，系统架构100可以包括信息处理端101，网络102和服务器103。网络102用以在信息处理端101和服务器103之间提供通信链路的介质。网络102可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
用户可以使用信息处理端101通过网络102与服务器103交互，以接收或发送信息等。信息处理端101上可以安装有各种通讯客户端应用，例如网页浏览器应用、信息处理类应用等。这里，信息处理端101例如可以从服务器103获取待配送订单集合，并对该待配送订单集合进行处理。
信息处理端101可以是各种电子设备，包括但不限于智能手机、平板电脑、膝上型便携计算机和台式计算机等等。信息处理端101例如可以是置于配送站点内的终端设备。
服务器103可以是提供各种服务的服务器，例如是存储有待配送订单集合的服务器。
需要说明的是，本申请实施例所提供的信息处理方法一般由信息处理端101执行，相应地，信息处理装置一般设置于信息处理端101中。
应该理解，图1中的信息处理端、网络和服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的信息处理端、网络和服务器。
需要说明的是，当待配送订单集合预先存储在信息处理端101本地时，系统架构100中可以不包括服务器103。
继续参考图2，示出了根据本申请的信息处理方法的一个实施例的流程200。该信息处理方法的流程200，包括以下步骤：
步骤201，获取待配送订单集合。
在本实施例中，待配送订单集合可以预先存储在与信息处理方法运行于其上的电子设备(例如图1所示的信息处理端101)远程通信连接的服务器中。上述电子设备可以通过有线连接方式或无线连接方式从该服务器获取上述待配送订单集合。当然，若上述待配送订单集 合预先存储在上述电子设备本地，上述电子设备也可以本地获取上述待配送订单集合。其中，待配送订单可以包括收货地址。
在本实施例的一些可选的实现方式中，上述待配送订单集合中的待配送订单可以来源于订单集合。该订单集合中的每个订单可以包括标识信息。上述待配送订单集合可以是通过以下步骤生成的：对于订单集合中的每个订单，确定该订单所包括的标识信息中是否存在预置标识集合中的预置标识，若否，则将该订单归入待配送订单集合。需要说明的是，上述待配送订单集合可以是上述电子设备或上述服务器通过执行该步骤生成的，本实施例不对此方面内容做任何限定。
需要指出的是，上述订单集合可以预先存储在上述电子设备本地或上述服务器中。其中，订单所包括的标识信息例如可以包括支付方式标识、配送方式标识、奢侈品订单标识、高额订单标识等等。支付方式标识例如可以包括以下至少一项：用于表征支付方式是线上付款的支付方式标识、用于表征支付方式是货到付款的支付方式标识、用于表征支付方式是现金支付的支付方式标识等等。配送方式标识例如可以包括以下至少一项：用于表征配送方式是自提方式的配送方式标识、用于表征配送方式是自配送的配送方式标识、用于表征配送方式是第三方物流配送的配送方式标识。奢侈品订单标识例如可以包括用于表征订单是奢侈品订单的奢侈品订单标识和/或用于表征订单不是奢侈品订单的奢侈品订单标识。高额订单标识例如可以包括用于表征订单是高额订单的高额订单标识和/或用于表征订单不是高额订单的高额订单标识。
这里，上述预置标识集合例如可以包括以下至少一项：用于表征配送方式是自提方式的配送方式标识、用于表征订单是奢侈品订单的奢侈品订单标识、用于表征订单是高额订单的高额订单标识等等。需要说明的是，上述预置标识集合是可以根据实际需要进行调整的，本实施例不对此方面内容做任何限定。
步骤202，对于待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标 识。
在本实施例中，上述电子设备在获取到上述待配送订单集合后，对于上述待配送订单集合中的每个待配送订单，上述电子设备可以将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识。其中，经映射所得的坐标点可以是经纬度坐标点。
需要说明的是，上述电子设备可以通过预置的地理信息系统(Geographic Information System，GIS)将待配送订单所包括的收货地址映射成坐标点。地理信息系统有时又称为“地学信息系统”。它是一种特定的十分重要的空间信息系统。它是在计算机硬、软件系统支持下，对整个或部分地球表层(包括大气层)空间中的有关地理分布数据进行采集、储存、管理、运算、分析、显示和描述的技术系统。
另外，上述电子设备本地可以存储有用于记录坐标点与配送区域标识的对应关系的信息列表，该信息列表中的每条信息可以包括坐标点和该坐标点所对应的配送区域标识。对于任意一个待配送订单，将该待配送订单所包括的收货地址映射成坐标点后，上述电子设备可以在该信息列表中查找与该坐标点相同的目标坐标点，若查找到，则上述电子设备可以将该目标坐标点所对应的配送区域标识作为与该待配送订单对应的配送区域标识。
在本实施例的一些可选的实现方式中，上述配送区域标识集合中的每个配送区域标识可以具有对应的坐标点序列，该坐标点序列中的各个坐标点可以是该配送区域标识所指示的配送区域的边界上的点，该配送区域标识还可以具有对应的几何图形，该几何图形可以是通过对该坐标点序列中的相邻坐标点进行连接所形成的封闭式的图形。这里，该坐标点序列中的坐标点可以是经纬度坐标点。
在本实施例的一些可选的实现方式中，对于上述待配送订单集合中的每个待配送订单，上述电子设备在将该待配送订单所包括的收货地址映射成坐标点后，上述电子设备可以通过以下方式确定与该待配送订单对应的配送区域标识：以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，对于上述配送区域标识集合中的每 个配送区域标识，确定该配送区域标识所对应的几何图形的边与该射线的交点的总数目，若该总数目为奇数，则将该配送区域标识作为与该待配送订单对应的配送区域标识。
如图3所示，图3示出了用于确定与待配送订单对应的配送区域标识的方法的一个示意图。图3中示出了坐标点301、具有多条边的不规则几何图形302和以坐标点301为起点的射线303。其中，坐标点301是通过对待配送订单A所包括的收货地址进行映射所得的坐标点。几何图形302与配送区域标识B相对应。射线303与几何图形302的边的交点的总数目为奇数3，可以表征坐标点301在几何图形302内，从而上述电子设备可以将配送区域标识B作为与待配送订单A对应的配送区域标识。
在本实施例的一些可选的实现方式中，上述配送区域标识集合可以具有对应的数据结构，该数据结构可以包括叶子节点和非叶子节点，其中，叶子节点是不包括子节点的节点，每个非叶子节点可以包括至少两个子节点。该数据结构所包括的各个叶子节点和各个非叶子节点可以分别对应不同的矩形框，且可以存储有所对应的矩形框的位置信息。上述各个叶子节点分别对应的矩形框可以是上述配送区域标识集合中的配送区域标识所对应的几何图形的最小外接矩形。对于上述各个非叶子节点中的每个非叶子节点，该非叶子节点所包括的各个子节点分别对应的矩形框可以包含在该非叶子节点所对应的矩形框内。这里，矩形框的位置信息例如可以包括该矩形框的左上顶点和右下顶点的坐标和/或右上顶点和左下顶点的坐标。
需要说明的是，该数据结构例如可以是有向图、树形结构或R树空间索引结构等。R树运用了空间分割的理念。R树采用了一种称为MBR(Minimal Bounding Rectangle，最小外接矩形)的方法，从叶子节点开始用矩形将空间框起来，节点越往上，框住的空间就越大，以此对空间进行分割。
如图4a所示，图4a示出了数据结构的一个示意图。在图4a中，数据结构包括叶子节点L1、L2、L3、L4、L5、L6、L7、L8、L9和非叶子节点M1、M2、M3、M4、T1、T2。其中，非叶子节点M1、M2 是非叶子节点T1的子节点。非叶子节点M3、M4是非叶子节点T2的子节点。叶子节点L1、L2、L3是非叶子节点M1的子节点。叶子节点L4、L5是非叶子节点M2的子节点。叶子节点L6、L7是非叶子节点M3的子节点。叶子节点L8、L9是非叶子节点M4的子节点。
如图4b所示，图4b示出了图4a所示的数据结构所包括的叶子节点和非叶子节点分别对应的矩形框的一个示意图。在图4b中，矩形框A、B、C是与叶子节点L1、L2、L3依次对应的矩形框，矩形框P1是与非叶子节点M1对应的矩形框，且矩形框A、B、C包含在矩形框P1内。矩形框D、E是与叶子节点L4、L5依次对应的矩形框，矩形框P2是与非叶子节点M2对应的矩形框，且矩形框D、E包含在矩形框P2内。矩形框P5是与非叶子节点T1对应的矩形框，且矩形框P1、P2包含在矩形框P5内。另外，矩形框F、G是与叶子节点L6、L7依次对应的矩形框，而矩形框P3是与非叶子节点M3对应的矩形框，且矩形框F、G包含在矩形框P3内。矩形框H、I是与叶子节点L8、L9依次对应的矩形框，而矩形框P4是与非叶子节点M4对应的矩形框，且矩形框H、I包含在矩形框P4内。矩形框P6是与非叶子节点T2对应的矩形框，且矩形框P3、P4包含在矩形框P6内。
在本实施例的一些可选的实现方式中，对于上述待配送订单集合中的每个待配送订单，上述电子设备在将该待配送订单所包括的收货地址映射成坐标点后，上述电子设备还可以通过执行以下步骤确定与该待配送订单对应的配送区域标识：基于经映射所得的坐标点和上述数据结构所包括的非叶子节点和叶子节点分别对应的矩形框的位置信息，在上述数据结构中确定目标叶子节点，其中，该目标叶子节点所对应的矩形框可以是该经映射所得的坐标点所在的矩形框；以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，确定所画的射线与该目标叶子节点所对应的矩形框内的几何图形的边的交点的总数目，若所确定的总数目为奇数，则将与该目标叶子节点对应的矩形框内的几何图形所对应的配送区域标识作为与该待配送订单对应的配送区域标识。这样，当上述配送区域标识集合包括大量的配送区域标识时，上述电子设备通过执行该步骤可以在较短的时间内为每 个待配送订单确定对应的配送区域标识。
以图4a和图4b分别所示的数据结构和该数据结构所包括的叶子节点和非叶子节点分别对应的矩形框为例，假定数据结构中的叶子节点和非叶子节点所存储的矩形框的位置信息是该矩形框的左上顶点和右下顶点的坐标；待配送订单Q的收货地址经映射后的坐标点为J。首先，上述电子设备可以在非叶子节点T1、T2分别对应的矩形框P5、P6中确定坐标点J所在的矩形框。接着，响应于上述电子设备确定坐标点J在矩形框P5内，上述电子设备可以在非叶子节点T1的子节点M1、M2分别对应的矩形框P1、P2内确定坐标点J所在的矩形框。然后，响应于上述电子设备确定坐标点J在矩形框P1内，上述电子设备可以在非叶子节点M1的子节点L1、L2、L3分别对应的矩形框A、B、C中确定坐标点J所在的矩形框。最后，响应于上述电子设备确定坐标点J在矩形框A内，上述电子设备可以将叶子节点L1确定为目标叶子节点。
这里，以矩形框P5为例，假定矩形框P5的位置信息包括矩形框P5的右上顶点的坐标(x1，y1)和左下顶点的坐标(x2，y2)。坐标点J的坐标为(x，y)。若x2<x<x1且y1<y<y2，则上述电子设备可以确定坐标点J在矩形框P5内。
步骤203，将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组。
在本实施例中，上述电子设备在确定与上述待配送订单集合中的每个待配送订单对应的配送区域标识后，上述电子设备可以将上述待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组，从而得到至少一个待配送订单组。
步骤204，为划分出的每个待配送订单组设置组标识，并生成组标识与该待配送订单组所对应的配送区域标识之间的对应关系。
在本实施例中，上述电子设备在对上述待配送订单集合进行待配送订单组划分后，上述电子设备可以为划分出的每个待配送订单组设置组标识，并生成该组标识与该待配送订单组所对应的配送区域标识之间的对应关系。作为示例，上述电子设备可以用键值对的方式记录 该组标识与该配送区域标识之间的对应关系，例如以该组标识为键，以该配送区域标识为值，组成键值对。
这里，上述电子设备可以与预置的组标识生成用服务器远程通信连接。上述电子设备可以将待配送订单组所对应的配送区域标识发送至该组标识生成用服务器，以使该组标识生成用服务器返回组标识，上述电子设备可以将该组标识设置为该待配送订单组的组标识。
在本实施例的一些可选的实现方式中，上述配送区域标识集合中的每个配送区域标识可以具有对应的配送方式标识，该配送方式标识例如可以为用于指示自配送的配送方式标识或用于指示第三方物流配送的配送方式标识。其中，用于指示自配送的配送方式标识和用于指示第三方物流配送的配送方式标识可以分别对应不同的组标识生成方式。对于划分出的每个待配送订单组，上述电子设备可以按照与该待配送订单组相关联的配送方式标识所对应的组标识生成方式生成组标识，并将所生成的组标识设置为该待配送订单组的组标识。
用于指示自配送的配送方式标识所对应的生成方式例如可以包括：组标识的首字符为第一预置字符、首字符后面为当前时间戳、当前时间戳后面为预置位数(例如5等)的流水号。用于指示第三方物流配送的配送方式标识所对应的生成方式例如可以包括：组标识的首字符为第二预置字符、首字符后面为当前时间戳、当前时间戳后面为预置位数的流水号。上述第一预置字符和上述第二预置字符可以互不相同。上述第一预置字符和上述第二预置字符例如可以是字母或数字等。需要说明的是，上述第一预置字符、上述第二预置字符和上述预置位数是可以根据实际需要进行修改的，本实施例不对此方面内容做任何限定。
在本实施例的一些可选的实现方式中，上述待配送订单集合中的每个待配送订单还可以包括订单标识。对于划分出的每个待配送订单组，上述电子设备还可以生成该待配送订单组的组标识与该待配送订单组所包括的待配送订单的订单标识之间的对应关系。作为示例，上述电子设备可以用键值对的方式记录该组标识与该待配送订单组所包括的待配送订单的订单标识之间的对应关系。例如以该组标识为键， 以该待配送订单组所包括的各个待配送订单的订单标识所形成的订单标识列表为值，组成键值对。
在本实施例的一些可选的实现方式中，响应于上述电子设备接收到包括异常订单的订单标识的提示信息，则上述电子设备可以从所划分出的各个待配送订单组中确定该异常订单所在的目标待配送订单组，从该目标待配送订单组中移除该异常订单，并取消该异常订单的订单标识与该目标待配送订单组的组标识之间的对应关系。其中，该异常订单可以是所划分出的待配送订单组中的、不能被配送的订单。例如用户付款后又申请退款的订单或没有相应库存的订单等。
作为示例，假定该目标待配送订单组的组标识与该目标待配送订单组所包括的待配送订单的订单标识是以键值对方式存储的，上述电子设备可以从键值对的值中移除该异常订单的订单标识。
继续参见图5，图5是根据本实施例的信息处理方法的应用场景的一个示意图。在图5的应用场景中，待配送订单集合预先存储在信息处理端本地，待配送订单包括收货地址。如标号501所示，上述信息处理端可以本地获取待配送订单集合。接着，如标号502所示，对于上述待配送订单集合中的每个待配送订单，上述信息处理端可以通过预置的GIS系统将该待配送订单所包括的收货地址映射成经纬度坐标点，并基于经映射所得的经纬度坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识，其中，该配送区域标识集合包括配送区域标识F1、F2、F3、F4、F5。然后，如标号503所示，上述信息处理端可以将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组，得到待配送订单组T1、T2、T3，其中，待配送订单组T1与配送区域标识F1对应，待配送订单组T2与配送区域标识F3对应，待配送订单组T3与配送区域标识F4对应。最后，如标号504所示，上述信息处理端可以为待配送订单组T1设置组标识T11，为待配送订单组T2设置组标识T21，以及为待配送订单组T3设置组标识T31，并以键值对的方式生成组标识T11与配送区域标识F1之间的对应关系、组标识T21与配送区域标识F3之间的对应关系以及组标识T31与配送区域标识F4之间的对应关系。
本申请的上述实施例提供的方法有效利用了对待配送订单所对应的配送区域标识的确定，实现了富于针对性的信息生成。
而且，将所生成的组标识与配送区域标识之间的对应关系应用于配送员收货环节，配送员通过组标识便能快速地获取到该组标识所指示的待配送订单组，并且还能得知待配送订单的收货地址所在的配送区域，进而可以缩短配送员的收货时间以提高配送员的配送效率。
进一步参考图6，其示出了信息处理方法的又一个实施例的流程600。该信息处理方法的流程600，包括以下步骤：
步骤601，获取待配送订单集合。
步骤602，对于待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识。
步骤603，将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组。
步骤604，为划分出的每个待配送订单组设置组标识，并生成组标识与该待配送订单组所对应的配送区域标识之间的对应关系。
在本实施例中，上述配送区域标识集合中的每个配送区域标识可以具有对应的配送员标识。这里，步骤601、步骤602、步骤603和步骤604具体处理及其所带来的技术效果可分别参考图2对应实施例中的步骤201、步骤202、步骤203和步骤204的相关说明，在此不再赘述。
步骤605，对于配送区域标识集合中的每个配送区域标识，将该配送区域标识所对应的组标识发送至该配送区域标识所对应的配送员标识所指示的配送员的终端设备。
在本实施例中，上述电子设备在执行完步骤604后，对于上述配送区域标识集合中的每个配送区域标识，上述电子设备可以通过有线连接方式或无线连接方式将该配送区域标识所对应的组标识发送至该配送区域标识所对应的配送员标识所指示的配送员的终端设备。
步骤606，响应于接收到包括配送员标识和组标识的收货信息， 则确定收货信息所包括的配送员标识和组标识是否具有关联关系。
在本实施例中，上述电子设备还可以接收配送员通过终端设备发送的包括配送员标识和组标识的收货信息。若上述电子设备接收到该收货信息，上述电子设备可以确定该收货信息所包括的配送员标识和组标识是否具有关联关系。作为示例，上述电子设备可以先在上述配送区域标识集合中确定与该配送员标识对应的目标配送区域标识，然后在所生成的待配送订单组的组标识与配送区域标识之间的对应关系中确定与该目标配送区域标识对应的组标识，最后将该组标识与该收货信息所包括的组标识进行比较。若两者相同，则上述电子设备可以确定该收货信息所包括的配送员标识和组标识具有关联关系。
在本实施例的一些可选的实现方式中，待配送订单组的组标识可以用于生成条码。上述电子设备上可以预先安装条码生成器应用，上述电子设备可以利用该应用生成包括该组标识的条码。上述收货信息例如可以是配送员使用终端设备扫描通过组标识生成的条码所发出的。
步骤607，返回收货信息所包括的组标识所指示的待配送订单组。
在本实施例中，响应于上述电子设备确定上述收货信息所包括的配送员标识与组标识具有关联关系，则上述电子设备可以返回上述收货信息所包括的组标识所指示的待配送订单组。
从图6中可以看出，与图2对应的实施例相比，本实施例中的信息处理方法的流程600突出了发送组标识的步骤以及接收收货信息的步骤。通过预先将配送员标识与配送区域标识进行绑定，避免出现配送员挑单的情况(例如有些配送员会根据货物体积的大小、配送区域的远近等进行挑单)。通过将组标识发送至对应的配送员的终端设备，方便配送员清楚地了解到自己负责配送哪些待配送订单组。在接收到收货信息后，通过确定该收货信息所包括的配送员标识和组标识是否具有关联关系，以避免返回错误的待配送订单组。在确定该收货信息所包括的配送员标识和组标识具有关联关系时，返回该组标识所指示的待配送订单组，可以使配送员在较短的时间内获取到其负责配送的每个待配送订单。由于收货时间缩短了，所以配送员的配送效率会进一步得到提高。
进一步参考图7，作为对上述各图所示方法的实现，本申请提供了一种信息处理装置的一个实施例，该装置实施例与图2所示的方法实施例相对应，该装置具体可以应用于各种电子设备中。
如图7所示，本实施例所示的信息处理装置700包括：获取单元701、确定单元702、划分单元703和生成单元704。其中，获取单元701，配置用于获取待配送订单集合，其中，待配送订单包括收货地址；确定单元702，配置用于对于待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识；划分单元703，配置用于将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组；而生成单元704，配置用于为划分出的每个待配送订单组设置组标识，并生成该组标识与该待配送订单组所对应的配送区域标识之间的对应关系
在本实施例中，信息处理装置700中：获取单元701、确定单元702、划分单元703和生成单元704的具体处理及其所带来的技术效果可分别参考图2对应实施例中的步骤201、步骤202、步骤203和步骤204的相关说明，在此不再赘述。
在本实施例的一些可选的实现方式中，配送区域标识集合中的每个配送区域标识可以具有对应的坐标点序列，该坐标点序列中的各个坐标点可以是该配送区域标识所指示的配送区域的边界上的点，该配送区域标识还可以具有对应的几何图形，该几何图形可以是通过对该坐标点序列中的相邻坐标点进行连接所形成的封闭式的图形。
在本实施例的一些可选的实现方式中，上述确定单元702可以包括：第一确定子单元(图中未示出)，配置用于以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，对于配送区域标识集合中的每个配送区域标识，确定该配送区域标识所对应的几何图形的边与该射线的交点的总数目，若该总数目为奇数，则将该配送区域标识作为与该待配送订单对应的配送区域标识。
在本实施例的一些可选的实现方式中，配送区域标识集合可以具 有对应的数据结构，该数据结构可以包括叶子节点和非叶子节点，其中，叶子节点可以是不包括子节点的节点，每个非叶子节点可以包括至少两个子节点；该数据结构所包括的各个叶子节点和各个非叶子节点可以分别对应不同的矩形框，且存储有所对应的矩形框的位置信息；该各个叶子节点分别对应的矩形框可以是配送区域标识集合中的配送区域标识所对应的几何图形的最小外接矩形；对于该各个非叶子节点中的每个非叶子节点，该非叶子节点所包括的各个子节点分别对应的矩形框可以包含在该非叶子节点所对应的矩形框内。
在本实施例的一些可选的实现方式中，上述确定单元702还可以包括：第二确定子单元(图中未示出)，配置用于基于该经映射所得的坐标点和上述数据结构所包括的非叶子节点和叶子节点分别对应的矩形框的位置信息，在上述数据结构中确定目标叶子节点，其中，该目标叶子节点所对应的矩形框可以是该经映射所得的坐标点所在的矩形框；第三确定子单元(图中未示出)，配置用于以该经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，确定所画的射线与该目标叶子节点所对应的矩形框内的几何图形的边的交点的总数目，若所确定的总数目为奇数，则将与该目标叶子节点对应的矩形框内的几何图形所对应的配送区域标识作为与该待配送订单对应的配送区域标识。
在本实施例的一些可选的实现方式中，待配送订单集合中的待配送订单可以来源于订单集合，订单集合中的每个订单可以包括标识信息，待配送订单集合可以是通过以下步骤生成的：对于订单集合中的每个订单，确定该订单所包括的标识信息中是否存在预置标识集合中的预置标识，若否，则将该订单归入待配送订单集合。
在本实施例的一些可选的实现方式中，配送区域标识集合中的每个配送区域标识可以具有对应的配送方式标识，该配送方式标识可以为用于指示自配送的配送方式标识或用于指示第三方物流配送的配送方式标识，该用于指示自配送的配送方式标识和该用于指示第三方物流配送的配送方式标识可以分别对应不同的组标识生成方式。
在本实施例的一些可选的实现方式中，上述生成单元704可以包 括：设置子单元(图中未示出)，配置用于对于划分出的每个待配送订单组，按照与该待配送订单组相关联的配送方式标识所对应的组标识生成方式生成组标识，并将所生成的组标识设置为该待配送订单组的组标识。
在本实施例的一些可选的实现方式中，待配送订单集合中的每个待配送订单还可以包括订单标识；以及上述装置700还可以包括：第一生成单元(图中未示出)，配置用于对于划分出的每个待配送订单组，生成该待配送订单组的组标识与该待配送订单组所包括的待配送订单的订单标识之间的对应关系。
在本实施例的一些可选的实现方式中，上述装置700还可以包括：移除单元(图中未示出)，配置用于响应于接收到包括异常订单的订单标识的提示信息，则从所划分出的各个待配送订单组中确定该异常订单所在的目标待配送订单组，从该目标待配送订单组中移除该异常订单，并取消该异常订单的订单标识与该目标待配送订单组的组标识之间的对应关系，其中，该异常订单可以是所划分出的待配送订单组中的、不能被配送的订单。
在本实施例的一些可选的实现方式中，配送区域标识集合中的每个配送区域标识可以具有对应的配送员标识；以及上述装置700还可以包括：第一发送单元(图中未示出)，配置用于对于配送区域标识集合中的每个配送区域标识，将该配送区域标识所对应的组标识发送至该配送区域标识所对应的配送员标识所指示的配送员的终端设备。
在本实施例的一些可选的实现方式中，上述装置700还可以包括：第二发送单元(图中未示出)，配置用于响应于接收到包括配送员标识和组标识的收货信息，则确定该收货信息所包括的配送员标识和组标识是否具有关联关系，若是，则返回该收货信息所包括的组标识所指示的待配送订单组。
下面参考图8，其示出了适于用来实现本申请实施例的电子设备的计算机系统800的结构示意图。图8示出的电子设备仅仅是一个示例，不应对本申请实施例的功能和使用范围带来任何限制。
如图8所示，计算机系统800包括中央处理单元(CPU)801，其 可以根据存储在只读存储器(ROM)802中的程序或者从存储部分808加载到随机访问存储器(RAM)803中的程序而执行各种适当的动作和处理。在RAM 803中，还存储有系统800操作所需的各种程序和数据。CPU 801、ROM 802以及RAM 803通过总线804彼此相连。输入/输出(I/O)接口805也连接至总线804。
以下部件连接至I/O接口805：包括键盘、鼠标等的输入部分806；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分807；包括硬盘等的存储部分808；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分809。通信部分809经由诸如因特网的网络执行通信处理。驱动器810也根据需要连接至I/O接口805。可拆卸介质811，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器810上，以便于从其上读出的计算机程序根据需要被安装入存储部分808。
特别地，根据本公开的实施例，上文参考流程图描述的过程可以被实现为计算机软件程序。例如，本公开的实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分809从网络上被下载和安装，和/或从可拆卸介质811被安装。在该计算机程序被中央处理单元(CPU)801执行时，执行本申请的系统中限定的上述功能。
需要说明的是，本申请所示的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本申请中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、 装置或者器件使用或者与其结合使用。而在本申请中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本申请各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，上述模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图或流程图中的每个方框、以及框图或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本申请实施例中所涉及到的单元可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元也可以设置在处理器中，例如，可以描述为：一种处理器包括获取单元、确定单元、划分单元和生成单元。其中，这些单元的名称在某种情况下并不构成对该单元本身的限定，例如，获取单元还可以被描述为“获取待配送订单集合的单元”。
作为另一方面，本申请还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的电子设备中所包含的；也可以是单独存在，而未装配入该电子设备中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被一个该电子设备执行时， 使得该电子设备包括：获取待配送订单集合，其中，待配送订单包括收货地址；对于待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识；将待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组；为划分出的每个待配送订单组设置组标识，并生成该组标识与该待配送订单组所对应的配送区域标识之间的对应关系。
以上描述仅为本申请的较佳实施例以及对所运用技术原理的说明。本领域技术人员应当理解，本申请中所涉及的发明范围，并不限于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离上述发明构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本申请中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (15)

  1. 一种信息处理方法，其特征在于，所述方法包括：
    获取待配送订单集合，其中，待配送订单包括收货地址；
    对于所述待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识；
    将所述待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组；
    为划分出的每个待配送订单组设置组标识，并生成所述组标识与该待配送订单组所对应的配送区域标识之间的对应关系。
  2. 根据权利要求1所述的方法，其特征在于，所述配送区域标识集合中的每个配送区域标识具有对应的坐标点序列，所述坐标点序列中的各个坐标点是该配送区域标识所指示的配送区域的边界上的点，该配送区域标识还具有对应的几何图形，所述几何图形是通过对所述坐标点序列中的相邻坐标点进行连接所形成的封闭式的图形。
  3. 根据权利要求2所述的方法，其特征在于，所述基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识，包括：
    以所述经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，对于所述配送区域标识集合中的每个配送区域标识，确定该配送区域标识所对应的几何图形的边与所述射线的交点的总数目，若所述总数目为奇数，则将该配送区域标识作为与该待配送订单对应的配送区域标识。
  4. 根据权利要求2所述的方法，其特征在于，所述配送区域标识集合具有对应的数据结构，所述数据结构包括叶子节点和非叶子节点，其中，叶子节点是不包括子节点的节点，每个非叶子节点包括至少两 个子节点；所述数据结构所包括的各个叶子节点和各个非叶子节点分别对应不同的矩形框，且存储有所对应的矩形框的位置信息；所述各个叶子节点分别对应的矩形框是所述配送区域标识集合中的配送区域标识所对应的几何图形的最小外接矩形；对于所述各个非叶子节点中的每个非叶子节点，该非叶子节点所包括的各个子节点分别对应的矩形框包含在该非叶子节点所对应的矩形框内。
  5. 根据权利要求4所述的方法，其特征在于，所述基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识，还包括：
    基于所述经映射所得的坐标点和所述数据结构所包括的非叶子节点和叶子节点分别对应的矩形框的位置信息，在所述数据结构中确定目标叶子节点，其中，所述目标叶子节点所对应的矩形框是所述经映射所得的坐标点所在的矩形框；
    以所述经映射所得的坐标点为起点，在二维平面上沿水平方向画一条射线，确定所画的射线与所述目标叶子节点所对应的矩形框内的几何图形的边的交点的总数目，若所确定的总数目为奇数，则将与所述目标叶子节点对应的矩形框内的几何图形所对应的配送区域标识作为与该待配送订单对应的配送区域标识。
  6. 根据权利要求1所述的方法，其特征在于，所述待配送订单集合中的待配送订单来源于订单集合，所述订单集合中的每个订单包括标识信息，所述待配送订单集合是通过以下步骤生成的：
    对于所述订单集合中的每个订单，确定该订单所包括的标识信息中是否存在预置标识集合中的预置标识，若否，则将该订单归入待配送订单集合。
  7. 根据权利要求1所述的方法，其特征在于，所述配送区域标识集合中的每个配送区域标识具有对应的配送方式标识，所述配送方式标识为用于指示自配送的配送方式标识或用于指示第三方物流配送的 配送方式标识，所述用于指示自配送的配送方式标识和所述用于指示第三方物流配送的配送方式标识分别对应不同的组标识生成方式。
  8. 根据权利要求7所述的方法，其特征在于，所述为划分出的每个待配送订单组设置组标识，包括：
    对于划分出的每个待配送订单组，按照与该待配送订单组相关联的配送方式标识所对应的组标识生成方式生成组标识，并将所生成的组标识设置为该待配送订单组的组标识。
  9. 根据权利要求1-8之一所述的方法，其特征在于，所述待配送订单集合中的每个待配送订单还包括订单标识；以及
    所述方法还包括：
    对于划分出的每个待配送订单组，生成该待配送订单组的组标识与该待配送订单组所包括的待配送订单的订单标识之间的对应关系。
  10. 根据权利要求9所述的方法，其特征在于，所述方法还包括：
    响应于接收到包括异常订单的订单标识的提示信息，则从所划分出的各个待配送订单组中确定所述异常订单所在的目标待配送订单组，从所述目标待配送订单组中移除所述异常订单，并取消所述异常订单的订单标识与所述目标待配送订单组的组标识之间的对应关系，其中，所述异常订单是所划分出的待配送订单组中的、不能被配送的订单。
  11. 根据权利要求1-8之一所述的方法，其特征在于，所述配送区域标识集合中的每个配送区域标识具有对应的配送员标识；以及
    所述方法还包括：
    对于所述配送区域标识集合中的每个配送区域标识，将该配送区域标识所对应的组标识发送至该配送区域标识所对应的配送员标识所指示的配送员的终端设备。
  12. 根据权利要求11所述的方法，其特征在于，所述方法还包括：
    响应于接收到包括配送员标识和组标识的收货信息，则确定所述收货信息所包括的配送员标识和组标识是否具有关联关系，若是，则返回所述收货信息所包括的组标识所指示的待配送订单组。
  13. 一种信息处理装置，其特征在于，所述装置包括：
    获取单元，配置用于获取待配送订单集合，其中，所述待配送订单集合中的每个待配送订单包括收货地址；
    确定单元，配置用于对于所述待配送订单集合中的每个待配送订单，将该待配送订单所包括的收货地址映射成坐标点，并基于经映射所得的坐标点，在预设的配送区域标识集合中确定与该待配送订单对应的配送区域标识；
    划分单元，配置用于将所述待配送订单集合中的对应同一个配送区域标识的待配送订单划分到同一个待配送订单组；
    生成单元，配置用于为划分出的每个待配送订单组设置组标识，并生成所述组标识与该待配送订单组所对应的配送区域标识之间的对应关系。
  14. 一种电子设备，其特征在于，包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求1-12中任一所述的方法。
  15. 一种计算机可读存储介质，其上存储有计算机程序，其特征在于，所述程序被处理器执行时实现如权利要求1-12中任一所述的方法。
PCT/CN2018/082688 2017-09-08 2018-04-11 信息处理方法和装置 WO2019047524A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/636,074 US20200193372A1 (en) 2017-09-08 2018-04-11 Information processing method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710805880.3A CN109472524B (zh) 2017-09-08 2017-09-08 信息处理方法和装置
CN201710805880.3 2017-09-08

Publications (1)

Publication Number Publication Date
WO2019047524A1 true WO2019047524A1 (zh) 2019-03-14

Family

ID=65634564

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/082688 WO2019047524A1 (zh) 2017-09-08 2018-04-11 信息处理方法和装置

Country Status (3)

Country Link
US (1) US20200193372A1 (zh)
CN (1) CN109472524B (zh)
WO (1) WO2019047524A1 (zh)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111754147B (zh) * 2019-03-28 2024-11-19 北京京东振世信息技术有限公司 路区划分方法、系统、装置和计算机可读存储介质
CN111932047A (zh) * 2019-05-13 2020-11-13 北京京东尚科信息技术有限公司 分配多任务集的方法、装置、设备和计算机可读介质
CN112132497A (zh) * 2019-06-25 2020-12-25 北京京东振世信息技术有限公司 配送接驳点确定方法、装置、介质及电子设备
CN112693802B (zh) * 2019-10-22 2022-12-27 北京京东振世信息技术有限公司 处理包裹的方法和装置
CN110969390B (zh) * 2019-12-02 2023-08-18 北京百度网讯科技有限公司 用于分区的方法、装置、设备和介质
CN113128744A (zh) * 2020-01-15 2021-07-16 北京沃东天骏信息技术有限公司 配送规划方法和装置
CN113762829B (zh) * 2020-08-05 2024-09-20 北京京东振世信息技术有限公司 订单货物的配送方法、装置及计算机可读介质
CN113762674B (zh) * 2020-10-22 2023-11-07 北京京东振世信息技术有限公司 订单配送方法和装置
CN113780711A (zh) * 2021-03-02 2021-12-10 北京沃东天骏信息技术有限公司 集合单处理方法及装置、电子设备、计算机可读存储介质
CN113364775B (zh) * 2021-06-04 2023-04-18 北京京东振世信息技术有限公司 微服务的调用方法、装置及服务器
CN114493745A (zh) * 2021-12-22 2022-05-13 浙江吉利控股集团有限公司 一种订单生成方法、装置和计算机可读存储介质
CN114022089B (zh) * 2022-01-04 2022-05-13 浙江口碑网络技术有限公司 一种配送禁入区域识别方法以及装置
CN114860725A (zh) * 2022-04-24 2022-08-05 京东城市(北京)数字科技有限公司 一种空间数据处理的方法和装置
CN116402430B (zh) * 2023-06-07 2023-09-19 成都运荔枝科技有限公司 一种基于冷链物流场景的干线订单匹配方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001061605A1 (en) * 2000-02-18 2001-08-23 Ipdev Co. System for placing product delivery orders through the internet
CN103785616A (zh) * 2013-12-25 2014-05-14 北京京东尚科信息技术有限公司 一种基于地理信息系统的邮件预分拣装置
CN105160021A (zh) * 2015-09-29 2015-12-16 滴滴（中国）科技有限公司 基于目的地偏好的订单分配方法及装置
CN105488172A (zh) * 2015-11-30 2016-04-13 北京奇艺世纪科技有限公司 一种基于位置的数据查询方法及装置
CN107093118A (zh) * 2016-09-27 2017-08-25 北京小度信息科技有限公司 一种资源设置方法及装置

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9754169B2 (en) * 2011-12-16 2017-09-05 Nec Corporation Information processing system, information processing method, information processing device and control method and control program thereof, and communication terminal and control method and control program thereof
CN102779300B (zh) * 2012-07-05 2017-09-19 华为技术有限公司 信息处理方法、服务器及物流终端
US9150119B2 (en) * 2013-03-15 2015-10-06 Aesynt Incorporated Apparatuses, systems, and methods for anticipating and delivering medications from a central pharmacy to a patient using a track based transport system
CN104077308B (zh) * 2013-03-28 2018-02-13 阿里巴巴集团控股有限公司 一种物流服务范围确定方法及装置
US10332058B1 (en) * 2014-06-27 2019-06-25 Amazon Technologies, Inc. Real time communication for carrier operations
CN105447667A (zh) * 2015-11-17 2016-03-30 成都信息工程大学 快递订单的自动分配方法
CN107025528A (zh) * 2016-01-29 2017-08-08 口碑控股有限公司 一种订单处理方法、设备和终端设备
CN105828292A (zh) * 2016-05-09 2016-08-03 青岛海信移动通信技术股份有限公司 一种基于地理围栏的位置检测方法及装置
CN106204222A (zh) * 2016-07-12 2016-12-07 多点生活(中国)网络科技有限公司 订单数据处理方法和装置
CN107016599A (zh) * 2017-04-06 2017-08-04 四川创物科技有限公司 一种订单集合分组方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001061605A1 (en) * 2000-02-18 2001-08-23 Ipdev Co. System for placing product delivery orders through the internet
CN103785616A (zh) * 2013-12-25 2014-05-14 北京京东尚科信息技术有限公司 一种基于地理信息系统的邮件预分拣装置
CN105160021A (zh) * 2015-09-29 2015-12-16 滴滴（中国）科技有限公司 基于目的地偏好的订单分配方法及装置
CN105488172A (zh) * 2015-11-30 2016-04-13 北京奇艺世纪科技有限公司 一种基于位置的数据查询方法及装置
CN107093118A (zh) * 2016-09-27 2017-08-25 北京小度信息科技有限公司 一种资源设置方法及装置

Also Published As

Publication number Publication date
CN109472524B (zh) 2022-04-26
US20200193372A1 (en) 2020-06-18
CN109472524A (zh) 2019-03-15

Similar Documents

Publication Publication Date Title
WO2019047524A1 (zh) 信息处理方法和装置
US20200286039A1 (en) Information generation method and apparatus
CN109241141B (zh) 深度学习的训练数据处理方法和装置
US11315070B2 (en) Method and apparatus for storing information
US10614621B2 (en) Method and apparatus for presenting information
CN110618982B (zh) 一种多源异构数据的处理方法、装置、介质及电子设备
US20210200971A1 (en) Image processing method and apparatus
CN109409419B (zh) 用于处理数据的方法和装置
CN110895591B (zh) 一种定位自提点的方法和装置
CN110619807B (zh) 生成全局热力图的方法和装置
CN108804445A (zh) 热力图生成方法和装置
CN117591025A (zh) 多源异构数据处理系统
US9535935B2 (en) Schema-based application model validation in a database
CN112308915A (zh) 用于定位快递包裹的方法和装置
CN109426878B (zh) 用于输出信息的方法和装置
CN109255563B (zh) 物品的储位区域的确定方法和装置
CN113379177B (zh) 一种任务调度系统和方法
CN113362090B (zh) 一种用户行为数据处理方法和装置
CN112633785B (zh) 一种仓储可视化的方法和装置
WO2024255306A1 (zh) 图像重建方法、装置、设备及存储介质
US9129318B2 (en) System and method for allocating suppliers using geographical information system and supplier capability
CN106062747A (zh) 信息接口生成
CN114676163A (zh) 一种数据查询方法、装置、设备、系统及存储介质
CN109150934B (zh) 信息推送方法和装置
CN110019531A (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: 18852872

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

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 19/08/2020)

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 1205ADATED 19/08/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18852872

Country of ref document: EP

Kind code of ref document: A1