Store position determination method and device, electronic equipment, storage medium and program product

By diluting the user's location into a coarse-grained unit area, and through expansion processing and cross-mutation optimization, the problems of large calculation volume and low efficiency in the existing technology are solved, and efficient and low-cost determination of store locations are achieved.

CN119090552APending Publication Date: 2024-12-06NAVINFO
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411197271.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-29
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

When determining the location of a store, the prior art processes fine-grained data of the user's specific location during the calculation process, resulting in large calculation volume, long calculation time, low efficiency and high cost.

Method used

By diluting the user's location into coarse-grained unit areas, the initial set of area combinations is obtained, and the most reasonable store location is determined through expansion processing and cross-mutation optimization until the preset conditions are met.

Benefits of technology

The store location determination with high computing efficiency and low cost is achieved. Reasonable candidate locations are retained through the iterative optimization process, unreasonable locations are eliminated, new candidate locations are introduced, and a more reasonable final store location is obtained.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090552A_ABST
    Figure CN119090552A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a store position determination method and device, electronic equipment, a storage medium and a program product. The method comprises the steps that an initial region combination set is obtained, the initial region combination set comprises a plurality of unit region combinations, and each unit region combination comprises a plurality of unit regions; then repeatedly executing the following steps until a first preset condition is met: performing expansion processing on the area of each unit region to obtain a first position region; and the fitness value of the unit area combination is calculated according to the first position area. When a first preset condition is met, the central point of the unit region in the unit region combination with the lowest fitness value in the obtained updated initial region combination set is used for building a store. The method is used for achieving the effects of high efficiency and low cost of generating the position of the store needing to be built.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a method, device, electronic device, storage medium and program product for determining a store location. Background Art

[0002] As consumption levels continue to rise, the demand for various stores is also increasing, such as shopping malls, car shops, restaurants, etc.

[0003] In the prior art, the location of each user is obtained, and the location represents the specific location of the user; and the location of the candidate store is determined; calculations are performed based on the specific location of each user and the location of the candidate store, and finally the location of the store to be built is obtained.

[0004] However, in the above method, during the calculation process, fine-grained data such as the specific location of each user is calculated, resulting in a large amount of calculation and a long calculation time; which in turn results in inefficiency and high cost in obtaining the location of the required store. Summary of the invention

[0005] The embodiments of the present application provide a method, device, electronic device, storage medium and program product for determining store locations, so as to achieve the effect of high efficiency and low cost in generating locations where stores need to be built.

[0006] In a first aspect, an embodiment of the present application provides a method for determining a store location, including:

[0007] Acquire an initial region combination set, wherein the initial region combination set includes a plurality of unit region combinations, and the unit region combination includes a plurality of unit regions;

[0008] Repeat the following steps until the first preset condition is reached:

[0009] For each unit area combination, the area of ​​the unit area in the unit area combination is expanded to obtain a first position area corresponding to the unit area in the unit area combination; and the fitness value of the unit area combination is determined according to the first position area corresponding to the unit area in the unit area combination;

[0010] Performing cross mutation processing on the unit regions in the unit region combination to obtain an updated initial region combination set;

[0011] Among them, the first preset condition is to reach a preset number of iterations; or, the first preset condition is that the rate of change of the fitness value of the unit area combination in the updated initial area combination set is less than a preset change rate; when the first preset condition is reached, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for building the store.

[0012] In a second aspect, an embodiment of the present application provides a device for determining a store location, including:

[0013] An acquisition module, used for acquiring an initial region combination set, wherein the initial region combination set includes a plurality of unit region combinations, and the unit region combination includes a plurality of unit regions;

[0014] Repeat the following steps until the first preset condition is reached:

[0015] A first processing module is used for performing expansion processing on the area of ​​a unit area in each unit area combination to obtain a first position area corresponding to the unit area in the unit area combination;

[0016] A determination module, configured to determine a fitness value of the unit area combination according to a first position area corresponding to a unit area in the unit area combination;

[0017] A second processing module is used to perform cross mutation processing on the unit regions in the unit region combination to obtain an updated initial region combination set;

[0018] Among them, the first preset condition is to reach a preset number of iterations; or, the first preset condition is that the rate of change of the fitness value of the unit area combination in the updated initial area combination set is less than a preset change rate; when the first preset condition is reached, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for building the store.

[0019] In a third aspect, an embodiment of the present application provides an electronic device, comprising: a processor, and a memory communicatively connected to the processor;

[0020] The memory stores computer-executable instructions;

[0021] The processor executes the computer-executable instructions stored in the memory, so that the processor executes the above first aspect and / or various possible implementations of the first aspect.

[0022] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the first aspect above and / or various possible implementations of the first aspect.

[0023] In a fifth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the above first aspect and / or various possible implementation methods of the first aspect.

[0024] The store location determination method, device, electronic device, storage medium and program product provided in the embodiments of the present application are achieved by thinning out multiple user locations in a preset location area into coarse-grained unit areas, and then obtaining an initial area combination set, wherein the initial area combination set includes multiple unit area combinations, and the unit area combination includes multiple unit areas.

[0025] Repeat the following steps until the first preset condition is reached:

[0026] For each unit area combination, the area of ​​the unit area in the unit area combination is expanded to obtain the first position area corresponding to the unit area in the unit area combination; and the fitness value of the unit area combination is calculated according to the first position area corresponding to the unit area in the unit area combination. The unit areas in the unit area combination are cross-mutated (i.e., the unit area combination with a smaller fitness value in the previous iteration is retained, the unit area combination with a larger fitness value in the previous iteration is eliminated, and then the unit area combination with a smaller fitness value in the previous iteration is changed and reorganized to obtain a new unit area combination) to obtain an updated initial area combination set. Among them, the first preset condition is that the preset number of iterations is reached; or the first preset condition is that the change rate of the fitness value of the unit area combination in the obtained area combination set is less than the preset change rate. When the first preset condition is reached, the center point of the unit area in the unit area combination with the lowest fitness value in the obtained area combination set is fed back to the user for store construction.

[0027] Since the above calculation process is to calculate and process the coarse-grained unit areas, the amount of calculation is small and the calculation time is short; thus, the location of the required store is obtained with high efficiency and low cost. Moreover, when the first preset condition is not met, the unit areas in the unit area combination are cross-mutated to obtain the area combination set used in the next iteration. This processing can retain reasonable candidate locations for store construction, eliminate unreasonable candidate locations for store construction, and introduce new candidate locations for store construction during the iteration process, thereby realizing continuous optimization of the area combination set, and making the location of the store construction required to be obtained more reasonable. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0029] Figure 1 A flowchart of a method for determining a store location provided in this application;

[0030] Figure 2 A schematic diagram of the preset location area and unit area provided for this application;

[0031] Figure 3 Schematic diagram of unit area combination and area combination set provided for this application;

[0032] Figure 4 Schematic diagram of the first location area provided in this application Figure 1 ;

[0033] Figure 5 A flowchart of another method for determining store locations provided for this application;

[0034] Figure 6 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 1 ;

[0035] Figure 7 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 2 ;

[0036] Figure 8 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 3 ;

[0037] Fig. 9 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 4 ;

[0038] Fig.10Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 5 ;

[0039] Fig.11 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 6 ;

[0040] Fig.12 Schematic diagram of the first location area provided in this application Figure 2 ;

[0041] Fig.13 A schematic diagram of a second location area provided for this application;

[0042] Fig.14 A schematic diagram of the structure of a device for determining a store location provided in this application;

[0043] Fig.15 A schematic diagram of the structure of the electronic device provided in this application.

[0044] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0045] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0046] As the demand for stores such as shopping malls, car dealerships, and restaurants grows, it is necessary to determine the locations where stores need to be built.

[0047] In one example, the location of each user can be obtained, which represents the specific location of the user when he sets out to go to the store, such as the location of the user's home; and the locations of candidate stores can be determined, for example, the locations of candidate stores can be determined manually based on experience; then, calculations are performed based on the specific location of each user and the locations of candidate stores to obtain the locations of the stores to be built.

[0048] However, the above method calculates fine-grained data such as the specific location of each user during the calculation process, resulting in a large amount of calculation and a long calculation time; which in turn results in inefficiency and high cost in obtaining the locations of the required stores.

