WO2018227771A1 - 基于保单服务的区域划分方法、系统、服务器和存储介质 - Google Patents

基于保单服务的区域划分方法、系统、服务器和存储介质 Download PDF

Info

Publication number
WO2018227771A1
WO2018227771A1 PCT/CN2017/099731 CN2017099731W WO2018227771A1 WO 2018227771 A1 WO2018227771 A1 WO 2018227771A1 CN 2017099731 W CN2017099731 W CN 2017099731W WO 2018227771 A1 WO2018227771 A1 WO 2018227771A1
Authority
WO
WIPO (PCT)
Prior art keywords
area
sub
latitude
polygon
longitude
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2017/099731
Other languages
English (en)
French (fr)
Inventor
陈莹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Technology Shenzhen Co Ltd
Original Assignee
Ping An Technology Shenzhen Co Ltd
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 Ping An Technology Shenzhen Co Ltd filed Critical Ping An Technology Shenzhen Co Ltd
Publication of WO2018227771A1 publication Critical patent/WO2018227771A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/08—Insurance

Definitions

  • the present invention relates to the field of computer technologies, and in particular, to a method, system, server, and storage medium for area division based on policy services.
  • Insurance has been integrated into people's lives as a safeguard mechanism. The types of insurance are also growing. Different types of insurance can provide different guarantees for customers.
  • insurance companies In order to maintain customers, insurance companies usually arrange business personnel to go to the customer's location to provide appropriate services to customers. When the business personnel are arranged in the past, the management personnel of the insurance company manually input the keywords in the customer address in the business system, find the customer location by fuzzy matching, and assign the found results to the business personnel. Since the fuzzy matching only matches the characters corresponding to the keywords, and does not consider the geographical location, the results found by the fuzzy matching may be located in different administrative regions.
  • the keyword manually input by the manager is “Technology Park”, and multiple technology parks can be found through fuzzy matching, including Nanshan High-tech Science and Technology Park, Longgang District Shangxue Science and Technology Park, and Futian District SEG Science Park. Baoan District Investment Promotion Bureau Science Park and Longhua District Baoneng Science and Technology Park. These technology parks are located in different administrative areas. If the same business personnel are arranged to provide services to customers in these administrative areas, it will bring inconvenience to the business personnel.
  • an administrative area division method, system, server, and storage medium based on a policy service are provided.
  • a method for dividing a region based on policy services including:
  • the policy data including a customer address
  • a regional division system based on policy services including:
  • a server configured to obtain policy data, where the policy data includes a client address, identify an area name of an administrative area corresponding to the customer address, retrieve a corresponding area boundary in the electronic map according to the area name, and obtain a polygon corresponding to the smallest division unit Deriving the administrative area in an electronic map by using the polygon and the area boundary; splicing a plurality of polygons to obtain a plurality of sub-areas; obtaining a number of policies corresponding to the plurality of sub-areas, if the number of policies exceeds a first threshold or a sub-area lower than the second threshold, generating an adjustment prompt, and sending the adjustment prompt to the terminal;
  • a terminal configured to receive the adjustment prompt, and send a request for acquiring an electronic map according to the adjustment prompt
  • the server is further configured to return the electronic map of the divided administrative area to the terminal according to the request.
  • the terminal is further configured to adjust, according to the policy quantity of the sub-area, the corresponding sub-area to a sub-area suitable for arranging the service personnel to perform the policy service.
  • a server comprising a memory and one or more processors, the memory storing computer readable instructions, the computer readable instructions being executed by the processor, causing the one or more processors to perform the following step:
  • the policy data including a customer address
  • One or more non-transitory readable storage mediums storing computer readable instructions, when executed by one or more processors, cause the one or more processors to perform the following steps:
  • the policy data including a customer address
  • FIG. 1 is an application scenario diagram of a method for dividing a region based on a policy service in an embodiment
  • FIG. 2 is a flow chart of a method for dividing a region based on a policy service in an embodiment
  • FIG. 3 is a block diagram of a zone division system based on a policy service in an embodiment
  • Figure 4 is a block diagram of a server in one embodiment.
  • the policy-based area division method provided in the embodiment of the present application can be applied in the application scenario as shown in FIG. 1.
  • the server 102 and the terminal 104 establish a communication connection with the network.
  • a database is deployed on the server 102, and policy data is stored in the database.
  • the server 102 invokes the thread to fetch the policy data in the database.
  • Policy data includes policy identification, customer identification, and customer address.
  • the server 102 identifies the area name of the administrative area corresponding to the customer address, and retrieves the corresponding area boundary in the electronic map according to the area name.
  • the smallest division unit for dividing the administrative area may be pre-configured on the server 102.
  • the smallest division unit can adopt a polygon.
  • the server 102 divides the administrative area equally in the electronic map using polygons and regional boundaries.
  • the hierarchical relationship of each administrative area is pre-stored on the server 102.
  • the server 102 splices a plurality of polygons belonging to the same hierarchy to obtain sub-regions corresponding to the same hierarchy.
  • the server 102 may also divide the sub-regions of the plurality of levels layer by layer according to the hierarchical relationship.
  • the server 102 can store the different levels of partitioning results in a database, respectively.
  • the server 102 counts the number of policies corresponding to each sub-area based on the customer address. If there is a sub-area where the number of policies exceeds the first threshold or is below the second threshold, the server 102 generates an adjustment prompt and transmits an adjustment prompt to the terminal 104.
  • the terminal 104 receives the adjustment prompt and sends a request for acquiring an electronic map to the server 102 according to the adjustment prompt.
  • the server 102 returns the electronic map of the divided administrative area to the terminal 104 in accordance with the request.
  • the terminal 104 adjusts the corresponding sub-area according to the policy quantity of the sub-area to a sub-area suitable for arranging the service personnel to perform the policy service.
  • a method for partitioning a policy based on a policy is provided.
  • the method is applied to a server as an example, and specifically includes:
  • Step 202 Obtain policy data, where the policy data includes a customer address.
  • Step 204 Identify an area name of an administrative area corresponding to the customer address.
  • Step 206 retrieve the corresponding area boundary in the electronic map according to the area name.
  • a database is deployed on the server, and policy data is stored in the database.
  • the server call thread fetches policy data in the database.
  • Policy data includes policy identification, customer identification, and customer address.
  • the server can identify the area name of the corresponding administrative area according to the text description in the customer address.
  • Administrative areas include cities, districts, counties, streets and towns. For example, Futian District, Shenzhen.
  • the server retrieves the corresponding area boundary in the electronic map according to the area name.
  • the electronic map may be an electronic map provided by a third party, for example, a Baidu map or the like.
  • the area boundary includes multiple geographic coordinates. Geographic coordinates include longitude and latitude. The geographic coordinates of the area boundaries can be stored in the database.
  • Step 208 Obtain a polygon corresponding to the smallest division unit, and divide the administrative area in the electronic map by using the polygon and the area boundary.
  • the smallest division unit for dividing the administrative area can be pre-configured on the server.
  • the smallest division unit can adopt a polygon.
  • a polygon is a closed pattern consisting of three or more segments connected in series.
  • the polygon may be a triangle or a quadrangle or the like.
  • the polygon may adopt a quadrilateral shape.
  • the area of the polygon can be configured according to the spacing between the buildings to cover a building.
  • the area of a polygon is 20 square meters, which can be regarded as an empirical value. The smaller the area of the polygon, the finer the division of the administrative area by the polygon.
  • the server uses polygons and regional boundaries to equally divide administrative areas in an electronic map. This divides the administrative area into multiple polygons. For example, the server divides the administrative area into multiple quads. If the boundary portion of the administrative region cannot be equally divided by the polygon, the shape of the boundary portion is retained. It can be understood that when the server divides the administrative area by using the polygon, there may be a case where there is no current customer within the range covered by the polygon.
  • Step 210 Acquire a hierarchical relationship of the administrative area, and splicing a plurality of polygons of the same level according to the hierarchical relationship to obtain sub-regions corresponding to the plurality of levels.
  • each administrative area For a city, it usually includes multiple districts or administrative districts such as counties. Each district or county belongs to an independent administrative area. In order to facilitate business personnel to provide services to customers in a relatively concentrated area, insurance companies can arrange for business personnel to work in their respective administrative areas.
  • the hierarchical relationship of each administrative area is pre-stored on the server, and the hierarchical relationship includes a parent level and a child level.
  • the sub-level in addition to the sub-level of the upper level (that is, the parent level), it can also be the parent level of the next level. A sub-level that does not have the next level can also be called a leaf level.
  • the hierarchical relationship of the administrative area includes the administrative area level, the road level, and the interest point level.
  • the points of interest refer to the buildings in the administrative area, including residential buildings and office buildings.
  • the address of the point of interest is usually located under the road section.
  • the administrative area is the parent level of the road level, and the road level is the sub-level of the administrative area.
  • the link level is the parent level of the point of interest level, and the point of interest level is the sub-level of the link level.
  • Futian District is the administrative level
  • Bagua Road is the level of the road
  • Ping An Building is the level of interest
  • Futian District is the parent level of Bagua Road
  • Bagua Road is the sub-level of Futian District
  • Bagua Road is the parent level of Ping An Building
  • Ping An Building is the sub-level of Bagua Road.
  • Ping An Building does not have the next level, it can also be called the leaf level.
  • the leaf level can be a cell, a building, a village or a town.
  • a cell or a building may be used as a leaf level, and a population density is lower than a predetermined density area, and a village or a town may be used as a leaf level.
  • Using the hierarchical relationship of the administrative area it is convenient for the insurance company to arrange the corresponding business personnel for each level.
  • the server splices multiple polygons belonging to the same level to obtain sub-regions corresponding to the same level. Specifically, the server splices a plurality of polygons belonging to the same leaf level to obtain sub-regions corresponding to the same leaf level.
  • the polygon corresponding to the leaf level may also be referred to as a leaf node.
  • a sub-region spliced by leaf nodes may also be referred to as a leaf region.
  • the server can also divide sub-regions of multiple levels layer by layer. Specifically, the server splices a plurality of leaf areas belonging to the same parent level to obtain a child area corresponding to the parent level. The sub-area corresponding to the parent level can also be referred to as the parent layer area. And so on, until the sub-regional division of all levels in the administrative region is completed according to the hierarchical relationship.
  • the server can store the results of different levels of partitioning in the database.
  • Step 212 Acquire a number of policies corresponding to the plurality of sub-areas, and if there is a sub-area whose policy quantity exceeds the first threshold or is lower than the second threshold, generate an adjustment prompt.
  • Step 214 Send the adjustment prompt to the terminal, so that the terminal adjusts the corresponding sub-area according to the adjustment prompt to a sub-area suitable for arranging the service personnel to perform the policy service.
  • the server translates the customer address into geographic coordinates.
  • the policy identification corresponding to the geographic coordinates falling within the sub-area is counted, thereby obtaining the number of policies corresponding to each sub-area.
  • the sub-area can be adjusted by considering the number of policies of the sub-areas.
  • the server compares the number of policies in each sub-area with the first threshold and the second threshold respectively. If the number of policies exceeds the first threshold, indicating that the number of policies in the sub-area is too high, the workload of the service personnel is excessively saturated, and the This sub-area is adjusted. If the number of policies is lower than the second threshold, indicating that the number of policies in the sub-area is too low, the workload of the business personnel is insufficient, and the sub-area needs to be adjusted.
  • the server If there is a sub-area where the number of policies exceeds the first threshold or is below the second threshold, the server generates a corresponding adjustment prompt and sends a adjustment prompt to the terminal.
  • the terminal receives the adjustment prompt, and the manager manually adjusts the corresponding sub-area in the electronic map through the terminal, so that the number of policies of the adjusted sub-area is equivalent. It is beneficial to use the adjusted sub-areas to arrange business personnel to provide policy services.
  • the area name of the corresponding administrative area is identified by the customer address in the policy data, and the area boundary of the administrative area is retrieved in the electronic map by using the area name.
  • the administrative area is divided in the electronic map by using the polygon corresponding to the smallest division unit and the area boundary. The smaller the area of the polygon, the finer the division of the administrative area.
  • a plurality of sub-regions can be obtained.
  • the sub-areas with too many or too few policies may be adjusted, so that the adjusted sub-area arranges the service personnel to provide the policy service, thereby realizing Effective division of administrative areas.
  • the hierarchical relationship includes a leaf level
  • the step of splicing a plurality of polygons to obtain a plurality of sub-regions includes: acquiring geographic coordinates corresponding to multiple customer addresses of the same leaf level; the geographic coordinates include longitude and latitude; Comparing multiple geographic coordinates to obtain the geographical coordinates with the longest longitude, the largest latitude, the longest longitude, the smallest latitude, the smallest longitude and the largest latitude, and the smallest longitude and the smallest latitude; the largest longitude, the largest latitude, the longest longitude and the smallest latitude,
  • the base area is generated by the geographical coordinates with the smallest longitude and the largest latitude and the smallest longitude and the smallest latitude; the plurality of polygons falling within the base area are spliced to form a sub-area of the leaf level.
  • the customer address may be a customer address in the policy data.
  • the server obtains multiple client addresses corresponding to the same leaf level.
  • the customer address has a corresponding geographic coordinate.
  • the geographic coordinates can be stored in the data by the server before the client address is converted.
  • the geographic coordinates can also be obtained after the server obtains the client address corresponding to the same leaf level.
  • Geographic coordinates include longitude and latitude.
  • the server compares multiple geographic coordinates of the same leaf level to obtain geographic coordinates with the longest longitude, the largest latitude, the longest longitude, the smallest latitude, the smallest longitude, the largest latitude, and the smallest longitude and the smallest latitude.
  • the server can also generate a base region using the four coordinates of the longest latitude, the longest latitude, the longest latitude, the smallest latitude, the longest latitude, and the longest latitude and the smallest latitude, and the base region is a quadrilateral.
  • the server splices a plurality of polygons that fall into the base area corresponding to the same leaf level to form a sub-area corresponding to the leaf level, which may also be referred to as a leaf area.
  • the server uses the geographic coordinates corresponding to the multiple customer addresses of the leaf level to form the basic area, and splicing the polygons falling into the basic area to form the leaf level of Pengyi Garden.
  • Leaf area The base area of the same leaf level is generated by the geographic coordinates corresponding to the customer address, thereby enabling the leaf area belonging to the leaf level to be quickly and efficiently divided among the plurality of polygons of the electronic map.
  • the server may splicing the multiple leaf areas corresponding to the parent level of the leaf level according to the hierarchical relationship of the administrative area to obtain the sub-area corresponding to the parent level. And so on, until all levels of the administrative area are divided according to the hierarchical relationship.
  • the method further comprises: if there is an overlapping area between the sub-areas in the electronic map, correcting the boundary of the sub-area where the overlapping area exists.
  • the area of the polygon that divides the administrative area in the electronic map is configured according to the spacing between the buildings, and it is particularly preferable to cover one building. Therefore, the number of buildings covered by the area of the polygon is the most ideal state.
  • the server extracts the keyword corresponding to the customer address according to the customer address.
  • the keyword can be a door number or a building name.
  • the customer address is: 601, Building 5, Pengyi Garden, Futian District, Shenzhen
  • the corresponding keyword can be 5 Buildings of Pengyi Garden.
  • Another example is the customer address: 12th Floor, Ping An Building, Bagua Road, Futian District, Shenzhen.
  • the corresponding keyword can be Ping An Building.
  • a keyword corresponding to a customer address can be equivalent to a building.
  • the leaf hierarchy is divided according to the base area generated by the geographic coordinates. If the geographic coordinates of the base regions generated in different leaf levels are adjacent, there may also be partial overlap between the base regions of different leaf levels. In order to more accurately divide the sub-regions of each level, when overlapping regions appear between sub-regions of the same level, the boundaries of the overlapping regions need to be corrected.
  • the step of correcting the boundary of the sub-area having the overlapping area includes: if there is a polygon in the overlapping area that does not have the corresponding keyword, the polygon having no corresponding keyword is in the overlapping area. Clearing, correcting the boundary of the sub-region according to the retained polygon; if the polygon in the overlapping region has a corresponding plurality of keywords, segmenting the polygon with multiple keywords, and splitting the overlapping region into a plurality of sub-polygons, according to Multiple sub-polygons correct the boundaries of the sub-regions.
  • a polygon or polygons are included in the overlap region.
  • the server corrects the boundary of the overlapping area
  • the polygons in the overlapping area can be corrected one by one. If there is no corresponding keyword in the polygon of the overlapping area corresponding to the sub-region of the same level, it means that there is no client in the range covered by the overlapping area of the sub-area. If there is a corresponding keyword in the polygon of the overlapping area corresponding to the sub-area, it means that the customer exists in the range covered by the overlapping area of the sub-area.
  • the sub-area in which the overlapping area exists includes a first sub-area and a second sub-area.
  • the server may clear the polygons in the first sub-area or the second sub-area that do not have corresponding keywords. The remaining area in the first sub-area or the second sub-area maintains the original boundary.
  • the polygon in the overlapping area of the first sub-area does not have a corresponding keyword
  • the polygon in the overlapping area of the second sub-area has a corresponding keyword
  • the polygon that does not have the corresponding keyword is cleared in the overlapping area
  • the first sub-region is modified at the boundary of the overlap region
  • the second sub-region maintains the original boundary at the boundary of the overlap region.
  • the server divides the polygon corresponding to the plurality of keywords according to a preset ratio, and divides the polygon into a plurality of sub-polygons.
  • the keywords corresponding to the sub-polygons are identified. If the keywords corresponding to the sub-polygons belong to different leaf levels, the server continues to segment the sub-polygons according to a preset ratio until the keywords corresponding to the sub-polygons belong to the same leaf level.
  • the server corrects the boundary of the first sub-region and the second sub-region at the overlapping region according to the divided sub-polygon. If there are a plurality of polygons in the overlapping area, the polygons of the overlapping area may be processed in the above manner to correct the boundaries of the overlapping areas of the first sub-area and the second sub-area.
  • the number of sub-areas in which the overlapping area exists in the same level may be multiple, and the server may also process the polygons of the overlapping area in the above manner, so as to correct the boundaries of the overlapping areas in the plurality of sub-areas.
  • the server may also process the polygons of the overlapping area in the above manner, so as to correct the boundaries of the overlapping areas in the plurality of sub-areas.
  • the method further includes: receiving a request for acquiring an electronic map sent by the terminal according to the adjustment prompt; returning the electronic map of the divided administrative area to the terminal according to the request, so that the terminal pairs the electronic quantity according to the number of the policy of the sub-area The sub-areas in the map are adjusted; the adjusted electronic map returned by the receiving terminal.
  • the server can identify the currently existing customers in sub-areas of different levels according to the customer address in the policy data. Specifically, the server labels the corresponding polygon according to the geographic coordinates of the customer address, such as adding a color to the polygon, and marking all existing customers in the sub-area.
  • the server can separately store the number of policies for sub-areas of different levels. This allows managers to visually see customer status in each sub-area at different levels. If the number of policies in a sub-area is small, the workload of the business personnel will be insufficient. If the number of policies in a sub-area is large, the workload of the business personnel will be over-saturated.
  • the server compares the number of policies in each sub-area with the first threshold and the second threshold respectively. If the number of policies exceeds the first threshold, indicating that the number of policies in the sub-area is too high, the workload of the service personnel is excessively saturated, and the This sub-area is adjusted. If the number of policies is lower than the second threshold, indicating that the number of policies in the sub-area is too low, the workload of the business personnel is insufficient, and the sub-area needs to be adjusted.
  • the terminal sends a request for acquiring an electronic map to the server according to the adjustment prompt, and the server returns the electronic map divided into the plurality of sub-areas to the terminal, and displays the terminal at the terminal.
  • the administrator can adjust the sub-areas in the electronic map through the terminal. Adjustments include segmentation and merging of sub-regions. For a sub-area whose policy number exceeds the first threshold, the manager divides the sub-area. For a sub-area whose policy quantity is lower than the second threshold, the manager merges the sub-area with the adjacent sub-area.
  • the manager selects the sub-area to be divided in the electronic map through the terminal, and generates a plurality of edit points on the boundary of the sub-area to be divided.
  • the manager selects an edit point through the terminal to generate a split start point, and selects another edit point to generate a split end point.
  • the terminal generates a dividing line in the sub-area according to the road between the dividing start point and the split end point.
  • the divided sub-region is generated by the boundary between the dividing line and the sub-region, thereby dividing one sub-region.
  • the manager selects the sub-areas to be merged in the electronic map through the terminal, and the sub-areas to be merged are two or more adjacent sub-areas.
  • the terminal receives the merge instruction input by the manager, and merges the sub-areas to be merged according to the merge instruction.
  • the number of policies in the plurality of sub-areas of the administrative area can be made equal, so that the workload of the business personnel can be evenly distributed.
  • a policy-based zoning system As shown in FIG. 3, the system includes: a server 302 and a terminal 304, wherein:
  • the server 302 is configured to obtain policy data, the policy data includes a customer address, identify an area name of an administrative area corresponding to the customer address, retrieve a corresponding area boundary in the electronic map according to the area name, acquire a polygon corresponding to the smallest division unit, and use the polygon And the area boundary divides the administrative area in the electronic map; splicing a plurality of polygons to obtain a plurality of sub-areas; obtaining the number of policies corresponding to the plurality of sub-areas, if there is a child whose policy number exceeds the first threshold or is lower than the second threshold In the area, an adjustment prompt is generated, and the adjustment prompt is sent to the terminal.
  • the terminal 304 is configured to receive an adjustment prompt, and send a request for acquiring an electronic map according to the adjustment prompt.
  • the server 302 is further configured to return the electronic map of the divided administrative area to the terminal according to the request.
  • the terminal 304 is further configured to adjust, according to the policy quantity of the sub-area, the corresponding sub-area to a sub-area suitable for arranging the service personnel to perform the policy service.
  • the terminal 304 is further configured to divide the sub-area for the sub-area whose policy quantity exceeds the first threshold; and for the sub-area whose policy quantity is lower than the second threshold, the terminal 304 is further configured to use the sub-area Adjacent sub-areas are merged.
  • the server 302 is further configured to acquire geographic coordinates corresponding to multiple customer addresses of the same leaf level; the geographic coordinates include longitude and latitude; and compare the plurality of geographic coordinates to obtain the longest longitude, the largest latitude, and the longitude. And the geographical coordinates with the smallest latitude, the smallest longitude and the largest latitude, and the smallest longitude and the smallest latitude; the basic region is generated by the geographical coordinates with the longest longitude, the largest latitude, the longest longitude, the smallest latitude, the smallest longitude and the largest latitude, and the smallest longitude and the smallest latitude; A plurality of polygons falling within the base area are spliced to form sub-regions of the leaf level.
  • the server 302 is further configured to correct the boundaries of the sub-regions in which the overlapping regions exist if there is an overlapping region in the electronic map between the sub-regions.
  • the server 302 is further configured to: if there is a polygon in the overlapping area that does not have a corresponding keyword, the polygon that does not have the corresponding keyword is cleared in the overlapping area, and the sub-area is re-divided according to the reserved polygon. If the polygon in the overlap region has a corresponding plurality of keywords, the polygon having the plurality of keywords is divided, the overlap region is split into a plurality of sub-polygons, and the boundaries of the sub-regions are divided according to the plurality of sub-polygons.
  • a server in one embodiment, as shown in FIG. 4, includes a processor coupled via a system bus, memory, computer readable instructions stored on the memory and executable on the processor, a network interface As well as databases and so on.
  • the processor is used to provide calculation and control capabilities.
  • the memory includes an internal memory and a non-volatile storage medium. An operating system and computer readable instructions are stored in the non-volatile storage medium.
  • the internal memory provides an environment for the operation of the operating system and computer readable instructions that are executed by the processor to implement a policy partitioning method based on policy services.
  • the network interface is used to communicate with the terminal over a network connection.
  • the database stores the policy data and the results of the division of multiple levels in the administrative area according to the hierarchical relationship.
  • the server can be implemented as a standalone server or a server cluster consisting of multiple servers. It will be understood by those skilled in the art that the structure shown in FIG. 4 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the server to which the solution of the present application is applied.
  • the specific server may include a ratio. More or fewer components are shown in the figures, or some components are combined, or have different component arrangements.
  • a server comprising a memory and one or more processors having stored therein computer readable instructions, the computer readable instructions being executed by the processor such that one or more processors Perform the following steps:
  • the adjustment prompt is sent to the terminal, so that the terminal adjusts the corresponding sub-area according to the adjustment prompt to a sub-area suitable for arranging the service personnel to perform the policy service.
  • the computer readable instructions are executed by the processor such that the one or more processors further perform the following steps:
  • geographic coordinates corresponding to multiple customer addresses of the same leaf level include longitude and latitude;
  • a plurality of polygons falling within the base area are spliced to form sub-regions of the leaf level.
  • the computer readable instructions are executed by the processor such that the one or more processors further perform the following steps:
  • the computer readable instructions are executed by the processor such that the one or more processors further perform the following steps:
  • the polygon having no corresponding keyword is cleared in the overlapping area, and the boundary of the sub-area is re-divided according to the retained polygon;
  • the polygon in the overlap region has a plurality of corresponding keywords
  • the polygon having the plurality of keywords is divided, the overlap region is split into a plurality of sub-polygons, and the boundaries of the sub-regions are divided according to the plurality of sub-polygons.
  • the computer readable instructions are executed by the processor such that the one or more processors further perform the following steps:
  • one or more non-transitory readable storage media having computer readable instructions that, when executed by one or more processors, cause one or more processors to execute The following steps:
  • the adjustment prompt is sent to the terminal, so that the terminal adjusts the corresponding sub-area according to the adjustment prompt to a sub-area suitable for arranging the service personnel to perform the policy service.
  • the one or more processors when the computer readable instructions are executed by one or more processors, the one or more processors further perform the following steps:
  • geographic coordinates corresponding to multiple customer addresses of the same leaf level include longitude and latitude;
  • a plurality of polygons falling within the base area are spliced to form sub-regions of the leaf level.
  • the one or more processors when the computer readable instructions are executed by one or more processors, the one or more processors further perform the following steps:
  • the one or more processors when the computer readable instructions are executed by one or more processors, the one or more processors further perform the following steps:
  • the polygon having no corresponding keyword is cleared in the overlapping area, and the boundary of the sub-area is re-divided according to the retained polygon;
  • the polygon in the overlap region has a plurality of corresponding keywords
  • the polygon having the plurality of keywords is divided, the overlap region is split into a plurality of sub-polygons, and the boundaries of the sub-regions are divided according to the plurality of sub-polygons.
  • the one or more processors when the computer readable instructions are executed by one or more processors, the one or more processors further perform the following steps:
  • the program when executed, may include the flow of an embodiment of the methods as described above.
  • the storage medium may be a magnetic disk, an optical disk, or a read-only storage memory (Read-Only) Memory, ROM), etc.

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Engineering & Computer Science (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

一种基于保单服务的区域划分方法，包括：获取保单数据，所述保单数据中包括客户地址；识别客户地址对应的行政区域的区域名称；根据所述区域名称在电子地图中检索对应的区域边界；获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；将多个多边形进行拼接，得到多个子区域；获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及将所述调节提示发送至终端，以使得终端根据所述调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。

Description

基于保单服务的区域划分方法、系统、服务器和存储介质
本申请要求于2017年6月12日提交中国专利局、申请号为201710439649.7、发明名称为“基于保单服务的区域划分方法、系统、服务器和存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
【技术领域】
本发明涉及计算机技术领域，特别是涉及一种基于保单服务的区域划分方法、系统、服务器和存储介质。
【背景技术】
保险作为一种保障机制已融入人们的生活中。保险的种类也是日益繁多。不同种类的保险可以为客户提供不同的保障。为了维护客户，保险公司通常会安排业务人员前往客户所在地为客户提供适宜的服务。在以往安排业务人员时，保险公司的管理人员在业务系统中手动输入客户地址中的关键字，通过模糊匹配的方式来查找客户所在地，将查找到的结果分配给业务人员。由于模糊匹配只是针对关键字对应的字符进行匹配，并不考虑地理位置，因此通过模糊匹配查找出的结果可能会位于不同的行政区域内。例如，管理人员手动输入的关键字为“科技园”，通过模糊匹配的方式可以查找到多个科技园，包括南山区高新技术科技园、龙岗区上雪科技园、福田区赛格科技园、宝安区招商局科技园以及龙华区宝能科技园等。这几个科技园分别位于不同的行政区域，如果安排同一个业务人员对这几个个行政区域的客户提供服务，会给业务人员带来不便。
基于此，需要考虑结合行政区域来安排业务人员为客户服务，以便于业务人员能够在一个较为集中的区域内进行工作。因此，如何对行政区域进行有效划分成为目前需要解决的一个技术问题。
【发明内容】
根据本申请公开的各种实施例，提供一种基于保单服务的行政区域划分方法、系统、服务器和存储介质。
一种基于保单服务的区域划分方法，包括：
获取保单数据，所述保单数据中包括客户地址；
识别客户地址对应的行政区域的区域名称；
根据所述区域名称在电子地图中检索对应的区域边界；
获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；
将多个多边形进行拼接，得到多个子区域；
获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
将所述调节提示发送至终端，以使得终端根据所述调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
一种基于保单服务的区域划分系统，包括：
服务器，用于获取保单数据，所述保单数据中包括客户地址；识别客户地址对应的行政区域的区域名称；根据所述区域名称在电子地图中检索对应的区域边界；获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；将多个多边形进行拼接，得到多个子区域；获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示，将所述调节提示发送至终端；
终端，用于接收所述调节提示，根据调节提示发送的获取电子地图的请求；
所述服务器还用于根据所述请求将划分后的行政区域的电子地图返回至终端；及
所述终端还用于根据子区域的保单数量提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
一种服务器，包括存储器和一个或多个处理器，所述存储器中储存有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
获取保单数据，所述保单数据中包括客户地址；
识别客户地址对应的行政区域的区域名称；
根据所述区域名称在电子地图中检索对应的区域边界；
获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；
将多个多边形进行拼接，得到多个子区域；
获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
将所述调节提示发送至终端，以使得终端根据所述调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
一个或多个存储有计算机可读指令的非易失性可读存储介质，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
获取保单数据，所述保单数据中包括客户地址；
识别客户地址对应的行政区域的区域名称；
根据所述区域名称在电子地图中检索对应的区域边界；
获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；
将多个多边形进行拼接，得到多个子区域；
获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
将所述调节提示发送至终端，以使得终端根据所述调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
本申请的一个或多个实施例的细节在下面的附图和描述中提出。本申请的其它特征、目的和优点将从说明书、附图以及权利要求书变得明显。
【附图说明】
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1为一个实施例中基于保单服务的区域划分方法的应用场景图；
图2为一个实施例中基于保单服务的区域划分方法的流程图；
图3为一个实施例中基于保单服务的区域划分系统的框图；
图4为一个实施例中服务器的框图。
【具体实施方式】
为了使本发明的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本发明进行进一步详细说明。应当理解，此处描述的具体实施例仅仅用以解释本发明，并不用于限定本发明。
本申请的实施例中所提供的基于保单服务的区域划分方法可以应用如图1所示的应用场景中。服务器102与终端104与通过网络建立通信连接。服务器102上部署了数据库，数据库中存储了保单数据。服务器102调用线程在数据库中抓取保单数据。保单数据包括保单标识、客户标识和客户地址等。服务器102识别客户地址对应的行政区域的区域名称，根据区域名称在电子地图中检索对应的区域边界。服务器102上可以预先配置用于划分行政区域的最小划分单元。最小划分单元可以采用多边形。服务器102利用多边形和区域边界在电子地图中对行政区域进行均等划分。服务器102上预先存储了每个行政区域的层级关系。服务器102将属于同一层级的多个多边形进行拼接，得到同一层级对应的子区域。服务器102按照层级关系，还可以逐层划分多个层级的子区域。服务器102可以将不同层级的划分结果分别存储在数据库中。
服务器102根据客户地址统计每个子区域对应的保单数量。若存在保单数量超过第一阈值或低于第二阈值的子区域，则服务器102生成调节提示，并且将调节提示发送至终端104。终端104接收调节提示，根据调节提示向服务器102发送的获取电子地图的请求。服务器102根据该请求将划分后的行政区域的电子地图返回至终端104。终端104根据子区域的保单数量提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
在一个实施例中，如图2所示，提供了一种基于保单服务的区域划分方法，以该方法应用于服务器为例进行说明，具体包括：
步骤202，获取保单数据，保单数据中包括客户地址。
步骤204，识别客户地址对应的行政区域的区域名称。
步骤206，根据区域名称在电子地图中检索对应的区域边界。
服务器上部署了数据库，数据库中存储了保单数据。服务器调用线程在数据库中抓取保单数据。保单数据包括保单标识、客户标识和客户地址等。服务器可以根据客户地址中的文字描述识别对应的行政区域的区域名称。
行政区域包括市、区、县、街道和镇等。例如，深圳市福田区。服务器根据区域名称在电子地图中检索对应的区域边界。电子地图可以是第三方提供的电子地图，例如，百度地图等。区域边界包括多个地理坐标。地理坐标包括经度和纬度。区域边界的地理坐标可以存储在数据库中。
步骤208，获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分。
服务器上可以预先配置用于划分行政区域的最小划分单元。最小划分单元可以采用多边形。多边形是指三条或三条以上的线段首尾顺次连接所组成的封闭图形。例如，多边形可以是三角形或者四边形等。优选的，多边形可以采用四边形。多边形的面积可以根据建筑物之间的间距来配置，以覆盖一个建筑物尤佳。例如，多边形的面积为20平方米，可以视其为一个经验值。多边形的面积越小，通过该多边形对行政区域的划分越精细。
服务器利用多边形和区域边界在电子地图中对行政区域进行均等划分。以此将行政区域划分为多个多边形。例如，服务器将行政区域划分为多个四边形。如果行政区域的边界部分不能按照多边形进行均分，则保留边界部分的形状。可以理解的，服务器在利用多边形对行政区域进行划分时，多边形所覆盖的范围内可能存在当前暂无客户的情形。
步骤210，获取行政区域的层级关系，根据层级关系将同一层级的多个多边形进行拼接，得到多个层级对应的子区域。
对于一个城市而言，通常会包括多个区或者县等行政区域。每个区或县属于一个独立的行政区域。为了便于业务人员在一个相对集中的区域内为客户提供服务，保险公司可以安排业务人员在其对应的行政区域内工作。服务器上预先存储了每个行政区域的层级关系，层级关系包括父层级和子层级。对于子层级而言，除了是上一层级（即父层级）的子层级，还可以是下一层级的父层级。不具备下一个层级的子层级也可以称为叶子层级。行政区域的层级关系中包括行政区域层级、路段层级和兴趣点层级。其中，兴趣点是指行政区域内建筑，包括居住建筑和办公建筑等。兴趣点的地址通常设在路段下。行政区域这一层级是路段层级的父层级，路段层级是行政区域这一层级的子层级。路段层级是兴趣点层级的父层级，兴趣点层级是路段层级的子层级。
例如，深圳市福田区八卦路平安大厦。其中，福田区为行政区域层级，八卦路为路段层级，平安大厦为兴趣点层级。福田区为八卦路的父层级，八卦路为福田区的子层级。八卦路为平安大厦的父层级，平安大厦为八卦路的子层级。平安大厦不具备下一个层级，也可以称为叶子层级。叶子层级可以是小区、楼宇、村或镇等。人口密度超过预设密度的区域，可以采用小区或楼宇等作为一个叶子层级，人口密度低于预设密度的区域，可以采用村或镇等作为一个叶子层级。利用行政区域的层级关系，方便保险公司按对每个层级安排相应的业务人员。
服务器将属于同一层级的多个多边形进行拼接，得到同一层级对应的子区域。具体的，服务器将属于同一叶子层级的多个多边形进行拼接，得到同一叶子层级所对应的子区域。其中，叶子层级所对应的多边形也可以称为叶子节点。由叶子节点拼接成的子区域也可以称为叶子区域。
服务器按照层级关系，还可以逐层划分多个层级的子区域。具体的，服务器将属于同一父层级的多个叶子区域进行拼接，得到父层级对应的子区域。父层级对应的子区域也可以称为父层区域。以此类推，直到按照层级关系完成该行政区域内所有层级的子区域划分。服务器可以将不同层级的划分结果分别存储在数据库中。
步骤212，获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示。
步骤214，将调节提示发送至终端，以使得终端根据调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
服务器将客户地址转换为地理坐标。对于落入子区域范围内的地理坐标对应的保单标识进行统计，由此得到每个子区域对应的保单数量。为了使得每个业务人员的工作量尽可能相当，可以考虑子区域的保单数量对子区域进行调节。服务器将每个子区域的保单数量与第一阈值和第二阈值分别进行比较，若保单数量超过第一阈值，表示该子区域的保单数量过高，会使得业务人员的工作量过度饱和，需要对该子区域进行调节。若保单数量低于第二阈值，表示该子区域的保单数量过低，会使得业务人员的工作量不足，也需要对该子区域进行调节。
如果存在保单数量超过第一阈值或低于第二阈值的子区域，服务器生成相应的调节提示，并且将调节提示发送至终端。终端接收调节提示，管理人员通过终端对电子地图中的相应子区域进行手动调节，以此使得调节后的子区域的保单数量相当。有利于使用调节后的子区域安排业务人员提供保单服务。
本实施例中，通过保单数据中的客户地址识别对应的行政区域的区域名称，利用区域名称在电子地图中检索行政区域的区域边界。利用最小划分单元对应的多边形以及区域边界在电子地图中对行政区域进行划分。多边形的面积也就越小，对行政区域的划分就越精细。通过将多个多边形进行拼接，可以得到多个子区域。通过对子区域的保单数量与第一阈值以及第二阈值的比较，可以对部分保单数量过多或过少的子区域进行调节，使得调节后的子区域安排业务人员提供保单服务，从而实现了对行政区域的有效划分。
在一个实施例中，层级关系中包括叶子层级，将多个多边形进行拼接，得到多个子区域的步骤，包括：获取同一叶子层级的多个客户地址对应的地理坐标；地理坐标包括经度和纬度；将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；利用经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标生成基础区域；将落入基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
本实施例中，客户地址可以是保单数据中的客户地址。服务器获取同一个叶子层级对应的多个客户地址。客户地址具有对应的地理坐标。地理坐标可以是服务器对客户地址预先进行转换后存入数据中的。地理坐标也可以是服务器在获取到同一个叶子层级对应的客户地址之后进行转换得到的。地理坐标包括经度和纬度。服务器将同一叶子层级的多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标。服务器也可以利用经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标这四个坐标来生成一个基础区域，该基础区域为四边形。服务器将落入同一个叶子层级对应的基础区域的多个多边形进行拼接，形成叶子层级对应的子区域，也可以称为叶子区域。
例如，以鹏益花园这一兴趣点作为叶子层级，服务器利用该叶子层级的多个客户地址对应的地理坐标形成基础区域，将落入基础区域的多边形进行拼接，形成鹏益花园这一叶子层级的叶子区域。通过客户地址对应的地理坐标生成同一叶子层级的基础区域，由此能够在电子地图的众多多边形中能够快速有效的划分出属于该叶子层级的叶子区域。
服务器在对叶子层级的叶子区域进行划分之后，还可以按照行政区域的层级关系，将叶子层级的父层级对应的多个叶子区域进行拼接，得到父层级对应的子区域。以此类推，直到按照层级关系完成该行政区域所有层级的划分。
在一个实施例中，该方法还包括：若子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
本实施例中，在电子地图中对行政区域进行划分的多边形的面积是根据建筑物之间的间距来配置的，且以覆盖一个建筑物尤佳。因此多边形的面积所覆盖的建筑物数量为1个时是最理想的状态。服务器根据客户地址提取客户地址对应的关键字。关键字可以是门栋号或建筑物名称等。例如，客户地址为：深圳市福田区鹏益花园5栋601，则对应的关键字可以是鹏益花园5栋。又如，客户地址为：深圳市福田区八卦路平安大厦12楼，则对应的关键字可以是平安大厦。一个客户地址对应的关键字可以相当于一个建筑物。进行行政区域划分时，每个多边形对应一个关键字时最理想的状态。
对于建筑物较为密集的地区，建筑物之间的间距较小，那么很可能会出现多个建筑物被划入一个多边形内的情形。此时，多边形对应的关键字为多个。由此可能会导致同一层级的子区域之间存在重叠区域。此外，叶子层级是依据地理坐标生成的基础区域划分的。如果不同叶子层级中生成基础区域的地理坐标相邻近，那么也可能会导致不同叶子层级的基础区域之间存在部分重叠。为了能够更加精确的对各个层级的子区域进行划分，在同一层级的子区域之间出现重叠区域时，需要对重叠区域的边界进行修正。
在其中一个实施例中，对存在重叠区域的子区域的边界进行修正的步骤，包括：若重叠区域中的存在不具有对应关键字的多边形，则将不具有对应关键字的多边形在重叠区域中清除，根据保留下的多边形修正子区域的边界；若重叠区域中的多边形具有对应的多个关键字，则将具有多个关键字的多边形进行分割，将重叠区域拆分为多个子多边形，根据多个子多边形修正子区域的边界。
重叠区域中包括一个多边形或多个多边形。服务器对重叠区域的边界进行修正时，可以对重叠区域中的多边形逐个进行修正。同一个层级的子区域对应的重叠区域的多边形中不具有对应的关键字，则表示子区域的重叠区域所覆盖的范围内暂无客户。如果子区域对应的重叠区域的多边形中具有对应的关键字，则表示子区域的重叠区域所覆盖的范围内已存在客户。存在重叠区域的子区域包括第一子区域和第二子区域。
若第一子区域和第二子区域的重叠区域中的多边形均不具有对应的关键字，则表示第一子区域和第二子区域在该多边形覆盖的范围内均暂无客户。服务器可以将第一子区域或第二子区中的重叠区域中不具有对应关键字的多边形清除。第一子区域或第二子区中的剩余区域维持原边界。
如果第一子区域的重叠区域中的多边形不具有对应的关键字，第二子区域的重叠区域中的多边形具有对应的关键字，则将不具有对应关键字的多边形在重叠区域中清除，对第一子区域在重叠区域的边界进行修正，第二子区域在重叠区域的边界维持原边界。
如果第一子区域与第二子区域的重叠区域中的多边形均具有对应的关键字，也就是重叠区域中的多边形对应多个关键字，则表示第一子区域和第二子区域在该多边形所覆盖的范围内均存在客户。服务器按照预设比例将对应多个关键字的多边形进行分割，将该多边形分割为多个子多边形。识别子多边形对应的关键字，若子多边形对应的关键字属于不同的叶子层级，则服务器继续按照预设比例对子多边形进行分割，直至子多边形所对应的关键字属于同一个叶子层级。服务器根据分割后的子多边形对第一子区域和第二子区域在重叠区域的边界进行修正。如果重叠区域的多边形为多个，则可以按照上述方式对重叠区域的多边形进行处理，以便对第一子区域和第二子区域在重叠区域的边界进行修正。
进一步的，同一层级中存在重叠区域的子区域可以是多个，服务器也可以按照上述方式对重叠区域的多边形进行处理，以便对多个子区域在重叠区域的边界进行修正。通过对子区域在重叠区域的边界进行修正，能够得到同一层级中每个子区域的精确边界，从而有效提高区域划分的准确性。
在一个实施例中，该方法还包括：接收终端根据调节提示发送的获取电子地图的请求；根据请求将划分后的行政区域的电子地图返回至终端，以使得终端根据子区域的保单数量对电子地图中的子区域进行调节；接收终端返回的调节后的电子地图。
为了使得每个业务人员的工作量尽可能相当，保险公司分配业务人员为客户提供服务时，通常会考虑每个子区域的保单数量。服务器可以根据保单数据中的客户地址在不同层级的子区域中标识出目前已存在的客户。具体的，服务器根据客户地址的地理坐标将对应的多边形进行标注，如对多边形添加颜色等方式进行标注，在子区域中标注出所有已存在的客户。服务器可以分别存储不同层级的子区域的保单数量。由此可以使得管理人员能够直观的看到不同层级的每个子区域内的客户状况。如果某个子区域的保单数量较少，会使得业务人员的工作量不足。如果某个子区域的保单数量较多，会使得业务人员的工作量过度饱和。
服务器将每个子区域的保单数量与第一阈值和第二阈值分别进行比较，若保单数量超过第一阈值，表示该子区域的保单数量过高，会使得业务人员的工作量过度饱和，需要对该子区域进行调节。若保单数量低于第二阈值，表示该子区域的保单数量过低，会使得业务人员的工作量不足，也需要对该子区域进行调节。
终端根据调节提示向服务器发送获取电子地图的请求，服务器将划分为多个子区域的电子地图返回至终端，在终端进行展示。对于需要调节的子区域，可以通过子区域的颜色或子区域边界闪烁等方式进行提示。管理人员可以通过终端对电子地图中的子区域进行调节。调节包括对子区域的分割与合并。对于保单数量超过第一阈值的子区域，管理人员会对该子区域进行分割。对于保单数量低于第二阈值的子区域，管理人员会对该子区域与相邻子区域进行合并。
当需要对子区域进行分割时，管理人员通过终端在电子地图中选择待分割子区域，在待分割子区域的边界上生成多个编辑点。管理人员通过终端选择一个编辑点生成分割起点，选择另外一个编辑点生成分割终点。终端根据分割起点与分割终点之间的道路在子区域中生成分割线。利用分割线与子区域的边界生成分割后的子区域，由此将一个子区域进行分割。
当需要对子区域进行合并时，管理人员通过终端在电子地图中选择待合并的子区域，待合并的子区域为两个或两个以上的相邻子区域。终端接收管理人员输入的合并指令，根据合并指令将待合并的子区域进行合并。
通过对子区域进行拆分或合并，可以使得行政区域的多个子区域内的保单数量相当，从而能够对业务人员的工作量进行均衡分配。
在一个实施例中，提供了一种基于保单服务的区域划分系统，如图3所示，该系统包括：服务器302和终端304，其中：
服务器302，用于获取保单数据，保单数据中包括客户地址；识别客户地址对应的行政区域的区域名称；根据区域名称在电子地图中检索对应的区域边界；获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分；将多个多边形进行拼接，得到多个子区域；获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示，将调节提示发送至终端。
终端304，用于接收调节提示，根据调节提示发送的获取电子地图的请求。
服务器302还用于根据请求将划分后的行政区域的电子地图返回至终端。
终端304还用于根据子区域的保单数量提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
在一个实施例中，对于保单数量超过第一阈值的子区域，终端304还用于对子区域进行分割；对于保单数量低于第二阈值的子区域，终端304还用于对该子区域与相邻子区域进行合并。
在一个实施例中，服务器302还用于获取同一叶子层级的多个客户地址对应的地理坐标；地理坐标包括经度和纬度；将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；利用经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标生成基础区域；将落入基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
在一个实施例中，服务器302还用于若子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
在其中一个实施例中，服务器302还用于若重叠区域中的存在不具有对应关键字的多边形，则将不具有对应关键字的多边形在重叠区域中清除，根据保留下的多边形重新划分子区域的边界；若重叠区域中的多边形具有对应的多个关键字，则将具有多个关键字的多边形进行分割，将重叠区域拆分为多个子多边形，根据多个子多边形划分子区域的边界。
在一个实施例中，如图4所示，提供了一种服务器，该服务器包括通过系统总线连接的处理器、存储器、存储在存储器上并可在处理器上运行的计算机可读指令、网络接口以及数据库等。其中，处理器用于提供计算和控制能力。存储器包括内存储器和非易失性存储介质。非易失性存储介质中存储有操作系统和计算机可读指令。内存储器为操作系统和计算机可读指令的运行提供环境，该计算机可读指令被处理器执行时以实现一种基于保单服务的区域划分方法。网络接口用于据以与终端通过网络连接通信。数据库中存储了保单数据以及对行政区域按照层级关系进行划分的多个层级的划分结果。
该服务器可以用独立的服务器或者是多个服务器组成的服务器集群来实现。本领域技术人员可以理解，图4中示出的结构，仅仅是与本申请方案相关的部分结构的框图，并不构成对本申请方案所应用于其上的服务器的限定，具体的服务器可以包括比图中所示更多或更少的部件，或者组合某些部件，或者具有不同的部件布置。
在一个实施例中，提供了一种服务器，包括存储器和一个或多个处理器，存储器中储存有计算机可读指令，计算机可读指令被所述处理器执行时，使得一个或多个处理器执行以下步骤：
获取保单数据，保单数据中包括客户地址；
识别客户地址对应的行政区域的区域名称；
根据区域名称在电子地图中检索对应的区域边界；
获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分；
将多个多边形进行拼接，得到多个子区域；
获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
将调节提示发送至终端，以使得终端根据调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
在一个实施例中，计算机可读指令被所述处理器执行时，使得一个或多个处理器还执行以下步骤：
获取同一叶子层级的多个客户地址对应的地理坐标；地理坐标包括经度和纬度；
将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；
利用经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标生成基础区域；及
将落入基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
在一个实施例中，计算机可读指令被所述处理器执行时，使得一个或多个处理器还执行以下步骤：
若子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
在一个实施例中，计算机可读指令被所述处理器执行时，使得一个或多个处理器还执行以下步骤：
若重叠区域中的存在不具有对应关键字的多边形，则将不具有对应关键字的多边形在重叠区域中清除，根据保留下的多边形重新划分子区域的边界；及
若重叠区域中的多边形具有对应的多个关键字，则将具有多个关键字的多边形进行分割，将重叠区域拆分为多个子多边形，根据多个子多边形划分子区域的边界。
在一个实施例中，计算机可读指令被所述处理器执行时，使得一个或多个处理器还执行以下步骤：
接收终端根据调节提示发送的获取电子地图的请求；
根据请求将划分后的行政区域的电子地图返回至终端，以使得终端根据子区域的保单数量对电子地图中的子区域进行调节；及
接收终端返回的调节后的电子地图。
在一个实施例中，提供了一个或多个存储有计算机可读指令的非易失性可读存储介质，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器执行以下步骤：
获取保单数据，保单数据中包括客户地址；
识别客户地址对应的行政区域的区域名称；
根据区域名称在电子地图中检索对应的区域边界；
获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分；
将多个多边形进行拼接，得到多个子区域；
获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
将调节提示发送至终端，以使得终端根据调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
在一个实施例中，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器还执行以下步骤：
获取同一叶子层级的多个客户地址对应的地理坐标；地理坐标包括经度和纬度；
将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；
利用经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大和经度最小且纬度最小的地理坐标生成基础区域；及
将落入基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
在一个实施例中，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器还执行以下步骤：
若同一层级的子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
在一个实施例中，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器还执行以下步骤：
若重叠区域中的存在不具有对应关键字的多边形，则将不具有对应关键字的多边形在重叠区域中清除，根据保留下的多边形重新划分子区域的边界；及
若重叠区域中的多边形具有对应的多个关键字，则将具有多个关键字的多边形进行分割，将重叠区域拆分为多个子多边形，根据多个子多边形划分子区域的边界。
在一个实施例中，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器还执行以下步骤：
接收终端根据调节提示发送的获取电子地图的请求；
根据请求将划分后的行政区域的电子地图返回至终端，以使得终端根据子区域的保单数量对电子地图中的子区域进行调节；及
接收终端返回的调节后的电子地图。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程，是可以通过计算机程序来指令相关的硬件来完成，所述的程序可存储于非易失性计算机可读取存储介质中，该程序在执行时，可包括如上述各方法的实施例的流程。其中，所述的存储介质可为磁碟、光盘、只读存储记忆体（Read-Only Memory，ROM）等。
以上所述实施例的各技术特征可以进行任意的组合，为使描述简洁，未对上述实施例中的各个技术特征所有可能的组合都进行描述，然而，只要这些技术特征的组合不存在矛盾，都应当认为是本说明书记载的范围。
以上所述实施例仅表达了本发明的几种实施方式，其描述较为具体和详细，但并不能因此而理解为对发明专利范围的限制。应当指出的是，对于本领域的普通技术人员来说，在不脱离本发明构思的前提下，还可以做出若干变形和改进，这些都属于本发明的保护范围。因此，本发明专利的保护范围应以所附权利要求为准。

Claims (24)

  1. 一种基于保单服务的区域划分方法，包括：
    获取保单数据，所述保单数据中包括客户地址；
    识别客户地址对应的行政区域的区域名称；
    根据所述区域名称在电子地图中检索对应的区域边界；
    获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；
    将多个多边形进行拼接，得到多个子区域；
    获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
    将所述调节提示发送至终端，以使得终端根据所述调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
  2. 根据权利要求1所述的方法，其特征在于，所述行政区域具有层级关系，所述层级关系中包括叶子层级，所述将多个多边形进行拼接，得到多个子区域的步骤包括：
    获取同一叶子层级的多个客户地址对应的地理坐标；所述地理坐标包括经度和纬度；
    将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；
    利用所述经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标生成基础区域；及
    将落入所述基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
  3. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    若子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
  4. 根据权利要求3所述的方法，其特征在于，所述对存在重叠区域的子区域的边界进行修正的步骤包括：
    若所述重叠区域中的存在不具有对应关键字的多边形，则将不具有对应关键字的多边形在所述重叠区域中清除；及
    根据保留下的多边形重新划分所述子区域的边界。
  5. 根据权利要求3所述的方法，其特征在于，所述对存在重叠区域的子区域的边界进行修正的步骤包括：
    若所述重叠区域中的多边形具有对应的多个关键字，则将具有多个关键字的多边形进行分割；及
    将所述重叠区域拆分为多个子多边形，根据多个子多边形划分所述子区域的边界。
  6. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    接收终端根据调节提示发送的获取电子地图的请求；
    根据所述请求将划分后的行政区域的电子地图返回至终端，以使得所述终端根据子区域的保单数量对电子地图中的子区域进行调节；及
    接收终端返回的调节后的电子地图。
  7. 一种基于保单服务的区域划分系统，包括：
    服务器，用于获取保单数据，所述保单数据中包括客户地址；识别客户地址对应的行政区域的区域名称；根据所述区域名称在电子地图中检索对应的区域边界；获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；将多个多边形进行拼接，得到多个子区域；获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示，将所述调节提示发送至终端；
    终端，用于接收所述调节提示，根据调节提示发送的获取电子地图的请求；
    所述服务器还用于根据所述请求将划分后的行政区域的电子地图返回至终端；及
    所述终端还用于根据子区域的保单数量提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
  8. 根据权利要求7所述的系统，其特征在于，对于保单数量超过第一阈值的子区域，所述终端还用于对所述子区域进行分割；及对于保单数量低于第二阈值的子区域，所述终端还用于对所述子区域与相邻子区域进行合并。
  9. 根据权利要求7所述的系统，其特征在于，所述服务器还用于获取同一叶子层级的多个客户地址对应的地理坐标；地理坐标包括经度和纬度；将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；利用经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标生成基础区域；及将落入基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
  10. 根据权利要求7所述的系统，其特征在于，所述服务器还用于若子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
  11. 根据权利要求10所述的系统，其特征在于，若重叠区域中的存在不具有对应关键字的多边形，所述服务器还用于将不具有对应关键字的多边形在重叠区域中清除，根据保留下的多边形重新划分子区域的边界。
  12. 根据权利要求10所述的系统，其特征在于，若重叠区域中的多边形具有对应的多个关键字，所述服务器还用于将具有多个关键字的多边形进行分割，将重叠区域拆分为多个子多边形，及根据多个子多边形划分子区域的边界。
  13. 一种服务器，包括存储器和一个或多个处理器，所述存储器中储存有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取保单数据，所述保单数据中包括客户地址；
    识别客户地址对应的行政区域的区域名称；
    根据所述区域名称在电子地图中检索对应的区域边界；
    获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；
    将多个多边形进行拼接，得到多个子区域；
    获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
    将所述调节提示发送至终端，以使得终端根据所述调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
  14. 根据权利要求13所述的服务器，其特征在于，所述行政区域具有层级关系，所述层级关系中包括叶子层级，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取同一叶子层级的多个客户地址对应的地理坐标；所述地理坐标包括经度和纬度；
    将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；
    利用所述经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标生成基础区域；及
    将落入所述基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
  15. 根据权利要求13所述的服务器，其特征在于，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
  16. 根据权利要求15所述的服务器，其特征在于，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若所述重叠区域中的存在不具有对应关键字的多边形，则将不具有对应关键字的多边形在所述重叠区域中清除；及
    根据保留下的多边形重新划分所述子区域的边界。
  17. 根据权利要求15所述的服务器，其特征在于，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若所述重叠区域中的多边形具有对应的多个关键字，则将具有多个关键字的多边形进行分割；及
    将所述重叠区域拆分为多个子多边形，根据多个子多边形划分所述子区域的边界。
  18. 根据权利要求13所述的服务器，其特征在于，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    接收终端根据调节提示发送的获取电子地图的请求；
    根据所述请求将划分后的行政区域的电子地图返回至终端，以使得所述终端根据子区域的保单数量对电子地图中的子区域进行调节；及
    接收终端返回的调节后的电子地图。
  19. 一个或多个存储有计算机可读指令的非易失性可读存储介质，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取保单数据，所述保单数据中包括客户地址；
    识别客户地址对应的行政区域的区域名称；
    根据所述区域名称在电子地图中检索对应的区域边界；
    获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；
    将多个多边形进行拼接，得到多个子区域；
    获取多个子区域对应的保单数量，若存在保单数量超过第一阈值或低于第二阈值的子区域，则生成调节提示；及
    将所述调节提示发送至终端，以使得终端根据所述调节提示将对应的子区域调节为适宜安排业务人员进行保单服务的子区域。
  20. 根据权利要求19所述的存储介质，其特征在于，所述行政区域具有层级关系，所述层级关系中包括叶子层级，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取同一叶子层级的多个客户地址对应的地理坐标；所述地理坐标包括经度和纬度；
    将多个地理坐标进行比对，得到经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标；
    利用所述经度最大且纬度最大、经度最大且纬度最小、经度最小且纬度最大以及经度最小且纬度最小的地理坐标生成基础区域；及
    将落入所述基础区域内的多个多边形进行拼接，形成叶子层级的子区域。
  21. 根据权利要求19所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若子区域之间在电子地图中存在重叠区域，则对存在重叠区域的子区域的边界进行修正。
  22. 根据权利要求21所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若所述重叠区域中的存在不具有对应关键字的多边形，则将不具有对应关键字的多边形在所述重叠区域中清除；及
    根据保留下的多边形重新划分所述子区域的边界。
  23. 根据权利要求21所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若所述重叠区域中的多边形具有对应的多个关键字，则将具有多个关键字的多边形进行分割；及
    将所述重叠区域拆分为多个子多边形，根据多个子多边形划分所述子区域的边界。
  24. 根据权利要求19所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    接收终端根据调节提示发送的获取电子地图的请求；
    根据所述请求将划分后的行政区域的电子地图返回至终端，以使得所述终端根据子区域的保单数量对电子地图中的子区域进行调节；及
    接收终端返回的调节后的电子地图。
PCT/CN2017/099731 2017-06-12 2017-08-30 基于保单服务的区域划分方法、系统、服务器和存储介质 Ceased WO2018227771A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710439649.7 2017-06-12
CN201710439649.7A CN107679992A (zh) 2017-06-12 2017-06-12 基于保单服务的区域划分方法、系统、服务器和存储介质

Publications (1)

Publication Number Publication Date
WO2018227771A1 true WO2018227771A1 (zh) 2018-12-20

Family

ID=61133644

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/099731 Ceased WO2018227771A1 (zh) 2017-06-12 2017-08-30 基于保单服务的区域划分方法、系统、服务器和存储介质

Country Status (2)

Country Link
CN (1) CN107679992A (zh)
WO (1) WO2018227771A1 (zh)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107679684B (zh) * 2017-06-13 2020-09-01 平安科技（深圳）有限公司 保单分配方法、装置、存储介质和计算机设备
CN108876440B (zh) * 2018-05-29 2021-09-03 创新先进技术有限公司 区域划分方法和服务器
CN109345947B (zh) * 2018-08-13 2022-02-22 中国平安人寿保险股份有限公司 基于数据关联性分析的工作区域划分方法及终端设备
CN109274732B (zh) * 2018-09-05 2021-09-17 北京达佳互联信息技术有限公司 地理位置获取方法、装置、电子设备及存储介质
CN109446284A (zh) * 2018-09-17 2019-03-08 平安科技（深圳）有限公司 显示客户地址的方法、装置、计算机设备和存储介质
CN109614543B (zh) * 2018-10-23 2023-11-21 中国平安财产保险股份有限公司 利用大数据推广农险业务的方法、装置和计算机设备
CN109784634B (zh) * 2018-12-13 2024-08-02 中国平安人寿保险股份有限公司 服务区域划分方法、电子装置及可读存储介质
CN110688437B (zh) * 2019-09-09 2022-03-25 中国平安财产保险股份有限公司 划分地理区域的方法、装置、设备及存储介质
CN111538726A (zh) * 2020-03-26 2020-08-14 中国平安人寿保险股份有限公司 基于图形化的信息录入方法及相关设备
CN113535865B (zh) * 2020-04-21 2023-11-10 中国移动通信集团四川有限公司 一种地图网格划分方法和电子设备
CN114357091B (zh) * 2020-10-13 2026-01-02 浙江宇视科技有限公司 关系确定、图像采集器数量确定方法、装置、设备及介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103902636A (zh) * 2012-12-30 2014-07-02 腾讯科技（深圳）有限公司 基于过滤聚类法推送信息的方法和服务器
CN103944932A (zh) * 2013-01-18 2014-07-23 阿里巴巴集团控股有限公司 搜索、确定活跃区域的方法与服务器
CN104077308A (zh) * 2013-03-28 2014-10-01 阿里巴巴集团控股有限公司 一种物流服务范围确定方法及装置
CN106570917A (zh) * 2016-10-25 2017-04-19 先锋智道（北京）科技有限公司 车辆需求热力图生成方法和装置
CN106779775A (zh) * 2015-11-23 2017-05-31 泰康保险集团股份有限公司 区域客户划分方法、划分装置及客户分配系统
US20170161841A1 (en) * 2006-02-15 2017-06-08 Allstate Insurance Company Retail Deployment Model

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170161841A1 (en) * 2006-02-15 2017-06-08 Allstate Insurance Company Retail Deployment Model
CN103902636A (zh) * 2012-12-30 2014-07-02 腾讯科技（深圳）有限公司 基于过滤聚类法推送信息的方法和服务器
CN103944932A (zh) * 2013-01-18 2014-07-23 阿里巴巴集团控股有限公司 搜索、确定活跃区域的方法与服务器
CN104077308A (zh) * 2013-03-28 2014-10-01 阿里巴巴集团控股有限公司 一种物流服务范围确定方法及装置
CN106779775A (zh) * 2015-11-23 2017-05-31 泰康保险集团股份有限公司 区域客户划分方法、划分装置及客户分配系统
CN106570917A (zh) * 2016-10-25 2017-04-19 先锋智道（北京）科技有限公司 车辆需求热力图生成方法和装置

Also Published As

Publication number Publication date
CN107679992A (zh) 2018-02-09

Similar Documents

Publication Publication Date Title
WO2018227771A1 (zh) 基于保单服务的区域划分方法、系统、服务器和存储介质
CN112491636B (zh) 数据处理方法及装置、计算机存储介质
WO2018103320A1 (zh) 灰度发布方法、系统、服务器及存储介质
US9935980B2 (en) Adding firewall security policy dynamically to support group VPN
CN105052084B (zh) 基于地理移动分配计算资源的方法和系统
US10298698B2 (en) Endpoint location tracking
WO2020220412A1 (zh) 基于零知识证明的公民隐私保护的方法、系统及存储介质
US9894144B2 (en) Application level mirroring in distributed overlay virtual networks
WO2018233372A1 (zh) 支持哈希调度策略的lvs调度方法、设备、装置及存储介质
EP1357701A2 (en) Method and apparatus for restoring the configuration of a network device
US10379890B1 (en) Synchronized cache of an operational state of distributed software system
US10230850B2 (en) IP telephony network using a configuration map for organizing sites
WO2013178081A1 (zh) Sns社区中的用户推荐方法和系统、计算机存储介质
CN114489931B (zh) 一种函数实例的容器创建方法及系统
WO2020233060A1 (zh) 事件通知方法、事件通知服务器、存储介质及装置
WO2017185925A1 (zh) 一种访问网站的方法、客户端及局域网内服务器
WO2018036168A1 (zh) 数据处理任务执行方法、装置、执行服务器和存储介质
WO2017157125A1 (zh) 在云计算环境中删除云主机的方法、装置、服务器及存储介质
US11811655B2 (en) Supporting overlay networks for multiple autonomous systems and underlays
WO2023056722A1 (zh) 一种分布式防火墙定义方法及系统
WO2013185311A1 (zh) 获取服务网关的方法及移动管理节点、数据网关及系统
US12580791B2 (en) Scalable distribution of identity information in overlay networks with identity-based policies
WO2018014594A1 (zh) 网络请求及响应的处理方法、装置、终端、服务器及存储介质
WO2020199599A1 (zh) 工作队列的信息展示方法、装置、计算机设备和存储介质
US20210319115A1 (en) Performance standby nodes for a secure storage system

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: 17913704

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17913704

Country of ref document: EP

Kind code of ref document: A1

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

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

122 Ep: pct application non-entry in european phase

Ref document number: 17913704

Country of ref document: EP

Kind code of ref document: A1