A computer system for store location selection and a store location selection method

Abstract

The present application discloses a computer system and a method for accurate store site selection, the computer system comprising: a first pre-selection interface, a loop execution component and a site selector, the first pre-selection interface is used to determine a single first honeycomb grid area and its first intersection area that have an intersection relationship with multiple store areas at the same time; the loop execution component is used to determine whether the first intersection areas have an intersection relationship, if so, the intersection area between every two first intersection areas with an intersection relationship is determined as a second intersection area, and the step of determining whether there is an intersection relationship is repeated until no two intersection areas have an intersection relationship, and a plurality of intersection areas are obtained in sequence; finally, the site selector can quickly and efficiently determine whether the first honeycomb grid area is a store opening area according to the sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas, thereby improving the accuracy of store site selection.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a computer system and a store site selection method for store site selection. Background Art

[0002] With the increasing development of the economy and society and the expansion of urban planning, it is particularly important for different merchants to determine the effective site selection area when selecting sites for opening stores. Most of the existing site selection systems support the drawing of store business districts, the drawing of blank business districts (areas where stores can be opened), and the analysis of blank business district data. In the factory store scenario, manual intervention is required to comprehensively consider factors such as population distribution, population structure, community distribution, traffic analysis, and geographical conditions to accurately plan the area where stores can be opened, as well as predict the radiation range and revenue forecast of stores in the area. However, with the increasing number of stores, it is obviously unreasonable to continue to accurately plan business districts through manual intervention, which is not only easy to cause deviations in site selection results, but also relatively low site selection efficiency.

[0003] Therefore, how to improve the accuracy of store location selection is a technical problem that needs to be urgently solved by technical personnel in this field. Summary of the invention

[0004] In view of this, the purpose of the present invention is to provide a computer system and a store location selection method for store location selection, which can improve the accuracy of store location selection. The specific scheme is as follows:

[0005] A first aspect of the present application provides a computer system for store site selection, comprising:

[0006] A first pre-selection interface is used to determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up stores, and a first intersection area between the first honeycomb grid area and each of the store areas;

[0007] A loop execution component is used to determine whether the first intersection areas have an intersection relationship. If yes, the intersection area between every two first intersection areas having an intersection relationship is determined as a second intersection area, and the step of determining whether there is an intersection relationship is repeatedly executed until no two intersection areas have an intersection relationship, thereby obtaining a plurality of intersection areas in sequence;

[0008] A site selector is used to determine the sum of the areas of odd-numbered intersection areas and the sum of the areas of even-numbered intersection areas among several intersection areas as the first area and the second area respectively, and determine the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas based on the area of ​​the first honeycomb grid area, the first area, and the second area, so as to determine whether the first honeycomb grid area is a business district area.

[0009] Optionally, the computer system for store location selection further includes:

[0010] The second pre-selection interface is used to determine a single second honeycomb grid area and its intersection area that has an intersection relationship with only one store area and has the possibility of setting up a store, so as to determine whether the second honeycomb grid area is a business district area.

[0011] Optionally, the determining whether the first intersecting areas have an intersecting relationship includes:

[0012] Each two first intersection regions are processed respectively by using a rapid repulsion experiment and a straddle experiment, and whether the first intersection regions have an intersection relationship is determined according to the experimental results.

[0013] Optionally, determining the intersection region between every two first intersection regions having an intersection relationship as a second intersection region includes:

[0014] The contour intersection points of every two first intersection areas having an intersection relationship are calculated using a vector method, and the corresponding second intersection area is determined by reversely sorting the contour vertices of the first intersection area and the coordinates of the contour intersection points.

[0015] Optionally, the step of respectively determining the first area and the second area by summing the areas of odd-numbered intersection areas and the areas of even-numbered intersection areas among the plurality of intersection areas comprises:

[0016] Use the shoelace theorem to calculate the area of ​​each intersection region to obtain the area corresponding to several intersection regions;

[0017] The sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas among the areas corresponding to the several intersection areas are determined as the first area and the second area, respectively.

