WO2019019448A1 - 行政区域划分验证方法、装置、服务器和存储介质 - Google Patents

行政区域划分验证方法、装置、服务器和存储介质 Download PDF

Info

Publication number
WO2019019448A1
WO2019019448A1 PCT/CN2017/108028 CN2017108028W WO2019019448A1 WO 2019019448 A1 WO2019019448 A1 WO 2019019448A1 CN 2017108028 W CN2017108028 W CN 2017108028W WO 2019019448 A1 WO2019019448 A1 WO 2019019448A1
Authority
WO
WIPO (PCT)
Prior art keywords
area
sub
areas
administrative
name
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/108028
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
Priority to SG11201809546VA priority Critical patent/SG11201809546VA/en
Priority to US16/095,927 priority patent/US20200143400A1/en
Publication of WO2019019448A1 publication Critical patent/WO2019019448A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201—Market modelling; Market analysis; Collecting market data
    • G06Q30/0204—Market segmentation
    • G06Q30/0205—Market segmentation based on location or geographical consideration
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • 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
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—Two-dimensional [2D] image generation
    • G06T11/20—Drawing from basic elements
    • G06T11/23—Drawing from basic elements using straight lines or curves

Definitions

  • the present application relates to the field of computer technology, and in particular, to an administrative area division verification method, apparatus, server, and storage medium.
  • 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 can arrange business personnel to provide different services to customers at the customer's location.
  • insurance companies can arrange business personnel in conjunction with administrative areas. The insurance company divides the administrative area through the servers in the background, and then can use the results of the division to arrange different business personnel. Before using the results of the division to arrange business personnel, how to effectively verify the division results of administrative regions becomes a technical problem that needs to be solved.
  • an administrative area division verification method, apparatus, server, and storage medium are provided.
  • a method for verifying administrative divisions comprising:
  • the plurality of sub-areas of the administrative area are recorded as reasonable sub-areas.
  • An administrative division device includes:
  • a loading module configured to acquire an area name of the administrative area; and loading an electronic map corresponding to the administrative area according to the area name; the administrative area is divided into multiple sub-areas in the electronic map;
  • a verification module configured to acquire a number of policies corresponding to the area name and a number of road segments corresponding to the area name; and use the number of policies corresponding to the area name and the number of road segments to perform multiple sub-areas of the administrative area Test;
  • a recording module configured to record, by the verification, a plurality of sub-areas of the administrative area as a reasonable sub-area.
  • 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 plurality of sub-areas of the administrative area are recorded as reasonable sub-areas.
  • One or more computer readable non-volatile storage media storing computer readable instructions, when executed by one or more processors, cause one or more processors to perform the steps of:
  • the plurality of sub-areas of the administrative area are recorded as reasonable sub-areas.
  • 1 is a hardware environment diagram of an administrative area division verification method in an embodiment
  • FIG. 2 is a flow chart of an administrative area division verification method in an embodiment
  • FIG. 3 is a block diagram of an administrative area division verification apparatus in an embodiment
  • Figure 4 is a block diagram of a server in one embodiment.
  • the administrative region division verification method provided in the embodiment of the present application can be applied as shown in FIG. 1 In the hardware environment.
  • Server 102 establishes a communication connection with terminal 102 over the network.
  • the server 102 acquires the area name of the administrative area, and loads the electronic map corresponding to the administrative area according to the area name.
  • the hierarchical relationship of each administrative area is pre-stored on the server 102.
  • the server 102 may divide the administrative area into sub-areas of a plurality of levels according to the hierarchical relationship of the administrative area.
  • the server 102 can verify the sub-area partitioning result of the link level in combination with the number of policies in the administrative area and the number of road sections.
  • a database is deployed on the server 102, and policy data is stored in the database.
  • the server 102 can perform statistics by using the policy identification in the policy data to obtain the number of policies corresponding to the area name.
  • the database also stores all the link names corresponding to multiple administrative areas.
  • the server 102 may obtain the name of the link in the administrative area according to the name of the area, and count the number of the sections in the administrative area according to the name of the link.
  • the server 102 verifies the plurality of sub-areas of the administrative area by using the number of policies corresponding to the area name and the number of sections.
  • the server 102 can record the sub-areas that pass the verification as a reasonable sub-area, that is, a sub-area suitable for arranging the service personnel to perform the service.
  • the terminal 104 can query the reasonable sub-area, and use the business personnel identification and the reasonable sub-area to generate corresponding service tasks. In this way, the results of the division of administrative areas are used to arrange different business personnel to serve in different regions.
  • an administrative region division verification method is provided. It should be understood that although the steps in the flowchart of FIG. 2 are sequentially displayed as indicated by the arrows, these steps are not inevitable. Execute in the order indicated by the arrows. Except as explicitly stated herein, the execution of these steps is not strictly limited, and may be performed in other sequences. Moreover, at least some of the steps in FIG. 2 may include a plurality of sub-steps or stages, which are not necessarily performed at the same time, but may be executed at different times, and the order of execution thereof is not necessarily This may be performed in sequence, but may be performed alternately or alternately with other steps or at least a portion of the sub-steps or stages of the other steps.
  • the method is applied to the server as an example, and specifically includes:
  • Step 202 Obtain an area name of an administrative area.
  • Step 204 Load an electronic map corresponding to the administrative area according to the name of the area; The submap is divided into multiple sub-areas.
  • the server obtains the name of the area of the administrative area, and the administrative area includes cities, districts, counties, and towns. For example, Futian District, Shenzhen.
  • the name of the area obtained by the server may be uploaded by the administrator through the terminal, or may be obtained through a configuration file stored in the database.
  • the server loads the electronic map corresponding to the administrative area 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 server can divide the administrative area into sub-areas of multiple levels according to the hierarchical relationship of the administrative area. Using the hierarchical relationship of the administrative area, it is convenient for the insurance company to arrange the corresponding business personnel according to the sub-areas of different levels.
  • 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. In an area where the population density exceeds the preset density, 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.
  • Step 206 Obtain a policy number corresponding to the area name and a number of road segments corresponding to the area name.
  • Step 208 verifying multiple sub-areas of the administrative area by using the number of policies corresponding to the area name and the number of road segments.
  • Step 210 If the verification passes, the plurality of sub-areas of the administrative area are recorded as reasonable sub-areas.
  • Each district or county belongs to an independent administrative area.
  • An independent administrative area such as a district or a county can serve as the top level of the hierarchical relationship of the administrative area, and the level of the road section is the sub-level of the top level of the administrative area.
  • the number of policies is an important reference indicator when an insurance company arranges for business personnel to provide services to customers.
  • the server verifies the sub-areas of each independent administrative area, it can verify the sub-area division result of the link level in combination with the number of policies in the administrative area and the number of road sections.
  • the division result of the administrative area is suitable for arranging the sub-areas of the service personnel for service, and the division is reasonable and the inspection is passed. If there are sub-areas that are unreasonably divided among the multiple sub-areas of the road level, it means that the division result of the administrative area is not suitable for arranging the service personnel to perform the service, the division is unreasonable, the verification fails, and the unreasonable sub-area needs to be performed. Adjustment.
  • a database is deployed on the server, and policy data is stored in the database.
  • the server can pre-count the number of policies for each administrative area. When a policy quantity is required, the server can obtain the number of policies in the administrative area based on the area name. If the server does not pre-count the number of policies, the server can obtain the corresponding policy data according to the area name.
  • the policy data includes the policy identification, and the server can use the policy identification in the policy data to perform statistics, and obtain the number of policies corresponding to the area name.
  • the database also stores all the link names corresponding to multiple administrative areas.
  • the server can obtain the name of the link in the administrative area according to the name of the area, and count the number of the sections in the administrative area according to the name of the link.
  • the server can calculate the recommended number of sub-areas corresponding to the administrative area according to the number of policies corresponding to the area name.
  • the server obtains the number of sub-areas divided by the section level in the administrative area. If the number of sub-areas partitions falls within the floating range corresponding to the number of sub-areas suggested, the server further compares the maximum number of sub-area suggested or floating ranges with the number of links. When the number of suggested sub-areas is less than or equal to the number of road segments, it indicates that the number of road segments is sufficient to support the sub-area division of the road segment level, and the administrative region The sub-areas of the inner road level are divided reasonably, and the division result of the administrative area is verified.
  • the server can record the sub-area that passes the verification as a reasonable sub-area, that is, a sub-area suitable for arranging service personnel for service.
  • the check fails. It is necessary to adjust the sub-level of the link level, for example, to divide the sub-area and the like. If the number of sub-area partitions does not fall within the floating range corresponding to the number of sub-areas recommended, the check fails, and the sub-areas need to be adjusted, for example, merging one or more adjacent sub-areas. By adjusting the sub-areas that fail to pass the verification, the adjusted sub-area division can meet the needs of the business personnel arrangement.
  • a plurality of sub-areas divided by the administrative area in the electronic map can be obtained.
  • the plurality of sub-areas of the administrative area are verified by the number of policies corresponding to the area name and the number of road sections. If the verification is performed, the plurality of sub-areas of the administrative area are recorded as reasonable sub-areas. Therefore, it is possible to effectively verify the results of the administrative division, and then ensure that the divided sub-areas are suitable for arranging business personnel to provide services to customers.
  • the step of dividing the administrative area into a plurality of sub-areas in the electronic map comprises: obtaining policy data, including the customer address in the policy data; identifying the area name of the administrative area corresponding to the customer address; and electronically according to the area name
  • the corresponding area boundary is retrieved in the map; the polygon corresponding to the smallest division unit is obtained, and the administrative area is divided in the electronic map by using the polygon and the area boundary; the polygon is spliced to obtain a plurality of sub-areas.
  • 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.
  • the server retrieves the corresponding area boundary in the electronic map according to the area name.
  • the area boundary includes multiple geographic coordinates. Geographic coordinates include longitude and latitude.
  • Geographic coordinates of the regional boundaries can be stored in In the database.
  • 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.
  • 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. By splicing a plurality of polygons, a plurality of sub-regions can be obtained.
  • the division of administrative areas, without manual division can quickly and effectively complete the division of administrative areas, not only can effectively improve the efficiency of division, but also can achieve a fine division of each level within the administrative area, providing convenience for service customers. .
  • the step of verifying the plurality of sub-areas of the administrative area by using the number of the policy corresponding to the area name and the number of the road segments comprises: calculating the number of sub-areas recommended by the administrative area by using the number of the policy corresponding to the area name; The number of sub-areas in the area in the electronic map; determine whether the number of sub-areas falls within the floating range corresponding to the number of sub-areas recommended; if so, further compare the maximum value of the floating range with the number of road segments; if the maximum value of the floating range If the number is less than the number of links, the check is passed.
  • the server obtains the number of policy proposals corresponding to the sub-areas of the link level, and uses the number of policies corresponding to the area name and the number of policy proposals corresponding to the sub-areas of the link level to calculate the recommended number of sub-areas of the link level corresponding to the administrative area.
  • the recommended number of sub-areas of the link level may be a zone.
  • the number of policies corresponding to the domain name and the quotient of the number of policy proposals corresponding to the sub-region of the link level may take an integer).
  • the policy name corresponding to the area name is 10000
  • the number of policy proposals corresponding to the sub-area of the road level is 500
  • the recommended number of sub-areas at the road level is 20.
  • the number of policy proposals corresponding to the sub-areas of the link level can be adjusted according to the insurance business status.
  • the server is in the sub-area of the road segment level.
  • the server may calculate a floating range corresponding to the number of sub-area suggestions according to the floating ratio and the number of sub-area suggestions. For example, if the floating ratio is 10%, the server can calculate the number corresponding to the sub-area suggested number floating downward by 10%, and the number corresponding to the upward floating 10%.
  • the server generates a corresponding floating range according to the quantity calculated by the floating ratio.
  • the server obtains the number of sub-areas divisions of the administrative area in the electronic map, and determines whether the number of sub-area divisions falls within a floating range corresponding to the recommended number of sub-areas. If the number of sub-areas partitions falls within the floating range corresponding to the recommended number of sub-areas, the server needs to further verify the division result of the administrative area according to the number of road sections in the administrative area.
  • the maximum value in the floating range corresponding to the number of sub-area suggestions may be referred to as the sub-region recommended maximum value.
  • the server compares the recommended maximum value of the sub-area corresponding to the administrative area with the number of the road segments. If the recommended maximum value of the sub-area is less than or equal to the number of the road segments, it indicates that the number of road segments in the administrative area is sufficient for dividing the sub-areas by the road segment, and the verification is passed. . That is to say, this division result indicates that each road segment can have a corresponding sub-area, or that there are two or more road segments corresponding to one sub-area. For example, the number of road sections in Futian District is 20, and the recommended maximum number of sub-zones is 15.
  • the sub-area divided in the electronic map may be a sub-area corresponding to one road segment, or may be a sub-area corresponding to two or more road segments.
  • the server records the plurality of sub-areas of the administrative area as a reasonable sub-area, that is, a sub-area suitable for arranging the service personnel to perform the service.
  • the number of sub-areas partitions falls within the floating range corresponding to the recommended number of sub-areas, but the recommended maximum value of sub-areas is greater than the number of road segments, it means that the number of road segments in the administrative area is insufficient for the road. If the segment divides the sub-area, the verification fails. If the number of sub-areas does not fall within the floating range corresponding to the recommended number of sub-areas, it indicates that the number of sub-areas is unreasonable and the verification fails.
  • the number of the policy is used to calculate the floating range corresponding to the recommended number of sub-areas, and the sub-area division of the administrative area is verified by the floating range and the number of sections, and the division result is not only verified in combination with the actual insurance service status. Moreover, the result of the division is verified in conjunction with the change in the number of future policies, thereby ensuring effective verification of the administrative division result.
  • the method further includes: if the verification fails, scanning a plurality of road segments corresponding to the administrative region, acquiring a point of interest corresponding to the road segment; and adjusting the sub-region of the administrative region according to the point of interest.
  • the server may scan multiple road segments corresponding to the administrative area to acquire points of interest corresponding to the road segments.
  • the point of interest can be a building such as a community or a building. There can be one or more customers at the point of interest.
  • the point of interest name can be included in the customer address.
  • the server can adjust the sub-areas of the administrative area according to the points of interest.
  • the server can retrieve the customer's address using the point of interest name to obtain the customer address containing the name of the point of interest.
  • the policy ID corresponding to the point of interest can be obtained by obtaining the corresponding policy identifier according to the customer address including the name of the point of interest.
  • the server collects the policy identifier corresponding to the point of interest and obtains the policy amount corresponding to the point of interest.
  • the server calculates the number of sub-area adjustments based on the number of sub-area suggestions and the number of sub-areas. When the number of sub-area suggestions is greater than the number of sub-areas, one or more sub-areas need to be split, and the sub-area adjustment quantity is also the sub-area split quantity. For example, the number of road segments in Futian District is 15 and the maximum number of sub-regions is 20. It is necessary to divide the sub-regions of one or more road segment levels, so that the number of sub-regions can reach 20.
  • the step of adjusting the sub-areas of the administrative area according to the points of interest includes: acquiring the number of policies corresponding to the plurality of points of interest; and extracting one or more points of interest as the areas to be split according to the number of suggested areas of the sub-areas
  • the split area is split according to the number of policies corresponding to the area to be split and the number of policy proposals corresponding to the sub-area.
  • the server can have multiple pairs of points of interest.
  • the amount of the policy should be sorted, such as sorting the amount of the policy from the most to the least.
  • the server extracts one or more interest point regions as the to-be-split regions according to the number of splits of the sub-regions according to the order of the policy amount.
  • the server splits the area to be split.
  • the server can split according to the policy amount corresponding to the area to be split. For example, if the policy amount of the to-be-split area is greater than 3 times the number of policy proposals corresponding to the sub-area, the split area may be split into three sub-areas.
  • the split area may be split into 2 sub-areas. Therefore, when the difference in the number of policies between different points of interest is large, the points can be split according to the points of interest, so that the amount of the policy between the split sub-areas can be relatively balanced, which is beneficial for the subsequent arrangement of the business personnel to follow up the service.
  • the sub-area includes an unplanned area; and the step of adjusting the sub-area of the administrative area according to the point of interest includes: acquiring a point of interest in the unplanned area; and recommending the quantity in the unplanned area according to the quantity of the sub-area
  • One or more points of interest are extracted from the points of interest; the unplanned areas are split according to the extracted points of interest.
  • the server can acquire unplanned areas in the sub-areas.
  • Sub-areas include planned areas and unplanned areas.
  • the planned area refers to the area where the customer has existing customers, and the planned area has the corresponding number of policies.
  • the unplanned area refers to the area where there is no customer, and the number of policies corresponding to the unplanned area is currently 0.
  • the server can split one or more unplanned areas. Specifically, the server acquires points of interest in a plurality of unplanned areas. The server calculates the number of sub-area splits based on the number of sub-area recommendations and the number of sub-areas.
  • the server extracts one or more points of interest according to the number of sub-area splits, and splits the unplanned areas according to the extracted points of interest. For example, the server can sort the area of multiple points of interest in an unplanned area. The larger the area of interest, the larger the population it covers and the greater the number of potential customers.
  • the server may extract one or more points of interest as the to-be-split area according to the area from large to small, and perform splitting. Therefore, when the number of policies between different points of interest in the planning area is roughly equal, the use of points of interest to split the unplanned areas can facilitate the subsequent arrangement of business personnel for customer development.
  • the server can sort the policy amounts corresponding to multiple points of interest.
  • the server extracts one or more sub-areas according to the number of sub-areas merged in ascending order. For the extracted sub-areas, the server compares the adjacent sub-areas to obtain the adjacent sub-areas with the smallest policy amount, and the server The extracted sub-areas are merged with their corresponding adjacent sub-areas with the smallest amount of policies.
  • the sub-area of the link level can also be adjusted through the terminal.
  • the server may generate the prompt information.
  • the server may also send the prompt information that the verification fails to be sent to the terminal corresponding to the management personnel. This allows the manager to manually adjust the sub-areas that failed the verification through the terminal.
  • the method further includes: receiving a request for acquiring an administrative area electronic map sent by the terminal; returning an electronic map of the administrative area to the terminal according to the request, where the electronic map includes multiple sub-tests corresponding to the administrative area a region, such that the terminal adjusts the sub-region in the electronic map; and receives the adjusted electronic map returned by the terminal.
  • the server stores the partitioned results of each level in the database.
  • the administrator can send a request for obtaining the hierarchically divided electronic map to the server through the terminal, and the server obtains the hierarchically divided electronic map from the database according to the request, returns the electronic map to the terminal, and displays the image at the terminal.
  • the server records the sub-area of the link level as an unreasonable sub-area.
  • the number of policies in each sub-area is usually considered.
  • the server can identify the currently existing customers in the sub-area. Specifically, the server labels the polygons of the smallest division unit 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. This allows managers to visually see the customer status within each sub-area. For example, the darker the color, the more the number of policies, and the lighter the color, the less the number of policies. 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 saturated.
  • the manager can adjust the sub-areas in the electronic map through the terminal.
  • 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.
  • Adjustments include segmentation and merging of sub-regions.
  • An application is installed on the terminal, and the sub-areas in the electronic map can be divided or merged by the application.
  • the application's menu can be a multi-level menu.
  • a multi-level menu can be displayed on the screen, thereby providing convenience for the manager to select the desired menu control.
  • 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 can refer to the color label in the sub-area, select the sub-area to be divided in the electronic map by the terminal, and generate multiple 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 draws 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 can refer to the color labels in the sub-areas, and select 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.
  • an administrative area dividing apparatus includes: a loading module 302, a verification module 304, and a recording module 306, wherein:
  • the loading module 302 is configured to obtain an area name of the administrative area, and load an electronic map corresponding to the administrative area according to the area name; the administrative area is divided into multiple sub-areas in the electronic map.
  • the verification module 304 is configured to acquire the number of policies corresponding to the area name and the number of road segments corresponding to the area name, and verify the plurality of sub-areas of the administrative area by using the number of policies corresponding to the area name and the number of road segments.
  • the recording module 306 is configured to record multiple sub-areas of the administrative area as reasonable sub-areas if the verification passes.
  • the device further includes a region dividing module 308, configured to obtain policy data, the policy data includes a client address, identify an area name of the administrative region corresponding to the client address, and retrieve the corresponding information in the electronic map according to the region name.
  • the boundary of the region is obtained; the polygon corresponding to the smallest division unit is obtained, and the administrative region is divided in the electronic map by using the polygon and the region boundary; the polygon is spliced to obtain a plurality of sub-regions.
  • the verification module 304 is further configured to calculate the number of sub-regions corresponding to the administrative region by using the number of policies corresponding to the region name, obtain the number of sub-regions in the electronic map, and determine whether the number of sub-regions is divided.
  • the floating range corresponding to the recommended number of sub-areas if yes, the maximum value of the floating range is further compared with the number of sections; if the maximum value of the floating range is less than the number of sections, the verification passes.
  • the apparatus further includes an adjustment module 310, configured to scan a plurality of road segments corresponding to the administrative area to obtain a point of interest corresponding to the road segment if the verification fails, and to access the administrative area according to the interest point. The area is adjusted.
  • an adjustment module 310 configured to scan a plurality of road segments corresponding to the administrative area to obtain a point of interest corresponding to the road segment if the verification fails, and to access the administrative area according to the interest point. The area is adjusted.
  • the adjustment module 310 is further configured to acquire the number of policies corresponding to the plurality of points of interest; extract one or more points of interest as the to-be-split area according to the number of sub-area suggestions; and the number of policies corresponding to the area to be split The number of policy proposals corresponding to the sub-area splits the area to be split.
  • the adjustment module 310 is further configured to acquire a point of interest in an unplanned area; Extract one or more points of interest in the points of interest in the unplanned area according to the number of sub-area suggestions; split the unplanned area according to the extracted points of interest.
  • the device further includes a communication module 312, configured to receive a request for acquiring an administrative area electronic map sent by the terminal, and return an electronic map of the administrative area to the terminal according to the request, where the electronic map includes the corresponding administrative area. Passing the verified plurality of sub-areas such that the terminal adjusts the sub-areas in the electronic map; receiving the adjusted electronic map returned by the terminal.
  • a communication module 312 configured to receive a request for acquiring an administrative area electronic map sent by the terminal, and return an electronic map of the administrative area to the terminal according to the request, where the electronic map includes the corresponding administrative area. Passing the verified plurality of sub-areas such that the terminal adjusts the sub-areas in the electronic map; receiving the adjusted electronic map returned by the terminal.
  • a server is provided, as shown in FIG. 4, which includes a processor, memory, and network interface connected by a system bus.
  • the processor of the server is used to provide computing and control capabilities.
  • the memory of the server includes a non-volatile storage medium and an internal memory.
  • the non-volatile storage medium of the server stores an operating system, computer readable instructions, and a database, the computer readable instructions being executed by the processor to implement an administrative partitioning verification method.
  • the database stores the policy data and the division result of the administrative area.
  • the internal memory of the server provides an environment for the operation of operating systems and computer readable instructions in a non-volatile storage medium.
  • the network interface of the server is used for communicating with an external terminal through a network connection, for example, receiving a request for obtaining an administrative area electronic map sent by the terminal.
  • a network connection for example, receiving a request for obtaining an administrative area electronic map sent by the terminal.
  • 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 plurality of sub-areas of the administrative area are recorded as reasonable sub-areas.
  • the processor also performs the following steps when executing the computer readable instructions:
  • the polygons are spliced to obtain multiple sub-regions.
  • the processor also performs the following steps when executing the computer readable instructions:
  • the maximum value of the floating range is further compared with the number of road segments; if the maximum value of the floating range is less than the number of road segments, the verification passes.
  • the processor also performs the following steps when executing the computer readable instructions:
  • the plurality of road segments corresponding to the administrative area are scanned to obtain the points of interest corresponding to the road segments;
  • the sub-areas of the administrative area are adjusted according to the points of interest.
  • the processor also performs the following steps when executing the computer readable instructions:
  • the area to be split is split according to the number of policies corresponding to the area to be split and the number of policy proposals corresponding to the sub-area.
  • the processor also performs the following steps when executing the computer readable instructions:
  • the unplanned area is split according to the extracted points of interest.
  • the processor also performs the following steps when executing the computer readable instructions:
  • the electronic map includes a plurality of sub-areas corresponding to the administrative area that have not passed the verification, so that the terminal adjusts the sub-areas in the electronic map;
  • one or more computer readable non-volatile storage media having computer readable instructions, when executed by one or more processors, causing one or more processors Perform the following steps:
  • the computer readable instructions when executed by the processor, also perform the following steps:
  • the polygons are spliced to obtain multiple sub-regions.
  • the computer readable instructions when executed by the processor, also perform the following steps:
  • the maximum value of the floating range is further compared with the number of road segments; if the maximum value of the floating range is less than the number of road segments, the verification passes.
  • the computer readable instructions when executed by the processor, also perform the following steps:
  • the plurality of road segments corresponding to the administrative area are scanned to obtain the points of interest corresponding to the road segments;
  • the sub-areas of the administrative area are adjusted according to the points of interest.
  • the computer readable instructions when executed by the processor, also perform the following steps:
  • the area to be split is split according to the number of policies corresponding to the area to be split and the number of policy proposals corresponding to the sub-area.
  • the computer readable instructions when executed by the processor, also perform the following steps:
  • the unplanned area is split according to the extracted points of interest.
  • the computer readable instructions when executed by the processor, also perform the following steps:
  • the electronic map includes a plurality of sub-areas corresponding to the administrative area that have not passed the verification, so that the terminal adjusts the sub-areas in the electronic map;
  • the storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or the like.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Technology Law (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
  • Information Transfer Between Computers (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

一种行政区域划分验证方法，包括：获取行政区域的区域名称(202)；根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域(204)；获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量(206)；利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验(208)；若校验通过，则将所述行政区域的多个子区域记录为合理子区域(210)。

Description

行政区域划分验证方法、装置、服务器和存储介质
本申请要求于2017年7月28日提交中国专利局、申请号为2017106296046、发明名称为“行政区域划分验证方法、装置、服务器和存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及计算机技术领域，特别是涉及一种行政区域划分验证方法、装置、服务器和存储介质。
背景技术
保险作为一种保障机制已融入人们的生活中。保险的种类也是日益繁多。不同种类的保险可以为客户提供不同的保障。针对不同种类的保险，保险公司可以安排业务人员前往客户所在地为客户提供不同的服务。为了便于业务人员在一个较为集中的区域内工作，保险公司可以结合行政区域来安排业务人员。保险公司通过后台的服务器对行政区域进行划分，继而可以利用划分结果安排不同业务人员。在利用划分结果来安排业务人员之前，如何对行政区域的划分结果进行有效验证成为目前需要解决的一个技术问题。
发明内容
根据本申请公开的各种实施例，提供一种行政区域划分验证方法、装置、服务器和存储介质。
一种行政区域划分验证方法，包括：
获取行政区域的区域名称；
根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；
利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验；及
若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
一种行政区域划分装置，包括：
加载模块，用于获取行政区域的区域名称；根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
校验模块，用于获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验；及
记录模块，用于若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
一种服务器，包括存储器和一个或多个处理器，所述存储器中储存有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
获取行政区域的区域名称；
根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；
利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验；及
若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
一个或多个存储有计算机可读指令的计算机可读非易失性存储介质，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器执行以下步骤：
获取行政区域的区域名称；
根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；
利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验；及
若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
本申请的一个或多个实施例的细节在下面的附图和描述中提出。本申请的其它特征、目的和优点将从说明书、附图以及权利要求书变得明显。
附图说明
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1为一个实施例中行政区域划分验证方法的硬件环境图；
图2为一个实施例中行政区域划分验证方法的流程图；
图3为一个实施例中行政区域划分验证装置的框图；
图4为一个实施例中服务器的框图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处描述的具体实施例仅仅用以解释本申请，并不用于限定本申请。
本申请的实施例中所提供的行政区域划分验证方法可以应用如图1所示 的硬件环境中。服务器102通过网络与终端102建立通信连接。服务器102获取行政区域的区域名称，根据区域名称加载该行政区域对应的电子地图。服务器102上预先存储了每个行政区域的层级关系。在电子地图中，服务器102按照行政区域的层级关系，可以将该行政区域划分为多个层级的子区域。服务器102在对每个独立的行政区域的子区域进行校验时，可以结合行政区域内的保单数量以及路段数量对路段层级的子区域划分结果进行校验。服务器102上部署了数据库，数据库中存储了保单数据。服务器102可以利用保单数据中的保单标识进行统计，得到与区域名称对应的保单数量。数据库中还存储了多个行政区域对应的所有路段名称。服务器102可以根据区域名称获取该行政区域内的路段名称，根据路段名称统计该行政区域内的路段数量。服务器102利用区域名称对应的保单数量以及路段数量对行政区域的多个子区域进行校验。服务器102对于校验通过的子区域，可以记录为合理子区域，即适宜安排业务人员进行服务的子区域。当保险公司的管理人员为业务人员为前往客户所在地为客户提供服务时，可以通过终端104查询合理子区域，利用业务人员标识与和合理子区域生成相应的服务任务。以此利用行政区域的划分结果来安排不同的业务人员在不同区域进行服务。
在一个实施例中，如图2所示，提供了一种行政区域划分验证方法，应该理解的是，虽然图2的流程图中的各个步骤按照箭头的指示依次显示，但是这些步骤并不是必然按照箭头指示的顺序依次执行。除非本文中有明确的说明，这些步骤的执行并没有严格的顺序限制，其可以以其他的顺序执行。而且，图2中的至少一部分步骤可以包括多个子步骤或者多个阶段，这些子步骤或者阶段并不必然是在同一时刻执行完成，而是可以在不同的时刻执行，其执行顺序也不必然是依次进行，而是可以与其他步骤或者其他步骤的子步骤或者阶段的至少一部分轮流或者交替地执行。以该方法应用于服务器为例进行说明，具体包括：
步骤202，获取行政区域的区域名称。
步骤204，根据区域名称加载行政区域对应的电子地图；行政区域在电 子地图中划分为多个子区域。
服务器获取行政区域的区域名称，行政区域包括市、区、县和镇等。例如，深圳市福田区。服务器获取到的区域名称可以是管理人员通过终端上传的，也可以是通过数据库中存储的配置文件获取到的。服务器根据区域名称加载该行政区域对应的电子地图。电子地图可以是第三方提供的电子地图，例如，百度地图等。在电子地图中，服务器按照行政区域的层级关系，可以将该行政区域划分为多个层级的子区域。利用行政区域的层级关系，方便保险公司按对不同层级的子区域安排相应的业务人员。
具体的，服务器上预先存储了每个行政区域的层级关系，层级关系包括父层级和子层级。对于子层级而言，除了是上一层级(即父层级)的子层级，还可以是下一层级的父层级。不具备下一个层级的子层级也可以称为叶子层级。行政区域的层级关系中包括行政区域层级、路段层级和兴趣点层级。其中，兴趣点是指行政区域内建筑，包括居住建筑和办公建筑等。兴趣点的地址通常设在路段下。行政区域这一层级是路段层级的父层级，路段层级是行政区域这一层级的子层级。路段层级是兴趣点层级的父层级，兴趣点层级是路段层级的子层级。
例如，深圳市福田区八卦路平安大厦。其中，福田区为行政区域层级，八卦路为路段层级，平安大厦为兴趣点层级。福田区为八卦路的父层级，八卦路为福田区的子层级。八卦路为平安大厦的父层级，平安大厦为八卦路的子层级。平安大厦不具备下一个层级，也可以称为叶子层级。叶子层级可以是小区、楼宇、村或镇等。人口密度超过预设密度的区域，可以采用小区或楼宇等作为一个叶子层级，人口密度低于预设密度的区域，可以采用村或镇等作为一个叶子层级。
步骤206，获取与区域名称对应的保单数量以及与区域名称对应的路段数量。
步骤208，利用区域名称对应的保单数量以及路段数量对行政区域的多个子区域进行校验。
步骤210，若校验通过，则将行政区域的多个子区域记录为合理子区域。
对于一个城市而言，通常会包括多个区或者县等行政区域。每个区或县属于一个独立的行政区域。为了便于业务人员在一个相对集中的区域内为客户提供服务，保险公司可以安排业务人员在其对应的行政区域内工作。区或县等独立的行政区域可以作为行政区域层级关系的顶层级，路段层级是行政区域这一顶层级的子层级。保险公司安排业务人员为客户提供服务时，保单数量是一项重要参考指标。服务器在对每个独立的行政区域的子区域进行校验时，可以结合行政区域内的保单数量以及路段数量对路段层级的子区域划分结果进行校验。若路段层级的多个子区域划分合理，则表示该行政区域的划分结果适宜安排业务人员进行服务的子区域，划分合理，通过检验。若路段层级的多个子区域中若存在划分不合理的子区域，则表示该行政区域的划分结果不适宜安排业务人员进行服务，划分不合理，校验未通过，需要进行不合理的子区域进行调节。
服务器上部署了数据库，数据库中存储了保单数据。服务器可以预先对每个行政区域的保单数量进行统计。当需要使用保单数量时，服务器可以根据区域名称获取该行政区域内的保单数量。如果服务器对保单数量未进行预先统计，服务器可以根据区域名称获取对应的保单数据。保单数据包括保单标识，服务器可以利用保单数据中的保单标识进行统计，得到与区域名称对应的保单数量。
数据库中还存储了多个行政区域对应的所有路段名称。服务器可以根据区域名称获取该行政区域内的路段名称，根据路段名称统计该行政区域内的路段数量。
服务器可以根据区域名称对应的保单数量计算行政区域对应的子区域建议数量。服务器获取行政区域内路段层级的子区域划分数量。如果子区域划分数量落入子区域建议数量对应的浮动范围内，则服务器进一步将子区域建议数量或浮动范围的最大值与路段数量进行比较。当子区域建议数量小于或等于路段数量时，表示路段数量足以支撑路段层级的子区域划分，行政区域 内路段层级的子区域划分合理，行政区域的划分结果校验通过。或者当浮动范围的最大值小于路段数量时，表示路段数量足以支撑路段层级的子区域划分，行政区域内的子区域划分合理，行政区域的划分结果校验通过。服务器对于校验通过的子区域，可以记录为合理子区域，即适宜安排业务人员进行服务的子区域。
如果子区域划分数量落入子区域建议数量对应的浮动范围，但是子区域建议数量对应的浮动范围的最大值大于路段数量，则校验未通过。需要对路段层级的子层级进行调节，例如，将子区域进行分割等。如果子区域划分数量未落入子区域建议数量对应的浮动范围内，则校验未通过，需要对子区域进行调节，例如，将相邻的一个或多个子区域进行合并等。通过对校验未通过的子区域进行调节，可以使得调节后的子区域划分满足业务人员安排的需要。
本实施例中，通过加载行政区域的电子地图，可以获取到行政区域在电子地图中划分的多个子区域。利用区域名称对应的保单数量以及路段数量对行政区域的多个子区域进行校验，若通过校验，则将行政区域的多个子区域记录为合理子区域。从而能够对行政区域划分结果进行有效验证，继而确保划分后的子区域适宜安排业务人员为客户提供服务。
在一个实施例中，将行政区域在电子地图中划分为多个子区域的步骤，包括：获取保单数据，保单数据中包括客户地址；识别客户地址对应的行政区域的区域名称；根据区域名称在电子地图中检索对应的区域边界；获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分；将多边形进行拼接，得到多个子区域。
服务器上部署了数据库，数据库中存储了保单数据。服务器调用线程在数据库中抓取保单数据。保单数据包括保单标识、客户标识和客户地址等。服务器可以根据客户地址中的文字描述识别对应的行政区域的区域名称。
服务器根据区域名称在电子地图中检索对应的区域边界。区域边界包括多个地理坐标。地理坐标包括经度和纬度。区域边界的地理坐标可以存储在 数据库中。服务器上可以预先配置用于划分行政区域的最小划分单元。最小划分单元可以采用多边形。多边形是指三条或三条以上的线段首尾顺次连接所组成的封闭图形。例如，多边形可以是三角形或者四边形等。优选的，多边形可以采用四边形。多边形的面积可以根据建筑物之间的间距来配置，以覆盖一个建筑物尤佳。例如，多边形的面积为20平方米，可以视其为一个经验值。多边形的面积越小，通过该多边形对行政区域的划分越精细。
服务器利用多边形和区域边界在电子地图中对行政区域进行均等划分。以此将行政区域划分为多个多边形。例如，服务器将行政区域划分为多个四边形。如果行政区域的边界部分不能按照多边形进行均分，则保留边界部分的形状。可以理解的，服务器在利用多边形对行政区域进行划分时，多边形所覆盖的范围内可能存在当前暂无客户的情形。
通过保单数据中的客户地址识别对应的行政区域的区域名称，利用区域名称在电子地图中检索行政区域的区域边界。利用最小划分单元对应的多边形以及区域边界在电子地图中对行政区域进行划分。多边形的面积也就越小，对行政区域的划分就越精细。通过将多个多边形进行拼接，可以得到多个子区域。行政区域的划分，不需要手工划分，即可能够快速有效的完成行政区域的划分，不仅能够有效提高划分效率，而且能够实现对行政区域内的每个层级进行精细划分，为服务客户提供了方便。
在一个实施例中，利用区域名称对应的保单数量以及路段数量对行政区域的多个子区域进行校验的步骤，包括：利用区域名称对应的保单数量计算行政区域对应的子区域建议数量；获取行政区域在电子地图中的子区域划分数量；判断子区域划分数量是否落入子区域建议数量对应的浮动范围；若是，则进一步将浮动范围的最大值与路段数量进行比较；若浮动范围的最大值小于路段数量，则校验通过。
服务器获取路段层级的子区域对应的保单建议数量，利用区域名称对应的保单数量以及路段层级的子区域对应的保单建议数量计算行政区域对应的路段层级的子区域建议数量。具体的，路段层级的子区域建议数量可以是区 域名称对应的保单数量以及路段层级的子区域对应的保单建议数量的商(可以取整数)。例如，区域名称对应的保单量为10000，路段层级的子区域对应的保单建议数量为500，那么路段层级的子区域建议数量为20。路段层级的子区域对应的保单建议数量可以根据保险业务状况进行调节。
考虑到保单数量随着时间的变化也会存在一定变化，为了让行政区域的划分结果能够在未来几年内(如未来3～5年内)适用于业务人员的安排，服务器在对路段层级的子区域进行校验时，可以根据子区域建议数量计算一个浮动范围。具体的，服务器可以根据浮动比例与子区域建议数量计算子区域建议数量对应的浮动范围。如，浮动比例为10％，服务器可以计算子区域建议数量向下浮动10％所对应的数量，以及向上浮动10％所对应的数量。服务器根据浮动比例计算得到的数量生成对应的浮动范围。服务器获取行政区域在电子地图中的子区域划分数量，判断子区域划分数量是否落入子区域建议数量对应的浮动范围。如果子区域划分数量落入子区域建议数量对应的浮动范围，服务器还需要进一步根据行政区域内的路段数量对行政区域的划分结果进行校验。
子区域建议数量对应的浮动范围中的最大值可以称为子区域建议最大值。服务器将行政区域对应的子区域建议最大值与路段数量进行比较，如果子区域建议最大值小于或等于路段数量，则表示该行政区域内的路段数量足够用于按路段划分子区域，校验通过。也就是说，这种划分结果表示每个路段都可以有对应的子区域，或者说，存在两个以及两个以上的路段对应一个子区域的情形。例如，福田区的路段数量为20个，子区域建议最大值为15个。在电子地图中划分的子区域，可以是一个路段对应的一个子区域，也可以是两个或两个以上的路段对应的一个子区域。当行政区域的划分结果校验通过时，服务器将该行政区域的多个子区域记录为合理子区域，即适宜安排业务人员进行服务的子区域。
如果子区域划分数量落入子区域建议数量对应的浮动范围，但是子区域建议最大值大于路段数量，则表示该行政区域内的路段数量不足以用于按路 段划分子区域，则校验未通过。如果子区域划分数量未落入子区域建议数量对应的浮动范围，表示子区域划分数量不合理，校验未通过。
本实施例中，利用保单数量计算子区域建议数量对应的浮动范围，通过该浮动范围与路段数量对行政区域的子区域划分进行校验，不仅结合实际的保险业务状况对划分结果进行校验，而且结合未来保单数量发生变化的状况对划分结果进行校验，因此能够确保对行政区域划分结果进行有效验证。
在一个实施例中，该方法还包括：若校验未通过，则对行政区域对应的多个路段进行扫描，获取路段对应的兴趣点；根据兴趣点对行政区域的子区域进行调节。
本实施例中，如果行政区域在路段层级的划分结果未通过校验，则需要对路段层级的子区域进行调节。服务器可以对行政区域对应的多个路段进行扫描，获取路段对应的兴趣点。兴趣点可以是小区或楼宇等建筑。兴趣点处可以有一个或多个客户。兴趣点名称可以包含在客户地址中。服务器可以根据兴趣点对行政区域的子区域进行调节。
服务器可以利用兴趣点名称在客户地址中进行检索，得到包含兴趣点名称的客户地址。根据包含兴趣点名称的客户地址获取对应的保单标识，即可得到兴趣点对应的保单标识。服务器将兴趣点对应的保单标识进行统计得到兴趣点对应的保单量。服务器根据子区域建议数量与子区域划分数量计算子区域调节数量。当子区域建议数量大于子区域划分数量时，需要对一个或多个子区域进行拆分，子区域调节数量也就是子区域拆分数量。例如，福田区的路段数量为15个，子区域建议最大值为20个，需要对其中一个或多个路段层级的子区域进行分割，从而使得子区域数量能够达到20个。
在其中一个实施例中，根据兴趣点对行政区域的子区域进行调节的步骤，包括：获取多个兴趣点对应的保单数量；根据子区域建议数量提取一个或多个兴趣点作为待拆分区域，根据待拆分区域对应的保单数量与子区域对应的保单建议数量对待拆分区域进行拆分。
当不同兴趣点之间的保单数量差异较大时，服务器可以对多个兴趣点对 应的保单量进行排序，如对保单量由多到少进行排序。服务器根据子区域拆分数量，根据保单量由多到少的排序提取一个或多个兴趣点区域作为待拆分区域。服务器将待拆分区域进行拆分。为了使拆分后的区域所对应的保单量尽量能够均衡，服务器可以根据待拆分区域对应的保单量进行拆分。例如，如果待拆分区域的保单量大于3倍的子区域对应的保单建议数量，可以将该拆分区域拆分为3个子区域。如果待拆分区域的保单量大于2倍的子区域对应的保单建议数量，可以将该拆分区域拆分为2个子区域。因此，当不同兴趣点之间的保单数量差异较大时，可以根据兴趣点进行拆分，从而能够使得拆分后的子区域之间保单量相对均衡，有利于后续安排业务人员跟进服务。
在其中一个实施例中，子区域包括未规划区域；根据兴趣点对行政区域的子区域进行调节的步骤，包括：获取未规划区域中的兴趣点；根据子区域建议数量在未规划区域中的兴趣点中提取一个或多个兴趣点；根据提取到的兴趣点对将未规划区域进行拆分。
当不同兴趣点之间的保单数量相对均衡时，服务器可以获取子区域中的未规划区域。子区域包括规划区域和未规划区域。其中，规划区域是指目前已有客户的区域，规划区域具有对应的保单数量。未规划区域是指暂无客户的区域，未规划区域对应的保单数量当前为0。考虑到保险公司需要在未规划区域进行客户开拓，服务器可以对一个或多个未规划区域进行拆分。具体的，服务器获取多个未规划区域中的兴趣点。服务器根据子区域建议数量与子区域划分数量计算子区域拆分数量。服务器根据子区域拆分数量提取一个或多个兴趣点，根据提取到的兴趣点对将未规划区域进行拆分。例如，服务器可以对未规划区域中的多个兴趣点的面积进行排序。兴趣点的面积越大，其所覆盖的人群就越大，潜在客户的数量也就越大。服务器可以根据面积由大到小提取一个或多个兴趣点作为待拆分区域，进行拆分。因此，当规划区域内的不同兴趣点之间的保单数量大致相当时，利用兴趣点对未规划区域进行拆分，可以便于后续安排业务人员进行客户开拓。
当子区域建议数量小于子区域划分数量时，需要对一个或多个子区域进 行合并，子区域调节数量也就是子区域合并数量。当需要对子区域进行合并时，服务器可以对多个兴趣点对应的保单量进行排序。服务器根据子区域合并数量按照由少到多的顺序提取一个或多个子区域，对于提取出的子区域，服务器将其相邻的多个子区域进行比较，得到保单量最小的相邻子区域，服务器将提取出的子区域与其对应的保单量最小的相邻子区域进行合并。
进一步的，当行政区域的划分结果未通过校验时，还可以通过终端对路段层级的子区域进行调节。服务器根据上述实施例中的方式对电子地图中行政区域的划分结果进行校验之后，如果校验未通过，服务器可以生成提示信息。服务器还可以将校验未通过的提示信息发送至管理人员对应的终端。由此可以使得管理人员通过终端对校验未通过的子区域进行手动调节。
在一个实施例中，该方法还包括：接收终端发送的获取行政区域电子地图的请求；根据请求将行政区域的电子地图返回至终端，电子地图中包括行政区域对应的未通过校验的多个子区域，以使得终端对电子地图中的子区域进行调节；接收终端返回的调节后的电子地图。
服务器将每个层级的划分结果分保存储在数据库中。管理人员通过终端可以向服务器发送获取层级划分后的电子地图的请求，服务器根据该请求从数据库中获取层级划分后的电子地图，将该电子地图返回至终端，在终端进行展示。当行政区域对应的路段层级的子区域校验未通过时，服务器将路段层级的子区域记录为不合理子区域。
为了使得每个业务人员的工作量尽可能相当，保险公司分配业务人员为客户提供服务时，通常会考虑每个子区域的保单数量。服务器可以在子区域中标识出目前已存在的客户。具体的，服务器根据客户地址的地理坐标将最小划分单元的多边形进行标注，如对多边形添加颜色等方式进行标注，在子区域中标注出所有已存在的客户。由此可以使得管理人员能够直观的看到每个子区域内的客户状况。例如，颜色越深表示保单数量越多，颜色越浅表示保单数量越少。如果某个子区域的保单数量较少，会使得业务人员的工作量不足。如果某个子区域的保单数量较多，会使得业务人员的工作量多度饱和。
为了能够对业务人员的工作量进行均衡分配，管理人员可以通过终端对电子地图中的子区域进行调节。服务器将每个子区域的保单数量与第一阈值和第二阈值分别进行比较，若保单数量超过第一阈值，表示该子区域的保单数量过高，会使得业务人员的工作量过度饱和，需要对该子区域进行调节。若保单数量低于第二阈值，表示该子区域的保单数量过低，会使得业务人员的工作量不足，也需要对该子区域进行调节。
调节包括对子区域的分割与合并。终端上安装了应用程序，通过应用程序可以对电子地图中的子区域进行分割或合并。其中，应用程序的菜单可以是多级菜单。当光标位于首级的菜单控件时，可以在屏幕显示多级菜单，由此为管理人员选择所需的菜单控件提供了方便。
终端根据调节提示向服务器发送获取电子地图的请求，服务器将划分为多个子区域的电子地图返回至终端，在终端进行展示。对于需要调节的子区域，可以通过子区域的颜色或子区域边界闪烁等方式进行提示。管理人员可以通过终端对电子地图中的子区域进行调节。调节包括对子区域的分割与合并。对于保单数量超过第一阈值的子区域，管理人员会对该子区域进行分割。对于保单数量低于第二阈值的子区域，管理人员会对该子区域与相邻子区域进行合并。
当需要对子区域进行分割时，管理人员可以参考子区域中的颜色标注，通过终端在电子地图中选择待分割子区域，在待分割子区域的边界上生成多个编辑点。管理人员通过终端选择一个编辑点生成分割起点，选择另外一个编辑点生成分割终点。终端根据分割起点与分割终点之间的道路在子区域中绘制分割线。利用分割线与子区域的边界生成分割后的子区域，由此将一个子区域进行分割。
当需要对子区域进行合并时，管理人员可以参考子区域中的颜色标注，通过终端在电子地图中选择待合并的子区域，待合并的子区域为两个或两个以上的相邻子区域。终端接收管理人员输入的合并指令，根据合并指令将待合并的子区域进行合并。
在一个实施例中，提供了一种行政区域划分装置，如图3所示，该装置包括：加载模块302、校验模块304和记录模块306，其中：
加载模块302，用于获取行政区域的区域名称；根据区域名称加载行政区域对应的电子地图；行政区域在电子地图中划分为多个子区域。
校验模块304，用于获取与区域名称对应的保单数量以及与区域名称对应的路段数量；利用区域名称对应的保单数量以及路段数量对行政区域的多个子区域进行校验。
记录模块306，用于若校验通过，则将行政区域的多个子区域记录为合理子区域。
在其中一个实施例中，该装置还包括区域划分模块308，用于获取保单数据，保单数据中包括客户地址；识别客户地址对应的行政区域的区域名称；根据区域名称在电子地图中检索对应的区域边界；获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分；将多边形进行拼接，得到多个子区域。
在其中一个实施例中，校验模块304还用于利用区域名称对应的保单数量计算行政区域对应的子区域建议数量；获取行政区域在电子地图中的子区域划分数量；判断子区域划分数量是否落入子区域建议数量对应的浮动范围；若是，则进一步将浮动范围的最大值与路段数量进行比较；若浮动范围的最大值小于路段数量，则校验通过。
在其中一个实施例中，该装置还包括调节模块310，用于若校验未通过，则对行政区域对应的多个路段进行扫描，获取路段对应的兴趣点；根据兴趣点对行政区域的子区域进行调节。
在其中一个实施例中，调节模块310还用于获取多个兴趣点对应的保单数量；根据子区域建议数量提取一个或多个兴趣点作为待拆分区域；根据待拆分区域对应的保单数量与子区域对应的保单建议数量对将待拆分区域进行拆分。
在其中一个实施例中，调节模块310还用于获取未规划区域中的兴趣点； 根据子区域建议数量在未规划区域中的兴趣点中提取一个或多个兴趣点；根据提取到的兴趣点对将未规划区域进行拆分。
在其中一个实施例中，该装置还包括通信模块312，用于接收终端发送的获取行政区域电子地图的请求；根据请求将行政区域的电子地图返回至终端，电子地图中包括行政区域对应的未通过校验的多个子区域，以使得终端对电子地图中的子区域进行调节；接收终端返回的调节后的电子地图。
在一个实施例中，提供了一种服务器，如图4所示，该服务器包括通过系统总线连接的处理器、存储器和网络接口。其中，该服务器的处理器用于提供计算和控制能力。该服务器的存储器包括非易失性存储介质、内存储器。该服务器的非易失性存储介质存储有操作系统、计算机可读指令和数据库，该计算机可读指令被处理器执行时以实现一种行政区域划分验证方法。该数据库中存储了保单数据和行政区域的划分结果。该服务器的内存储器为非易失性存储介质中的操作系统和计算机可读指令的运行提供环境。该服务器的网络接口用于与外部的终端通过网络连接通信，比如，接收终端发送的获取行政区域电子地图的请求等。本领域技术人员可以理解，图4中示出的结构，仅仅是与本申请方案相关的部分结构的框图，并不构成对本申请方案所应用于其上的服务器的限定，具体的服务器可以包括比图中所示更多或更少的部件，或者组合某些部件，或者具有不同的部件布置。
一种服务器，包括存储器和一个或多个处理器，所述存储器中储存有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
获取行政区域的区域名称；
根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；
利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个 子区域进行校验；及
若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
在一个实施例中，处理器执行计算机可读指令时还执行以下步骤：
获取保单数据，保单数据中包括客户地址；
识别客户地址对应的行政区域的区域名称；
根据区域名称在电子地图中检索对应的区域边界；
获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分；及
将多边形进行拼接，得到多个子区域。
在一个实施例中，处理器执行计算机可读指令时还执行以下步骤：
利用区域名称对应的保单数量计算行政区域对应的子区域建议数量；
获取行政区域在电子地图中的子区域划分数量；
判断子区域划分数量是否落入子区域建议数量对应的浮动范围；及
若是，则进一步将浮动范围的最大值与路段数量进行比较；若浮动范围的最大值小于路段数量，则校验通过。
在一个实施例中，处理器执行计算机可读指令时还执行以下步骤：
若校验未通过，则对行政区域对应的多个路段进行扫描，获取路段对应的兴趣点；及
根据兴趣点对行政区域的子区域进行调节。
在一个实施例中，处理器执行计算机可读指令时还执行以下步骤：
获取多个兴趣点对应的保单数量；
根据子区域建议数量提取一个或多个兴趣点作为待拆分区域；及
根据待拆分区域对应的保单数量与子区域对应的保单建议数量对将待拆分区域进行拆分。
在一个实施例中，处理器执行计算机可读指令时还执行以下步骤：
获取未规划区域中的兴趣点；
根据子区域建议数量在未规划区域中的兴趣点中提取一个或多个兴趣 点；及
根据提取到的兴趣点对将未规划区域进行拆分。
在一个实施例中，处理器执行计算机可读指令时还执行以下步骤：
接收终端发送的获取行政区域电子地图的请求；
根据请求将行政区域的电子地图返回至终端，电子地图中包括行政区域对应的未通过校验的多个子区域，以使得终端对电子地图中的子区域进行调节；及
接收终端返回的调节后的电子地图。
在一个实施例中，提供了一个或多个存储有计算机可读指令的计算机可读非易失性存储介质，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器执行以下步骤：
获取行政区域的区域名称；
根据区域名称加载行政区域对应的电子地图；行政区域在电子地图中划分为多个子区域；
获取与区域名称对应的保单数量以及与区域名称对应的路段数量；
利用区域名称对应的保单数量以及路段数量对行政区域的多个子区域进行校验；及
若校验通过，则将行政区域的多个子区域记录为合理子区域。
在一个实施例中，计算机可读指令被处理器执行时还执行以下步骤：
获取保单数据，保单数据中包括客户地址；
识别客户地址对应的行政区域的区域名称；
根据区域名称在电子地图中检索对应的区域边界；
获取最小划分单元对应的多边形，利用多边形和区域边界在电子地图中对行政区域进行划分；及
将多边形进行拼接，得到多个子区域。
在一个实施例中，计算机可读指令被处理器执行时还执行以下步骤：
利用区域名称对应的保单数量计算行政区域对应的子区域建议数量；
获取行政区域在电子地图中的子区域划分数量；
判断子区域划分数量是否落入子区域建议数量对应的浮动范围；及
若是，则进一步将浮动范围的最大值与路段数量进行比较；若浮动范围的最大值小于路段数量，则校验通过。
在一个实施例中，计算机可读指令被处理器执行时还执行以下步骤：
若校验未通过，则对行政区域对应的多个路段进行扫描，获取路段对应的兴趣点；及
根据兴趣点对行政区域的子区域进行调节。
在一个实施例中，计算机可读指令被处理器执行时还执行以下步骤：
获取多个兴趣点对应的保单数量；
根据子区域建议数量提取一个或多个兴趣点作为待拆分区域；及
根据待拆分区域对应的保单数量与子区域对应的保单建议数量对将待拆分区域进行拆分。
在一个实施例中，计算机可读指令被处理器执行时还执行以下步骤：
获取未规划区域中的兴趣点；
根据子区域建议数量在未规划区域中的兴趣点中提取一个或多个兴趣点；及
根据提取到的兴趣点对将未规划区域进行拆分。
在一个实施例中，计算机可读指令被处理器执行时还执行以下步骤：
接收终端发送的获取行政区域电子地图的请求；
根据请求将行政区域的电子地图返回至终端，电子地图中包括行政区域对应的未通过校验的多个子区域，以使得终端对电子地图中的子区域进行调节；及
接收终端返回的调节后的电子地图。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程，是可以通过计算机可读指令来指令相关的硬件来完成，所述的计算机可读指令可存储于非易失性计算机可读取存储介质中，该计算机可读指令在执 行时，可包括如上述各方法的实施例的流程。其中，所述的存储介质可为磁碟、光盘、只读存储记忆体(Read-Only Memory，ROM)等。
以上所述实施例的各技术特征可以进行任意的组合，为使描述简洁，未对上述实施例中的各个技术特征所有可能的组合都进行描述，然而，只要这些技术特征的组合不存在矛盾，都应当认为是本说明书记载的范围。
以上所述实施例仅表达了本申请的几种实施方式，其描述较为具体和详细，但并不能因此而理解为对发明专利范围的限制。应当指出的是，对于本领域的普通技术人员来说，在不脱离本申请构思的前提下，还可以做出若干变形和改进，这些都属于本申请的保护范围。因此，本申请专利的保护范围应以所附权利要求为准。

Claims (20)

  1. 一种行政区域划分验证方法，包括：
    获取行政区域的区域名称；
    根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
    获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；
    利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验；及
    若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    获取保单数据，所述保单数据中包括客户地址；
    识别客户地址对应的行政区域的区域名称；
    根据所述区域名称在电子地图中检索对应的区域边界；
    获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；及
    将多边形进行拼接，得到多个子区域。
  3. 根据权利要求1所述的方法，其特征在于，所述利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验的步骤包括：
    利用所述区域名称对应的保单数量计算所述行政区域对应的子区域建议数量；
    获取所述行政区域在电子地图中的子区域划分数量；
    判断所述子区域划分数量是否落入所述子区域建议数量对应的浮动范围；及
    若是，则进一步将所述浮动范围的最大值与所述路段数量进行比较；若所述浮动范围的最大值小于所述路段数量，则校验通过。
  4. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    若校验未通过，则对所述行政区域对应的多个路段进行扫描，获取路段对应的兴趣点；及
    根据所述兴趣点对所述行政区域的子区域进行调节。
  5. 根据权利要求4所述的方法，其特征在于，所述根据所述兴趣点对所述行政区域的子区域进行调节的步骤包括：
    获取多个兴趣点对应的保单数量；
    根据子区域建议数量提取一个或多个兴趣点作为待拆分区域；及
    根据待拆分区域对应的保单数量与子区域对应的保单建议数量对将所述待拆分区域进行拆分。
  6. 根据权利要求4所述的方法，其特征在于，所述子区域包括未规划区域；所述根据所述兴趣点对所述行政区域的子区域进行调节的步骤包括：
    获取未规划区域中的兴趣点；
    根据子区域建议数量在所述未规划区域中的兴趣点中提取一个或多个兴趣点；及
    根据提取到的兴趣点对将所述未规划区域进行拆分。
  7. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    接收终端发送的获取行政区域电子地图的请求；
    根据所述请求将行政区域的电子地图返回至终端，所述电子地图中包括行政区域对应的未通过校验的多个子区域，以使得终端对电子地图中的子区域进行调节；及
    接收终端返回的调节后的电子地图。
  8. 一种行政区域划分装置，包括：
    加载模块，用于获取行政区域的区域名称；根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
    校验模块，用于获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；利用所述区域名称对应的保单数量以及路段数量对所述 行政区域的多个子区域进行校验；及
    记录模块，用于若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
  9. 根据权利要求8所述的装置，其特征在于，所述装置还包括：
    区域划分模块，用于获取保单数据，所述保单数据中包括客户地址；识别客户地址对应的行政区域的区域名称；根据所述区域名称在电子地图中检索对应的区域边界；获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；及将多边形进行拼接，得到多个子区域。
  10. 根据权利要求8所述的装置，其特征在于，所述校验模块还用于利用所述区域名称对应的保单数量计算所述行政区域对应的子区域建议数量；获取所述行政区域在电子地图中的子区域划分数量；判断所述子区域划分数量是否落入所述子区域建议数量对应的浮动范围；及若是，则进一步将所述浮动范围的最大值与路段数量进行比较；若所述浮动范围的最大值小于路段数量，则校验通过。
  11. 一种服务器，包括存储器和一个或多个处理器，所述存储器中储存有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取行政区域的区域名称；
    根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
    获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；
    利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验；及
    若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
  12. 根据权利要求11所述的服务器，其特征在于，所述计算机可读指令 被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取保单数据，所述保单数据中包括客户地址；
    识别客户地址对应的行政区域的区域名称；
    根据所述区域名称在电子地图中检索对应的区域边界；
    获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；及
    将多边形进行拼接，得到多个子区域。
  13. 根据权利要求11所述的服务器，其特征在于，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    利用所述区域名称对应的保单数量计算所述行政区域对应的子区域建议数量；
    获取所述行政区域在电子地图中的子区域划分数量；
    判断所述子区域划分数量是否落入所述子区域建议数量对应的浮动范围；及
    若是，则进一步将所述浮动范围的最大值与所述路段数量进行比较；若所述浮动范围的最大值小于所述路段数量，则校验通过。
  14. 根据权利要求11所述的服务器，其特征在于，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若校验未通过，则对所述行政区域对应的多个路段进行扫描，获取路段对应的兴趣点；及
    根据所述兴趣点对所述行政区域的子区域进行调节。
  15. 根据权利要求14所述的服务器，其特征在于，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取多个兴趣点对应的保单数量；
    根据子区域建议数量提取一个或多个兴趣点作为待拆分区域；及
    根据待拆分区域对应的保单数量与子区域对应的保单建议数量对将所述待拆分区域进行拆分。
  16. 一个或多个存储有计算机可读指令的计算机可读非易失性存储介质，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器执行以下步骤：
    获取行政区域的区域名称；
    根据所述区域名称加载所述行政区域对应的电子地图；所述行政区域在电子地图中划分为多个子区域；
    获取与所述区域名称对应的保单数量以及与所述区域名称对应的路段数量；
    利用所述区域名称对应的保单数量以及路段数量对所述行政区域的多个子区域进行校验；及
    若校验通过，则将所述行政区域的多个子区域记录为合理子区域。
  17. 根据权利要求16所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取保单数据，所述保单数据中包括客户地址；
    识别客户地址对应的行政区域的区域名称；
    根据所述区域名称在电子地图中检索对应的区域边界；
    获取最小划分单元对应的多边形，利用所述多边形和区域边界在电子地图中对所述行政区域进行划分；及
    将多边形进行拼接，得到多个子区域。
  18. 根据权利要求16所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：利用所述区域名称对应的保单数量计算所述行政区域对应的子区域建议数量；
    获取所述行政区域在电子地图中的子区域划分数量；
    判断所述子区域划分数量是否落入所述子区域建议数量对应的浮动范围；及
    若是，则进一步将所述浮动范围的最大值与所述路段数量进行比较；若 所述浮动范围的最大值小于所述路段数量，则校验通过。
  19. 根据权利要求16所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    若校验未通过，则对所述行政区域对应的多个路段进行扫描，获取路段对应的兴趣点；及
    根据所述兴趣点对所述行政区域的子区域进行调节。
  20. 根据权利要求19所述的存储介质，其特征在于，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    获取多个兴趣点对应的保单数量；
    根据子区域建议数量提取一个或多个兴趣点作为待拆分区域；及
    根据待拆分区域对应的保单数量与子区域对应的保单建议数量对将所述待拆分区域进行拆分。
PCT/CN2017/108028 2017-07-28 2017-10-27 行政区域划分验证方法、装置、服务器和存储介质 Ceased WO2019019448A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
SG11201809546VA SG11201809546VA (en) 2017-07-28 2017-10-27 Verification method and device for division of administrative region, server and storage medium
US16/095,927 US20200143400A1 (en) 2017-07-28 2017-10-27 Verification method for division of administrative region, server and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710629604.6 2017-07-28
CN201710629604.6A CN107688891B (zh) 2017-07-28 2017-07-28 行政区域划分验证方法、装置、服务器和存储介质

Publications (1)

Publication Number Publication Date
WO2019019448A1 true WO2019019448A1 (zh) 2019-01-31

Family

ID=61153039

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/108028 Ceased WO2019019448A1 (zh) 2017-07-28 2017-10-27 行政区域划分验证方法、装置、服务器和存储介质

Country Status (4)

Country Link
US (1) US20200143400A1 (zh)
CN (1) CN107688891B (zh)
SG (1) SG11201809546VA (zh)
WO (1) WO2019019448A1 (zh)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109345947B (zh) * 2018-08-13 2022-02-22 中国平安人寿保险股份有限公司 基于数据关联性分析的工作区域划分方法及终端设备
CN109784634B (zh) * 2018-12-13 2024-08-02 中国平安人寿保险股份有限公司 服务区域划分方法、电子装置及可读存储介质
WO2021109026A1 (zh) * 2019-12-04 2021-06-10 哈尔滨海能达科技有限公司 调度系统资源树生成方法、装置、调度装置及计算机存储介质
CN111065115B (zh) * 2019-12-04 2023-03-14 哈尔滨海能达科技有限公司 调度系统资源树生成方法、调度装置及计算机存储介质
CN112559661B (zh) * 2020-12-09 2024-03-01 北京百度网讯科技有限公司 检索地址类型的方法、装置和电子设备
CN115545807B (zh) * 2022-12-02 2023-04-18 广州数说故事信息科技有限公司 商圈划分方法、装置、地理信息系统、终端设备及介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103366325A (zh) * 2013-03-14 2013-10-23 北京师范大学 巡查区域的监管方法及装置
CN106557829A (zh) * 2015-09-30 2017-04-05 百度在线网络技术（北京）有限公司 用车业务中获取需求与运力不匹配区域的方法和装置
CN106570917A (zh) * 2016-10-25 2017-04-19 先锋智道（北京）科技有限公司 车辆需求热力图生成方法和装置
CN106780064A (zh) * 2016-12-02 2017-05-31 腾讯科技（深圳）有限公司 一种区域划分方法、装置及网络设备

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2002951411A0 (en) * 2002-09-16 2002-09-26 The University Of Sydney Genotype screen
US11288633B2 (en) * 2010-04-02 2022-03-29 Vivint, Inc. Door to door sales management tool
EP2584504B9 (de) * 2011-10-20 2016-10-19 Deutsche Post AG Automatisches Zuordnen eines Suchgebiets zu einer Suchanfrage
CN103944932B (zh) * 2013-01-18 2017-07-14 阿里巴巴集团控股有限公司 搜索、确定活跃区域的方法与服务器
WO2015157584A1 (en) * 2014-04-10 2015-10-15 Fract, Inc. Systems and methods for identifying a region of interest on a map

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103366325A (zh) * 2013-03-14 2013-10-23 北京师范大学 巡查区域的监管方法及装置
CN106557829A (zh) * 2015-09-30 2017-04-05 百度在线网络技术（北京）有限公司 用车业务中获取需求与运力不匹配区域的方法和装置
CN106570917A (zh) * 2016-10-25 2017-04-19 先锋智道（北京）科技有限公司 车辆需求热力图生成方法和装置
CN106780064A (zh) * 2016-12-02 2017-05-31 腾讯科技（深圳）有限公司 一种区域划分方法、装置及网络设备

Also Published As

Publication number Publication date
US20200143400A1 (en) 2020-05-07
CN107688891B (zh) 2020-03-10
SG11201809546VA (en) 2019-02-27
CN107688891A (zh) 2018-02-13

Similar Documents

Publication Publication Date Title
WO2019019448A1 (zh) 行政区域划分验证方法、装置、服务器和存储介质
US11558429B2 (en) Data processing and scanning systems for generating and populating a data inventory
US11921894B2 (en) Data processing systems for generating and populating a data inventory for processing data access requests
US10181051B2 (en) Data processing systems for generating and populating a data inventory for processing data access requests
Groves et al. Developing key indicators for adaptive water planning
US20180315145A1 (en) Managing school systems on a blockchain
US20190129902A1 (en) Data processing systems for generating and populating a data inventory
US11586700B2 (en) Data processing systems and methods for automatically blocking the use of tracking tools
WO2019056710A1 (zh) 供应商推荐方法、装置及计算机可读存储介质
US12299065B2 (en) Data processing systems and methods for dynamically determining data processing consent configurations
US20200004762A1 (en) Data processing systems and methods for automatically detecting and documenting privacy-related aspects of computer software
CN107798450A (zh) 业务分配方法和装置
CN112580881B (zh) 营业网点选址方法、装置、计算机设备及存储介质
CN115280298A (zh) 防止敏感信息的公开
US10970675B2 (en) Data processing systems for generating and populating a data inventory
US20170308834A1 (en) Identifying changes in health and status of assets from continuous image feeds in near real time
KR101310420B1 (ko) 사용자가 정의 가능한 업무 절차 기반 도시 계획 관리 시스템 및 이를 위한 기록매체
US10229005B2 (en) Pattern based configuration method for minimizing the impact of component failures
US11138242B2 (en) Data processing systems and methods for automatically detecting and documenting privacy-related aspects of computer software
HK1249634A1 (zh) 行政区域划分验证方法、装置、服务器和存储介质
HK1249634B (zh) 行政区域划分验证方法、装置、服务器和存储介质
KR102961872B1 (ko) 커뮤니티 기반 한국 정착 지원 시스템 및 그 동작 방법
US20250231830A1 (en) Best hedging, utilization and validation of information (bhuvi) machine learning model
US11657226B2 (en) Detecting and mitigating bias in natural language processing
Denly et al. Inaccessibility and Compliance: Geography, Institutions, and Agency in Foreign Aid

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

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

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

122 Ep: pct application non-entry in european phase

Ref document number: 17919470

Country of ref document: EP

Kind code of ref document: A1