WO2018210057A1 - 配送区域确定方法和装置 - Google Patents

配送区域确定方法和装置 Download PDF

Info

Publication number
WO2018210057A1
WO2018210057A1 PCT/CN2018/080198 CN2018080198W WO2018210057A1 WO 2018210057 A1 WO2018210057 A1 WO 2018210057A1 CN 2018080198 W CN2018080198 W CN 2018080198W WO 2018210057 A1 WO2018210057 A1 WO 2018210057A1
Authority
WO
WIPO (PCT)
Prior art keywords
delivery
delivery area
area
determining
units
Prior art date
Application number
PCT/CN2018/080198
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/498,279 priority Critical patent/US20200082318A1/en
Publication of WO2018210057A1 publication Critical patent/WO2018210057A1/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
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/029—Location-based management or tracking services

Definitions

  • the present application relates to the field of computer technology, and in particular, to the field of Internet technologies, and in particular, to a method and apparatus for determining a delivery area.
  • the express delivery business has also developed rapidly. Before the courier delivers the item, the delivery site needs to divide the delivery location into the distribution area.
  • the existing distribution area division method is mainly based on the division of personnel by experience, the division efficiency is low, and it is susceptible to subjective factors.
  • the purpose of the present application is to propose an improved delivery area determination method and apparatus to solve the technical problems mentioned in the background section above.
  • an embodiment of the present application provides a method for determining a delivery area, where the method includes: acquiring each of the appropriate geographical locations in a specified geographic area within a specified historical time period; and mapping each properly placed geographic location information to the gate In the gridded map, get the map map; for each grid, determine the distance between the grid and the grid of the nearest proper location; cluster the grids within the preset range to get a plurality of delivery area units; clustering the plurality of delivery area units to obtain at least one delivery area including a plurality of delivery area units.
  • the method before obtaining the plurality of delivery area units, further comprises: dividing the mapping map according to the Tyson polygon, using the grids of the respective proper geographical locations as points in the respective Tyson polygons respectively. Obtaining a plurality of sub-geographic regions; for each type of geographic region obtained by clustering the raster, if the geographic region includes at least two sub-geographic regions, combining at least two sub-geographic regions; The sub-geographic regions that are not involved in the merge are determined as a plurality of distribution area units.
  • the at least one delivery area is a plurality of delivery areas; and after clustering the plurality of delivery area units to obtain the at least one delivery area, the method further comprises: based on the specified historical time period, each delivery The number of delivery in the area unit, adjusting the delivery area unit included in the delivery area in the plurality of delivery areas; or adjusting the delivery area in the plurality of delivery areas based on the delivery time length in each delivery area unit within the specified historical time period The included distribution area unit.
  • adjusting the delivery area unit included in the delivery area of the plurality of delivery areas based on the number of delivery in each of the delivery area units within the specified historical time period comprises: for each of the at least one delivery area a delivery area, determining a delivery quantity of the delivery area within a specified historical time period, wherein the delivery quantity of the delivery area is the sum of the delivery quantity of each delivery area unit; and in response to determining that the delivery quantity of the delivery area is greater than the preset quantity range, One or more delivery area units in the delivery area are divided into other delivery areas; in response to determining that the delivery quantity of the delivery area is less than a preset number range, one or more of the other distribution area units are divided into the In the delivery area.
  • adjusting the delivery area unit included in the delivery area of the plurality of delivery areas based on the delivery duration in each of the delivery area units during the specified historical time period comprises: for each of the at least one delivery area a delivery area, determining a delivery duration of the delivery area within a specified historical time period, wherein a delivery time of the delivery area is a sum of delivery durations of the respective delivery area units; and in response to determining that the delivery time of the delivery area is greater than a preset duration range, One or more delivery area units in the delivery area are divided into other delivery areas; in response to determining that the delivery time of the delivery area is less than a preset duration range, one or more delivery area units in the other delivery areas are divided into the In the delivery area.
  • the present application provides a delivery area determining apparatus, where the apparatus includes: an acquiring unit configured to acquire each of the proper geographical location information in a specified geographical area within a specified historical time period; and a mapping unit configured to be used for Mapping each of the properly placed geographic location information to the rasterized map to obtain a mapped map; determining a unit configured to determine, for each of the grids, a distance from the grid of the nearest properly placed geographic location; a clustering unit configured to cluster the grids whose distances are within a preset value range to obtain a plurality of distribution area units; and the area determining unit configured to cluster the plurality of distribution area units to obtain a plurality of At least one delivery area of the distribution area unit.
  • the apparatus further includes: a sub-geographic area determining unit configured to divide the map map based on the Tyson polygon and each of the grids in which the geographical locations are properly located as points in each Tyson polygon Obtaining a plurality of sub-geographic regions; merging units configured to merge at least two sub-geographic regions for each type of geographic region obtained by clustering the raster; if the geographic region includes at least two sub-geographic regions, the region is merged; The unit determining unit is configured to determine the merged geographical area and the sub-geographic area not participating in the merge as a plurality of delivery area units.
  • the at least one delivery area is a plurality of delivery areas; and the apparatus further comprises: a first adjustment unit configured to adjust the plurality of delivery based on the number of delivery in each of the delivery area units within a specified historical time period a delivery area unit included in the delivery area in the area; or a second adjustment unit configured to adjust the delivery area included in the plurality of delivery areas based on the delivery time length in each of the delivery area units within the designated historical time period Distribution area unit.
  • the first adjusting unit includes: a first determining module configured to determine, for each of the at least one delivery area, a delivery quantity of the delivery area within a specified historical time period, wherein the delivery area The quantity of the delivery is the sum of the delivery quantity of each delivery area unit; the first dividing module is configured to respond to determining that the delivery quantity of the delivery area is greater than a preset quantity range, and one or more delivery area units in the delivery area Dividing into other delivery areas; the first area dividing module is configured to divide one or more delivery area units in the other delivery areas into the delivery area in response to determining that the delivery quantity of the delivery area is less than a preset quantity range .
  • the second adjusting unit includes: a second determining module configured to determine, for each of the at least one delivery area, a delivery duration of the delivery area within the specified historical time period, wherein the delivery area The delivery time is the sum of the delivery durations of the respective delivery area units; the second division module is configured to respond to the determination that the delivery time of the delivery area is greater than the preset duration range, and one or more delivery area units in the delivery area Dividing into other distribution areas; the second area dividing module is configured to divide one or more delivery area units in the other delivery areas into the delivery area in response to determining that the delivery time of the delivery area is less than a preset duration .
  • the distribution area determining method and apparatus acquires each of the appropriate geographical position information in the designated geographical area within the specified historical time period. After that, each map location information is mapped to a rasterized map to obtain a map map. Then for each grid, determine the distance of the grid from the grid where the nearest destination is located. Then, the clusters whose distances are within the preset numerical range are clustered to obtain a plurality of delivery area units. Finally, a plurality of distribution area units are clustered to obtain at least one delivery area including a plurality of delivery area units. Thereby improving the efficiency of distribution area distribution.
  • 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 a delivery area determining method in accordance with the present application.
  • 3a and 3b are schematic diagrams of determining a distance by a grid according to a delivery area determining method of the present application
  • FIG. 4 is a schematic diagram of an application scenario of a delivery area determining method according to the present application.
  • FIG. 5 is a flow chart of still another embodiment of a delivery area determining method according to the present application.
  • FIG. 6 is a flow chart of still another embodiment of a delivery area determining method according to the present application.
  • FIG. 7 is a flow chart of still another embodiment of a delivery area determining method according to the present application.
  • Figure 8 is a flow chart showing still another embodiment of the delivery area determining method according to the present application.
  • FIG. 9 is a schematic structural view of an embodiment of a delivery area determining apparatus according to the present application.
  • FIG. 10 is a block diagram showing the structure of a computer system suitable for implementing the server of the embodiment of the present application.
  • FIG. 1 illustrates an exemplary system architecture 100 of an embodiment of a delivery area determination method or delivery area determination apparatus to which the present application may be applied.
  • system architecture 100 can include terminal devices 101, 102, 103, network 104, and server 105.
  • the network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105.
  • Network 104 may include various types of connections, such as wired, wireless communication links, fiber optic cables, and the like.
  • the user can interact with the server 105 over the network 104 using the terminal devices 101, 102, 103 to receive or transmit messages and the like.
  • Various communication client applications such as a web browser application, a shopping application, a search application, an instant communication tool, a mailbox client, a social platform software, and the like, may be installed on the terminal devices 101, 102, and 103.
  • the terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting receiving information related to the delivery area, including but not limited to smart phones, tablets, e-book readers, MP3 players (Moving Picture Experts Group Audio Layer) III.
  • the motion picture expert compresses the standard audio layer 3), the MP4 (Moving Picture Experts Group Audio Layer IV) player, the laptop portable computer, the desktop computer, and the like.
  • the server 105 may be a server that provides various services, such as a background server that provides support for the delivery area displayed on the terminal devices 101, 102, 103.
  • the background server may analyze and process data such as the received geographical location information, and feed back the processing result (for example, the distribution area related data) to the terminal device.
  • the delivery area determining method provided by the embodiment of the present application is generally performed by the server 105. Accordingly, the delivery area determining apparatus is generally disposed in the server 105.
  • terminal devices, networks, and servers in Figure 1 is merely illustrative. Depending on the implementation needs, there can be any number of terminal devices, networks, and servers.
  • the delivery area determining method comprises the following steps:
  • Step 201 Acquire each of the appropriate geographical location information in the designated geographical area within the specified historical time period.
  • the electronic device (for example, the server shown in FIG. 1) on which the delivery area determining method runs can acquire the plurality of proper geographical location information in the specified geographical area within the specified historical time period.
  • the historical time period as the specified elapsed time period, such as yesterday's day or yesterday's morning and half.
  • the courier can use the duration of the time period as a delivery cycle to deliver a round of delivery to the area in which it is responsible for each delivery cycle.
  • the designated geographic area is an artificially defined geographic area.
  • the geographical location information is the information of the geographical location where the courier is properly placed on the item, and the geographical location is within the specified geographical area.
  • the geographical location information includes longitude information and latitude information. After the general courier is properly voted, the location information will be uploaded at the appropriate location. This embodiment utilizes the proper location information to determine the delivery area unit.
  • Step 202 Map each properly-placed geographic location information into a rasterized map to obtain a mapped map.
  • the electronic device maps the properly placed geographic location information into a map, which is a rasterized map.
  • the mapping in this embodiment is a location point corresponding to the longitude information and the latitude information included in the map in the map.
  • the map can be rasterized to get a rasterized map. After the map location information is mapped to the map, the corresponding points on the map map are placed in the grid. Rasterizing a map divides the map into multiple rasters. For example, a rasterized map can have a 1 square meter geographic area as a grid.
  • step of mapping the geographical location information into the map may be performed first, and then the step of rasterizing the map is performed to obtain the mapping map.
  • Step 203 For each grid, determine the distance of the grid from the grid where the nearest right location is located.
  • the electronic device determines the distance of the grid from the grid in which the nearest right location is located. Determine the distance between the grid and the grid, first determine the calculation rules for the distance between the grids.
  • the first rule can be used to infer the distance based on the relative position between the grids. For example, a grid representing 1 (m2) can determine the distance between each grid and the adjacent grid is 1 (m). Then, if the two grids are separated, the distance is 2 (meters).
  • FIG. 3a is a mapping map, where “1” indicates the grid where the geographical location is properly placed, and “0” is the grid where the geographical location other than the proper geographical location is located.
  • Figure 3b shows the distance between the grids and the grids of the nearest geographical locations after the distance calculation. The "0" indicates the grid where the geographical location is located. Any number in other grids indicates the number. The distance from the grid where the nearest grid is located.
  • Step 204 Cluster the grids whose distances are within a preset numerical range to obtain a plurality of delivery area units.
  • the electronic device clusters the grids whose distances are within a preset numerical range. Then, the geographical area composed of the plurality of grids obtained after the clustering is used as the delivery area unit.
  • the distribution area unit is a geographical area composed of a plurality of grids, and is a unit constituting the distribution area. A distribution area unit can be a building or an alley.
  • the preset value range is a range of values set in advance for the distance, and the grid within the range from the grid where the geographical position is located can participate in the clustering.
  • the clustering here is based on the distance, and the above-mentioned electronic device clusters the grids that are in the preset numerical range and the positions are gathered together.
  • the preset value range is less than or equal to 5 (meters).
  • a grid in which the geographical location a is located is clustered into a plurality of grids in the immediate vicinity: a class, where the distance between the plurality of grids adjacent to the location a is between 1 and 5 .
  • some grids are adjacent to the outermost grid of the class a grid.
  • the distance between these grids and the grid where the geographical position a is located is more than 5, which does not meet the preset value range.
  • these grids are more than 5 apart from the grid where any of the locations are located.
  • they can be separated by a grid that has a large distance from the grid where each of the locations is located.
  • the area corresponding to these grids may be a wider street or a river or the like.
  • Step 205 Clustering a plurality of delivery area units to obtain at least one delivery area including a plurality of delivery area units.
  • the electronic device clusters the plurality of delivery area units, and after clustering, obtains at least one delivery area including the plurality of delivery area units.
  • Each of the distribution areas includes a plurality of delivery area units. After the delivery area is obtained, the delivery area can be used as a delivery area for a courier.
  • clustering algorithms there are various clustering algorithms that can be used, and specific unsupervised clustering can be used, for example, a K-means algorithm, a Gaussian mixture model (GMM), or a combination of the two.
  • GMM Gaussian mixture model
  • FIG. 4 is a schematic diagram of an application scenario of the delivery area determining method according to the present embodiment.
  • the server 401 first obtains the appropriate geographical location information 402 of each of the appropriate geographical locations in the Xihongmen area of Beijing between 8:00 and 12:00 yesterday.
  • the server maps the acquired geographical location information 402 into the rasterized map to obtain a mapping map 403, wherein the distance between the grid where each of the properly placed geographic locations is located and the adjacent grid is set to 1.
  • the server determines, for each grid, the distance 404 between the grid and the grid of the nearest appropriate location. Based on the determined respective distances, clusters having a distance of less than 5 are clustered to obtain a plurality of delivery area units 405.
  • the plurality of delivery area units 405 are clustered to obtain at least one delivery area 406, and the obtained at least one delivery area 406 is transmitted to the terminal device 407.
  • Figure 4 the server 401
  • the above-described embodiments of the present application utilize grids to speed up the allocation of regions and improve the accuracy of the distribution through two clustering processes.
  • the distribution efficiency of the distribution area can be improved, and the problem that the distribution is affected by subjective factors can be solved.
  • the process 500 of the delivery area determining method includes the following steps:
  • Step 501 Acquire each of the appropriate geographical location information in the specified geographic area within the specified historical time period.
  • the server may acquire a plurality of properly placed geographic location information within a specified historical time period and within a specified geographic area. Specify the historical time period as the specified elapsed time period, such as yesterday's day or yesterday's morning and half.
  • the courier can use the duration of the time period as a delivery cycle and deliver a round of delivery to the area in which it is responsible for each cycle.
  • the specified geographic area is a specified geographic area.
  • Properly placed geographical location information is generally the geographical location information that the courier uploads at a properly delivered location after proper delivery. This embodiment utilizes the proper location information to determine the delivery area unit.
  • Step 502 Map each properly-placed geographic location information into a rasterized map to obtain a mapped map.
  • the server maps the properly placed geographic location information to the map, which is a rasterized map.
  • the map can be rasterized to get a rasterized map.
  • the corresponding points on the map map are placed in the grid. Rasterizing a map divides the map into multiple rasters. For example, a rasterized map can have a 1 square meter geographic area as a grid.
  • step of mapping the geographical location information into the map may be performed first, and then the step of rasterizing the map is performed to obtain the mapping map.
  • Step 503 For each grid, determine the distance of the grid from the grid where the nearest right location is located.
  • the server determines the distance of the grid from the grid in which the nearest point of the map is located on the map map. Determine the distance between the grid and the grid, first determine the calculation rules for the distance between the grids. If a grid represents 1 (m2), you can determine that the distance between each grid and the adjacent grid is 1 (m). Then, if the two grids are separated, the distance is 2 (meters). You can also calculate the distance between a specified position in one raster and the same specified position in another raster, such as calculating the distance between the centers of the two rasters. The distance between the grid where the location is properly placed and the grid itself is zero.
  • the distance can be obtained by a distance transform. Specifically, it can be obtained by the following formula:
  • G' is a map that has been mapped with geographical location information and rasterized.
  • D f (p) is the distance between each grid and the grid of the nearest geographical location from the grid.
  • p is an arbitrary grid
  • q is the grid where the geographical location is properly placed.
  • d(p,q) is a distance function, indicating the distance from any grid p to the grid q where the nearest proper location is located.
  • the distance function here can be selected from a variety of distance functions, such as Euclidean distance (aka Euclidean distance), or Manhattan distance, and the like.
  • f(p) is also a variable. The specific values are as follows:
  • Step 504 clustering the grids whose distances are within a preset numerical range.
  • the server clusters the grids within a predetermined range of values.
  • the preset value range is a range of values set in advance for the distance, and the grid within the range from the grid where the geographical position is located can participate in the clustering.
  • the clustering here is based on the distance, and the above-mentioned server clusters the grids that are in the preset numerical range and the positions are gathered together.
  • Step 505 Based on the Voronoi diagram, the grids of the respective locations are respectively divided into points in the Tyson polygons, and the map map is divided to obtain a plurality of sub-geographic regions.
  • the server may divide the map map by using the grid in which each of the proper geographical locations is located as a point within each Tyson polygon, which is the point on which the Tyson polygon is constructed.
  • Tyson polygon On the map, you need to first connect the grids of multiple locations to make a triangle, then make the vertical bisector of each side of the triangle, and then get the grid around each location. Multiple Tyson polygons. Use the Thiessen polygon as a sub-geographic area.
  • the Delaunay triangulation algorithm may be used for division, or the two division methods may be combined to obtain a plurality of sub-geographic regions.
  • Step 506 For each type of geographic area obtained by clustering the grid, if at least two sub-geographic areas are included in the geographic area, at least two sub-geographic areas are combined.
  • the server further processes the divided sub-geographic regions according to the result obtained by the clustering. For each type of geographic area, if at least two divided sub-geographic areas are included in the geographical area, the at least two sub-geographic areas are merged. The original at least two sub-geographic regions are merged into one region.
  • step 507 the merged geographic area and the sub-geographic area not participating in the merge are determined as a plurality of delivery area units.
  • the server determines the merged geographical area and the sub-geographic area that does not participate in the merge as a plurality of delivery area units. Thus, after clustering and division, a plurality of delivery area units are obtained.
  • Step 508 Clustering a plurality of delivery area units to obtain at least one delivery area including a plurality of delivery area units.
  • the server clusters the plurality of delivery area units, and after clustering, obtains at least one delivery area including the plurality of delivery area units.
  • Each of the distribution areas includes a plurality of delivery area units. After the delivery area is obtained, the delivery area can be used as a delivery area for a courier.
  • mapping map based on the Thiessen polygon by classifying the mapping map based on the Thiessen polygon, it is possible to involve an area far from the geographical position, and reduce the probability of missing the delivery area.
  • the process 600 of the delivery area determining method includes the following steps:
  • Step 601 Acquire each of the appropriate geographical location information in the specified geographic area within the specified historical time period.
  • the server may acquire a plurality of properly placed geographic location information within a specified historical time period and within a specified geographic area. Specify the historical time period as the specified elapsed time period, such as yesterday's day or yesterday's morning and half.
  • the courier can use the duration of the time period as a delivery cycle and deliver a round of delivery to the area in which it is responsible for each cycle.
  • the specified geographic area is a specified geographic area.
  • Properly placed geographical location information is generally the geographical location information that the courier uploads at a properly delivered location after proper delivery. This embodiment utilizes the proper location information to determine the delivery area unit.
  • Step 602 Map each properly-placed geographic location information into a rasterized map to obtain a mapped map.
  • the server maps the properly placed geographic location information to the map, which is a rasterized map.
  • the map can be rasterized to get a rasterized map. After mapping the geographical location information to the map, each of the properly placed geographic locations falls into the grid. Rasterizing a map divides the map into multiple rasters. For example, a rasterized map can have a 1 square meter geographic area as a grid.
  • step of mapping the geographical location information into the map may be performed first, and then the step of rasterizing the map is performed to obtain the mapping map.
  • Step 603 for each grid, determine the distance of the grid from the grid where the nearest right location is located.
  • the server determines the distance of the grid from the grid in which the nearest properly placed location is located. Determine the distance between the grid and the grid, first determine the calculation rules for the distance between the grids. If a grid represents 1 (m2), you can determine that the distance between each grid and the adjacent grid is 1 (m). Then, if the two grids are separated, the distance is 2 (meters). You can also calculate the distance between a specified position in one raster and the same specified position in another raster, such as calculating the distance between the centers of the two rasters. The distance between the grid where the location is properly placed and the grid itself is zero.
  • Step 604 Clustering the grids whose distances are within a preset numerical range to obtain a plurality of delivery area units.
  • the server clusters the grids within a predetermined range of values. Then, the geographical area composed of the plurality of grids obtained after the clustering is used as the delivery area unit.
  • the distribution area unit is a geographical area composed of a plurality of grids, and is a unit constituting the distribution area.
  • a distribution area unit can be a building or an alley.
  • the preset value range is a range of values set in advance for the distance, and the grid within the range from the grid where the geographical position is located can participate in the clustering.
  • the clustering here is based on the distance, and the above-mentioned server clusters the grids that are in the preset numerical range and the positions are gathered together.
  • Step 605 Clustering a plurality of delivery area units to obtain a plurality of delivery areas including a plurality of delivery area units.
  • the server clusters the plurality of delivery area units, and after clustering, obtains a plurality of delivery areas including the plurality of delivery area units.
  • Each of the distribution areas includes a plurality of delivery area units.
  • the delivery area can be used as a delivery area for a courier.
  • Step 606 Adjust a delivery area unit included in the delivery area in the plurality of delivery areas based on the number of delivery in each of the delivery area units within the specified historical time period;
  • the delivery area unit included in the delivery area in the plurality of delivery areas is adjusted based on the delivery time length in each of the delivery area units within the designated historical time period.
  • the number of delivery here refers to the number of items delivered and properly delivered by the courier, and the length of delivery refers to the length of time that the courier delivers and properly orders the item.
  • the specified historical time period may be a time period in which the server receives the geographical location information.
  • the server adjusts the delivery area unit included in the delivery area based on the number of delivery of each delivery area unit in the delivery area. For example, if the number of delivery of each delivery area unit is too large (more than the preset number), the number of delivery area units in the delivery area is reduced. Vice versa, that is, if the number of delivery of each delivery area unit is too small (less than the preset number), the number of delivery area units in the delivery area is increased.
  • the delivery area unit can also be adjusted based on the delivery time in the delivery area unit. For example, if the delivery time of each delivery area unit is too long (greater than the preset number), the number of delivery area units in the delivery area is reduced. Vice versa, that is, the delivery time of each delivery area unit is too short (shorter than the preset number), and the number of delivery area units in the delivery area is increased.
  • the delivery area unit of the delivery area can be adjusted according to the delivery quantity of the delivery area or the delivery time length, and the delivery area is further optimized according to actual conditions.
  • the flow 700 of the delivery area determining method includes the following steps:
  • Step 701 Acquire each of the appropriate geographical location information in the specified geographic area within the specified historical time period.
  • the server may acquire a plurality of properly placed geographic location information within a specified historical time period and within a specified geographic area. Specify the historical time period as the specified elapsed time period, such as yesterday's day or yesterday's morning and half.
  • the courier can use the duration of the time period as a delivery cycle and deliver a round of delivery to the area in which it is responsible for each cycle.
  • the specified geographic area is a specified geographic area.
  • Properly placed geographical location information is generally the geographical location information that the courier uploads at a properly delivered location after proper delivery. This embodiment utilizes the proper location information to determine the delivery area unit.
  • Step 702 Map each properly-placed geographic location information into a rasterized map to obtain a mapped map.
  • the server maps the properly placed geographic location information to the map, which is a rasterized map.
  • the map can be rasterized to get a rasterized map.
  • the corresponding points on the map map are placed in the grid. Rasterizing a map divides the map into multiple rasters. For example, a rasterized map can have a 1 square meter geographic area as a grid.
  • step of mapping the geographical location information into the map may be performed first, and then the step of rasterizing the map is performed to obtain the mapping map.
  • Step 703 for each grid, determine the distance of the grid from the grid where the nearest right location is located.
  • the server determines the distance of the grid from the grid in which the nearest properly placed location is located. Determine the distance between the grid and the grid, first determine the calculation rules for the distance between the grids. If a grid represents 1 (m2), the distance between each grid and the adjacent grid is determined to be 1 (meters). Then, if the two grids are separated, the distance is 2 (meters). You can also calculate the distance between a specified position in one raster and the same specified position in another raster, such as calculating the distance between the centers of the two rasters. The distance between the grid where the location is properly placed and the grid itself is zero.
  • Step 704 Clustering the grids whose distances are within a preset numerical range to obtain a plurality of delivery area units.
  • the server clusters the grids within a predetermined range of values. Then, the geographical area composed of the plurality of grids obtained after the clustering is used as the delivery area unit.
  • the distribution area unit is a geographical area composed of a plurality of grids, and is a unit constituting the distribution area.
  • a distribution area unit can be a building or an alley.
  • the preset value range is a range of values set in advance for the distance, and the grid within the range from the grid where the geographical position is located can participate in the clustering.
  • the clustering here is based on the distance, and the above-mentioned server clusters the grids that are in the preset numerical range and the positions are gathered together.
  • Step 705 Clustering a plurality of delivery area units to obtain a plurality of delivery areas including a plurality of delivery area units.
  • the server clusters the plurality of delivery area units, and after clustering, obtains a plurality of delivery areas including the plurality of delivery area units.
  • Each of the distribution areas includes a plurality of delivery area units.
  • the delivery area can be used as a delivery area for a courier.
  • Step 706 For each of the plurality of delivery areas, determine the number of delivery of the delivery area within the specified historical time period.
  • the server determines the number of delivery of the delivery area within the specified historical time period.
  • the specified historical time period here may be the same as the aforementioned specified historical time period.
  • the delivery quantity of the delivery area is determined based on the delivery quantity of each delivery area unit in the delivery area. Specifically, the delivery quantity of the delivery area is the sum of the delivery quantity of each delivery area unit in the delivery area.
  • the number of delivery of each delivery area unit can be obtained by determining the number of appropriate geographical location information within the delivery area unit.
  • Step 707 in response to determining that the delivery quantity of the delivery area is greater than a preset quantity range, dividing one or more delivery area units in the delivery area into other delivery areas.
  • the preset number range is a range set in advance for the number of delivery. If the delivery quantity is not within the preset number range, the server makes an adjustment to the delivery area unit in the delivery area. If the server determines that the delivery quantity of the delivery area is greater than the preset quantity range, the server responds by dividing one or more delivery area units in the delivery area into other delivery areas. For example, a distribution area unit located at the edge of the delivery area is divided into adjacent delivery areas to reduce the number of delivery of the delivery area.
  • Step 708 in response to determining that the delivery quantity of the delivery area is less than the preset number range, dividing one or more of the other distribution area units into the delivery area.
  • the server determines that the delivery quantity of the delivery area is less than the preset quantity range, the server responds by dividing one or more delivery area units of the other delivery areas into the delivery area. This will increase the number of deliveries that are too small in the delivery area. For example, two delivery area units located in adjacent delivery areas are divided into the delivery area.
  • a flow 800 of yet another embodiment of a delivery area determination method is illustrated.
  • the process 800 of the delivery area determining method includes the following steps:
  • Step 801 Acquire each of the appropriate geographical location information in the designated geographic area within the specified historical time period.
  • the server may acquire a plurality of properly placed geographic location information within a specified historical time period and within a specified geographic area. Specify the historical time period as the specified elapsed time period, such as yesterday's day or yesterday's morning and half.
  • the courier can use the duration of the time period as a delivery cycle and deliver a round of delivery to the area in which it is responsible for each cycle.
  • the specified geographic area is a specified geographic area.
  • Properly placed geographical location information is generally the geographical location information that the courier uploads at a properly delivered location after proper delivery. This embodiment utilizes the proper location information to determine the delivery area unit.
  • Step 802 Map each properly-placed geographic location information into a rasterized map to obtain a mapped map.
  • the server maps the properly placed geographic location information to the map, which is a rasterized map.
  • the map can be rasterized to get a rasterized map.
  • the corresponding points on the map map are placed in the grid. Rasterizing a map divides the map into multiple rasters. For example, a rasterized map can have a 1 square meter geographic area as a grid.
  • step of mapping the geographical location information into the map may be performed first, and then the step of rasterizing the map is performed to obtain the mapping map.
  • Step 803 for each grid, determine the distance of the grid from the grid of the nearest proper location.
  • the server determines the distance of the grid from the grid in which the nearest properly placed location is located. Determine the distance between the grid and the grid, first determine the calculation rules for the distance between the grids. If a grid represents 1 (m2), you can determine that the distance between each grid and the adjacent grid is 1 (m). Then, if the two grids are separated, the distance is 2 (meters). You can also calculate the distance between a specified position in one raster and the same specified position in another raster, such as calculating the distance between the centers of the two rasters. The distance between the grid where the location is properly placed and the grid itself is zero.
  • Step 804 clustering the grids whose distances are within a preset numerical range to obtain a plurality of delivery area units.
  • the server clusters the grids within a predetermined range of values. Then, the geographical area composed of the plurality of grids obtained after the clustering is used as the delivery area unit.
  • the distribution area unit is a geographical area composed of a plurality of grids, and is a unit constituting the distribution area.
  • a distribution area unit can be a building or an alley.
  • the preset value range is a range of values set in advance for the distance, and the grid within the range from the grid where the geographical position is located can participate in the clustering.
  • the clustering here is based on the distance, and the above-mentioned server clusters the grids that are in the preset numerical range and the positions are gathered together.
  • Step 805 Clustering a plurality of delivery area units to obtain a plurality of delivery areas including a plurality of delivery area units.
  • the server clusters the plurality of delivery area units, and after clustering, obtains a plurality of delivery areas including the plurality of delivery area units.
  • Each of the distribution areas includes a plurality of delivery area units. Once the delivery area is available, the delivery area can be used as a delivery area for the courier.
  • Step 806 Determine, for each of the at least one delivery area, a delivery duration of the delivery area within the specified historical time period.
  • the server determines the delivery duration of the delivery area within the specified historical time period.
  • the specified historical time period here may be the same as the aforementioned specified historical time period.
  • the delivery time of the delivery area is determined based on the delivery time of each delivery area unit in the delivery area. Specifically, the delivery time of the delivery area is the sum of the delivery time of each delivery area unit in the delivery area.
  • the delivery time of each delivery area unit may be determined by determining the time (or reception time) of the first properly placed geographical location information in the delivery area unit to the time (or reception time) of the last properly placed geographical location information. Time difference to get.
  • Step 807 in response to determining that the delivery duration of the delivery area is greater than a preset duration range, dividing one or more delivery area units in the delivery area into other delivery areas.
  • the preset duration is a range that is preset for the delivery duration. If the delivery duration is not within the preset duration, the server adjusts the delivery area unit in the delivery area. If the server determines that the delivery time of the delivery area is greater than the preset duration, the server responds by dividing one or more delivery area units in the delivery area into other delivery areas. For example, the delivery area unit located at the edge of the delivery area is divided into adjacent delivery areas to shorten the delivery time of the delivery area.
  • Step 808 in response to determining that the delivery time of the delivery area is less than the preset duration range, dividing one or more delivery area units in the other delivery areas into the delivery area.
  • the server determines that the delivery time of the delivery area is less than the preset duration, the server responds by dividing one or more delivery area units of the other delivery areas into the delivery area. This makes it possible to increase the delivery time of the delivery area that is too short. For example, two delivery area units located in adjacent delivery areas are divided into the delivery area.
  • the present application provides an embodiment of a delivery area determining apparatus, and the apparatus embodiment corresponds to the method embodiment shown in FIG. Can be applied to a variety of electronic devices.
  • the delivery area determining apparatus 900 of the present embodiment includes an obtaining unit 901, a mapping unit 902, a determining unit 903, a clustering unit 904, and an area determining unit 905.
  • the obtaining unit 901 is configured to acquire each of the appropriate geographical location information in the specified geographic area within the specified historical time period
  • the mapping unit 902 is configured to map the respective properly placed geographical location information into the rasterized map, and obtain Mapping a map
  • determining unit 903, configured to determine, for each grid, a distance of the grid from a grid in which the nearest right geographical location is located
  • a clustering unit 904 configured to set the distance within a preset value range
  • the grid is clustered to obtain a plurality of delivery area units
  • the area determination unit 905 is configured to cluster the plurality of delivery area units to obtain at least one delivery area including a plurality of delivery area units.
  • the obtaining unit 901 can acquire a plurality of proper geographical location information in the specified geographic time zone within the specified historical time zone. Specify the historical time period as the specified elapsed time period, such as yesterday's day or yesterday's morning and half.
  • the courier can use the duration of the time period as a delivery cycle and deliver a round of delivery to the area in which it is responsible for each cycle.
  • the specified geographic area is a specified geographic area.
  • Properly placed geographical location information is generally the geographical location information that the courier uploads at a properly delivered location after proper delivery. This embodiment utilizes the proper location information to determine the delivery area unit.
  • mapping unit 902 maps the properly placed geographic location information into a map, which is a rasterized map.
  • the map can be rasterized to get a rasterized map. After mapping the geographical location information to the map, each of the properly placed geographic locations falls into the grid. Rasterizing a map divides the map into multiple rasters. For example, a rasterized map can have a 1 square meter geographic area as a grid.
  • the determining unit 903 determines the distance of the grid from the grid in which the nearest proper location is located. Determine the distance between the grid and the grid, first determine the calculation rules for the distance between the grids. For example, if a grid represents 1 (m2), you can determine that the distance between each grid and the adjacent grid is 1 (m). Then, if the two grids are separated, the distance is 2 (meters). You can also calculate the distance between a specified position in one raster and the same specified position in another raster, such as calculating the distance between the centers of the two rasters. The distance between the grid where the location is properly placed and the grid itself is zero.
  • the clustering unit 904 clusters the grids whose distances are within a preset numerical range. Then, the geographical area composed of the plurality of grids obtained after the clustering is used as the delivery area unit.
  • the distribution area unit is a geographical area composed of a plurality of grids, and is a unit constituting the distribution area. A distribution area unit can be a building or an alley.
  • the preset value range is a range of values set in advance for the distance, and the grid within the range from the grid where the geographical position is located can participate in the clustering.
  • the clustering here is based on the distance, and the clustering unit 904 clusters the grids that are within the preset numerical range and the positions are gathered together.
  • the area determination unit 905 clusters the plurality of delivery area units, and obtains at least one delivery area including the plurality of delivery area units described above.
  • Each of the distribution areas includes a plurality of delivery area units. After the delivery area is obtained, the delivery area can be used as a delivery area for a courier.
  • the apparatus further includes: a sub-geographic area determining unit (not shown) configured to use each of the grids of the appropriate geographical locations as the respective a point within the Tyson polygon, dividing the map map to obtain a plurality of sub-geographic regions; a merging unit (not shown) configured for each type of geographic region obtained by clustering the grid, if the geographic region is Include at least two sub-geographic regions, combining at least two sub-geographic regions; a regional unit determining unit (not shown) configured to determine the merged geographic region and the sub-geographic region not participating in the merge as multiple delivery region units .
  • the at least one delivery area is a plurality of delivery areas; and the apparatus further includes: a first adjustment unit (not shown) configured to be based on each of the specified historical time periods a delivery quantity in the delivery area unit, adjusting a delivery area unit included in the delivery area in the plurality of delivery areas; or a second adjustment unit (not shown) configured to be based on each of the delivery area units within the specified historical time period The delivery time zone in the medium, and the delivery area unit included in the delivery area in the plurality of delivery areas is adjusted.
  • the first adjusting unit includes: a first determining module (not shown) configured to determine a specified historical time period for each of the at least one delivery area The number of delivery of the delivery area, wherein the delivery quantity of the delivery area is the sum of the delivery quantity of each delivery area unit; the first dividing module (not shown) is configured to respond to determining that the delivery quantity of the delivery area is greater than the pre- Configuring a quantity range to divide one or more delivery area units in the delivery area into other delivery areas; a first area dividing module (not shown) configured to determine that the number of delivery of the delivery area is less than a preset A range of quantities into which one or more distribution area units in other distribution areas are divided.
  • the second adjusting unit includes: a second determining module (not shown) configured to determine a specified historical time period for each of the at least one delivery area The delivery time of the delivery area, wherein the delivery time of the delivery area is the sum of the delivery time of each delivery area unit; and the second division module (not shown) is configured to respond to determining that the delivery time of the delivery area is greater than the pre- Configuring a time range to divide one or more delivery area units in the delivery area into other delivery areas; a second area dividing module (not shown) configured to determine that the delivery time of the delivery area is less than a preset The duration range divides one or more delivery area units in other delivery areas into the delivery area.
  • FIG. 10 there is shown a block diagram of a computer system 1000 suitable for use in implementing the electronic device of the embodiments of the present application.
  • the electronic device shown in FIG. 10 is merely an example, and should not impose any limitation on the function and scope of use of the embodiments of the present application.
  • FIG. 10 is a block diagram showing the structure of a computer system suitable for implementing the electronic device of the embodiment of the present application.
  • computer system 1000 includes a central processing unit (CPU) 1001 that can be loaded into a program in random access memory (RAM) 1003 according to a program stored in read only memory (ROM) 1002 or from storage portion 1008. And perform various appropriate actions and processes.
  • RAM random access memory
  • ROM read only memory
  • RAM random access memory
  • ROM read only memory
  • the CPU 1001, the ROM 1002, and the RAM 1003 are connected to each other through a bus 1004.
  • An input/output (I/O) interface 1005 is also coupled to bus 1004.
  • the following components are connected to the I/O interface 1005: an input portion 1006 including a keyboard, a mouse, etc.; an output portion 1007 including a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and a speaker; a storage portion 1008 including a hard disk or the like And a communication portion 1009 including a network interface card such as a LAN card, a modem, or the like.
  • the communication section 1009 performs communication processing via a network such as the Internet.
  • Driver 1010 is also coupled to I/O interface 1005 as needed.
  • a removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like is mounted on the drive 1010 as needed so that a computer program read therefrom is installed into the storage portion 1008 as needed.
  • an embodiment of the present application 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 the communication portion 1009, and/or installed from the removable medium 1011.
  • the computer program is executed by the central processing unit (CPU) 1001
  • the above-described functions defined in the method of the present application are performed.
  • the computer readable medium of the present application may be a computer readable signal medium or a computer readable storage medium or any combination of the two.
  • the computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing.
  • a computer readable storage medium may be any tangible medium that can contain or store a program, which can be used by or in connection with an instruction execution system, apparatus or device.
  • a computer readable signal medium may include a data signal that is propagated in the baseband or as part of a carrier, carrying computer readable program code. Such propagated data signals can take a variety of forms including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer readable signal medium can also be any computer readable medium other than a computer readable storage medium, which can transmit, propagate, or transport a program for use by or in connection with the instruction execution system, apparatus, or device.
  • Program code embodied on a computer readable medium can be transmitted by any suitable medium, including but not limited to wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
  • each block of the flowchart or block diagram can represent a module, a program segment, or a portion of code that includes one or more of the logic functions for implementing the specified.
  • Executable instructions can also occur in a different order than that illustrated in the drawings. For example, two successively represented blocks may in fact be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented in a dedicated hardware-based system that performs the specified function or operation. Or it can be implemented by a combination of dedicated hardware and computer instructions.
  • the units involved in the embodiments of the present application may be implemented by software or by hardware.
  • the described unit may also be provided in the processor, for example, as a processor including an acquisition unit 901, a mapping unit 902, a determination unit 903, a clustering unit 904, and an area determination unit 905.
  • the names of these units do not constitute a limitation on the unit itself under certain circumstances.
  • the receiving unit may also be described as “acquiring each of the appropriate geographical locations in a specified geographical area within a specified historical time period. unit”.
  • the present application also provides a computer readable medium, which may be included in the apparatus described in the above embodiments, or may be separately present and not incorporated into the apparatus.
  • the computer readable medium carries one or more programs, when the one or more programs are executed by the device, causing the device to: acquire each of the appropriate geographical locations in a specified geographic area within a specified historical time period; Each of the properly placed geographic location information is mapped to the rasterized map to obtain a mapped map; for each raster, the distance between the raster and the grid of the nearest proper geographical location is determined; the distance is within a preset numerical range
  • the inner grid is clustered to obtain a plurality of delivery area units; clustering the plurality of delivery area units to obtain at least one delivery area including a plurality of delivery area units.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