[0018] Optionally, the determining, based on the area of ​​the first honeycomb grid area, the first area, and the second area, the target area in the first honeycomb grid area that does not intersect with any of the store areas includes:

[0019] Performing a difference calculation on the area of ​​the first honeycomb grid region and the first area, and performing a sum calculation on the result of the difference calculation and the second area;

[0020] The target area in the first honeycomb grid area that does not intersect with any of the store areas is determined according to the result of the sum calculation.

[0021] Optionally, the determining whether the first honeycomb grid area is a business district area includes:

[0022] It is determined whether the target area accounts for an area of ​​the first honeycomb grid area that is lower than a preset threshold. If so, the first honeycomb grid area is determined to be a business district area.

[0023] A second aspect of the present application provides a store location selection method, based on the aforementioned computer system, comprising:

[0024] Determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up stores, and a first intersection area between the first honeycomb grid area and each of the store areas;

[0025] Determine whether the first intersection regions have an intersection relationship, and if so, determine the intersection region between every two first intersection regions that have an intersection relationship as a second intersection region, and repeat the step of determining whether there is an intersection relationship until no two intersection regions have an intersection relationship, thereby obtaining a plurality of second intersection regions in sequence;

[0026] The sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas among the several intersection areas are respectively determined as the first area and the second area, and the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas is determined based on the area of ​​the first honeycomb grid area, the first area, and the second area to determine whether the first honeycomb grid area is a business district area.

[0027] A third aspect of the present application provides an electronic device, comprising a processor and a memory; wherein the memory is used to store a computer program, and the computer program is loaded and executed by the processor to implement the aforementioned store location selection method.

[0028] A fourth aspect of the present application provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are loaded and executed by a processor, the aforementioned store location selection method is implemented.

[0029] In the present application, a computer system for store site selection includes: a first pre-selection interface, used to determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up a store, and a first intersection area between the first honeycomb grid area and each of the store areas; a loop execution component, used to determine whether the first intersection areas have an intersection relationship, and if so, determine the intersection area between every two of the first intersection areas with an intersection relationship as a second intersection area, and repeat the step of determining whether there is an intersection relationship until no two intersection areas have an intersection relationship, thereby obtaining several intersection areas in sequence; a site selector, used to determine the sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas in several intersection areas as the first area and the second area, respectively, and determine the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas based on the area of ​​the first honeycomb grid area, the first area, and the second area, so as to determine whether the first honeycomb grid area is a business district area. The present application preliminarily screens out honeycomb grid areas with multiple intersecting areas through the first pre-selection interface, and then uses a loop execution component to repeatedly determine the areas where the intersecting areas intersect again until there is no intersection relationship and stops the loop. Finally, the site selector can quickly and efficiently determine whether the honeycomb grid area preliminarily screened by the first pre-selection interface is a store opening area based on the area of ​​the intersecting area obtained by the odd and even execution loops, thereby improving the accuracy of store site selection. The present application also provides a store site selection method based on the above-mentioned computer system, which also has the above-mentioned advantages and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0031] Figure 1 A computer system architecture diagram for store location selection provided for this application;

[0032] Figure 2 A schematic diagram of a first intersection area provided for this application;

[0033] Figure 3 A schematic diagram illustrating a rapid rejection experiment provided for this application;

[0034] Figure 4 A schematic diagram illustrating a straddling experiment provided for this application;

[0035] Figure 5 A schematic diagram illustrating the critical state of a straddle experiment provided in this application;

[0036] Figure 6 A flow chart of a store location selection method provided for this application;

[0037] Figure 7 A structural diagram of a store location electronic equipment provided for this application. DETAILED DESCRIPTION