[0049] The method for determining the store location provided in the present application extracts the specific location of the user into coarse-grained data, and then performs calculations based on the coarse-grained specific location data of the user, and finally obtains the location of the store to be built. Since the calculation process is performed on the coarse-grained specific location data of the user, the amount of calculation is small and the calculation time is short; thus, the location of the store to be built is obtained efficiently and at a low cost. Moreover, during the calculation process, through multiple iterations, each iteration optimizes the candidate store location in the previous iteration, thereby making the final location of the store to be built more reasonable.

[0050] The technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems are described in detail below with specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.

[0051] Figure 1 A flow chart of a method for determining a store location provided in this application, such as Figure 1 As shown, the method includes:

[0052] S101. Acquire an initial region combination set, wherein the initial region combination set includes a plurality of unit region combinations, and the unit region combination includes a plurality of unit regions.

[0053] Exemplarily, the execution subject of this embodiment can be a server, or a terminal device, or an electronic device, or a store location determination device or device, or other devices or equipment that can implement the solution of this application, without limitation. Among them, the server can be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services ("Virtual Private Server", or "VPS" for short). The server can also be a server of a distributed system, or a server combined with a blockchain.

[0054] This embodiment is introduced with the execution subject being a server.

[0055] For example, the unit area may be a geographical area covering the user locations of multiple users, and the unit area may belong to a preset location area, which may be understood as an area where a store is to be built, such as the area of ​​a certain city. First, the server may divide the preset location area into multiple unit areas of the same shape and area. Figure 2 To understand, Figure 2 A schematic diagram of the preset location area and unit area provided for this application, such as Figure 2 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Figure 2 The hexagon in is a unit area, and each unit area covers the user locations of multiple users, where the user location can be understood as the location of the user's home.

[0056] The server obtains an initial set of area combinations, wherein the initial set of area combinations includes multiple unit area combinations, each unit area combination includes one or more unit areas, and the center point of each unit area can be understood as the location of a candidate store. Figure 3 To understand, Figure 3 A schematic diagram of the unit area combination and area combination set provided for this application.

[0057] like Figure 3 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Figure 3 Each hexagon in is a unit area. Figure 3 The unit area combination M11 represented by (a) includes unit areas M111, M112, M113, M114, M115, and M116; Figure 3 The unit area combination M12 represented by (b) includes a unit area M121, a unit area M122, a unit area M123, a unit area M124, a unit area M125, and a unit area M126; Figure 3 The unit area combination M13 represented by (c) includes a unit area M131, a unit area M132, a unit area M133, a unit area M134, a unit area M135, and a unit area M136; Figure 3 The unit area combination M14 represented by (d) includes a unit area M141, a unit area M142, a unit area M143, a unit area M144, a unit area M145, and a unit area M146; Figure 3 The unit area combination M15 represented by (e) includes a unit area M151, a unit area M152, a unit area M153, a unit area M154, a unit area M155, and a unit area M156; Figure 3The unit area combination M16 indicated by (f) includes a unit area M161 , a unit area M162 , a unit area M163 , a unit area M164 , a unit area M165 , and a unit area M166 .

[0058] Figure 3 The initial region combination set D1 includes Figure 3 The unit area combination M11 represented by (a) Figure 3 The unit area combination M12 represented by (b) Figure 3 The unit area combination M13 represented by (c) Figure 3 The unit area combination M14 represented by (d) Figure 3 The unit area combination M15 represented by (e) Figure 3 The unit area combination M16 represented by (f) in the figure.

[0059] When the server first obtains the initial area combination set, for example, it may select unit areas with a high user density in the preset location area to form a unit area combination.

[0060] Since the center point of each unit area can be regarded as a thinning of multiple user locations, multiple user locations in the preset location area can be thinned into coarse-grained unit areas, and then calculations are performed based on the coarse-grained unit areas to finally obtain the locations where stores need to be built. Since the calculation process is based on the specific location data of coarse-grained users, the amount of calculation is small and the calculation time is short; thus, the efficiency of obtaining the locations where stores need to be built is high and the cost is low.

[0061] Repeat the following steps S102 to S104 until the first preset condition is reached:

[0062] In one example, the first preset condition is that a preset number of iterations is reached; or the first preset condition is that a change rate of the fitness value of a unit region combination in the obtained region combination set is less than a preset change rate.

[0063] Among them, the first preset condition is that the change rate of the fitness value of the unit area combination in the obtained area combination set is less than the preset change rate. For example, the minimum fitness value in each iteration in the last R iterations (R is a positive integer greater than 1) can be formed into a set, and the variance of the set is less than the preset change rate, which is used as the first preset condition. The preset number of iterations and the preset change rate can be determined based on experience, and this embodiment does not limit this.

[0064] S102 . For each unit area combination, dilate the area of ​​the unit area in the unit area combination to obtain a first position area corresponding to the unit area in the unit area combination; wherein the first position area is the expanded unit area.

[0065] Exemplarily, after obtaining the set of area combinations, the server can, for each unit area combination, expand the area of ​​each unit area in the unit area combination. It can also be understood that each unit area in the unit area combination is taken as the center, and the areas of adjacent unit areas are gradually included in all directions until the expanded unit area covers the entire preset position area, and the expanded unit areas do not overlap with each other, and the expanded unit area is used as the first position area.

[0066] For example, you can combine Figure 4 To understand, Figure 4 Schematic diagram of the first location area provided in this application Figure 1 ,like Figure 4 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Figure 4 Each hexagon in represents a unit area, and the unit area combination M11 is the unit area combination M11 in the example of step S101. Figure 4 (a) is the state before the unit area in the unit area combination M11 is expanded. Figure 4 (b) in FIG. 1 is a state after the unit area in the unit area combination M11 is expanded to obtain the first position area.

[0067] Reference Figure 4 It can be seen from (b) that after the unit area M111 is expanded, the first position area D1q11 is obtained; after the unit area M112 is expanded, the first position area D1q12 is obtained; after the unit area M113 is expanded, the first position area D1q13 is obtained; after the unit area M114 is expanded, the first position area D1q14 is obtained; after the unit area M115 is expanded, the first position area D1q15 is obtained; after the unit area M116 is expanded, the first position area D1q16 is obtained; each first position area together covers the preset position area Xq1, and the first position areas do not overlap.

[0068] S103. For each unit area combination, determine the fitness value of the unit area combination according to the first position area corresponding to the unit area in the unit area combination; wherein the fitness value indicates the construction cost and driving time cost when constructing a store at the center point on the unit area in the unit area combination.

[0069] Exemplarily, after obtaining the first location area corresponding to the unit area in each unit area combination, the server may determine the fitness value of the unit area combination for each unit area combination according to the first location area corresponding to the unit area in the unit area combination.

[0070] For example, the server can determine the fitness value of the unit area combination based on the construction cost, driving time cost, and service capacity of the store when building a store at the center point of the unit area in the unit area combination. In addition, the lower the construction cost, the lower the driving time cost, and the more reasonable the service capacity of the store, the smaller the fitness value. Therefore, the smaller the fitness value, the more reasonable the corresponding location where the store can be built. Among them, the driving time cost indicates the time required to drive from the user's location to the store; the service capacity of the store indicates the number of users that the store can serve at the same time.

[0071] S104, cross-mutation processing is performed on the unit areas in the unit area combination to obtain an updated initial area combination set. When the first preset condition is met, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for building the store, and when the first preset condition is met, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for feedback to the user.

[0072] Exemplarily, after obtaining the fitness value of each unit area combination, the server may first determine whether the first preset condition is met.

[0073] If the server determines that the first preset condition is not met, a cross mutation process is performed on the unit areas in the unit area combination to obtain an updated initial area combination set. The total number of unit area combinations in the initial area combination set and the initial area combination set after each subsequent update can be determined based on experience, and this embodiment does not limit this.

