[go: up one dir, main page]

WO2018227771A1 - Procédé, système, serveur de division de régions sur la base d'une police d'assurance, et support d'informations - Google Patents

Procédé, système, serveur de division de régions sur la base d'une police d'assurance, et support d'informations 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)
Chinese (zh)
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/fr
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)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Selon l'invention, un procédé de division de régions sur la base d'une police d'assurance comprend : l'acquisition de données de police d'assurance, les données de police d'assurance comprenant une adresse d'un client ; l'identification du nom de la région d'une région administrative correspondant à l'adresse du client ; la recherche d'une frontière régionale correspondante dans une carte électronique sur la base du nom de la région ; l'acquisition d'un polygone correspondant à une unité de division minimale et l'utilisation du polygone et de la frontière régionale pour diviser la région administrative sur la carte électronique ; la réunion de multiples polygones pour produire de multiples sous-régions ; l'acquisition des nombres de polices d'assurance correspondant aux multiples sous-régions ; si une sous-région dont le nombre de polices d'assurance est supérieur à un premier seuil ou inférieur à un second seuil est présente, alors la génération d'une demande d'ajustement ; et la transmission de la demande d'ajustement à un terminal, ce qui permet au terminal d'ajuster, sur la base de la demande d'ajustement, la sous-région correspondante en tant que sous-région appropriée pour qu'un membre d'équipe de service puisse fournir des services de police d'assurance.
PCT/CN2017/099731 2017-06-12 2017-08-30 Procédé, système, serveur de division de régions sur la base d'une police d'assurance, et support d'informations Ceased WO2018227771A1 (fr)

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 (fr) 2018-12-20

Family

ID=61133644

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/099731 Ceased WO2018227771A1 (fr) 2017-06-12 2017-08-30 Procédé, système, serveur de division de régions sur la base d'une police d'assurance, et support d'informations

Country Status (2)

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

Families Citing this family (10)

* 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 中国移动通信集团四川有限公司 一种地图网格划分方法和电子设备

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 (fr) Procédé, système, serveur de division de régions sur la base d'une police d'assurance, et support d'informations
US9935980B2 (en) Adding firewall security policy dynamically to support group VPN
CN112491636B (zh) 数据处理方法及装置、计算机存储介质
CN115380513A (zh) 用于联合多站点逻辑网络的网络管理系统
US6915309B1 (en) Automatically generating replication topology information for use by a directory service
US10298698B2 (en) Endpoint location tracking
WO2020220412A1 (fr) Procédé et système de protection de la confidentialité de citoyen à base de preuve à divulgation nulle de connaissance, et support de stockage
US9894144B2 (en) Application level mirroring in distributed overlay virtual networks
WO2018058959A1 (fr) Procédé et appareil de vérification de langage sql, serveur et dispositif de stockage
WO2018233372A1 (fr) Procédé, dispositif et appareil de programmation de lvs prenant en charge une politique de programmation de hachage, et support de stockage
US10230850B2 (en) IP telephony network using a configuration map for organizing sites
US10379890B1 (en) Synchronized cache of an operational state of distributed software system
CN114489931B (zh) 一种函数实例的容器创建方法及系统
WO2017185925A1 (fr) Procédé d'accès à un site web, client et serveur de réseau local
WO2020233060A1 (fr) Procédé et appareil de notification d'événement, serveur de notification d'événement et support de stockage
WO2017157125A1 (fr) Procédé et appareil de suppression d'un hôte en nuage dans un environnement informatique en nuage, serveur et support d'informations
US11811655B2 (en) Supporting overlay networks for multiple autonomous systems and underlays
WO2015180434A1 (fr) Procédé de gestion de données, nœud et système pour grappe de bases de données
WO2017016275A1 (fr) Procédé de traitement de données dans un système de vente de billets en ligne, et système de vente de billets en ligne
WO2020199599A1 (fr) Procédé et appareil de présentation d'informations de file d'attente de travaux, et dispositif informatique et support d'informations
US20210319115A1 (en) Performance standby nodes for a secure storage system
US20250080378A1 (en) Scalable distribution of identity information in overlay networks with identity-based policies
WO2018014594A1 (fr) Procédé de traitement de demande et de réponse de réseau, dispositif, terminal, serveur, et support de stockage
US11140224B2 (en) Moving storage volumes across network boundaries
US20180309691A1 (en) Enhanced sequence number updating of routes associated with migrating virtual machines

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