[0038] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0039] Most of the existing site selection systems support the mapping of store business districts, the mapping of blank business districts (areas where stores can be opened), and the analysis of blank business district data. In the factory store scenario, manual intervention is required to comprehensively consider factors such as population distribution, population structure, community distribution, traffic flow analysis, and geographical conditions to accurately plan the area where stores can be opened, as well as to predict the radiation range and revenue forecast of stores in the area. However, as the number of stores increases, it is obviously unreasonable to continue to accurately plan business districts through manual intervention, which is not only likely to lead to deviations in site selection results, but also relatively low site selection efficiency. In response to the above technical defects, the present application provides a computer system for accurate store location selection, including a first pre-selection interface, a loop execution component and a site selector. The first pre-selection interface is used to determine a single first honeycomb grid area and its first intersection area that have an intersection relationship with multiple store areas at the same time; the loop execution component is used to determine whether the first intersection areas have an intersection relationship. If so, the intersection area between every two first intersection areas with an intersection relationship is determined as the second intersection area, and the step of determining whether there is an intersection relationship is repeated until no two intersection areas have an intersection relationship, and several intersection areas are obtained in sequence; finally, the site selector can quickly and efficiently determine whether the first honeycomb grid area is a store opening area based on the sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas, thereby improving the accuracy of store location selection. At the same time, the present application also provides a store location selection scheme based on the above computer system, which also has the above advantages and will not be repeated here.

[0040] Figure 1 A computer system architecture diagram for store location selection provided in an embodiment of the present application. Figure 1 As shown, the computer system for store site selection includes a first pre-selection interface 01, a loop execution component 02 and a site selector 03.

[0041] The first pre-selection interface 01 is used to determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up stores, and the first intersection area between the first honeycomb grid area and each of the store areas.

[0042] In this embodiment, the first honeycomb grid area is also a blank business district. The honeycomb grid is a regular hexagon generated based on the geographic index (UberH3). The regular hexagon obtained after a series of screening of the honeycomb grid is the blank business district. H3 is a grid-based geographic spatial index, but unlike the ordinary matrix grid index, each of its grids is a hexagon. The store area (store business district) is a regular quadrilateral generated with the store as the center and different values ​​according to different services. The first honeycomb grid area obtained by screening the first pre-selection interface 01 is as follows: Figure 2 The regular hexagon and square shown in the figure are the store areas, and the first honeycomb grid area intersects with multiple store areas. Of course, in addition to the regular hexagon and square set in this embodiment, honeycomb grid areas and store areas of other shapes can achieve the same effect as the setting of this embodiment, and this application does not limit this. Regardless of which polygon is used, the vertex coordinates use geographical longitude and latitude, similar to x and y on the coordinate axis, which facilitates the construction of polygons and the calculation of coordinate axes.

[0043] In this embodiment, the first pre-selection interface 01 mainly calculates which store business districts intersect with which blank business districts, and stores the intersection ratio and intersection relationship, and screens out blank business districts that intersect with multiple store business districts to reduce the amount of subsequent calculations. For a blank business district that only intersects with one store business district, it can be directly judged whether the blank business district is valid based on the intersection store ratio. Therefore, the computer system can also include a second pre-selection interface, which is used to determine a single second honeycomb grid area and its intersection area that has an intersection relationship with only one store area and has the possibility of setting up a store, so as to determine whether the second honeycomb grid area is a business district area. Specifically, the honeycomb grid near the point can be calculated in units of honeycomb grid layers according to the size of the store center store and the store business district, that is, the honeycomb grid that may intersect is calculated. In addition, the above process necessarily needs to determine whether the two areas have an intersection relationship, which is consistent with the judgment method in the following loop execution component 02, and specifically refer to the corresponding content disclosed in the following embodiment.

[0044] The loop execution component 02 is used to determine whether there is an intersection relationship between the first intersection areas. If so, the intersection area between every two first intersection areas with an intersection relationship is determined as a second intersection area. The step of determining whether there is an intersection relationship is repeated until there is no intersection relationship between any two intersection areas, and a plurality of intersection areas are obtained in sequence.