[0074] For example, Figure 3 In the example, it is assumed that the server obtains the initial region combination set D1 Figure 3 The fitness value of the unit area combination M11 represented by (a) is < Figure 3 The fitness value of the unit area combination M12 represented by (b) is < Figure 3 The fitness value of the unit area combination M13 represented by (c) is < Figure 3 The fitness value of the unit area combination M14 represented by (d) is < Figure 3 The fitness value of the unit area combination M15 represented by (e) is < Figure 3If the fitness value of the unit area combination M16 represented by (f) is determined not to meet the first preset condition, the server can retain the unit area combination M16 with a smaller fitness value in the updated initial area combination set. Figure 3 The unit area combination M11 represented by (a) Figure 3 The unit area combination M12 represented by (b) is Figure 3 The unit region combination M13 represented by (c) is mutated (i.e., Figure 3 The unit area in the unit area combination M13 represented by (c) is changed), and by Figure 3 The unit area in the unit area combination M11 represented by (a) is Figure 3 The unit area in the unit area combination M12 represented by (b) Figure 3 The unit regions in the unit region combination M13 represented by (c) are crossed (i.e., reorganized) to obtain another three unit region combinations, eliminating the region combination set D1 with the larger fitness value. Figure 3 The unit area combination M14 represented by (d) Figure 3 The unit area combination M15 represented by (e) Figure 3 The unit area combination M16 represented by (f) in the figure.

[0075] Since the server obtains the fitness value by calculating each unit area in each unit area combination, and then determines whether it is reasonable to build a store at the center point of each unit area in each unit area combination by comparing the fitness values ​​of each unit area combination, therefore, in order to make a more reasonable judgment on whether the fitness values ​​of different unit area combinations are reasonable, the total number of unit areas in the unit area combinations in the initial area combination set can be the same.

[0076] If the server determines that the first preset condition has been met, it stops iterating and feeds back to the user the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set obtained at this time; the user can build a store on the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set obtained when the first preset condition is met.

[0077] It can be understood that when the first preset condition is met, the minimum fitness value determined by the most recent iterations has become stable. It can also be understood that when the user meets the first preset condition, the store is built at the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set, with the lowest construction cost, the lowest driving time cost, and the most reasonable number of users that can be served, that is, the most reasonable location for building a store is found. At this time, these locations where stores can be built are fed back to the user.

[0078] The method for determining the store location provided in the embodiment of the present application is to thin out multiple user locations in a preset location area into coarse-grained unit areas, and then obtain an initial area combination set, wherein the initial area combination set includes multiple unit area combinations, and the unit area combination includes multiple unit areas.

[0079] Repeat the following steps until the preset first iteration number is reached; or, in the iteration of the number of values ​​represented by the most recent preset second iteration number, the minimum fitness value in each iteration tends to be stable:

[0080] For each unit area combination, the area of ​​the unit area in the unit area combination is expanded to obtain the first position area corresponding to the unit area in the unit area combination; and the fitness value of the unit area combination is calculated according to the first position area corresponding to the unit area in the unit area combination. If it is determined that the first preset condition is not met, the unit areas in the unit area combination are cross-mutated (that is, the unit area combination with a smaller fitness value in the previous iteration is retained, the unit area combination with a larger fitness value in the previous iteration is eliminated, and then the unit area combination with a smaller fitness value in the previous iteration is changed and reorganized to obtain a new unit area combination) to update the area combination set. Among them, when the first preset condition is met, the center point of the unit area in the unit area combination with the lowest fitness value in the obtained area combination set is fed back to the user for store construction.

[0081] Since the above calculation process is to calculate and process the coarse-grained unit areas, the amount of calculation is small and the calculation time is short; thus, the location of the required store is obtained with high efficiency and low cost. Moreover, when the first preset condition is not met, the unit areas in the unit area combination are cross-mutated to obtain a set of area combinations to be used in the next iteration. This process can retain reasonable candidate locations for store construction, eliminate unreasonable candidate locations for store construction, and introduce new candidate locations for store construction during the iteration process, thereby realizing continuous optimization of the initial set of area combinations, and making the location of the required store construction more reasonable.

[0082] Figure 5 A flowchart of another method for determining a store location provided for this application is shown in FIG. Figure 5 As shown, in this embodiment Figure 1 Based on the embodiment, a method for determining a store location is described in detail, and the method includes:

[0083] S501. Acquire an initial region combination set, wherein the initial region combination set includes a plurality of unit region combinations, and the unit region combination includes a plurality of unit regions.

[0084] Exemplarily, the execution subject of this embodiment can be a server, or a terminal device, or an electronic device, or a store location determination device or device, or other devices or equipment that can implement the solution of this application, without limitation. Among them, the server can be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services ("Virtual Private Server", or "VPS" for short). The server can also be a server of a distributed system, or a server combined with a blockchain.

[0085] This embodiment is introduced with the execution subject being a server.

[0086] In one example, the unit area of ​​the unit area combination in the initial area combination set is a geographical area with a density value less than a preset density threshold, the density value indicates the path distance between the center point of the unit area and the center point of the unit area adjacent to the unit area on the road network, and the density value indicates the number of users in the unit area and the number of users in the unit area adjacent to the unit area on the road network; the unit areas between different unit area combinations in the initial area combination set are not repeated.

[0087] In an example, the density value of the i-th unit area in the unit area combination is:

[0088]

[0089] Wherein, xij is the land use value of the i-th unit area and the j-th unit area adjacent to the i-th unit area on the road network; when either the i-th unit area or the j-th unit area adjacent to the i-th unit area on the road network satisfies the land use nature, the value of xij is the first preset value; when neither the i-th unit area nor the j-th unit area adjacent to the i-th unit area on the road network satisfies the land use nature, the value of xij is the second preset value;

[0090] Dij is the shortest path distance on the road network between the center point of the ith unit area and the center point of the jth unit area adjacent to the ith unit area on the road network; Wi is the number of users in the ith unit area; Wj is the number of users in the jth unit area adjacent to the ith unit area on the road network; t is the total number of unit areas adjacent to the ith unit area on the road network; t is a positive integer greater than or equal to 1; i is a positive integer greater than or equal to 1; j is a positive integer greater than or equal to 1 and less than or equal to t.

[0091] For example, the implementation of step S501 is similar to the implementation of step S101. Based on the content of step S101, for example, Figure 6-Figure 11 , further understand the server's initial set of regional combinations.

[0092] Figure 6 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 1 ,like Figure 6 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Figure 6 Each hexagon in represents a unit area, such as Figure 6 As shown in (a), the server randomly selects 7 unit areas in the preset location area Xq1, and then calculates the density value formula for these unit areas according to the above-mentioned density value formula Calculate the density value. Assuming that the density value of unit area M111 is less than the density value of unit area M112, less than the density value of unit area M113, less than the density value of unit area M114, less than the density value of unit area M115, less than the density value of unit area M116, less than the density value of unit area M117, then Figure 6 The preset density threshold value corresponding to the unit area combination M11 represented by (b) is assigned a value represented by the density value of the unit area M117.

[0093] Next, the server Figure 6 Among the seven randomly selected unit areas represented by (a), the unit areas with density values ​​less than the density value of the unit area M117 are selected, namely, the unit areas M111, M112, M113, M114, M115, and M116 as Figure 6 The unit area combination M11 represented by (b).

[0094] Figure 7 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 2 ,like Figure 7 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Figure 7 Each hexagon in represents a unit area, such as Figure 7 As shown in (a), the server randomly selects 7 unit areas in the preset location area Xq1, including unit area M121, unit area M122, unit area M123, unit area M124, unit area M125, unit area M126, and unit area M127. Figure 6 The unit area represented by (a) is determined Figure 6 The implementation method of the unit area combination M11 represented by (b) is similar to that of Figure 7 The unit area combination M12 shown in (b) includes a unit area M121, a unit area M122, a unit area M123, a unit area M124, a unit area M125, and a unit area M126.

[0095] Similarly, Figure 8 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 3 ,like Figure 8 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Figure 8 Each hexagon in represents a unit area, such as Figure 8 As shown in (a), the server randomly selects 7 unit areas in the preset location area Xq1, including unit area M131, unit area M132, unit area M133, unit area M134, unit area M135, unit area M136, and unit area M137. Figure 6 The unit area represented by (a) is determined Figure 6 The implementation method of the unit area combination M11 represented by (b) is similar to that of Figure 8 The unit area combination M13 shown in (b) includes a unit area M131, a unit area M132, a unit area M133, a unit area M134, a unit area M135, and a unit area M136.

[0096] Fig. 9 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 4 ,like Fig. 9 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Fig. 9 Each hexagon in represents a unit area, such as Fig. 9As shown in (a), the server randomly selects 7 unit areas in the preset location area Xq1, including unit area M141, unit area M142, unit area M143, unit area M144, unit area M145, unit area M146, and unit area M147. Figure 6 The unit area represented by (a) is determined Figure 6 The implementation method of the unit area combination M11 represented by (b) is similar to that of Fig. 9 The unit area combination M14 shown in (b) includes a unit area M141, a unit area M142, a unit area M143, a unit area M144, a unit area M145, and a unit area M146.