一种配送区域确定方法和装置，方法包括：获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息（201）；将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图（202）；对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离（203）；对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元（204）；对该多个配送区域单元进行聚类，得到包括该多个配送区域单元的至少一个配送区域（205）。本方案提高了配送区域分配的效率。

Description

配送区域确定方法和装置
本专利申请要求于2017年5月19日提交的、申请号为201710356899.4、申请人为北京京东世纪贸易有限公司和北京京东尚科信息技术有限公司、发明名称为“配送区域确定方法和装置”的中国专利申请的优先权，该申请的全文以引用的方式并入本申请中。
技术领域
本申请涉及计算机技术领域，具体涉及互联网技术领域，尤其配送区域确定方法和装置。
背景技术
随着电商业务的飞速增长，快递业务也随之有了迅猛的发展。在快递员配送物品前，配送站点需要对配送地点划分区域得到配送区域。
然而，现有的配送区域划分方法主要是人员凭经验进行划分，划分的效率较低，且容易受到主观因素影响。
发明内容
本申请的目的在于提出一种改进的配送区域确定方法和装置，来解决以上背景技术部分提到的技术问题。
第一方面，本申请实施例提供了一种配送区域确定方法，该方法包括：获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息；将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图；对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离；对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元；对多个配送区域单元进行聚类，得到包括多个配送区域单元的至少一个配送区域。
在一些实施例中，在得到多个配送区域单元之前，该方法还包括： 基于泰森多边形，以各个妥投地理位置所在的栅格分别作为各个泰森多边形内的点，对映射地图进行划分，得到多个子地理区域；对于对栅格聚类得到的每一类地理区域，若该类地理区域中包含至少两个子地理区域，将至少两个子地理区域进行合并；将合并得到的地理区域和未参与合并的子地理区域确定为多个配送区域单元。
在一些实施例中，至少一个配送区域为多个配送区域；以及在对多个配送区域单元进行聚类，得到至少一个配送区域之后，该方法还包括：基于在指定历史时间段内，各个配送区域单元中的配送数量，调整多个配送区域中的配送区域所包括的配送区域单元；或基于在指定历史时间段内，各个配送区域单元中的配送时长，调整多个配送区域中的配送区域所包括的配送区域单元。
在一些实施例中，基于在指定历史时间段内，各个配送区域单元中的配送数量，调整多个配送区域中的配送区域所包括的配送区域单元，包括：对于至少一个配送区域中的每个配送区域，确定指定历史时间段内该配送区域的配送数量，其中，配送区域的配送数量为各个配送区域单元的配送数量之和；响应于确定该配送区域的配送数量大于预设数量范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；响应于确定该配送区域的配送数量小于预设数量范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
在一些实施例中，基于在指定历史时间段内，各个配送区域单元中的配送时长，调整多个配送区域中的配送区域所包括的配送区域单元，包括：对于至少一个配送区域中的每个配送区域，确定指定历史时间段内该配送区域的配送时长，其中，配送区域的配送时长为各个配送区域单元的配送时长之和；响应于确定该配送区域的配送时长大于预设时长范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；响应于确定该配送区域的配送时长小于预设时长范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
第二方面，本申请提供了一种配送区域确定装置，该装置包括： 获取单元，配置用于获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息；映射单元，配置用于将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图；确定单元，配置用于对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离；聚类单元，配置用于对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元；区域确定单元，配置用于对多个配送区域单元进行聚类，得到包括多个配送区域单元的至少一个配送区域。
在一些实施例中，该装置还包括：子地理区域确定单元，配置用于基于泰森多边形，以各个妥投地理位置所在的栅格分别作为各个泰森多边形内的点，对映射地图进行划分，得到多个子地理区域；合并单元，配置用于对于对栅格聚类得到的每一类地理区域，若该类地理区域中包含至少两个子地理区域，将至少两个子地理区域进行合并；区域单元确定单元，配置用于将合并得到的地理区域和未参与合并的子地理区域确定为多个配送区域单元。
在一些实施例中，至少一个配送区域为多个配送区域；以及装置还包括：第一调整单元，配置用于基于在指定历史时间段内，各个配送区域单元中的配送数量，调整多个配送区域中的配送区域所包括的配送区域单元；或第二调整单元，配置用于基于在指定历史时间段内，各个配送区域单元中的配送时长，调整多个配送区域中的配送区域所包括的配送区域单元。
在一些实施例中，第一调整单元，包括：第一确定模块，配置用于对于至少一个配送区域中的每个配送区域，确定指定历史时间段内该配送区域的配送数量，其中，配送区域的配送数量为各个配送区域单元的配送数量之和；第一划分模块，配置用于响应于确定该配送区域的配送数量大于预设数量范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；第一区域划分模块，配置用于响应于确定该配送区域的配送数量小于预设数量范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
在一些实施例中，第二调整单元，包括：第二确定模块，配置用于对于至少一个配送区域中的每个配送区域，确定指定历史时间段内 该配送区域的配送时长，其中，配送区域的配送时长为各个配送区域单元的配送时长之和；第二划分模块，配置用于响应于确定该配送区域的配送时长大于预设时长范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；第二区域划分模块，配置用于响应于确定该配送区域的配送时长小于预设时长范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
本申请实施例提供的配送区域确定方法和装置，通过获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息。之后将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图。然后对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离。而后对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元。最后对多个配送区域单元进行聚类，得到包括多个配送区域单元的至少一个配送区域。从而提高了配送区域分配的效率。
附图说明
通过阅读参照以下附图所作的对非限制性实施例所作的详细描述，本申请的其它特征、目的和优点将会变得更明显：
图1是本申请可以应用于其中的示例性系统架构图；
图2是根据本申请的配送区域确定方法的一个实施例的流程图；
图3a和图3b是根据本申请的配送区域确定方法的通过栅格确定距离的示意图；
图4是根据本申请的配送区域确定方法的一个应用场景的示意图；
图5是根据本申请的配送区域确定方法的又一个实施例的流程图；
图6是根据本申请的配送区域确定方法的又一个实施例的流程图；
图7是根据本申请的配送区域确定方法的又一个实施例的流程图；
图8是根据本申请的配送区域确定方法的又一个实施例的流程 图；
图9是根据本申请的配送区域确定装置的一个实施例的结构示意图；
图10是适于用来实现本申请实施例的服务器的计算机系统的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释相关发明，而非对该发明的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与有关发明相关的部分。
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本申请。
图1示出了可以应用本申请的配送区域确定方法或配送区域确定装置的实施例的示例性系统架构100。
如图1所示，系统架构100可以包括终端设备101、102、103，网络104和服务器105。网络104用以在终端设备101、102、103和服务器105之间提供通信链路的介质。网络104可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
用户可以使用终端设备101、102、103通过网络104与服务器105交互，以接收或发送消息等。终端设备101、102、103上可以安装有各种通讯客户端应用，例如网页浏览器应用、购物类应用、搜索类应用、即时通信工具、邮箱客户端、社交平台软件等。
终端设备101、102、103可以是具有显示屏并且支持接收配送区域相关信息的各种电子设备，包括但不限于智能手机、平板电脑、电子书阅读器、MP3播放器(Moving Picture Experts Group Audio Layer III，动态影像专家压缩标准音频层面3)、MP4(Moving Picture Experts Group Audio Layer IV，动态影像专家压缩标准音频层面4)播放器、膝上型便携计算机和台式计算机等等。
服务器105可以是提供各种服务的服务器，例如对终端设备101、102、103上显示的配送区域提供支持的后台服务器。后台服务器可以对接收到的妥投地理位置信息等数据进行分析等处理，并将处理结果(例如配送区域相关数据)反馈给终端设备。
需要说明的是，本申请实施例所提供的配送区域确定方法一般由服务器105执行，相应地，配送区域确定装置一般设置于服务器105中。
应该理解，图1中的终端设备、网络和服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的终端设备、网络和服务器。
继续参考图2，示出了根据本申请的配送区域确定方法的一个实施例的流程200。该配送区域确定方法，包括以下步骤：
步骤201，获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息。
在本实施例中，配送区域确定方法运行于其上的电子设备(例如图1所示的服务器)可以获取指定历史时间段内的，并且是指定地理区域中的多个妥投地理位置信息。指定历史时间段为指定的已经过去的时间段，比如昨天的一天或者昨天上午半天。快递员可以以该时间段的时长作为一个投递周期，在每个投递周期对其负责的区域进行一轮投递。指定地理区域为一片人为限定的地理区域。妥投地理位置信息为快递员对物品实现妥投所在的地理位置的信息，该地理位置在上述指定地理区域内。通常妥投地理位置信息中包括经度信息和纬度信息。一般快递员在妥投后，会在妥投的地点上传妥投地理位置信息。本实施例利用妥投地理位置信息来确定配送区域单元。
步骤202，将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图。
在本实施例中，上述电子设备将妥投地理位置信息映射到地图中，该地图是经过栅格化的地图。本实施例中的映射即是在地图中呈现妥投地理位置信息中所包括的经度信息和纬度信息对应的位置点。可以对地图进行栅格化处理，以得到栅格化的地图。将妥投地理位置信息映射到地图中后，各个妥投地理位置在映射地图上对应的点即落在栅 格中。对地图进行栅格化即是将地图划分为多个栅格，例如，栅格化的地图可以是将1平方米的地理区域作为一个栅格。
需要说明的是，也可以先执行将妥投地理位置信息映射到地图中的步骤，再执行对地图进行栅格化处理的步骤，以得到映射地图。
步骤203，对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离。
在本实施例中，对于每一个栅格，上述电子设备确定该栅格与最近的妥投地理位置所在的栅格的距离。确定栅格与栅格之间的距离，首先确定栅格之间距离的计算规则。可以采用第一种规则，根据栅格之间的相对位置来推断距离。比如一个栅格代表1(平方米)，可以确定每个栅格与相邻的栅格之间的距离为1(米)。那么以此类推，如果相隔两个栅格，则距离为2(米)。也可以可以采用第二种规则，计算一个栅格中指定位置与另一个栅格中同样的指定位置的距离，比如计算两个栅格的正中心之间的距离。妥投地理位置所在的栅格与栅格本身的距离是0。如图3所示，图3a为映射地图，其中的“1”指示妥投地理位置所在的栅格，“0”为除妥投地理位置以外的其他地理位置所在的栅格。图3b为进行距离计算后，各个栅格距离最近的妥投地理位置所在栅格的距离，其中的“0”指示妥投地理位置所在的栅格，其他栅格中的任一数字指示该数字所在的栅格距离最近的妥投地理位置所在栅格的距离。
步骤204，对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元。
在本实施例中，根据步骤203中确定得到的距离，上述电子设备对距离在预设数值范围内的栅格进行聚类。之后将聚类后得到的多个栅格组成的地理区域作为配送区域单元。配送区域单元为多个栅格组成的地理区域，是组成配送区域的单位。一个配送区域单元可以是一栋楼或者一条胡同。预设数值范围是对距离预先设置的数值范围，与妥投地理位置所在栅格的距离在该范围内的栅格，才能够参与聚类。这里的聚类是根据距离进行的，上述电子设备对在预设数值范围内并且位置相聚拢的栅格进行聚类。
举例来说，预设数值范围为小于等于5(米)。一个妥投地理位置a所在的栅格与紧邻的多个栅格聚类为一类：a类，这里紧邻的多个栅格与该妥投地理位置a的距离都是在1到5之间。另外有一些栅格与a类栅格最外围的栅格相邻，这些栅格与妥投地理位置a所在的栅格的距离在5以上，不符合预设数值范围。并且这些栅格与任何的妥投地理位置所在的栅格的距离都大于5。各类栅格之间，则可以被这些与各个妥投地理位置所在的栅格皆有较大距离的栅格相隔离开。一般这些栅格所对应的区域可以是较宽阔的街道或者河流等等。
步骤205，对多个配送区域单元进行聚类，得到包括多个配送区域单元的至少一个配送区域。
在本实施例中，上述电子设备在得到多个配送区域单元之后，对多个配送区域单元进行聚类，聚类后得到包括上述的多个配送区域单元的至少一个配送区域。其中的每个配送区域都包括多个配送区域单元。得到配送区域之后，则可以将该配送区域作为一个快递员的配送区域。
具体地，可以使用的聚类算法有多种，具体可以使用非监督聚类，比如，K-means算法、高斯混合模型算法(Gaussian mixture model，GMM)，也可以将两者结合使用。
继续参见图4，图4是根据本实施例的配送区域确定方法的应用场景的一个示意图。在图4的应用场景中，服务器401首先获取昨天上午8点至12点之间的北京市西红门地区中的每个妥投地理位置的妥投地理位置信息402。之后服务器将获取到的妥投地理位置信息402映射到栅格化的地图中，得到映射地图403，其中每个妥投地理位置所在的栅格与相邻的栅格的距离设为1。然后服务器对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离404。根据确定得到的各个距离，对距离在5以内的栅格进行聚类，得到多个配送区域单元405。最后对多个配送区域单元405进行聚类，得到至少一个配送区域406，将得到的至少一个配送区域406发送给终端设备407。如图4所示。
本申请的上述实施例利用栅格加快了区域分配的速度，并通过两次聚类过程提高了分配的精确度。使用本实施例中的方法能够提高配送区域的分配效率，解决分配受到主观因素影响的问题。
进一步参考图5，其示出了配送区域确定方法的又一个实施例的流程500。该配送区域确定方法的流程500，包括以下步骤：
步骤501，获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息。
在本实施例中，服务器可以获取指定历史时间段内的，并且是指定地理区域中的多个妥投地理位置信息。指定历史时间段为指定的已经过去的时间段，比如昨天的一天或者昨天上午半天。快递员可以以该时间段的时长作为一个投递周期，在每个周期对其负责的区域进行一轮投递。指定地理区域为一片指定的地理区域。妥投地理位置信息一般为快递员在妥善投递后，在妥善投递的地点上传的地理位置信息。本实施例利用妥投地理位置信息来确定配送区域单元。
步骤502，将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图。
在本实施例中，上述服务器将妥投地理位置信息映射到地图中，该地图是经过栅格化的地图。可以对地图进行栅格化处理，以得到栅格化的地图。将妥投地理位置信息映射到地图中后，各个妥投地理位置在映射地图上对应的点即落在栅格中。对地图进行栅格化即是将地图划分为多个栅格，例如，栅格化的地图可以是将1平方米的地理区域作为一个栅格。
需要说明的是，也可以先执行将妥投地理位置信息映射到地图中的步骤，再执行对地图进行栅格化处理的步骤，以得到映射地图。
步骤503，对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离。
在本实施例中，对于每一个栅格，上述服务器确定该栅格与最近的妥投地理位置在映射地图上对应的点所在的栅格的距离。确定栅格与栅格之间的距离，首先确定栅格之间距离的计算规则。如果一个栅 格代表1(平方米)，可以确定每个栅格与相邻的栅格之间的距离为1(米)。那么以此类推，如果相隔两个栅格，则距离为2(米)。也可以计算一个栅格中指定位置与另一个栅格中同样的指定位置的距离，比如计算两个栅格的正中心之间的距离。妥投地理位置所在的栅格与栅格本身的距离是0。
距离可以通过距离变换(Distance transform)获得。具体地，可以采用以下公式获得：
Figure PCTCN2018080198-appb-000001
其中，G'为已经映射了妥投地理位置信息并且栅格化的地图。其中D f(p)为各个栅格与距离该栅格最近的妥投地理位置所在的栅格之间的距离。p为任意的栅格，q为妥投地理位置所在的栅格。d(p,q)为距离函数，表示任意的栅格p到最近的妥投地理位置所在栅格q的距离。这里的距离函数可以选自多种距离函数，比如，欧几里得距离(又名欧式距离)，或者曼哈顿距离等等。其中f(p)也是一个变量。具体取值如下：
Figure PCTCN2018080198-appb-000002
p在街区内或普通道路上时，f(p)＝0，p在河流或者高速路上时，f(p)＝∞。
步骤504，对距离在预设数值范围内的栅格进行聚类。
在本实施例中，根据确定得到的距离，上述服务器对距离在预设数值范围内的栅格进行聚类。预设数值范围是对距离预先设置的数值范围，与妥投地理位置所在栅格的距离在该范围内的栅格，才能够参与聚类。这里的聚类是根据距离进行的，上述服务器对在预设数值范围内并且位置相聚拢的栅格进行聚类。
步骤505，基于泰森多边形(Voronoi diagram)，以各个妥投地理位置所在的栅格分别作为各个泰森多边形内的点，对映射地图进行划分，得到多个子地理区域。
在本实施例中，服务器可以以各个妥投地理位置所在的栅格作为各个泰森多边形内的点，对映射地图进行划分，该点是构建泰森多边 形所基于的点。在映射地图上作泰森多边形，需要首先对多个妥投地理位置所在的栅格进行连线，作三角形，之后作三角形各边的垂直平分线，随即得到围绕各个妥投地理位置所在的栅格的多个泰森多边形。将泰森多边形作为子地理区域。
需要说明的是，除了可以基于泰森多边形对映射地图进行划分，还可以使用Delaunay三角剖分算法进行划分，或者将两种划分方式相结合，进而得到多个子地理区域。
步骤506，对于对栅格聚类得到的每一类地理区域，若该类地理区域中包含至少两个子地理区域，将至少两个子地理区域进行合并。
在本实施例中，在聚类之后，得到各类的地理区域，上述服务器根据聚类得到的结果对划分得到的子地理区域进行进一步的处理。对于每一类地理区域，如果该类地理区域中包含至少两个划分得到的子地理区域，则将这至少两个子地理区域进行合并。原来的至少两个子地理区域则合并为一个区域。
步骤507，将合并得到的地理区域和未参与合并的子地理区域确定为多个配送区域单元。
在本实施例中，上述服务器将合并得到的地理区域，和未参与合并的子地理区域确定为多个配送区域单元。这样，经过聚类和划分，得到多个配送区域单元。
步骤508，对多个配送区域单元进行聚类，得到包括多个配送区域单元的至少一个配送区域。
在本实施例中，上述服务器在得到多个配送区域单元之后，对多个配送区域单元进行聚类，聚类后得到包括上述的多个配送区域单元的至少一个配送区域。其中的每个配送区域都包括多个配送区域单元。得到配送区域之后，则可以将该配送区域作为一个快递员的配送区域。
本实施例通过对映射地图进行基于泰森多边形的划分，能够涉及到距离妥投地理位置较远的区域，减少配送区域遗漏的概率。
进一步参考图6，其示出了配送区域确定方法的又一个实施例的流程600。该配送区域确定方法的流程600，包括以下步骤：
步骤601，获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息。
在本实施例中，服务器可以获取指定历史时间段内的，并且是指定地理区域中的多个妥投地理位置信息。指定历史时间段为指定的已经过去的时间段，比如昨天的一天或者昨天上午半天。快递员可以以该时间段的时长作为一个投递周期，在每个周期对其负责的区域进行一轮投递。指定地理区域为一片指定的地理区域。妥投地理位置信息一般为快递员在妥善投递后，在妥善投递的地点上传的地理位置信息。本实施例利用妥投地理位置信息来确定配送区域单元。
步骤602，将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图。
在本实施例中，上述服务器将妥投地理位置信息映射到地图中，该地图是经过栅格化的地图。可以对地图进行栅格化处理，以得到栅格化的地图。将妥投地理位置信息映射到地图中后，各个妥投地理位置即落在栅格中。对地图进行栅格化即是将地图划分为多个栅格，例如，栅格化的地图可以是将1平方米的地理区域作为一个栅格。
需要说明的是，也可以先执行将妥投地理位置信息映射到地图中的步骤，再执行对地图进行栅格化处理的步骤，以得到映射地图。
步骤603，对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离。
在本实施例中，对于每一个栅格，上述服务器确定该栅格与最近的妥投地理位置所在的栅格的距离。确定栅格与栅格之间的距离，首先确定栅格之间距离的计算规则。如果一个栅格代表1(平方米)，可以确定每个栅格与相邻的栅格之间的距离为1(米)。那么以此类推，如果相隔两个栅格，则距离为2(米)。也可以计算一个栅格中指定位置与另一个栅格中同样的指定位置的距离，比如计算两个栅格的正中心之间的距离。妥投地理位置所在的栅格与栅格本身的距离是0。
步骤604，对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元。
在本实施例中，根据确定得到的距离，上述服务器对距离在预设 数值范围内的栅格进行聚类。之后将聚类后得到的多个栅格组成的地理区域作为配送区域单元。配送区域单元为多个栅格组成的地理区域，是组成配送区域的单位。一个配送区域单元可以是一栋楼或者一条胡同。预设数值范围是对距离预先设置的数值范围，与妥投地理位置所在栅格的距离在该范围内的栅格，才能够参与聚类。这里的聚类是根据距离进行的，上述服务器对在预设数值范围内并且位置相聚拢的栅格进行聚类。
步骤605，对多个配送区域单元进行聚类，得到包括多个配送区域单元的多个配送区域。
在本实施例中，上述服务器在得到多个配送区域单元之后，对多个配送区域单元进行聚类，聚类后得到包括上述的多个配送区域单元的多个配送区域。其中的每个配送区域都包括多个配送区域单元。得到配送区域之后，则可以将该配送区域作为一个快递员的配送区域。
步骤606，基于在指定历史时间段内，各个配送区域单元中的配送数量，调整多个配送区域中的配送区域所包括的配送区域单元；
或
基于在指定历史时间段内，各个配送区域单元中的配送时长，调整多个配送区域中的配送区域所包括的配送区域单元。
在本实施例中，这里的配送数量指快递员配送并妥投物品的数量，配送时长指快递员配送并妥投物品的时长。指定历史时间段可以是上述服务器接收妥投地理位置信息的时间段。上述服务器基于配送区域中各个配送区域单元的配送数量，对配送区域中包括的配送区域单元进行调整。例如，各个配送区域单元的配送数量过多(多于预设数量)，则减少配送区域中配送区域单元的数量。反之亦然，即是各个配送区域单元的配送数量过少(少于预设数量)，则增加配送区域中配送区域单元的数量。
也可以基于配送区域单元中的配送时长，对配送区域单元进行调整。例如，各个配送区域单元的配送时长过长(长于预设数量)，则减少配送区域中配送区域单元的数量。反之亦然，即是各个配送区域单元的配送时长过短(短于预设数量)，则增加配送区域中配送区域单元 的数量。
本实施例能够根据配送区域的配送数量或者配送时长来调整配送区域的配送区域单元，根据实际情况对配送区域进行进一步的优化。
进一步参考图7，其示出了配送区域确定方法的又一个实施例的流程700。该配送区域确定方法的流程700，包括以下步骤：
步骤701，获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息。
在本实施例中，服务器可以获取指定历史时间段内的，并且是指定地理区域中的多个妥投地理位置信息。指定历史时间段为指定的已经过去的时间段，比如昨天的一天或者昨天上午半天。快递员可以以该时间段的时长作为一个投递周期，在每个周期对其负责的区域进行一轮投递。指定地理区域为一片指定的地理区域。妥投地理位置信息一般为快递员在妥善投递后，在妥善投递的地点上传的地理位置信息。本实施例利用妥投地理位置信息来确定配送区域单元。
步骤702，将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图。
在本实施例中，上述服务器将妥投地理位置信息映射到地图中，该地图是经过栅格化的地图。可以对地图进行栅格化处理，以得到栅格化的地图。将妥投地理位置信息映射到地图中后，各个妥投地理位置在映射地图上对应的点即落在栅格中。对地图进行栅格化即是将地图划分为多个栅格，例如，栅格化的地图可以是将1平方米的地理区域作为一个栅格。
需要说明的是，也可以先执行将妥投地理位置信息映射到地图中的步骤，再执行对地图进行栅格化处理的步骤，以得到映射地图。
步骤703，对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离。
在本实施例中，对于每一个栅格，上述服务器确定该栅格与最近的妥投地理位置所在的栅格的距离。确定栅格与栅格之间的距离，首先确定栅格之间距离的计算规则。如果一个栅格代表1(平方米)，可 以确定每个栅格与相邻的栅格之间的距离为1(米)。那么以此类推，如果相隔两个栅格，则距离为2(米)。也可以计算一个栅格中指定位置与另一个栅格中同样的指定位置的距离，比如计算两个栅格的正中心之间的距离。妥投地理位置所在的栅格与栅格本身的距离是0。
步骤704，对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元。
在本实施例中，根据确定得到的距离，上述服务器对距离在预设数值范围内的栅格进行聚类。之后将聚类后得到的多个栅格组成的地理区域作为配送区域单元。配送区域单元为多个栅格组成的地理区域，是组成配送区域的单位。一个配送区域单元可以是一栋楼或者一条胡同。预设数值范围是对距离预先设置的数值范围，与妥投地理位置所在栅格的距离在该范围内的栅格，才能够参与聚类。这里的聚类是根据距离进行的，上述服务器对在预设数值范围内并且位置相聚拢的栅格进行聚类。
步骤705，对多个配送区域单元进行聚类，得到包括多个配送区域单元的多个配送区域。
在本实施例中，上述服务器在得到多个配送区域单元之后，对多个配送区域单元进行聚类，聚类后得到包括上述的多个配送区域单元的多个配送区域。其中的每个配送区域都包括多个配送区域单元。得到配送区域之后，则可以将该配送区域作为一个快递员的配送区域。
步骤706，对于多个配送区域中的每个配送区域，确定指定历史时间段内该配送区域的配送数量。
在本实施例中，对于每个配送区域，上述服务器确定指定历史时间段内配送区域的配送数量。这里的指定历史时间段与前述的指定历史时间段可以是相同的。配送区域的配送数量是基于配送区域中的各个配送区域单元的配送数量确定的，具体地，配送区域的配送数量为该配送区域中各个配送区域单元的配送数量之和。各个配送区域单元的配送数量可以通过确定配送区域单元内的妥投地理位置信息的数量来获得。
步骤707，响应于确定该配送区域的配送数量大于预设数量范围， 将该配送区域中的一个或多个配送区域单元划分到其他配送区域中。
在本实施例中，预设数量范围为对配送数量预先设定的范围。如果配送数量不在该预设数量范围内，则上述服务器对该配送区域中的配送区域单元做出调整。上述服务器若确定配送区域的配送数量大于预设数量范围，则做出响应：将该配送区域中的一个或多个配送区域单元划分到其他配送区域中。例如，将位于配送区域边缘的配送区域单元划分到相邻的配送区域中，以减少该配送区域的配送数量。
步骤708，响应于确定该配送区域的配送数量小于预设数量范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
在本实施例中，上述服务器若确定配送区域的配送数量小于预设数量范围，则做出响应：将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。这样就能够增加配送区域过少的配送数量。例如，将位于相邻的配送区域中的两个配送区域单元划分到该配送区域中。
进一步参考图8，其示出了配送区域确定方法的又一个实施例的流程800。该配送区域确定方法的流程800，包括以下步骤：
步骤801，获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息。
在本实施例中，服务器可以获取指定历史时间段内的，并且是指定地理区域中的多个妥投地理位置信息。指定历史时间段为指定的已经过去的时间段，比如昨天的一天或者昨天上午半天。快递员可以以该时间段的时长作为一个投递周期，在每个周期对其负责的区域进行一轮投递。指定地理区域为一片指定的地理区域。妥投地理位置信息一般为快递员在妥善投递后，在妥善投递的地点上传的地理位置信息。本实施例利用妥投地理位置信息来确定配送区域单元。
步骤802，将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图。
在本实施例中，上述服务器将妥投地理位置信息映射到地图中，该地图是经过栅格化的地图。可以对地图进行栅格化处理，以得到栅 格化的地图。将妥投地理位置信息映射到地图中后，各个妥投地理位置在映射地图上对应的点即落在栅格中。对地图进行栅格化即是将地图划分为多个栅格，例如，栅格化的地图可以是将1平方米的地理区域作为一个栅格。
需要说明的是，也可以先执行将妥投地理位置信息映射到地图中的步骤，再执行对地图进行栅格化处理的步骤，以得到映射地图。
步骤803，对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离。
在本实施例中，对于每一个栅格，上述服务器确定该栅格与最近的妥投地理位置所在的栅格的距离。确定栅格与栅格之间的距离，首先确定栅格之间距离的计算规则。如果一个栅格代表1(平方米)，可以确定每个栅格与相邻的栅格之间的距离为1(米)。那么以此类推，如果相隔两个栅格，则距离为2(米)。也可以计算一个栅格中指定位置与另一个栅格中同样的指定位置的距离，比如计算两个栅格的正中心之间的距离。妥投地理位置所在的栅格与栅格本身的距离是0。
步骤804，对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元。
在本实施例中，根据确定得到的距离，上述服务器对距离在预设数值范围内的栅格进行聚类。之后将聚类后得到的多个栅格组成的地理区域作为配送区域单元。配送区域单元为多个栅格组成的地理区域，是组成配送区域的单位。一个配送区域单元可以是一栋楼或者一条胡同。预设数值范围是对距离预先设置的数值范围，与妥投地理位置所在栅格的距离在该范围内的栅格，才能够参与聚类。这里的聚类是根据距离进行的，上述服务器对在预设数值范围内并且位置相聚拢的栅格进行聚类。
步骤805，对多个配送区域单元进行聚类，得到包括多个配送区域单元的多个配送区域。
在本实施例中，上述服务器在得到多个配送区域单元之后，对多个配送区域单元进行聚类，聚类后得到包括上述的多个配送区域单元的多个配送区域。其中的每个配送区域都包括多个配送区域单元。得 到配送区域之后，则可以将该配送区域作为一个快递员的配送区域。
步骤806，对于至少一个配送区域中的每个配送区域，确定指定历史时间段内该配送区域的配送时长。
在本实施例中，对于每个配送区域，上述服务器确定指定历史时间段内配送区域的配送时长。这里的指定历史时间段与前述的指定历史时间段可以是相同的。配送区域的配送时长是基于配送区域中的各个配送区域单元的配送时长确定的，具体地，配送区域的配送时长为该配送区域中各个配送区域单元的配送时长之和。各个配送区域单元的配送时长可以通过确定配送区域单元内的第一个妥投地理位置信息的发出时间(或接收时间)到最后一个妥投地理位置信息的发出时间(或接收时间)之间的时间差来获得。
步骤807，响应于确定该配送区域的配送时长大于预设时长范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中。
在本实施例中，预设时长范围为对配送时长预先设定的范围。如果配送时长不在该预设时长范围内，则上述服务器对该配送区域中的配送区域单元做出调整。上述服务器若确定配送区域的配送时长大于预设时长范围，则做出响应：将该配送区域中的一个或多个配送区域单元划分到其他配送区域中。例如，将位于配送区域边缘的配送区域单元划分到相邻的配送区域中，以缩短该配送区域的配送时长。
步骤808，响应于确定该配送区域的配送时长小于预设时长范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
在本实施例中，上述服务器若确定配送区域的配送时长小于预设时长范围，则做出响应：将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。这样就能够增加配送区域过短的配送时长。例如，将位于相邻的配送区域中的两个配送区域单元划分到该配送区域中。
进一步参考图9，作为对上述各图所示方法的实现，本申请提供了一种配送区域确定装置的一个实施例，该装置实施例与图2所示的方法实施例相对应，该装置具体可以应用于各种电子设备中。
如图9所示，本实施例的配送区域确定装置900包括：获取单元901、映射单元902、确定单元903、聚类单元904和区域确定单元905。获取单元901，配置用于获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息；映射单元902，配置用于将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图；确定单元903，配置用于对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离；聚类单元904，配置用于对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元；区域确定单元905，配置用于对多个配送区域单元进行聚类，得到包括多个配送区域单元的至少一个配送区域。
在本实施例中，获取单元901可以获取指定历史时间段内的，并且是指定地理区域中的多个妥投地理位置信息。指定历史时间段为指定的已经过去的时间段，比如昨天的一天或者昨天上午半天。快递员可以以该时间段的时长作为一个投递周期，在每个周期对其负责的区域进行一轮投递。指定地理区域为一片指定的地理区域。妥投地理位置信息一般为快递员在妥善投递后，在妥善投递的地点上传的地理位置信息。本实施例利用妥投地理位置信息来确定配送区域单元。
在本实施例中，映射单元902将妥投地理位置信息映射到地图中，该地图是经过栅格化的地图。可以对地图进行栅格化处理，以得到栅格化的地图。将妥投地理位置信息映射到地图中后，各个妥投地理位置即落在栅格中。对地图进行栅格化即是将地图划分为多个栅格，例如，栅格化的地图可以是将1平方米的地理区域作为一个栅格。
在本实施例中，对于每一个栅格，确定单元903确定该栅格与最近的妥投地理位置所在的栅格的距离。确定栅格与栅格之间的距离，首先确定栅格之间距离的计算规则。举例来说，如果一个栅格代表1(平方米)，可以确定每个栅格与相邻的栅格之间的距离为1(米)。那么以此类推，如果相隔两个栅格，则距离为2(米)。也可以计算一个栅格中指定位置与另一个栅格中同样的指定位置的距离，比如计算两个栅格的正中心之间的距离。妥投地理位置所在的栅格与栅格本身的距离是0。
在本实施例中，聚类单元904对距离在预设数值范围内的栅格进行聚类。之后将聚类后得到的多个栅格组成的地理区域作为配送区域单元。配送区域单元为多个栅格组成的地理区域，是组成配送区域的单位。一个配送区域单元可以是一栋楼或者一条胡同。预设数值范围是对距离预先设置的数值范围，与妥投地理位置所在栅格的距离在该范围内的栅格，才能够参与聚类。这里的聚类是根据距离进行的，聚类单元904对在预设数值范围内并且位置相聚拢的栅格进行聚类。
在本实施例中，区域确定单元905在得到多个配送区域单元之后，对多个配送区域单元进行聚类，聚类后得到包括上述的多个配送区域单元的至少一个配送区域。其中的每个配送区域都包括多个配送区域单元。得到配送区域之后，则可以将该配送区域作为一个快递员的配送区域。
在本实施例的一些可选的实现方式中，该装置还包括：子地理区域确定单元(未示出)，配置用于基于泰森多边形，以各个妥投地理位置所在的栅格分别作为各个泰森多边形内的点，对映射地图进行划分，得到多个子地理区域；合并单元(未示出)，配置用于对于对栅格聚类得到的每一类地理区域，若该类地理区域中包含至少两个子地理区域，将至少两个子地理区域进行合并；区域单元确定单元(未示出)，配置用于将合并得到的地理区域和未参与合并的子地理区域确定为多个配送区域单元。
在本实施例的一些可选的实现方式中，至少一个配送区域为多个配送区域；以及装置还包括：第一调整单元(未示出)，配置用于基于在指定历史时间段内，各个配送区域单元中的配送数量，调整多个配送区域中的配送区域所包括的配送区域单元；或第二调整单元(未示出)，配置用于基于在指定历史时间段内，各个配送区域单元中的配送时长，调整多个配送区域中的配送区域所包括的配送区域单元。
在本实施例的一些可选的实现方式中，第一调整单元，包括：第一确定模块(未示出)，配置用于对于至少一个配送区域中的每个配送区域，确定指定历史时间段内该配送区域的配送数量，其中，配送区域的配送数量为各个配送区域单元的配送数量之和；第一划分模块(未 示出)，配置用于响应于确定该配送区域的配送数量大于预设数量范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；第一区域划分模块(未示出)，配置用于响应于确定该配送区域的配送数量小于预设数量范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
在本实施例的一些可选的实现方式中，第二调整单元，包括：第二确定模块(未示出)，配置用于对于至少一个配送区域中的每个配送区域，确定指定历史时间段内该配送区域的配送时长，其中，配送区域的配送时长为各个配送区域单元的配送时长之和；第二划分模块(未示出)，配置用于响应于确定该配送区域的配送时长大于预设时长范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；第二区域划分模块(未示出)，配置用于响应于确定该配送区域的配送时长小于预设时长范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
下面参考图10，其示出了适于用来实现本申请实施例的电子设备的计算机系统1000的结构示意图。图10示出的电子设备仅仅是一个示例，不应对本申请实施例的功能和使用范围带来任何限制。
图10示出了适于用来实现本申请实施例的电子设备的计算机系统的结构示意图。如图10所示，计算机系统1000包括中央处理单元(CPU)1001，其可以根据存储在只读存储器(ROM)1002中的程序或者从存储部分1008加载到随机访问存储器(RAM)1003中的程序而执行各种适当的动作和处理。在RAM 1003中，还存储有系统1000操作所需的各种程序和数据。CPU 1001、ROM 1002以及RAM 1003通过总线1004彼此相连。输入/输出(I/O)接口1005也连接至总线1004。
以下部件连接至I/O接口1005：包括键盘、鼠标等的输入部分1006；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分1007；包括硬盘等的存储部分1008；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分1009。通信部分1009 经由诸如因特网的网络执行通信处理。驱动器1010也根据需要连接至I/O接口1005。可拆卸介质1011，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器1010上，以便于从其上读出的计算机程序根据需要被安装入存储部分1008。
特别地，根据本申请的实施例，上文参考流程图描述的过程可以被实现为计算机软件程序。例如，本申请的实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分1009从网络上被下载和安装，和/或从可拆卸介质1011被安装。在该计算机程序被中央处理单元(CPU)1001执行时，执行本申请的方法中限定的上述功能。需要说明的是，本申请的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本申请中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。而在本申请中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本申请各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，该模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本申请实施例中所涉及到的单元可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元也可以设置在处理器中，例如，可以描述为：一种处理器包括获取单元901、映射单元902、确定单元903、聚类单元904和区域确定单元905。其中，这些单元的名称在某种情况下并不构成对该单元本身的限定，例如，接收单元还可以被描述为“获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息的单元”。
作为另一方面，本申请还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的装置中所包含的；也可以是单独存在，而未装配入该装置中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被该装置执行时，使得该装置：获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息；将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图；对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离；对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元；对多个配送区域单元进行聚类，得到包括多个配送区域单元的至少一个配送区域。
以上描述仅为本申请的较佳实施例以及对所运用技术原理的说 明。本领域技术人员应当理解，本申请中所涉及的发明范围，并不限于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离上述发明构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本申请中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (12)

  1. 一种配送区域确定方法，其特征在于，所述方法包括：
    获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息；
    将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图；
    对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离；
    对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元；
    对所述多个配送区域单元进行聚类，得到包括所述多个配送区域单元的至少一个配送区域。
  2. 根据权利要求1所述的配送区域确定方法，其特征在于，在所述得到多个配送区域单元之前，所述方法还包括：
    基于泰森多边形，以各个妥投地理位置所在的栅格分别作为各个泰森多边形内的点，对所述映射地图进行划分，得到多个子地理区域；
    对于对栅格聚类得到的每一类地理区域，若该类地理区域中包含至少两个子地理区域，将所述至少两个子地理区域进行合并；
    将合并得到的地理区域和未参与合并的子地理区域确定为多个配送区域单元。
  3. 根据权利要求1所述的配送区域确定方法，其特征在于，所述至少一个配送区域为多个配送区域；以及
    在所述对所述多个配送区域单元进行聚类，得到至少一个配送区域之后，所述方法还包括：
    基于在所述指定历史时间段内，各个配送区域单元中的配送数量，调整所述多个配送区域中的配送区域所包括的配送区域单元；或
    基于在所述指定历史时间段内，各个配送区域单元中的配送时长，调整所述多个配送区域中的配送区域所包括的配送区域单元。
  4. 根据权利要求3所述的配送区域确定方法，其特征在于，所述基于在所述指定历史时间段内，各个配送区域单元中的配送数量，调整所述多个配送区域中的配送区域所包括的配送区域单元，包括：
    对于所述至少一个配送区域中的每个配送区域，确定所述指定历史时间段内该配送区域的配送数量，其中，配送区域的配送数量为各个配送区域单元的配送数量之和；
    响应于确定该配送区域的配送数量大于预设数量范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；
    响应于确定该配送区域的配送数量小于预设数量范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
  5. 根据权利要求3-4之一所述的配送区域确定方法，其特征在于，所述基于在所述指定历史时间段内，各个配送区域单元中的配送时长，调整所述多个配送区域中的配送区域所包括的配送区域单元，包括：
    对于所述至少一个配送区域中的每个配送区域，确定所述指定历史时间段内该配送区域的配送时长，其中，配送区域的配送时长为各个配送区域单元的配送时长之和；
    响应于确定该配送区域的配送时长大于预设时长范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；
    响应于确定该配送区域的配送时长小于预设时长范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
  6. 一种配送区域确定装置，其特征在于，所述装置包括：
    获取单元，配置用于获取指定历史时间段内的指定地理区域中的各个妥投地理位置信息；
    映射单元，配置用于将各个妥投地理位置信息映射到栅格化的地图中，得到映射地图；
    确定单元，配置用于对于每一个栅格，确定该栅格与最近的妥投地理位置所在的栅格的距离；
    聚类单元，配置用于对距离在预设数值范围内的栅格进行聚类，得到多个配送区域单元；
    区域确定单元，配置用于对所述多个配送区域单元进行聚类，得到包括所述多个配送区域单元的至少一个配送区域。
  7. 根据权利要求6所述的配送区域确定装置，其特征在于，所述装置还包括：
    子地理区域确定单元，配置用于基于泰森多边形，以各个妥投地理位置所在的栅格分别作为各个泰森多边形内的点，对所述映射地图进行划分，得到多个子地理区域；
    合并单元，配置用于对于对栅格聚类得到的每一类地理区域，若该类地理区域中包含至少两个子地理区域，将所述至少两个子地理区域进行合并；
    区域单元确定单元，配置用于将合并得到的地理区域和未参与合并的子地理区域确定为多个配送区域单元。
  8. 根据权利要求6所述的配送区域确定装置，其特征在于，所述至少一个配送区域为多个配送区域；以及
    所述装置还包括：
    第一调整单元，配置用于基于在所述指定历史时间段内，各个配送区域单元中的配送数量，调整所述多个配送区域中的配送区域所包括的配送区域单元；或
    第二调整单元，配置用于基于在所述指定历史时间段内，各个配送区域单元中的配送时长，调整所述多个配送区域中的配送区域所包括的配送区域单元。
  9. 根据权利要求8所述的配送区域确定装置，其特征在于，所述第一调整单元，包括：
    第一确定模块，配置用于对于所述至少一个配送区域中的每个配送区域，确定所述指定历史时间段内该配送区域的配送数量，其中， 配送区域的配送数量为各个配送区域单元的配送数量之和；
    第一划分模块，配置用于响应于确定该配送区域的配送数量大于预设数量范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；
    第一区域划分模块，配置用于响应于确定该配送区域的配送数量小于预设数量范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
  10. 根据权利要求8-9之一所述的配送区域确定装置，其特征在于，所述第二调整单元，包括：
    第二确定模块，配置用于对于所述至少一个配送区域中的每个配送区域，确定所述指定历史时间段内该配送区域的配送时长，其中，配送区域的配送时长为各个配送区域单元的配送时长之和；
    第二划分模块，配置用于响应于确定该配送区域的配送时长大于预设时长范围，将该配送区域中的一个或多个配送区域单元划分到其他配送区域中；
    第二区域划分模块，配置用于响应于确定该配送区域的配送时长小于预设时长范围，将其他配送区域中的一个或多个配送区域单元划分到该配送区域中。
  11. 一种电子设备，包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求1-5中任一所述的方法。
  12. 一种计算机可读存储介质，其上存储有计算机程序，其特征在于，该程序被处理器执行时实现如权利要求1-5中任一所述的方法。