[0045] In this embodiment, specifically, the quick rejection test and the straddle test can be used to process each pair of the first intersection regions, and based on the test results, it is determined whether there is an intersection relationship between the first intersection regions. Judging whether two regions intersect is equivalent to judging whether two line segments in space intersect, which can be achieved through the quick rejection test and the straddle test. The intersection relationship is obtained through traversal calculation and stored in the database. Figure 3 Figure for illustrating the quick rejection test, as Figure 3 shown, it is judged whether the projections of the two line segments on the x and y coordinates overlap, that is, it is judged whether the end point with the larger x value in the next line segment is less than the end point with the smaller x value in the other line segment. If so, it means that the two line segments definitely have no intersection point. Similarly, the y coordinate is judged. The pseudocode is: max(C.x, D.x) < min(A.x, B.x) || max(C.y, D.y) < min(A.y, B.y) || max(A.x, B.x) < min(C.x, D.x) || max(A.y, B.y) < min(C.y, D.y). If one of the above four judgments is true, it means that the two line segments definitely do not intersect, otherwise, the straddle test is performed for judgment. Obviously, Figure 3 the two line segments in cannot pass the quick rejection test.

[0046] The straddle test mainly judges whether line segments intersect by measuring the cross product. Let the measured points be P(x1, y1) and Q(x2, y2), then the measured cross product is defined as: P x Q = x1y2 - x2y1, and the result is a vector, which is the normal vector of the plane where the PQ vector is located. Obviously, there are properties: P x Q = -(Q x P), P x (-Q) = -(P x Q); if P x Q > 0, then P is in the clockwise direction of Q; if P x Q < 0, then P is in the counterclockwise direction of Q; if P x Q = 0, then P and Q are collinear, but they may be in the same direction or in the opposite direction. The intersection of two line segments means that they straddle each other. As Figure 4 shown, point A and point B are respectively on both sides of line segment CD, and point C and point D are respectively on both sides of line segment AB, that is, vectors A - D and B - D are respectively at both ends of vector C - D, that is, their cross products have different signs. At the same time, it is also necessary to prove that point C and point D are at both ends of line segment AB. If both conditions are satisfied, it means that the line segments intersect. In addition, critical cases need to be considered, that is, the case when the cross product of the two line segments is equal to zero, as Figure 5 shown.

[0047] In this embodiment, the vector method is used to calculate the contour intersection points of each two first intersection areas having an intersection relationship, and the corresponding second intersection area is determined by reversely sorting the contour vertices of the first intersection area and the coordinates of the contour intersection points. The second intersection area is determined in the same process as the first intersection area. For ease of understanding, the second intersection area is still determined in the same way. Figure 2 Take the example to illustrate the determination process of the first intersection area and the second intersection area. First, obtain the intersection point between the contours of the two areas. It is difficult to handle the special case of a slope of 0 by using the plane geometry method and the point-slope equation, and multiple divisions will occur during the calculation, making it difficult to ensure accuracy. This embodiment uses the vector method to solve, assuming that the intersection point is (x0, y0), then the following set of equations must hold:

[0048]

[0049] Among them, k1 and k2 are any constants that are not 0 (if they are 0, it means that there are overlapping endpoints, which has been ruled out above). Relating equation 1 with equation 2, and combining equation 3 with equation 4, eliminating k1 and k2, we can get:

[0050] x0(y2-y1)-x1(y2-y1)=y0(x2-x1)-y1(x2-x1);

[0051] x0(y4-y3)-x3(y4-y3)=y0(x4-x3)-y3(x4-x3);

[0052] Move the terms containing the unknowns x0 and y0 to the left and the constant terms to the right, and we get:

[0053] (y2-y1)x0+(x1-x2)y0=(y2-y1)x1+(x1-x2)y1;

[0054] (y4-y3)x0+(x3-x4)y0=(y4-y3)x3+(x3-x4)y3;

[0055] Assume the two constant terms are b1 and b2:

[0056] b1=(y2-y1)x1+(x1-x2)y1

[0057] b2=(y4-y3)x3+(x3-x4)y3

[0058] The coefficient determinant is D. Substituting b1 and b2 for the coefficient of x0 gives D1, and substituting b1 and b2 for the coefficient of y0 gives D2. Then we have:

[0059] |D|=(x2-x1)(y4-y3)-(x4-x3)(y2-y1)

[0060] |D1|=b2(x2-x1)-b1(x4-x3)

[0061] |D2|=b2(y2-y1)-b1(y4-y3)