[0097] Fig.10 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 5 ,like Fig.10 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Fig.10 Each hexagon in represents a unit area, such as Fig.10 As shown in (a), the server randomly selects 7 unit areas in the preset location area Xq1, including unit area M151, unit area M152, unit area M153, unit area M154, unit area M155, unit area M156, and unit area M157. Figure 6 The unit area represented by (a) is determined Figure 6 The implementation method of the unit area combination M11 represented by (b) is similar to that of Fig.10 The unit area combination M15 shown in (b) includes a unit area M151, a unit area M152, a unit area M153, a unit area M154, a unit area M155, and a unit area M156.

[0098] Fig.11 Schematic diagram of the unit area combination in the initial area combination set provided in this application Figure 6 ,like Fig.11 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Fig.11 Each hexagon in represents a unit area, such as Fig.11 As shown in (a), the server randomly selects 7 unit areas in the preset location area Xq1, including unit area M161, unit area M162, unit area M163, unit area M164, unit area M165, unit area M166, and unit area M167. Figure 6The unit area represented by (a) is determined Figure 6 The implementation method of the unit area combination M11 represented by (b) is similar to that of Fig.11 The unit area combination M16 shown in (b) includes a unit area M161, a unit area M162, a unit area M163, a unit area M164, a unit area M165, and a unit area M166.

[0099] Finally, the server will Figure 6 The unit area combination M11 represented by (b) Figure 7 The unit area combination M12 represented by (b) Figure 8 The unit area combination M13 represented by (b) Fig. 9 The unit area combination M14 represented by (b) Fig.10 The unit area combination M15 represented by (b) Fig.11 The unit area combination M16 represented by (b) is used as the area combination set obtained for the first time.

[0100] In order to avoid unreasonable store locations due to the initial regional combination covering too small a range, Figure 6 Middle (a), Figure 7 Middle (a), Figure 8 Middle (a), Fig. 9 Middle (a), Fig.10 Middle (a), Fig.11 The unit areas represented by (a) need not be repeated.

[0101] It is worth noting that when the server determines the area combination set obtained for the first time, the total number of unit areas randomly selected in the preset location area Xq1, the preset density threshold corresponding to each unit area combination, and the total number of unit areas in the unit area combination can be determined based on experience, and this embodiment does not impose any restrictions on this.

[0102] Among them, using the formula When calculating the density value of a unit area, the server may first obtain the land property data, road data, and user data that include the preset location area range. In the land property data, the preset location area is divided into multiple geographical areas of land properties according to whether the land use properties are met, and each geographical area of ​​land properties has land attributes. When the geographical area of ​​the land properties is suitable for building a store (such as commercial land), the land attribute is that the land use properties are met; when the geographical area of ​​the land properties is not suitable for building a store (such as a park), the land attribute is that the land use properties are not met.

[0103] In the land nature data, the land attribute corresponding to the position of the center point of the unit area represents whether the construction of a store at the center point of the unit area satisfies the land use nature. A land attribute of 0 indicates that the unit area does not satisfy the land use nature, and a land attribute of 1 indicates that the unit area satisfies the land use nature. When the land attribute of either the i-th unit area or the j-th unit area adjacent to the i-th unit area on the road network is 1, the value of xij is 1; when the land attributes of both the i-th unit area and the j-th unit area adjacent to the i-th unit area on the road network are 0, the value of xij is 0. In order to improve the rationality of the area combination set obtained for the first time, when the value of xij is 0, the server may not use the i-th unit area, but randomly select another unit area with a xij value of 1.

[0104] The road data obtained by the server includes the road information required for map path planning. The server can determine the shortest path distance Dij between the center point of the ith unit area and the center point of the jth unit area adjacent to the ith unit area on the road network based on the map path planning algorithm and the road data, and the existence of a planned path between the center points of the two adjacent unit areas on the road network.

[0105] The user data obtained by the server includes the specific location of users who may come to the store to be built, such as the location of the user's home. The number of user locations in the user data contained in the unit area is the number of users in the unit area. Therefore, Wi is the number of user locations in the user data contained in the i-th unit area; Wj is the number of user locations in the user data contained in the j-th unit area adjacent to the i-th unit area on the road network.

[0106] The center point of the unit area for calculating density can be understood as the location of the store to be constructed, and the unit area adjacent to the unit area on the road network can be understood as the thinning of the user locations in this unit area. It can be seen from the density value formula of the unit area that the shorter the shortest path distance on the road network between the center point of the unit area and the center point of the unit area adjacent to it, the smaller the density value, which can also be understood as the closer the user is to the location of the store to be constructed, the smaller the density value; it can also be seen from the density value formula of the unit area that the larger the sum of the number of users in the unit area and the number of users in the unit area adjacent to the unit area on the road network, the smaller the density value, which can also be understood as the more users are near the location of the store to be constructed, the smaller the density value.

[0107] Therefore, the smaller the density value of the unit area, the more reasonable the location of the store built at the center of the unit area. Then, after randomly selecting the unit area, by selecting the unit area with a relatively small density value, the unit area in the first area combination set is more reasonable, that is, the location of the store to be built is more reasonable. Subsequent iterative processing based on more reasonable unit areas will eventually result in a more reasonable location for the store to be built.

[0108] Repeat steps S502 to S504 until the first preset condition is met:

[0109] In one example, the first preset condition is that a preset number of iterations is reached; or the first preset condition is that a change rate of the fitness value of a unit region combination in the obtained region combination set is less than a preset change rate.

[0110] Among them, the first preset condition is that the change rate of the fitness value of the unit area combination in the obtained area combination set is less than the preset change rate. For example, the minimum fitness value in each iteration in the last R iterations (R is a positive integer greater than 1) can be formed into a set, and the variance of the set is less than the preset change rate, which is used as the first preset condition. The preset number of iterations and the preset change rate can be determined based on experience, and this embodiment does not limit this.

[0111] S502 . For each unit area combination, dilate the area of ​​the unit area in the unit area combination until the unit area in the unit area combination meets a second preset condition, so as to obtain a first position area corresponding to the unit area in the unit area combination.

[0112] The first location area is the expanded unit area. The second preset condition is that the number of users in the expanded unit area is less than or equal to the preset number of users; the first location area obtained when the second preset condition is met includes multiple complete unit areas; the first location area obtained when the second preset condition is met does not overlap with other expanded unit areas.

[0113] For example, after obtaining the set of area combinations, the server may expand the area of ​​each unit area in each unit area combination for each unit area combination, which can also be understood as taking each unit area in the unit area combination as the center and gradually including the area of ​​adjacent unit areas on the road network in all directions until the unit areas in the unit area combination meet the second preset condition. In addition, the expanded unit areas do not overlap with each other. The expanded unit areas are used as the first location area.

[0114] The second preset condition is that the sum of the number of users in each unit area after the expansion is less than or equal to the preset number of users, and the preset number of users represents the maximum number of users that a store is estimated to be able to serve at the same time. Therefore, the second preset condition can also be understood as, for example, the number of users that can be served by the expanded unit area at the same time cannot exceed the maximum number of users that a store is estimated to be able to serve at the same time.

[0115] For example, you can combine Fig.12 To understand, Fig.12 Schematic diagram of the first location area provided in this application Figure 2 ,like Fig.12 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Fig.12 Each hexagon in represents a unit area, and the unit area combination M11 is the unit area combination M11 in the example of step S501. Fig.12 (a) is the state before the unit area in the unit area combination M11 is expanded. Fig.12 (b) shows the state after the unit area in the unit area combination M11 is expanded to obtain the first position area.

[0116] Reference Fig.12 In (b), it can be seen that after the unit area M111 is expanded, the first position area D1q11 is obtained; after the unit area M112 is expanded, the first position area D1q12 is obtained; after the unit area M113 is expanded, the first position area D1q13 is obtained; after the unit area M114 is expanded, the first position area D1q14 is obtained; after the unit area M115 is expanded, the first position area D1q15 is obtained; after the unit area M116 is expanded, the first position area D1q16 is obtained; the first position areas do not overlap. In addition, the number of users in each first position area does not exceed the preset number of users.