PCT/CN2018/080198 2017-05-19 2018-03-23 配送区域确定方法和装置 WO2018210057A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/498,279 US20200082318A1 (en) 2017-05-19 2018-03-23 Method and device for determining delivery region

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710356899.4A CN108960694B (zh) 2017-05-19 2017-05-19 配送区域确定方法和装置
CN201710356899.4 2017-05-19

Publications (1)

Publication Number Publication Date
WO2018210057A1 true WO2018210057A1 (zh) 2018-11-22

Family

ID=64273258

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/080198 WO2018210057A1 (zh) 2017-05-19 2018-03-23 配送区域确定方法和装置

Country Status (3)

Country Link
US (1) US20200082318A1 (zh)
CN (1) CN108960694B (zh)
WO (1) WO2018210057A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111461627A (zh) * 2020-04-27 2020-07-28 上海东普信息科技有限公司 快递员派送区域的划分方法、装置、设备及存储介质
US20210263957A1 (en) * 2019-03-19 2021-08-26 Tencent Technology (Shenzhen) Company Limited Method and apparatus for dividing region, storage medium, and electronic device

Families Citing this family (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109784650A (zh) * 2018-12-15 2019-05-21 深圳壹账通智能科技有限公司 办公区域分配方法、装置、计算机设备及存储介质
CN109670721A (zh) * 2018-12-26 2019-04-23 拉扎斯网络科技（上海）有限公司 任务调度方法、装置、电子设备及计算机可读存储介质
CN109685751B (zh) * 2018-12-27 2021-03-09 拉扎斯网络科技（上海）有限公司 配送区域的合并方法、装置、电子设备及存储介质
CN109858685A (zh) * 2019-01-11 2019-06-07 杭州匹知共创科技有限公司 一种物流运力智能分配方法
CN109711789A (zh) * 2019-01-22 2019-05-03 北京顺丰同城科技有限公司 一种配送范围的确定方法及装置
CN111754147A (zh) * 2019-03-28 2020-10-09 北京京东尚科信息技术有限公司 路区划分方法、系统、装置和计算机可读存储介质
CN110223123A (zh) * 2019-06-17 2019-09-10 拉扎斯网络科技（上海）有限公司 一种数据处理方法、装置、可读存储介质和电子设备
CN110659858A (zh) * 2019-09-11 2020-01-07 达疆网络科技(上海)有限公司 一种解决跨江、跨桥配送范围过长的方法
CN111091262A (zh) * 2019-10-22 2020-05-01 拉扎斯网络科技（上海）有限公司 配送资源召回方法、装置、服务器及存储介质
CN110728485B (zh) * 2019-11-05 2022-09-06 京东城市(南京)科技有限公司 妥投位置修正方法和装置
CN112837003A (zh) * 2019-11-25 2021-05-25 北京京东振世信息技术有限公司 一种确定快递员配送范围的方法和装置
CN111461779B (zh) * 2020-03-31 2023-10-24 拉扎斯网络科技（上海）有限公司 地图信息处理的方法、装置、可读存储介质和电子设备
CN111915256B (zh) * 2020-07-31 2023-09-26 上海寻梦信息技术有限公司 构建派件围栏的方法、异地签收识别方法及相关设备
CN111898954B (zh) * 2020-07-31 2024-01-12 沙师弟(重庆)网络科技有限公司 一种基于改进高斯混合模型聚类的车辆匹配方法
US11971263B1 (en) * 2020-08-11 2024-04-30 Amazon Technologies, Inc. Geographical unit generation
CN112966864A (zh) * 2021-03-02 2021-06-15 悉地（苏州）勘察设计顾问有限公司 一种城市公交充电站布局规划方法、装置及可读存储介质
CN113065835B (zh) * 2021-05-08 2024-06-18 北京京东振世信息技术有限公司 物流引导信息生成方法、装置、电子设备及存储介质
CN114049066A (zh) * 2021-11-16 2022-02-15 浙江百世技术有限公司 基于签收地址生成站点派件区域的方法、系统
WO2023234449A1 (ko) * 2022-05-30 2023-12-07 쿠팡 주식회사 배달 업무 관련 정보를 제공하는 전자 장치 및 그 방법

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102903037A (zh) * 2011-07-28 2013-01-30 上海拉手信息技术有限公司 配送中心选址的方法
US20140185863A1 (en) * 2011-08-24 2014-07-03 Syslore Oy Device and method for detecting a region of interest on a delivery object
CN104200369A (zh) * 2014-08-27 2014-12-10 北京京东尚科信息技术有限公司 一种确定商品配送范围的方法和装置
US20160321351A1 (en) * 2015-04-30 2016-11-03 Verint Systems Ltd. System and method for spatial clustering using multiple-resolution grids

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1882156A4 (en) * 2005-05-09 2012-04-04 United Parcel Service Inc SYSTEMS AND METHODS FOR ROUTING AND SHARING
KR100943513B1 (ko) * 2007-09-13 2010-02-22 한국전자통신연구원 실시간 배달작업 계획 관리 시스템 및 방법
US10255577B1 (en) * 2011-12-22 2019-04-09 Amazon Technologies, Inc. System and method for generating a delivery plan for multi-tier delivery schemes
CN104077308B (zh) * 2013-03-28 2018-02-13 阿里巴巴集团控股有限公司 一种物流服务范围确定方法及装置
US20160048804A1 (en) * 2014-08-14 2016-02-18 Sunil Paul Systems and methods for transportation services for package delivery
KR20170060034A (ko) * 2014-09-08 2017-05-31 인벤센스, 인크. 맵 정보 보조 향상된 휴대가능 내비게이션을 이용하기 위한 방법 및 장치
US9377312B2 (en) * 2014-09-25 2016-06-28 United States Postal Service Methods and systems for creating and using a location identification grid
US20170262804A1 (en) * 2016-03-14 2017-09-14 United Parcel Service Of America, Inc. Determining estimated pick-up/delivery windows using clustering

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102903037A (zh) * 2011-07-28 2013-01-30 上海拉手信息技术有限公司 配送中心选址的方法
US20140185863A1 (en) * 2011-08-24 2014-07-03 Syslore Oy Device and method for detecting a region of interest on a delivery object
CN104200369A (zh) * 2014-08-27 2014-12-10 北京京东尚科信息技术有限公司 一种确定商品配送范围的方法和装置
US20160321351A1 (en) * 2015-04-30 2016-11-03 Verint Systems Ltd. System and method for spatial clustering using multiple-resolution grids

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210263957A1 (en) * 2019-03-19 2021-08-26 Tencent Technology (Shenzhen) Company Limited Method and apparatus for dividing region, storage medium, and electronic device
US11966424B2 (en) * 2019-03-19 2024-04-23 Tencent Technology (Shenzhen) Company Limited Method and apparatus for dividing region, storage medium, and electronic device
CN111461627A (zh) * 2020-04-27 2020-07-28 上海东普信息科技有限公司 快递员派送区域的划分方法、装置、设备及存储介质
CN111461627B (zh) * 2020-04-27 2023-09-26 上海东普信息科技有限公司 快递员派送区域的划分方法、装置、设备及存储介质

Also Published As

Publication number Publication date
CN108960694B (zh) 2022-04-12
US20200082318A1 (en) 2020-03-12
CN108960694A (zh) 2018-12-07

Similar Documents

Publication Publication Date Title
WO2018210057A1 (zh) 配送区域确定方法和装置
CN109003028B (zh) 用于划分物流区域的方法和装置
WO2019095883A1 (zh) 信息生成方法和装置
CN110741402B (zh) 用于运力调度的系统和方法
WO2019128355A1 (zh) 确定精确地理位置的方法和装置
KR20160100809A (ko) 목표 주소를 확정하기 위한 방법 및 장치
US10896218B2 (en) Computerized geo-referencing for images
CN105657449B (zh) 一种视频转码分配方法、装置及视频转码系统
WO2022057364A1 (zh) 区域划分方法、装置、电子设备及计算机可读存储介质
WO2019047524A1 (zh) 信息处理方法和装置
WO2019041817A1 (zh) 电子围栏分块方法和装置
CN111178810B (zh) 用于生成信息的方法和装置
CN112559663B (zh) Poi数据处理方法、装置、设备、存储介质和程序产品
CN109697637A (zh) 对象类别确定方法、装置、电子设备及计算机存储介质
US11232470B2 (en) Customer flow line and customer flow hot zone determining method and apparatus
CN110209748B (zh) 索引地理围栏的方法和装置
CN110414613B (zh) 区域聚类的方法、装置、设备和计算机可读存储介质
CN107944697A (zh) 基于供需关系的热地图计算方法和系统、服务器、介质
WO2018210058A1 (zh) 订单显示方法和装置
CN108173958A (zh) 一种多云环境下基于蚁群算法的数据优化存储方法
WO2019033676A1 (zh) 订单处理方法和装置
US20160189061A1 (en) System and method of event position allocation
CN112884189A (zh) 订单量预测模型的训练方法、装置以及设备
CN112256811B (zh) 一种基于图结构的地图信息表示方法及装置
CN115719270A (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: 18801999

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 12.03.2020.

122 Ep: pct application non-entry in european phase

Ref document number: 18801999

Country of ref document: EP

Kind code of ref document: A1