[0062] Thus, the coordinates of the intersection point can be obtained as: x0=|D1| / |D|, y0=|D2| / |D|.

[0063] Based on the above calculation process, Figure 2 The intersection points of the square 2 and the regular hexagon 1 are A, B, and C, and all the intersection points of other figures are obtained by analogy. Since the result of the intersection of convex polygons is still a convex polygon, the intersection set is sorted in reverse order, and the graphics ABC, graphics DEGF, graphics JVOK, graphics QLS, and graphics WUTM are obtained in the order of vector marking points, which is the first intersection area. At this time, the loop execution component 02 determines that there is still an intersection relationship between the first intersection areas. In the same way, the intersecting graphics are intersected in pairs again to obtain graphics VHGI, graphics QRKL, and graphics NMPO, which is the second intersection area. It is determined again that the three graphics do not intersect, and the first intersection area and the second intersection area are obtained in turn. When the intersection relationship is more complicated, the second intersection area still has an intersection relationship. The same method is used to obtain the third intersection area until the Nth intersection area, that is, several intersection areas.

[0064] The site selector 03 is used to determine the sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas among several intersection areas as the first area and the second area, respectively, and determine the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas based on the area of ​​the first honeycomb grid area, the first area, and the second area, so as to determine whether the first honeycomb grid area is a business district area.

[0065] In this embodiment, the shoelace theorem can be used to calculate the area of ​​each intersection region to obtain the area corresponding to a number of intersection regions; wherein the shoelace theorem is a theorem for calculating the area of ​​any polygonal figure, and the formula is expressed as:

[0066]

[0067] Then, the sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas in the areas corresponding to the several intersection areas are respectively determined as the first area and the second area. Since the above example only has one odd-numbered intersection area and one even-numbered intersection area, the first area is the sum of the areas of the graphics ABC, DEGF, JVOK, QLS, and WUTM, and the second area is the sum of the areas of the graphics VHGI, QRKL, and NMPO. On this basis, the area of ​​the first honeycomb grid area is calculated by difference from the first area, and the result of the difference calculation is calculated by summation with the second area. The target area area in the first honeycomb grid area that does not intersect with any of the store areas is determined according to the result of the summation calculation. The target area area formula is expressed as: S=S (regular hexagon) S=S1-S (sum of the areas of the odd-numbered intersection figures) + S (sum of the areas of the even-numbered intersection figures).

[0068] Finally, determine whether the area of ​​the target area accounts for the area of ​​the first honeycomb grid area is lower than a preset threshold. If so, determine that the first honeycomb grid area is a business district area. The difficulty of calculating the intersection of multiple graphics is solved, and finally obtains the ratio of the area not covered by a polygon, that is, the area of ​​the blank business district that is not covered by the store business district is lower than a certain percentage, then it is determined to be a valid business district. In summary, the computer and system in this embodiment are based on the cooperative authentication business scenario. With the support of the underlying honeycomb grid, population, DAU and other data, it can automatically plan the business district and generate the business district area where the store can be opened. Finally, the system can achieve the generation and incremental update of the cooperative authentication blank business district without adjusting the basic algorithm, so as to provide data models and visualization tools for the business party to formulate store opening strategies.

[0069] It can be seen that in the embodiment of the present application, the computer system for store site selection includes: a first pre-selection interface, which is used to determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up a store, and a first intersection area between the first honeycomb grid area and each of the store areas; a loop execution component, which is used to determine whether the first intersection areas have an intersection relationship, and if so, determine the intersection area between every two of the first intersection areas that have an intersection relationship as a second intersection area, and repeat the step of determining whether there is an intersection relationship until there is no intersection relationship between any two intersection areas, thereby obtaining several intersection areas in sequence; a site selector, which is used to determine the sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas in several intersection areas as the first area and the second area, respectively, and determine the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas based on the area of ​​the first honeycomb grid area, the first area, and the second area, so as to determine whether the first honeycomb grid area is a business district area. The embodiment of the present application preliminarily screens out honeycomb grid areas with multiple intersecting areas through a first pre-selection interface, and then uses a loop execution component to repeatedly determine the areas where the intersecting areas intersect again until the loop is stopped when there is no intersection relationship. Finally, the site selector can quickly and efficiently determine whether the honeycomb grid area preliminarily screened by the first pre-selection interface is suitable for setting up a store based on the areas of the intersecting areas obtained by executing the loop for odd and even times, thereby improving the accuracy of store site selection.