[0117] By setting the number of users in the expanded unit area to be less than or equal to the preset number of users as the second preset condition that the first location area needs to meet, when a store is built at the center point of the unit area in the unit area combination corresponding to the first location area, the estimated number of users that can be served at the same time can be controlled within the preset number of users, thereby preventing the estimated number of users that can be served at the same time that requires the construction of a store from exceeding the maximum number of users that can be served by one store at the same time, thereby ensuring a good user experience.

[0118] S503. For each unit area combination, determine the fitness value of the unit area combination according to multiple area data of the first location area corresponding to the unit area in the unit area combination and the construction cost information of the unit area in the unit area combination.

[0119] The fitness value indicates the construction cost and travel time cost when constructing a store at the center point of the unit area in the unit area combination. The area data indicates the relevant information of the first location area; and the construction cost information represents the construction cost of the unit area.

[0120] In one example, the plurality of region data includes first region data and second region data.

[0121] The first area data includes first information and a first restriction condition, the first information represents the number of users included in the first location area, and the first restriction condition is a preset user number threshold;

[0122] The second area data includes second information and a second restriction condition, the second information represents the path time between the center point of the first location area and the farthest point of the first location area on the road network, and the second restriction condition is a first preset time threshold.

[0123] In one example, the fitness value of the unit area combination is

[0124] Wherein, vkb is the value of the information represented by the bth region data of the kth first position region; vb is the value of the restriction condition represented by the bth region data; c is the total number of region data, c is a positive integer greater than or equal to 1; b is a positive integer greater than or equal to 1 and less than or equal to c;

[0125] Bk is the value of the construction cost information of the kth first location area; n is the total number of first location areas corresponding to the unit area combination, n is a positive integer greater than or equal to 1; k is a positive integer greater than or equal to 1 and less than or equal to n.

[0126] For example, after obtaining the first location area corresponding to the unit area in each unit area combination, the server can, for each unit area combination, calculate the fitness value formula based on the fitness value formula introduced above according to the multiple area data of the first location area corresponding to the unit area in the unit area combination and the construction cost information of the unit area in the unit area combination. Determine the fitness value of the unit area combination.

[0127] For example, in the fitness value formula In the figure, it is assumed that c is 2, that is, the total number of regional data of the kth first location area is 2. When b=1, v1 is the value of the first restriction condition represented by the first regional data, that is, the preset user quantity threshold, wherein the preset user quantity threshold represents the estimated number of standard users that a store can serve at the same time, and vk1 is the value of the first information represented by the first regional data of the kth first location area, that is, the sum of the number of users in each unit area in the kth first location area.

[0128] When b=2, v2 is the value of the second restriction condition represented by the second area data, that is, the first preset time threshold, wherein the first preset time threshold represents the longest estimated time corresponding to the shortest path between the store and the user location on the road network that is acceptable to the user; vk2 is the value of the second information represented by the second area data of the kth first location area, that is, the estimated time corresponding to the path between the center point of the unit area in the unit area combination corresponding to the first location area and the point farthest from the center point on the road network within the first location area.

[0129] In order to calculate the fitness value of the unit area combination, the server may also obtain construction cost data, for example, which divides the preset location area into a plurality of geographical areas of construction cost according to the construction cost information of the store, and each geographical area of ​​construction cost has construction cost information. Bk is the position of the center point of the unit area in the unit area combination corresponding to the kth first location area in the construction cost data, and the corresponding construction cost information.

[0130] From the introduction of the fitness value of the above unit area combination, it can be seen that the lower the construction cost of the candidate store, the closer the number of users that the candidate store can serve at the same time is to the estimated standard number of users that the store can serve at the same time, and the closer the estimated time from the candidate store to the farthest user location on the road network is to the estimated time that the user can accept, the smaller the fitness value of the unit area combination. Therefore, the smaller the fitness value of the unit area combination, the more reasonable it is to build a store at the center point of each unit area in the unit area combination.

[0131] S504, cross-mutation processing is performed on the unit areas in the unit area combination to obtain an updated initial area combination set. When the first preset condition is met, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for building the store, and when the first preset condition is met, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for feedback to the user.

[0132] In one example, “performing a cross-mutation process on the unit regions in the unit region combination to obtain an updated initial region combination set” includes:

[0133] Determine a unit area combination whose fitness value is less than a first fitness threshold in the initial area combination set as a first candidate combination;

[0134] Determine a first candidate combination whose fitness value is greater than a second fitness threshold, and disrupt the order of unit areas in the first candidate combination whose fitness value is greater than the second fitness threshold to obtain a second candidate combination; or select unit areas that are different from all unit areas in the area combination set to form the second candidate combination;

[0135] Determine the unit area combinations in the initial area combination set whose fitness values ​​are less than the third fitness threshold as the third candidate combinations; and recombine the unit areas in each third candidate combination to obtain each fourth candidate combination, wherein the number of unit areas in the fourth candidate combination is the same as the number of unit areas in the third candidate combination;

[0136] According to the first candidate combination, the second candidate combination and the fourth candidate combination, an updated initial region combination set is obtained.

[0137] Exemplarily, the implementation of step S504 is similar to the implementation of step S104. Based on the content introduced in step S104, for example, in combination with step S501, Figure 6-Figure 11 The represented initial region combination set example provides a further understanding of “performing a cross mutation process on the unit regions in the unit region combination to obtain an updated initial region combination set”.

[0138] See also Figure 6-Figure 11 , assuming that the server obtains the initial set of regional combinations Figure 6 The fitness value of the unit area combination M11 represented by (b) is < Figure 7 The fitness value of the unit area combination M12 represented by (b) is < Figure 8 The fitness value of the unit area combination M13 represented by (b) is < Fig. 9 The fitness value of the unit area combination M14 represented by (b) is < Fig.10 The fitness value of the unit area combination M15 represented by (b) is < Fig.11 The fitness value of the unit area combination M16 represented by (b) is determined, and it is determined that the first preset condition is not met.

[0139] For example, the server can Fig. 9 The fitness value of the unit area combination M14 represented by (b) is used as the first fitness threshold, and then the fitness value of the initial area combination set obtained is less than Fig. 9 The fitness value of the unit area combination M14 represented by (b) is Figure 6 The unit area combination M11 represented by (b) Figure 7 The unit area combination M12 represented by (b) Figure 8 The unit area combination M13 represented by (b) is used as the first candidate combination;

[0140] The server can then Figure 7 The fitness value of the unit area combination M12 represented by (b) is used as the second fitness threshold, and the fitness values ​​of the first candidate combination greater than Figure 7 The fitness value of the unit area combination M12 represented by (b) is Figure 8 The order of the unit regions in the unit region combination M13 represented by (b) in the figure is used to obtain the second candidate combination. Figure 8 To understand (b) in the above example, assume that Figure 8 In the unit area combination M13 represented by (b), the order of subsequent expansion processing of the unit areas is unit area M131, unit area M132, unit area M133, unit area M134, unit area M135, unit area M136. Then the server can use unit area M131, unit area M132, unit area M133, unit area M134, unit area M135, unit area M136 as the second candidate combination, and modify the order of subsequent expansion processing of the unit areas in the second candidate combination to unit area M136, unit area M132, unit area M135, unit area M133, unit area M131, unit area M134. Alternatively, the server can also select unit areas that are different from the unit areas in the area combination set obtained for the first time from the preset location area Xq1 to form the second candidate combination.

[0141] The server can then Fig. 9 The fitness value of the unit area combination M14 represented by (b) is used as the third fitness threshold, and then the fitness value of the initial area combination set obtained is less than Fig. 9 The fitness value of the unit area combination M14 represented by (b) is Figure 6 The unit area combination M11 represented by (b) Figure 7 The unit area combination M12 represented by (b) Figure 8 The unit area combination M13 represented by (b) is used as the third candidate combination, and Figure 6 The unit area in the unit area combination M11 represented by (b) Figure 7 The unit area in the unit area combination M12 represented by (b) Figure 8The unit areas in the unit area combination M13 represented by (b) are recombined in pairs or in pairs to obtain fourth candidate combinations.