[0070] Figure 6 A flow chart of a store location selection method provided in an embodiment of the present application. Figure 6 As shown, the store location selection method is based on the aforementioned computer system and includes:

[0071] S11: Determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up stores, and a first intersection area between the first honeycomb grid area and each of the store areas.

[0072] S12: Determine whether the first intersection areas have an intersection relationship. If so, determine the intersection area between every two first intersection areas that have an intersection relationship as a second intersection area. Repeat the step of determining whether there is an intersection relationship until no two intersection areas have an intersection relationship, and obtain several intersection areas in sequence.

[0073] S13: Determine the first area and the second area as the sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas among the several intersection areas, respectively, and determine the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas based on the area of ​​the first honeycomb grid area, the first area, and the second area, so as to determine whether the first honeycomb grid area is a business district area.

[0074] In this embodiment, the site selection function for opening a store provides a store opening area planned based on factors such as population distribution, daily activity, traffic flow, and vehicle ownership. In practice, each store opening area may already contain stores that have already been opened. In order to make the prediction of the store opening area range more accurate, through steps S11-S13 and based on the aforementioned computer system, the radiation range of the stores that have been opened in a store opening area can be calculated. When the coverage area is less than a specified threshold, it is a valid store opening area. For the specific process of the above steps S11-S13, reference can be made to the corresponding content disclosed in the aforementioned embodiment, and no further description will be given here.

[0075] Furthermore, an embodiment of the present application also provides an electronic device. Figure 7 This is a structural diagram of an electronic device 20 according to an exemplary embodiment. The content in the diagram cannot be regarded as any limitation on the scope of use of the present application.

[0076] Figure 7 A schematic diagram of the structure of an electronic device 20 provided in an embodiment of the present application. The electronic device 20 may specifically include: at least one processor 21, at least one memory 22, a power supply 23, a communication interface 24, an input / output interface 25, and a communication bus 26. The memory 22 is used to store a computer program, which is loaded and executed by the processor 21 to implement the relevant steps in the store location selection method disclosed in any of the aforementioned embodiments.

[0077] In this embodiment, the power supply 23 is used to provide working voltage for each hardware device on the electronic device 20; the communication interface 24 can create a data transmission channel between the electronic device 20 and the external device, and the communication protocol it follows is any communication protocol that can be applied to the technical solution of the present application, and is not specifically limited here; the input and output interface 25 is used to obtain external input data or output data to the outside world, and its specific interface type can be selected according to specific application needs and is not specifically limited here.

[0078] In addition, the memory 22, as a carrier for storing resources, can be a read-only memory, a random access memory, a disk or an optical disk, etc. The resources stored thereon may include an operating system 221, a computer program 222 and data 223, etc. The storage method can be temporary storage or permanent storage.

[0079] The operating system 221 is used to manage and control the hardware devices and computer programs 222 on the electronic device 20, so as to realize the operation and processing of the massive data 223 in the memory 22 by the processor 21, which can be Windows Server, Netware, Unix, Linux, etc. In addition to including a computer program that can be used to complete the store location selection method performed by the electronic device 20 disclosed in any of the aforementioned embodiments, the computer program 222 can further include a computer program that can be used to complete other specific tasks. The data 223 can include regional data collected by the electronic device 20.

[0080] Furthermore, an embodiment of the present application also discloses a storage medium, in which a computer program is stored. When the computer program is loaded and executed by a processor, the steps of the store location selection method disclosed in any of the aforementioned embodiments are implemented.

[0081] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part.