[0142] For example, you can combine Figure 6-Figure 7 To understand, the server will Figure 6 The unit areas M111, M112, M113, M114, M115, and M116 in the unit area combination M11 shown in (b) are: Figure 7 The unit areas M121, M122, M123, M124, M125, and M126 in the unit area combination M12 represented by (b) are cross-recombined in pairs to obtain a unit area combination consisting of unit areas M111, M112, M113, M124, M125, and M126 (the fourth candidate combination). Another unit area combination consisting of unit areas M121, M122, M123, M114, M115, and M116 (the fourth candidate combination) can be obtained. By analogy, Figure 6 The unit area in the unit area combination M11 represented by (b) Figure 7 The unit area in the unit area combination M12 represented by (b) Figure 8 The unit regions in the unit region combination M13 represented by (b) are cross-recombined in pairs to obtain multiple fourth candidate combinations.

[0143] like Figure 6-Figure 8 As shown, the server will Figure 6 The unit areas M111, M112, M113, M114, M115, and M116 in the unit area combination M11 shown in (b) are: Figure 7 The unit areas M121, M122, M123, M124, M125, and M126 in the unit area combination M12 shown in (b) are: Figure 8The unit area M131, unit area M132, unit area M133, unit area M134, unit area M135, and unit area M136 in the unit area combination M13 represented by (b) above can be recombined in three-by-three crossovers to obtain a unit area combination consisting of unit area M111, unit area M112, unit area M123, unit area M124, unit area M135, and unit area M136 (the fourth alternative combination). Another unit area combination consisting of unit area M111, unit area M112, unit area M133, unit area M134, unit area M125, and unit area M126 (the fourth alternative combination) and a unit area combination consisting of unit area M121, unit area M122, unit area M113, unit area M114, unit area M135, and unit area M136 (the fourth alternative combination) can be obtained. By analogy, Figure 6 The unit area in the unit area combination M11 represented by (b) Figure 7 The unit area in the unit area combination M12 represented by (b) Figure 8 The unit areas in the unit area combination M13 represented by (b) are recombined in a three-by-three crossover manner to obtain multiple fourth candidate combinations.

[0144] Furthermore, the server uses the area combination set consisting of the first candidate combination, the second candidate combination, and the fourth candidate combination as the updated initial area combination set.

[0145] Each time the initial region combination set is updated, the first fitness threshold, the second fitness threshold, and the third fitness threshold used in the calculation process can be determined based on experience, and this embodiment does not impose any limitation on this.

[0146] During the iteration process, when the first preset condition is not met, the initial regional combination set is updated, that is, the unit regional combination with a relatively small fitness value in the previous iteration is retained, which can be understood as copying the reasonable candidate construction store location in the previous iteration; changing part of the unit regional combination with a relatively small fitness value in the previous iteration can be understood as mutating the reasonable candidate construction store location in the previous iteration, which can avoid only finding the reasonable candidate construction store location locally, which is conducive to finding the reasonable candidate construction store location within the preset location area; recombining the unit areas in the unit regional combination with a relatively small fitness value in the previous iteration can be understood as recombining on the basis of the reasonable candidate construction store location in the previous iteration, which is conducive to finding a more reasonable candidate construction store location; at the same time, eliminating the unit regional combination with a relatively large fitness value in the previous iteration can be understood as eliminating the unreasonable candidate construction store location in the previous iteration. Furthermore, the regional combination set can be continuously optimized during the iteration process, so that the location of the store to be built is more reasonable.

[0147] In addition, before obtaining the initial area combination set, the server may also receive at least one preset unit area, and use the unit area as a unit area in the unit area combination in the initial area combination set obtained, and participate in the iteration process, and, during the iteration process, the unit area will not be eliminated and will not change. Alternatively, before obtaining the initial area combination set, the server may also receive at least one preset unit area and its corresponding first position area, and use the unit area as a unit area in the unit area combination in the initial area combination set obtained, and participate in the iteration process, and, during the iteration process, the unit area will not be eliminated and will not change; at the same time, the first position area corresponding to the unit area also remains unchanged. When there is a clear location where a store needs to be built, or there is a clear location where a store needs to be built and its corresponding first position area, the above method can be used to ensure that the location where the store needs to be built and its corresponding first position area are always retained during the iteration process.

[0148] S505. When the first preset condition is met, the area of ​​the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is expanded until the unit area in the unit area combination meets the third preset condition, so as to obtain the second position area corresponding to the unit area in the unit area combination.

[0149] Among them, the third preset condition is that the path time between the center point of the expanded unit area and the farthest point of the expanded unit area on the road network is less than or equal to the value of the second preset time threshold; the second position area obtained when the third preset condition is met does not overlap with other expanded unit areas; the second position area is the expanded unit area.

[0150] Exemplarily, when the first preset condition is met, the server performs expansion processing on the area of ​​the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set, which can also be understood as taking the center point of each unit area in the unit area combination as the starting point, extending on the road network to a path time less than or equal to the value of the second preset time threshold, and the position of the end point extended on the road network is not within other expanded unit areas, and the end points extended on the road network are connected in series as the unit area after the unit area is expanded. The expanded unit area is used as the second position area.

[0151] The second preset time threshold represents the longest estimated time corresponding to the shortest path between the store and the user's location on the road network that the user can accept. Therefore, the third preset condition can also be understood as, for example, that within the expanded unit area, the path time between the center point of the expanded unit area (taking the center point of the unit area before expansion as the center point of the expanded unit area) and the point on the road network farthest from the center point does not exceed the longest estimated time corresponding to the shortest path between the store and the user's location on the road network that the user can accept.

[0152] Different unit areas in the unit area combination may define different second preset time thresholds. The specific value of the second preset time threshold may be determined based on experience, and this embodiment does not impose any limitation on this.

[0153] For example, you can combine Fig.13 To understand, Fig.13 A schematic diagram of the second location area provided by this application, such as Fig.13 As shown, the area represented by polygon Xq1 is the preset position area Xq1. Fig.13 Each hexagon represents a unit area. The unit area combination MN is the unit area combination with the lowest fitness value in the updated initial area combination set obtained when the first preset condition is met. The unit area combination MN includes unit area MN1, unit area MN2, unit area MN3, unit area MN4, unit area MN5, and unit area MN6. Fig.13 (a) is the state before the unit area in the unit area combination MN is expanded. Fig.13 (b) shows the state after the unit area in the unit area combination MN is expanded to obtain the second position area.

[0154] Reference Fig.13 In (b), it can be seen that after the unit area MN1 is expanded, the second position area D2q1 is obtained; after the unit area MN2 is expanded, the second position area D2q2 is obtained; after the unit area MN3 is expanded, the second position area D2q3 is obtained; after the unit area MN4 is expanded, the second position area D2q4 is obtained; after the unit area MN5 is expanded, the second position area D2q5 is obtained; after the unit area MN6 is expanded, the second position area D2q6 is obtained; the second position areas do not overlap. Moreover, within the scope of each second position area, the path time between the center point of the unit area in the unit area combination corresponding to the second position area and the point farthest from the center point on the road network does not exceed the value of the second preset time threshold.

[0155] By using, as a third preset condition, within the scope of the expanded unit area, the path time between the center point of the expanded unit area (taking the center point of the unit area before expansion as the center point of the expanded unit area) and the point farthest from the center point on the road network does not exceed the longest estimated time corresponding to the shortest path between the store and the user location on the road network that is acceptable to the user, the scope of the second location area obtained after expansion can represent the coverage geographical range of potential users when a store is built at the center point of the unit area in the unit area combination corresponding to the second location area, and within the longest estimated time corresponding to the shortest path between the store and the user location on the road network that is acceptable to the user.

[0156] S506. Determine a radiation range evaluation value of the second location area based on the area of ​​the second location area, the area of ​​the preset location area, the number of users in the preset unit area covered by the second location area, and the path information of the preset unit area covered by the second location area; wherein the radiation range evaluation value indicates the number of users and driving information when a store is built at the center point of the second location area.

[0157] In one example, the radiation range evaluation value of the second position area corresponding to the hth unit area in the unit area combination is

[0158] The second location area covers a plurality of unit areas, and the preset unit areas covered by the second location area are other unit areas except the unit area corresponding to the second location area;

[0159] Gh is the area of ​​the second position area; A is the area of ​​each unit area in the preset position area; m is the total number of unit areas in the preset position area; m is a positive integer greater than 1; h is a positive integer greater than or equal to 1;

[0160] Ys is the number of users in the sth preset unit area in the second location area; Lhs is the shortest path distance between the center point of the second location area and the center point of the sth preset unit area in the second location area on the road network;