[0082] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the statement "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0083] The computer system for store site selection and the store site selection method provided by the present invention are introduced in detail above. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea; at the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A computer system for store location selection, characterized in that: include: A first pre-selection interface is used to determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up stores, and a first intersection area between the first honeycomb grid area and each of the store areas; A loop execution component is used to determine whether the first intersection areas have an intersection relationship. If yes, the intersection area between every two first intersection areas having an intersection relationship is determined as a second intersection area, and the step of determining whether there is an intersection relationship is repeatedly executed until no two intersection areas have an intersection relationship, thereby obtaining a plurality of intersection areas in sequence; A site selector is used to determine the sum of the areas of odd-numbered intersection areas and the sum of the areas of even-numbered intersection areas among several intersection areas as the first area and the second area respectively, and determine the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas based on the area of ​​the first honeycomb grid area, the first area, and the second area, so as to determine whether the first honeycomb grid area is a business district area.

2. The computer system for store location selection according to claim 1, characterized in that: Also includes: The second pre-selection interface is used to determine a single second honeycomb grid area and its intersection area that has an intersection relationship with only one store area and has the possibility of setting up a store, so as to determine whether the second honeycomb grid area is a business district area.

3. The computer system for store location selection according to claim 1, characterized in that: The determining whether the first intersecting areas have an intersecting relationship includes: Each two first intersection regions are processed respectively by using a rapid repulsion experiment and a straddle experiment, and whether the first intersection regions have an intersection relationship is determined according to the experimental results.

4. The computer system for store location selection according to claim 3, characterized in that: The step of determining the intersection region between every two first intersection regions having an intersection relationship as a second intersection region comprises: The contour intersection points of every two first intersection areas having an intersection relationship are calculated using a vector method, and the corresponding second intersection area is determined by reversely sorting the contour vertices of the first intersection area and the coordinates of the contour intersection points.

5. The computer system for store location selection according to claim 4, characterized in that: The sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas among the plurality of intersection areas are respectively determined as the first area and the second area, comprising: Use the shoelace theorem to calculate the area of ​​each intersection region to obtain the area corresponding to several intersection regions; The sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas among the areas corresponding to the several intersection areas are determined as the first area and the second area, respectively.

6. The computer system for store location selection according to any one of claims 1 to 5, characterized in that: The determining of the target area in the first honeycomb grid area that does not intersect with any of the store areas based on the area of ​​the first honeycomb grid area, the first area, and the second area includes: Performing a difference calculation on the area of ​​the first honeycomb grid region and the first area, and performing a sum calculation on the result of the difference calculation and the second area; The target area in the first honeycomb grid area that does not intersect with any of the store areas is determined according to the result of the sum calculation.

7. The computer system for store location selection according to claim 6, characterized in that: The determining whether the first honeycomb grid area is a business district area includes: It is determined whether the target area accounts for an area of ​​the first honeycomb grid area that is lower than a preset threshold. If so, the first honeycomb grid area is determined to be a business district area.

8. A store location selection method, characterized in that: The computer system according to any one of claims 1 to 7, comprising: Determine a single first honeycomb grid area that has an intersection relationship with multiple store areas and has the possibility of setting up stores, and a first intersection area between the first honeycomb grid area and each of the store areas; Determine whether the first intersection regions have an intersection relationship, and if so, determine the intersection region between every two first intersection regions that have an intersection relationship as a second intersection region, and repeat the step of determining whether there is an intersection relationship until no two intersection regions have an intersection relationship, thereby obtaining a plurality of second intersection regions in sequence; The sum of the areas of the odd-numbered intersection areas and the sum of the areas of the even-numbered intersection areas among the several intersection areas are respectively determined as the first area and the second area, and the area of ​​the target area in the first honeycomb grid area that does not intersect with any of the store areas is determined based on the area of ​​the first honeycomb grid area, the first area, and the second area to determine whether the first honeycomb grid area is a business district area.

9. An electronic device, characterized in that: The electronic device includes a processor and a memory; wherein the memory is used to store a computer program, and the computer program is loaded and executed by the processor to implement the store location selection method as described in claim 8.

10. A computer-readable storage medium, characterized in that: Used to store computer executable instructions, which, when loaded and executed by a processor, implement the store location selection method as claimed in claim 8.

Images