[0161] Ths0 is the first path time on the road network between the center point of the second location area and the center point of the sth preset unit area in the second location area; Ths1 is the second path time on the road network between the center point of the second location area and the center point of the sth preset unit area in the second location area; the first path time is the time determined by calculating the historical path time of the path on the road network between the center point of the second location area and the center point of the sth preset unit area in the second location area; the second path time is the estimated time required for the path on the road network between the center point of the second location area and the center point of the sth preset unit area in the second location area; r is the total number of preset unit areas in the second location area, r is a positive integer greater than or equal to 1; s is a positive integer greater than or equal to 1 and less than or equal to r.

[0162] For example, after calculating the second location area, the server can calculate the radiation range evaluation value based on the formula of the second location area, the area of ​​the preset location area, the number of users in the preset unit area covered by the second location area, and the path information of the preset unit area covered by the second location area. A radiation range assessment value of the second location area is determined.

[0163] Among them, the unit area covered by the second location area represents the unit area whose center point falls within the scope of the second location area. In the formula of the above-mentioned radiation range evaluation value, Lhs can be, for example, the shortest path distance on the road network between the center point of the second location area (i.e., the center point of the unit area in the unit area combination corresponding to the second location area) calculated by the server based on the road data and the map path planning algorithm and the center point of the sth preset unit area in the second location area.

[0164] For example, the server can also obtain dynamic traffic data, which includes the historical path time of each road within the preset location area. Ths0, for example, can be the time determined by the server based on the dynamic traffic data, based on the historical path time of the path on the road network between the center point of the second location area (i.e., the center point of the unit area in the unit area combination corresponding to the second location area) and the center point of the sth preset unit area in the second location area (the calculation method, for example, can add the historical path time of each road in the path on the road network). Since the dynamic traffic data is derived from the historical travel time of vehicles on each road, it is more in line with the actual travel time. Therefore, Ths0, for example, can be understood as the actual travel time on the road network between the center point of the second location area and the center point of the sth preset unit area in the second location area.

[0165] Ths1, for example, may be the estimated time required for a path on the road network between the center point of the second location area and the center point of the sth preset unit area in the second location area based on a map path planning algorithm by the server.

[0166] In an example, if the server does not obtain dynamic traffic data, Ths0 / Ths1 can be assigned a value of 1.

[0167] S507: Feedback the second location area and the radiation range evaluation value of the second location area to the user.

[0168] Exemplarily, after calculating the second location area and the radiation range evaluation value of the second location area, the server may feed back the second location area and the radiation range evaluation value of the second location area to the user for reference in building a store.

[0169] In the method for determining the store location provided in the embodiment of the present application, the smaller the density value of the unit area, the more reasonable the store location built at the center point of the unit area. Furthermore, after randomly selecting the unit area, by selecting the unit area with a relatively small density value therefrom, the unit area in the first area combination set obtained is more reasonable, that is, the location of the store to be constructed selected for the first time is more reasonable.

[0170] By setting the number of users in the expanded unit area to be less than or equal to the preset number of users as the second preset condition that the first location area needs to meet, when a store is built at the center point of the unit area in the unit area combination corresponding to the first location area, the estimated number of users that can be served at the same time can be controlled within the preset number of users, thereby preventing the estimated number of users that can be served at the same time that requires the construction of a store from exceeding the maximum number of users that can be served by one store at the same time, thereby ensuring a good user experience.

[0171] During the iteration process, when the first preset condition is not met, the regional combination set is updated, that is, the reasonable candidate construction store locations in the previous iteration are copied; the reasonable candidate construction store locations in the previous iteration are mutated, which can avoid only finding reasonable candidate construction store locations locally, which is conducive to finding reasonable candidate construction store locations within the preset location area; based on the reasonable candidate construction store locations in the previous iteration, the positions are recombined, which is conducive to finding more reasonable candidate construction store locations; at the same time, the unreasonable candidate construction store locations in the previous iteration are eliminated. Furthermore, the regional combination set can be continuously optimized during the iteration process, so that the final location of the store to be built is more reasonable.

[0172] Fig.14 A schematic diagram of the structure of the device for determining the store location provided in this application, such as Fig.14 As shown, the store location determination device 140 provided in this embodiment includes:

[0173] An acquisition module 1401 is used to acquire an initial region combination set, wherein the initial region combination set includes a plurality of unit region combinations, and the unit region combination includes a plurality of unit regions;

[0174] Repeat the steps of the first processing module 1402, the determination module 1403, and the second processing module 1404 in sequence until the first preset condition is met:

[0175] The first processing module 1402 is used to perform expansion processing on the area of ​​the unit regions in each unit region combination to obtain a first position region corresponding to the unit regions in the unit region combination.

[0176] The determination module 1403 is used to determine the fitness value of each unit area combination according to the first position area corresponding to the unit area in the unit area combination.

[0177] The second processing module 1404 is used to perform cross mutation processing on the unit regions in the unit region combination to obtain an updated initial region combination set.

[0178] Among them, the first preset condition is to reach a preset number of iterations; or, the first preset condition is that the rate of change of the fitness value of the unit area combination in the updated initial area combination set is less than the preset change rate; when the first preset condition is reached, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for store construction.

[0179] In a possible implementation, the first processing module 1402 is specifically configured to:

[0180] For each unit area combination, the area of ​​the unit area in the unit area combination is expanded until the unit area in the unit area combination meets the second preset condition, so as to obtain the first position area corresponding to the unit area in the unit area combination;

[0181] Among them, the second preset condition is that the number of users in the expanded unit area is less than or equal to the preset number of users; the first location area obtained when the second preset condition is met includes multiple complete unit areas; the first location area obtained when the second preset condition is met does not overlap with other expanded unit areas.

[0182] In a possible implementation, the determination module 1403 is specifically configured to:

[0183] For each unit area combination, determine the fitness value of the unit area combination according to a plurality of area data of the first location area corresponding to the unit area in the unit area combination and the construction cost information of the unit area in the unit area combination;

[0184] The area data indicates relevant information of the first location area; the construction cost information represents the construction cost of the unit area.

[0185] In one possible implementation, the fitness value of the unit area combination is

[0186] Wherein, vkb is the value of the information represented by the bth region data of the kth first position region; vb is the value of the restriction condition represented by the bth region data; c is the total number of region data, c is a positive integer greater than or equal to 1; b is a positive integer greater than or equal to 1 and less than or equal to c;

[0187] Bk is the value of the construction cost information of the kth first location area; n is the total number of first location areas corresponding to the unit area combination, n is a positive integer greater than or equal to 1; k is a positive integer greater than or equal to 1 and less than or equal to n.

[0188] In a possible implementation, the second processing module 1404 is specifically configured to:

[0189] Determine a unit area combination whose fitness value is less than a first fitness threshold in the initial area combination set as a first candidate combination;

[0190] Determine a first candidate combination whose fitness value is greater than a second fitness threshold, and disrupt the order of unit areas in the first candidate combination whose fitness value is greater than the second fitness threshold to obtain a second candidate combination; or select unit areas that are different from each unit area in the initial area combination set to form the second candidate combination;

[0191] Determine the unit area combinations in the initial area combination set whose fitness values ​​are less than the third fitness threshold as the third candidate combinations; and recombine the unit areas in each third candidate combination to obtain each fourth candidate combination, wherein the number of unit areas in the fourth candidate combination is the same as the number of unit areas in the third candidate combination;

[0192] According to the first candidate combination, the second candidate combination and the fourth candidate combination, an updated initial region combination set is obtained.

[0193] In a possible implementation, the store location determination device 140 is further configured to:

[0194] When the first preset condition is reached, the area of ​​the unit area in the unit area combination with the lowest fitness value in the obtained updated initial area combination set is expanded until the unit area in the unit area combination meets the third preset condition, so as to obtain the second position area corresponding to the unit area in the unit area combination; wherein the third preset condition is that the path time between the center point of the expanded unit area and the farthest point of the expanded unit area on the road network is less than or equal to the value of the second preset time threshold; the second position area obtained when the third preset condition is met does not overlap with other expanded unit areas; the second position area is the expanded unit area;

[0195] Determine the radiation range evaluation value of the second location area according to the area of ​​the second location area, the area of ​​the preset location area, the number of users in the preset unit area covered by the second location area, and the path information of the preset unit area covered by the second location area; wherein the unit area belongs to the preset location area; and the radiation range evaluation value indicates the number of users and driving information when a store is built at the center point of the second location area;

[0196] The second position area and the radiation range evaluation value of the second position area are fed back to the user.

[0197] The store location determination device provided in this embodiment can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and will not be described in detail in this embodiment.

[0198] Fig.15 This is a schematic diagram of the structure of the electronic device provided in this application. Fig.15As shown, the electronic device 150 provided in this embodiment includes: at least one processor 1501 and a memory 1502. Optionally, the device 150 also includes a communication component 1503. The processor 1501, the memory 1502 and the communication component 1503 are connected via a bus 1504.

[0199] In a specific implementation process, at least one processor 1501 executes the computer-executable instructions stored in the memory 1502, so that at least one processor 1501 executes the above method.

[0200] The specific implementation process of the processor 1501 can be found in the above method embodiment, and its implementation principle and technical effect are similar, so this embodiment will not be repeated here.

[0201] In the above-mentioned embodiment, it should be understood that the processor 1501 can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), etc. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the invention can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor.

[0202] The memory 1502 may include a high-speed memory (Random Access Memory, RAM), and may also include a non-volatile memory (Non-volatile Memory, NVM), such as at least one disk memory.

[0203] The bus 1504 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, the bus in the drawings of the present application is not limited to only one bus or one type of bus.

[0204] The electronic device provided in this embodiment may be the server in the above embodiment.

[0205] The present application also provides a computer program product, including a computer program, which implements the above method when executed by a processor.

[0206] The present application also provides a computer-readable storage medium, in which computer-executable instructions are stored. When a processor executes the computer-executable instructions, the above method is implemented.

[0207] The above-mentioned readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk. The readable storage medium can be any available medium that can be accessed by a general or special-purpose computer.

[0208] An exemplary readable storage medium is coupled to a processor so that the processor can read information from the readable storage medium and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can be located in an application specific integrated circuit (Application Specific Integrated Circuits, referred to as: ASIC). Of course, the processor and the readable storage medium can also exist in the device as discrete components.

[0209] The division of units is only a logical function division, and there may be other divisions in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interface, device or unit, which can be electrical, mechanical or other forms.

[0210] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0211] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0212] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods of each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0213] Those skilled in the art can understand that all or part of the steps of implementing the above-mentioned method embodiments can be completed by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the steps of the above-mentioned method embodiments are executed; and the aforementioned storage medium includes: ROM, RAM, disk or optical disk and other media that can store program codes.

[0214] Finally, it should be noted that those skilled in the art will readily conceive of other embodiments of the present invention after considering the specification and practicing the invention disclosed herein. The present invention is intended to cover any variations, uses or adaptations of the present invention, which follow the general principles of the present invention and include common knowledge or customary technical means in the art not disclosed by the present invention, are not limited to the precise structure described above and shown in the drawings, and may be modified and changed in various ways without departing from the scope thereof. The scope of the present invention is limited only by the appended claims.

Claims

1. A method for determining a store location, characterized in that: The method comprises: Acquire an initial region combination set, wherein the initial region combination set includes a plurality of unit region combinations, and the unit region combination includes a plurality of unit regions; Repeat the following steps until the first preset condition is reached: For each unit area combination, the area of ​​the unit area in the unit area combination is expanded to obtain a first position area corresponding to the unit area in the unit area combination; and the fitness value of the unit area combination is determined according to the first position area corresponding to the unit area in the unit area combination; Performing cross mutation processing on the unit regions in the unit region combination to obtain an updated initial region combination set; Among them, the first preset condition is to reach a preset number of iterations; or, the first preset condition is that the rate of change of the fitness value of the unit area combination in the updated initial area combination set is less than a preset change rate; when the first preset condition is reached, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for building the store.

2. The method according to claim 1, characterized in that: For each unit area combination, the area of ​​the unit area in the unit area combination is expanded to obtain the first position area corresponding to the unit area in the unit area combination, including: For each unit area combination, the area of ​​the unit area in the unit area combination is expanded until the unit area in the unit area combination meets the second preset condition, so as to obtain the first position area corresponding to the unit area in the unit area combination; Among them, the second preset condition is that the number of users in the expanded unit area is less than or equal to the preset number of users; the first location area obtained when the second preset condition is met includes multiple complete unit areas; the first location area obtained when the second preset condition is met does not overlap with other expanded unit areas.

3. The method according to claim 1, characterized in that For each unit area combination, determining the fitness value of the unit area combination according to the first position area corresponding to the unit area in the unit area combination includes: For each unit area combination, determine the fitness value of the unit area combination according to a plurality of area data of the first location area corresponding to the unit area in the unit area combination and the construction cost information of the unit area in the unit area combination; The area data indicates relevant information of the first location area; and the construction cost information represents the construction cost of a unit area.

4. The method according to claim 3, characterized in that The fitness value of the unit area combination is Wherein, vkb is the value of the information represented by the bth region data of the kth first position region; vb is the value of the restriction condition represented by the bth region data; c is the total number of region data, c is a positive integer greater than or equal to 1; b is a positive integer greater than or equal to 1 and less than or equal to c; Bk is the value of the construction cost information of the kth first location area; n is the total number of first location areas corresponding to the unit area combination, n is a positive integer greater than or equal to 1; k is a positive integer greater than or equal to 1 and less than or equal to n.

5. The method according to claim 1, characterized in that Performing cross mutation processing on the unit regions in the unit region combination to obtain an updated initial region combination set, including: Determine a unit area combination whose fitness value is less than a first fitness threshold in the initial area combination set as a first candidate combination; Determine a first candidate combination whose fitness value is greater than a second fitness threshold, and disrupt the order of unit areas in the first candidate combination whose fitness value is greater than the second fitness threshold to obtain a second candidate combination; or select unit areas that are different from each unit area in the initial area combination set to form the second candidate combination; Determine the unit area combinations in the initial area combination set whose fitness values ​​are less than the third fitness threshold as the third candidate combinations; and recombine the unit areas in each of the third candidate combinations to obtain each fourth candidate combination, wherein the number of unit areas in the fourth candidate combination is the same as the number of unit areas in the third candidate combination; An updated initial area combination set is obtained according to the first candidate combination, the second candidate combination and the fourth candidate combination.

6. The method according to any one of claims 1 to 5, characterized in that The method further comprises: When the first preset condition is reached, the area of ​​the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is expanded until the unit area in the unit area combination meets the third preset condition, so as to obtain the second position area corresponding to the unit area in the unit area combination; wherein the third preset condition is that the path time between the center point of the expanded unit area and the farthest point of the expanded unit area on the road network is less than or equal to the value of the second preset time threshold; the second position area obtained when the third preset condition is met does not overlap with other expanded unit areas; the second position area is the expanded unit area; Determine the radiation range evaluation value of the second location area according to the area of ​​the second location area, the area of ​​the preset location area, the number of users in the preset unit area covered by the second location area, and the path information of the preset unit area covered by the second location area; wherein the unit area belongs to the preset location area; the radiation range evaluation value indicates the number of users and driving information when a store is built at the center point of the second location area; The second location area and the radiation range evaluation value of the second location area are fed back to the user.

7. A device for determining a store location, characterized in that: The device comprises: An acquisition module, used for acquiring an initial region combination set, wherein the initial region combination set includes a plurality of unit region combinations, and the unit region combination includes a plurality of unit regions; Repeat the following steps until the first preset condition is reached: A first processing module is used for performing expansion processing on the area of ​​a unit area in each unit area combination to obtain a first position area corresponding to the unit area in the unit area combination; A determination module, configured to determine a fitness value of the unit area combination according to a first position area corresponding to a unit area in the unit area combination; A second processing module is used to perform cross mutation processing on the unit regions in the unit region combination to obtain an updated initial region combination set; Among them, the first preset condition is to reach a preset number of iterations; or, the first preset condition is that the rate of change of the fitness value of the unit area combination in the updated initial area combination set is less than a preset change rate; when the first preset condition is reached, the center point of the unit area in the unit area combination with the lowest fitness value in the updated initial area combination set is used for building the store.

8. An electronic device, characterized in that: The electronic device comprises: a processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 6.

9. A computer-readable storage medium / computer program product, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 6 when executed by a processor; and / or, The computer program product comprises a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.