Business district determination method and device, medium and computer equipment

Abstract

The invention discloses a business district determination method and device, a medium and computer equipment. The method comprises the steps of obtaining a first business district where a current shop is located; the first business district is a business district obtained by expanding an original business district where the current shop is located; performing boundary contraction processing on the first business district to obtain a second business district; the area of the second business district is smaller than that of the first business district; smoothing the boundary of the second business district; the number of the first boundary points of the second business district after smoothing processing is smaller than the number of the first boundary points of the second business district before smoothing processing; obtaining a target business district where the current shop is located based on the first boundary point of the second business district after smoothing processing; the target business district is a range in which the delivery capacity can deliver the order of the current shop.

Description

Technical Field

[0001] The present disclosure relates to the field of logistics technology, and in particular, to a method and apparatus for determining a business district, a medium, and a computer device. Background Art

[0002] In the field of logistics, distribution capacity is allocated according to the business district where a store is located. The business district where a store is located is usually characterized by a set of boundary points of the business district, and the range enclosed by the boundary points is the business district where the store is located. In practical applications, sometimes it is necessary to expand the business district. However, the expanded business district may have the problem of being too large in area. In this case, the related art usually re-plans the business district. However, the re-planning process takes a long time and occupies a lot of resources. Summary of the Invention

[0003] In a first aspect, an embodiment of the present disclosure provides a method for determining a business district. The method includes: obtaining a first business district where a current store is located; the first business district is a business district obtained by expanding the original business district where the current store is located; performing boundary contraction processing on the first business district to obtain a second business district; the area of the second business district is smaller than the area of the first business district; performing smoothing processing on the boundary of the second business district; the number of first boundary points of the second business district after smoothing processing is smaller than the number of first boundary points of the second business district before smoothing processing; obtaining the target business district where the current store is located based on the first boundary points of the second business district after smoothing processing; the target business district is the range within which the distribution capacity can deliver orders for the current store.

[0004] In some embodiments, the performing boundary contraction processing on the first business district to obtain a second business district includes: obtaining a plurality of second boundary points of the first business district; deleting boundary points that meet the deletion condition among the plurality of second boundary points; determining the area enclosed by the undeleted boundary points as the second business district; wherein the deletion condition is determined based on at least one of the following: whether the second business district obtained after deleting the second boundary point is a connected business district; the order volume of the sub-region corresponding to the candidate boundary point among the second boundary points; whether the candidate boundary point among the second boundary points is a boundary point within the original business district.

[0005] In some embodiments, the method further includes: obtaining candidate boundary points among the plurality of second boundary points; if the second business district obtained after deleting the candidate boundary point is connected, determining the candidate boundary point as a boundary point that meets the deletion condition.

[0006] In some embodiments, the method further includes: determining a passable sub-region in the second business district; if there are no first sub-region and second sub-region in the second business district that satisfy the following condition, determining that the second business district is connected: starting from the first sub-region and moving in the passable sub-region, when the number of moving steps reaches a preset maximum number of steps, still not reaching the second sub-region; wherein, the first sub-region and the second sub-region are any sub-regions in the passable sub-region.

[0007] In some embodiments, the method further includes: obtaining the order volume of the sub-region corresponding to the candidate boundary point among the multiple second boundary points; if the order volume of the sub-region corresponding to the candidate boundary point is less than or equal to a preset quantity, determining that the candidate boundary point is a boundary point that satisfies the deletion condition.

[0008] In some embodiments, the method further includes: if the sub-region corresponding to the candidate boundary point among the multiple second boundary points is not a sub-region within the original business district, determining that the candidate boundary point is a boundary point that satisfies the deletion condition.

[0009] In some embodiments, the smoothing process of the boundary of the second business district includes: obtaining a plurality of consecutive first target boundary points in the second business district that satisfy a preset condition; performing a smoothing process on the smoothable boundary segment formed by the plurality of first target boundary points; wherein, the preset condition includes: only being on the boundary of the second business district where the current store is located; or being on the common boundary of the second business district where the current store is located and the second business district where the same adjacent store is located.

[0010] In some embodiments, the obtaining a plurality of consecutive first target boundary points in the second business district that satisfy a preset condition includes: obtaining the marking information of the first boundary point, where the marking information is used to indicate the probability that the first boundary point belongs to only one store; obtaining the association relationship between the first boundary point and the store, where the association relationship is used to determine the store to which each first boundary point belongs; based on the marking information and the association relationship, determining a plurality of consecutive first target boundary points that satisfy the preset condition.

[0011] In some embodiments, a plurality of consecutive first target boundary points that meet preset conditions are stored in a temporary boundary list; the obtaining of the plurality of consecutive first target boundary points that meet preset conditions in the second business circle includes: when the marking information of the current boundary point among the plurality of first boundary points is second marking information, if the current boundary point is the end point among the plurality of first boundary points, or the current boundary point belongs to multiple stores, determining the boundary points already stored in the temporary boundary list as the plurality of consecutive first target boundary points that meet preset conditions, where the second marking information is used to indicate that the probability that the current boundary point belongs to only one store is greater than the probability that the current boundary point belongs to multiple stores; the method further includes: after smoothing the first target boundary points, clearing the temporary boundary list and adding the current boundary point to the temporary boundary list.

[0012] In some embodiments, the method further includes: when the marking information of the current boundary point is the second marking information, if the current boundary point is not the end point among the plurality of first boundary points and the current boundary point belongs to only one store, adding the current boundary point to the temporary boundary list.

[0013] In some embodiments, the method further includes: if the current boundary point is the first starting point among the plurality of first boundary points and the first starting point belongs to only one store, adding the current boundary point to the temporary boundary list and setting the marking information of the next boundary point of the current boundary point in the second business circle as the second marking information, where the marking information of the first starting point is first marking information different from the second marking information.

[0014] In some embodiments, a plurality of consecutive first target boundary points that meet a preset condition are stored in a temporary boundary list; the method further includes: when the marking information of the current boundary point among the plurality of first boundary points is third marking information, if the current boundary point is the end point among the plurality of first boundary points, or the current boundary point belongs to only one store, obtain a second starting point of the temporary boundary list, where the third marking information is used to indicate that the probability that the current boundary point belongs to only one store is less than the probability that the current boundary point belongs to multiple stores; obtain a second target boundary point, where the second target boundary point is the previous boundary point of the second starting point among the plurality of first boundary points; determine the store list to which the second target boundary point belongs and the candidate stores to which the second starting point belongs; neither the store list nor the candidate stores include the current store; if the candidate store is not in the store list, determine the boundary points already stored in the temporary boundary list as a plurality of consecutive first target boundary points that meet the preset condition; after smoothing the plurality of consecutive first target boundary points that meet the preset condition, clear the temporary boundary list and add the current boundary point to the temporary boundary list.

[0015] In some embodiments, the method further includes: if the candidate store is in the store list, determine whether the second target boundary point and the second starting point are neighborhood boundary points within the second business district where the candidate store is located; if so, update the second starting point to the second target boundary point, update the next boundary point of the second starting point in the temporary list to the second starting point, and return to the step of determining the store list to which the second target boundary point belongs.

[0016] In some embodiments, the method further includes: if the second target boundary point and the second starting point are not neighborhood boundary points within the second business district where the candidate store is located, determine the boundary points between the second starting point and the end point of the temporary boundary list as a plurality of consecutive first target boundary points that meet the preset condition; after smoothing the plurality of consecutive first target boundary points that meet the preset condition, clear the temporary boundary list and add the current boundary point to the temporary boundary list.

[0017] In some embodiments, the smoothing process for a continuous plurality of first target boundary points that meet a preset condition includes: If the number of boundary points between the second starting point and the ending point of the temporary boundary list is greater than 0, obtain a pre-stored common boundary list. The boundary points in the common boundary list are the boundary points after smoothing, and the ending point of the common boundary list corresponds to the second starting point of the temporary boundary list, and the starting point of the common boundary list corresponds to the ending point of the temporary boundary list; Determine the boundary points in the common boundary list as the boundary points after smoothing corresponding to the continuous plurality of first target boundary points that meet the preset condition; If the number of boundary points between the second starting point and the ending point of the temporary boundary list is equal to 0, perform a smoothing process on the boundary points already stored in the temporary boundary list.

[0018] In some embodiments, the method further includes: When the marking information of the current boundary point is the third marking information, if the current boundary point is not the ending point among the plurality of first boundary points and the current boundary point belongs to multiple stores, determine whether the current boundary point and the previous boundary point in the second business district are neighborhood boundary points within the second business district where the candidate store is located; If so, add the current boundary point to the temporary boundary list; Otherwise, return to the step of obtaining the second starting point of the temporary boundary list.

[0019] In some embodiments, the method further includes: If the current boundary point is the first starting point among the plurality of first boundary points and the first starting point belongs to multiple stores, add the current boundary point to the temporary boundary set, and set the marking information of the next boundary point of the current boundary point in the second business district to the third marking information, where the marking information of the first starting point is the first marking information different from the third marking information.

[0020] In some embodiments, the method further includes: After smoothing a continuous plurality of first target boundary points that meet a preset condition, add the smoothed first boundary points to the final boundary list, and return to the step of obtaining the continuous plurality of first target boundary points that meet the preset condition in the second business district until all the boundary points in the second business district are obtained; Among them, the boundary points in the final boundary list are used to obtain the target business district of the current store.

[0021] Second aspect, embodiments of the present disclosure provide a business district determination device, the device comprising: a first acquisition module for acquiring a first business district where the current store is located; the first business district being a business district obtained by expanding the original business district where the current store is located; a contraction processing module for performing boundary contraction processing on the first business district to obtain a second business district; the area of the second business district being smaller than the area of the first business district; a smoothing processing module for smoothing the boundary of the second business district; the number of first boundary points of the second business district after smoothing being smaller than the number of first boundary points of the second business district before smoothing; a second acquisition module for acquiring a target business district where the current store is located based on the first boundary points of the second business district after smoothing; the target business district being the range within which the delivery capacity can deliver orders for the current store.

[0022] In some embodiments, the contraction processing module is configured to: acquire a plurality of second boundary points of the first business district; delete boundary points that meet the deletion condition among the plurality of second boundary points; and determine the area enclosed by the undeleted boundary points as the second business district; wherein the deletion condition is determined based on at least one of the following: whether the second business district obtained after deleting the second boundary point is a connected business district; the order volume of the sub-region corresponding to the candidate boundary point among the second boundary points; whether the candidate boundary point among the second boundary points is a boundary point within the original business district.

[0023] In some embodiments, the device further comprises: a third acquisition module for acquiring candidate boundary points among the plurality of second boundary points; a first determination module for determining that the candidate boundary point meets the deletion condition if the second business district obtained after deleting the candidate boundary point is connected.

[0024] In some embodiments, the device further comprises: a second determination module for determining a passable sub-region in the second business district; a third determination module for determining that the second business district is connected if there are no first sub-region and second sub-region in the second business district that meet the following condition: starting from the first sub-region and moving in the passable sub-region, when the number of moving steps reaches a preset maximum number of steps, the second sub-region has not been reached yet; wherein the first sub-region and the second sub-region are any sub-regions in the passable sub-region.

[0025] In some embodiments, the device further comprises: a fourth acquisition module for acquiring the order volume of the sub-region corresponding to the candidate boundary point among the plurality of second boundary points; a fourth determination module for determining that the candidate boundary point meets the deletion condition if the order volume of the sub-region corresponding to the candidate boundary point is less than or equal to a preset quantity.

[0026] In some embodiments, the device further includes: a fifth determination module, configured to determine, if a sub-region corresponding to a candidate boundary point among the multiple second boundary points is not a sub-region within the original business circle, that the candidate boundary point is a boundary point satisfying the deletion condition.

[0027] In some embodiments, the smoothing processing module is configured to: obtain multiple consecutive first target boundary points in the second business circle that meet a preset condition; perform smoothing processing on a smoothable boundary segment formed by connecting the multiple first target boundary points; where the preset condition includes: only being on the boundary of the second business circle where the current store is located; or being on a common boundary between the second business circle where the current store is located and the second business circle where the same adjacent store is located.

[0028] In some embodiments, the smoothing processing module is configured to: obtain marking information of the first boundary point, where the marking information is used to indicate the probability that the first boundary point belongs to only one store; obtain an association relationship between the first boundary point and the store, where the association relationship is used to determine the store to which each first boundary point belongs; based on the marking information and the association relationship, determine multiple consecutive first target boundary points that meet the preset condition.

[0029] In some embodiments, multiple consecutive first target boundary points that meet the preset condition are stored in a temporary boundary list; the smoothing processing module is configured to: when the marking information of the current boundary point among the multiple first boundary points is second marking information, if the current boundary point is the end point among the multiple first boundary points, or the current boundary point belongs to multiple stores, determine the boundary points already stored in the temporary boundary list as multiple consecutive first target boundary points that meet the preset condition, where the second marking information is used to indicate that the probability that the current boundary point belongs to only one store is greater than the probability that the current boundary point belongs to multiple stores; the device further includes: a first clearing module, configured to, after performing smoothing processing on the first target boundary points, clear the temporary boundary list and add the current boundary point to the temporary boundary list.

[0030] In some embodiments, the device further includes: a first adding module, configured to, when the marking information of the current boundary point is the second marking information, if the current boundary point is not the end point among the multiple first boundary points and the current boundary point belongs to only one store, add the current boundary point to the temporary boundary list.

[0031] In some embodiments, the device further includes: a first setting module, configured to, if the current boundary point is the first starting point among the multiple first boundary points and the first starting point belongs to only one store, add the current boundary point to the temporary boundary list, and set the marking information of the next boundary point of the current boundary point in the second business district to the second marking information, where the marking information of the first starting point is a first marking information different from the second marking information.

[0032] In some embodiments, a plurality of consecutive first target boundary points that meet a preset condition are stored in the temporary boundary list; the device further includes: a second starting point obtaining module, configured to, when the marking information of the current boundary point among the multiple first boundary points is the third marking information, if the current boundary point is the end point among the multiple first boundary points, or the current boundary point belongs to only one store, obtain the second starting point of the temporary boundary list, where the third marking information is used to indicate that the probability that the current boundary point belongs to only one store is less than the probability that the current boundary point belongs to multiple stores; a second target boundary point obtaining module, configured to obtain a second target boundary point, where the second target boundary point is the previous boundary point of the second starting point among the multiple first boundary points; a sixth determining module, configured to determine the store list to which the second target boundary point belongs and the candidate store to which the second starting point belongs; neither the store list nor the candidate store includes the current store; a seventh determining module, configured to, if the candidate store is not in the store list, determine the boundary points already stored in the temporary boundary list as a plurality of consecutive first target boundary points that meet the preset condition; a second clearing module, configured to, after smoothing the plurality of consecutive first target boundary points that meet the preset condition, clear the temporary boundary list, and add the current boundary point to the temporary boundary list.

[0033] In some embodiments, the device further includes: a first judging module, configured to, if the candidate store is in the store list, judge whether the second target boundary point and the second starting point are neighborhood boundary points in the second business district where the candidate store is located; a first updating module, configured to, if so, update the second starting point to the second target boundary point, update the next boundary point of the second starting point in the temporary list to the second starting point, and return to execute the function of the sixth determining module.

[0034] In some embodiments, the device further includes: an eighth determination module, configured to, if the second target boundary point and the second starting point are not neighborhood boundary points within the second business district where the candidate store is located, determine each boundary point between the second starting point and the end point of the temporary boundary list as a plurality of consecutive first target boundary points that meet the preset conditions; a third clearing module, configured to, after smoothing the plurality of consecutive first target boundary points that meet the preset conditions, clear the temporary boundary list and add the current boundary point to the temporary boundary list.

[0035] In some embodiments, the smoothing processing module is configured to: if the number of boundary points between the second starting point and the end point of the temporary boundary list is greater than 0, obtain a pre-stored common boundary list, where the boundary points in the common boundary list are boundary points after smoothing processing, and the end point of the common boundary list corresponds to the second starting point of the temporary boundary list, and the starting point of the common boundary list corresponds to the end point of the temporary boundary list; determine the boundary points in the common boundary list as the boundary points after smoothing processing corresponding to the plurality of consecutive first target boundary points that meet the preset conditions; if the number of boundary points between the second starting point and the end point of the temporary boundary list is equal to 0, perform smoothing processing on the boundary points already stored in the temporary boundary list.

[0036] In some embodiments, the device further includes: a second judgment module, configured to, when the marking information of the current boundary point is the third marking information, if the current boundary point is not the end point among the plurality of first boundary points and the current boundary point belongs to multiple stores, judge whether the current boundary point and the previous boundary point in the second business district are neighborhood boundary points within the second business district where the candidate store is located; if so, add the current boundary point to the temporary boundary list; otherwise, return to execute the function of the second starting point acquisition module.

[0037] In some embodiments, the device further includes:

[0038] A second setting module, configured to, if the current boundary point is the first starting point among the plurality of first boundary points and the first starting point belongs to multiple stores, add the current boundary point to the temporary boundary set and set the marking information of the next boundary point of the current boundary point in the second business district as the third marking information, where the marking information of the first starting point is a first marking information different from the third marking information.

[0039] In some embodiments, the device further includes:

[0040] A return module, configured to, after smoothing a plurality of consecutive first target boundary points that meet a preset condition, add the smoothed first boundary points to a final boundary list, and return to execute the function of the smoothing module until all boundary points in the second business circle are obtained; wherein, the boundary points in the final boundary list are used to obtain the target business circle of the current store.

[0041] In a third aspect, an embodiment of the present disclosure provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the method described in any embodiment of the present disclosure is implemented.

[0042] In a fourth aspect, an embodiment of the present disclosure provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the program, the method described in any embodiment of the present disclosure is implemented.

[0043] In the embodiments of the present disclosure, the area of the first business circle is reduced by performing boundary contraction processing on the first business circle obtained by expanding the original business circle to obtain a second business circle, and then the target business circle where the current store is located is obtained according to the second business circle. In this way, when the first business circle is too large, there is no need to re-plan the first business circle. Since the boundary contraction processing takes a short time and consumes less resources, it can effectively reduce the time and resource consumption when obtaining the target business circle. In addition, by smoothing a plurality of first boundary points of the second business circle, the number of boundary points on the second business circle can be reduced, thereby reducing the storage resources required to store the boundary points on the target business circle and reducing the processing resources occupied when processing the boundary points on the target business circle.

[0044] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and do not limit the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The accompanying drawings here are incorporated into the specification and constitute a part of the present disclosure. These drawings show embodiments consistent with the present disclosure and are used together with the specification to illustrate the technical solutions of the present disclosure.

[0046] Figure 1 It is a schematic diagram of the business circle and boundary points of the embodiments of the present disclosure.

[0047] Figure 2 It is a flowchart of the business circle determination method of the embodiments of the present disclosure.

[0048] Figure 3 It is a schematic diagram of the original business circle, the first business circle and the sub-region of the embodiments of the present disclosure.

[0049] Figure 4A and Figure 4BSchematic diagrams of neighborhood boundary points of embodiments of the present disclosure respectively.

[0050] Figure 5 Schematic diagram of boundary points of embodiments of the present disclosure.

[0051] Figure 6 Schematic diagram of a cavity of embodiments of the present disclosure.

[0052] Figure 7 Schematic diagram of a connected business district of embodiments of the present disclosure.

[0053] Figure 8 Schematic diagram of a non - connected business district of embodiments of the present disclosure.

[0054] Figure 9A Schematic diagram of boundary points of the business districts of adjacent stores of embodiments of the present disclosure.

[0055] Figure 9B Schematic diagram of the smoothing process of boundary points of the business districts of adjacent stores of embodiments of the present disclosure.

[0056] Figure 10 Schematic diagram of boundary points of the business districts of adjacent stores of embodiments of the present disclosure and their numbers.

[0057] Figure 11 Overall flowchart of the boundary smoothing process of embodiments of the present disclosure.

[0058] Figure 12 Schematic diagram of boundary points of the business districts of adjacent stores of another embodiment of the present disclosure and their numbers.

[0059] Figure 13 Schematic diagram of boundary points of the business districts of adjacent stores of yet another embodiment of the present disclosure and their numbers.

[0060] Figure 14 Schematic diagram of boundary points of embodiments of the present disclosure and their marking information.

[0061] Figure 15A And Figure 15B Schematic diagram of the smoothing process of embodiments of the present disclosure.

[0062] Figure 16 Schematic diagram of the process of selecting the first starting point of embodiments of the present disclosure.

[0063] Figure 17 Block diagram of the business district determination device of embodiments of the present disclosure.

[0064] Figure 18 Schematic diagram of a computer device of embodiments of the present disclosure. Detailed implementation manners

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

[0066] The terms used in the present disclosure are for the purpose of describing particular embodiments only and are not intended to limit the present disclosure. The singular forms "a", "the", and "said" used in the present disclosure and the appended claims are also intended to include the plural forms unless the context clearly dictates otherwise. It should also be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. Additionally, the term "at least one" as used herein represents any one of a plurality or any combination of at least two of a plurality.

[0067] It should be understood that although the terms first, second, third, etc. may be used in the present disclosure to describe various information, such information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of the present disclosure, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein may be interpreted as "when" or "while" or "in response to determining".

[0068] In order to enable those skilled in the art to better understand the technical solutions in the embodiments of the present disclosure and to make the above-mentioned objects, features, and advantages of the embodiments of the present disclosure more obvious and understandable, the technical solutions in the embodiments of the present disclosure will be further described in detail below with reference to the accompanying drawings.

[0069] The business district where the store is located is usually characterized by a set of boundary points of the business district. Figure 1 A schematic diagram showing the business district and the boundary points is shown. Among them, the area where the five-pointed star is located represents the store, the polygonal area where the store is located represents the business district where the store is located, and the black dots on the boundary line of the business district represent the boundary points of the business district. After the business district of the store has been formed, due to various needs, it is necessary to expand the business district. However, the expanded business district may have the problem of being too large in area. In this case, the related art usually re-plans the business district. However, the process of re-planning takes a long time and occupies a lot of resources.

[0070] Based on this, the embodiments of the present disclosure provide a method for determining a business district. See Figure 2 , the method includes:

[0071] Step S1: Obtain the first business district where the current store is located; the first business district is the business district obtained by expanding the original business district of the current store.

[0072] Step S2: Perform boundary contraction processing on the first business district to obtain a second business district; the area of the second business district is smaller than the area of the first business district.

[0073] Step S3: Smooth the boundary of the second business district; after the smoothing process, the number of first boundary points of the second business district is less than the number of first boundary points of the second business district before the smoothing process.

[0074] Step S4: Obtain the target business district where the current store is located based on the first boundary points of the second business district after the smoothing process; the target business district is the range within which the delivery capacity can deliver the orders of the current store.

[0075] In the embodiments of the present disclosure, when the area of the first business district obtained after expanding the original business district is too large, there is no need to re-plan the first business district. Instead, the area of the first business district is reduced by performing boundary contraction processing on the first business district to obtain a second business district, and then the target business district where the current store is located is obtained based on the second business district. Since the boundary contraction processing takes less time and consumes fewer resources, it can effectively reduce the time and resource consumption when obtaining the target business district.

[0076] In step S1, the current store is the store where the current boundary contraction is performed. The original business district of the current store can be a pre-generated area. For example, it can be manually delimited by the user or automatically generated according to a certain algorithm. The original business district includes multiple sub-regions, and each sub-region can be divided according to longitude and latitude. As Figure 3 shown, multiple grid points can be divided in the physical space according to the first interval in the longitude direction and the second interval in the latitude direction. Each grid point is a sub-region, which can be called a Grid of Interest (GOI), as shown by the black squares and gray squares in the figure. Among them, the area composed of the black squares is the first business district. The first interval and the second interval can be equal or unequal. In other examples, the sub-region can also be a region of other shapes (such as a hexagon), or the sub-region can also be a region with specific semantic information, such as an office building, a community, a hospital, etc. The target area can also be divided into multiple sub-regions in other ways, which will not be listed one by one here.

[0077] For ease of understanding, each sub-region can be abstracted as a point. The sub-regions located on the boundary of the business district can be called boundary points, and the sub-regions in the business district other than the boundary points are called non-boundary points. The set composed of boundary points is called the boundary point set or the boundary point collection. In some embodiments, a certain point on the sub-region within the business district (for example, the center point or the corner point of the sub-region) can be used to represent the sub-region within the business district. After obtaining the original business district, the original business district can be expanded in a certain way to obtain the first business district, including the area composed of the black squares and the area composed of the gray squares in the figure.

[0078] In step S2, when the area of the first business district does not meet the requirements, boundary contraction processing can be performed on the first business district. Among them, the area of the first business district not meeting the requirements can be that the area of the first business district is greater than x times the area of the original business district (x is a constant greater than 1). For example, the value of x can be 2. Then, when the area of the first business district is greater than 2 times the area of the original business district, it can be determined that the area of the first business district does not meet the requirements, and thus boundary contraction processing is required.

[0079] In some embodiments, multiple second boundary points of the first business district can be obtained, and the boundary points that meet the deletion conditions among the multiple second boundary points are deleted. The area surrounded by the remaining boundary points (i.e., the non-deleted boundary points) is the second business district. Further, some boundary points of the first business district can be deleted layer by layer. Still taking Figure 3 as an example, the boundary points in the first row in Figure 3 can be deleted first. After deleting these boundary points, Figure 3 the sub-regions in the second row in

[0080] become boundary points. If the area of the first business district still does not meet the requirements, the sub-regions in the second row can be further deleted. And so on, until the area of the first business district meets the requirements. Since some boundary points in the first business district are deleted during the boundary contraction process, the area of the obtained second business district is smaller than the area of the first business district. Figure 4A As shown in Figure 4BAs shown in the figure, the neighborhood points of candidate point a in the figure include the sub-region represented by the gray square and the sub-region represented by the black square. If at least one neighborhood point of the candidate point is not within the first business circle, determine that the candidate point is the second boundary point of the first business circle. As Figure 5 shown, in an embodiment where the neighborhood points include eight adjacent sub-regions as Figure 4B shown, the neighborhood points in the upper left and lower right of candidate point a are not within the first business circle. Therefore, candidate point a is the second boundary point of the first business circle; while all eight neighborhood points of candidate point b are within the first business circle. Therefore, candidate point b is not the second boundary point of the first business circle.

[0081] In some embodiments, there may be voids within the first business circle. If the sub-regions surrounding a group of connected sub-regions (including one or more sub-regions) are all included in the first business circle, but this group of sub-regions is not included in the first business circle, then this group of sub-regions is a void. As Figure 6 shown, each square represents a sub-region. The sub-regions represented by the gray squares are connected to each other. If the other sub-regions surrounding the sub-regions represented by the gray squares (i.e., the sub-regions represented by the black squares) are all included in the first business circle, but the sub-regions represented by the gray squares are not included in the first business circle, then the sub-regions represented by the gray squares are voids.

[0082] Grid points in the physical space can be obtained. If all the neighborhood points of the grid point are within the first business circle and the grid point is outside the first business circle, add the grid point to the first business circle. In this way, the voids within the first business circle can be filled, thereby removing the voids. After removing the voids, determine whether the candidate point is the second boundary point of the first business circle based on whether all the neighborhood points of the candidate point are within the first business circle, so as to avoid incorrect determination of boundary points due to the existence of voids.

[0083] In some embodiments, the deletion condition is determined based on at least one of the following:

[0084] Condition 1: Whether the second business circle obtained after deleting the second boundary point is a connected business circle. After deleting the boundary point, it is necessary to ensure that the obtained second business circle is connected. Therefore, candidate boundary points among multiple second boundary points can be obtained. If the second business circle obtained after deleting the candidate boundary point is connected, it can be determined that the candidate boundary point is the boundary point that meets the deletion condition. Otherwise, it is determined that the candidate point does not meet the deletion condition, that is, the candidate point cannot be deleted.

[0085] In some embodiments, a passable sub-region in the second business district can be determined. If there are no first and second sub-regions in the second business district that meet the following conditions, it is determined that the second business district is connected: starting from the first sub-region and moving in the passable sub-region, when the number of moving steps reaches a preset maximum number of steps, the second sub-region has not been reached yet. Herein, the first sub-region and the second sub-region are any sub-regions in the passable sub-region.

[0086] As Figure 7 shown, each dot represents a sub-region, and the set of dots represents the second business district. The black dots represent passable sub-regions, and the white dots represent non-passable sub-regions. Assume that the first sub-region is sub-region a (the dot within the rhombus in the figure), and the second sub-region is sub-region b (the dot within the triangle in the figure). Assume that the maximum number of steps is 20. Then, when starting from the first sub-region and moving in the passable sub-region, the second sub-region can be reached after 6 steps. And no matter how the first sub-region and the second sub-region are selected, when starting from the first sub-region and moving in the passable sub-region, the second sub-region can always be reached before the preset maximum number of steps is reached. Therefore, the second business district is connected. As Figure 8 shown, when starting from the first sub-region and moving in the passable sub-region, even when the number of moving steps reaches the maximum number of steps, the second sub-region still cannot be reached. Therefore, the second business district is not connected. By setting Condition 1, it can be ensured that the second business district obtained after deleting the boundary points is still connected.

[0087] Condition 2: The order volume of the sub-region corresponding to the candidate boundary point among the second boundary points. After deleting the boundary points, it is necessary to ensure that the order volume within the second business district does not decrease significantly. The order volume of the sub-region corresponding to the candidate boundary point among multiple second boundary points can be obtained. If the order volume of the sub-region corresponding to the candidate boundary point is less than or equal to a preset quantity, it is determined that the candidate boundary point is a boundary point that meets the deletion condition. Otherwise, it is determined that the candidate boundary point does not meet the deletion condition. Herein, the preset quantity can be 0 or other values. When the preset quantity is 0, if the order volume of a candidate boundary point is 0, it is determined that the candidate boundary point is a boundary point that meets the deletion condition; otherwise, it is determined that the candidate boundary point does not meet the deletion condition. In some embodiments, the order volume of a sub-region can be determined based on the total number of order transactions (TotalCovers, TC) within the sub-region. By setting Condition 2, the order volume within the second business district can be effectively guaranteed, and the situation where the order volume within the second business district decreases significantly due to boundary contraction can be reduced.

[0088] Condition 3: Whether the candidate boundary points among the second boundary points are boundary points within the original business circle. After performing boundary contraction processing, it is desired to ensure that the original business circle of the current store remains unchanged as much as possible. Since the delivery capacity is familiar with the routes within the original business circle, in this way, the delivery capacity can be made to perform deliveries as much as possible on familiar routes and in familiar areas, thereby improving the delivery efficiency. In addition, since some users tend to place orders at familiar stores, by adopting the solution of this embodiment, the original order placement habits of users can also be satisfied as much as possible, improving the user experience and reducing the loss of users caused by the change of the business circle for the store. Specifically, if the candidate boundary points among the multiple second boundary points are not boundary points within the original business circle, determine that the candidate boundary points are boundary points that meet the deletion conditions. Otherwise, determine that the candidate boundary points do not meet the deletion conditions. For example, assume that boundary point a is included in the original business circle corresponding to store A. When performing boundary contraction, boundary point a will be retained in the second business circle corresponding to store A and will not be deleted from the second business circle corresponding to store A.

[0089] After performing boundary contraction processing on the first business circle, it is also possible to determine whether the ratio of the area of the second business circle to the area of the first business circle is greater than a preset ratio (the preset ratio is greater than 1). If so, return to the step of performing boundary contraction processing on the first business circle. In this embodiment, through multiple iterations, the second business circle with an area that meets the conditions is finally determined.

[0090] After obtaining the second business circle after boundary contraction, the number of boundary points of the second business circle may increase, which will result in more processing resources and storage resources being required to process and store the boundary points of the second business circle during business processing. Therefore, in step S3, the boundary of the second business circle can be smoothed, and this process is called the boundary smoothing process. Smoothing processing can reduce the number of boundary points, thereby reducing the storage resources and processing resources required for the multiple first boundary points of the second business circle. For example, see Figure 15A , for multiple boundary points a, b, and c that are collinear or approximately collinear (the angle is close to 180°), removing boundary point a does not affect the scope of the business circle. Therefore, boundary point a can be removed through smoothing processing, and only boundary point b and boundary point c are retained. Another example, see Figure 15B , since there is an upper limit to the number of boundary points that the business system can process, even if sacrificing the scope of the business circle after removing boundary point a, boundary point a still needs to be removed to ensure that the number of boundary points does not exceed the upper limit of the number of boundary points that the business system can process. However, in practical applications, smoothing the boundary points may cause the business circles of adjacent stores to overlap. As Figure 9AAs shown, the boundary points of the business area of Store A and the boundary points of the business area of Store B overlap in some areas and do not overlap in some areas. If the common boundary points of Stores A and B are continuous, then using the same boundary smoothing process, Stores A and B will not overlap at the continuous common boundary points. However, if it is as shown in Figure 9B , if there are non-common boundary points between two segments of continuous common boundary points, after the boundary smoothing process, the boundary points of Store A are shown as the gray solid line in the figure, and the boundary points of Store B after the boundary smoothing process are shown as the gray dashed line in the figure. It can be seen that the business areas of Stores A and B overlap with each other.

[0091] To solve the above problems, embodiments of the present disclosure can obtain a plurality of consecutive first target boundary points that meet preset conditions, and perform a smoothing process on the smoothable boundary segments formed by the plurality of first target boundary points. Among them, the preset conditions include: only being on the boundary of the second business area where the current store is located (hereinafter referred to as Condition 1), or being on the common boundary of the second business areas of the current store and the same adjacent store (hereinafter referred to as Condition 2).

[0092] As shown in Figure 10 , assume that the current store is Store A. Each black dot in the figure represents a first boundary point, and the numbers in the figure represent the numbers of the first boundary points. The first boundary points numbered 13 to 16 are a plurality of consecutive first target boundary points unique to Store A; the first boundary points numbered 8 to 10 are a plurality of consecutive first target boundary points on the common boundary between Store A and Store C (referred to as common boundary points). The boundary formed by the first boundary points numbered 8 to 10 is the common boundary between Store A and Store C, and the first boundary points numbered 8 to 10 are the common boundary points on the common boundary between Store A and Store C; the first boundary points numbered 17 to 21 are a plurality of consecutive common boundary points on the common boundary between Store A and Store B. The boundary formed by the first boundary points numbered 17 to 21 is the common boundary between Store A and Store B, and the first boundary points numbered 17 to 21 are the common boundary points on the common boundary between Store A and Store B. Therefore, for Store A, the first boundary points numbered 13 to 16 can be used as a group of first target boundary points (i.e., the above-mentioned plurality of consecutive first target boundary points that meet the preset conditions) for smoothing processing, the first boundary points numbered 8 to 10 can be used as another group of first target boundary points for smoothing processing, and the first boundary points numbered 17 to 21 can also be used as a group of first target boundary points for smoothing processing.

[0093] After the smooth boundary segments formed by connecting each set of first target boundary points are smoothed, they can be used to determine the target business area of the store to which the set of first target boundary points belongs. For example, the first boundary points numbered 13 to 16 are a set of consecutive first target boundary points unique to Store A. Therefore, after the first boundary points numbered 13 to 16 are smoothed, they are used to determine the target business area of Store A. The first boundary points numbered 8 to 10 are a set of consecutive first target boundary points on the common boundary between Store A and Store C. Therefore, after the first boundary points numbered 8 to 10 are smoothed, they are used to determine the target business areas of Store A and Store B respectively. The first boundary points numbered 17 to 21 are a set of consecutive first target boundary points on the common boundary between Store A and Store B. Therefore, after the first boundary points numbered 8 to 10 are smoothed, they are used to determine the target business areas of Store A and Store C respectively.

[0094] Since each set of first target boundary points for which smoothing is performed includes only consecutive boundary points on the boundary unique to the current store or only consecutive boundary points on the common boundary between the current store and an adjacent store, after smoothing such a set of first target boundary points, the target business areas of adjacent stores do not overlap.

[0095] In some embodiments, to facilitate determining a set of consecutive first target boundary points that meet a preset condition, marking information can be set for each first boundary point. The marking information is used to indicate the probability that a first boundary point belongs to only one store. If the probability that a first boundary point belongs to only one store is greater than the probability that the first boundary point belongs to multiple stores, the marking information of the first boundary point is second marking information. If the probability that a first boundary point belongs to only one store is less than the probability that the first boundary point belongs to multiple stores, the marking information of the first boundary point is third marking information. Here, a first boundary point belonging to only one store means that the first boundary point is on the boundary of the business area of this store, and a first boundary point belonging to multiple stores means that the first boundary point is on the common boundary of the business areas of these multiple stores. In particular, to identify the starting point (hereinafter referred to as the first starting point) among multiple first boundary points, the identification information of the first starting point can also be set as first identification information.

[0096] The first starting point can be the starting point of a set of consecutive first target boundary points that meet a preset condition. Still taking Figure 10Taking [a certain example], and assuming that each boundary point is connected in a clockwise direction, the boundary point numbered 13 is the starting point of a continuous series of first target boundary points that meet condition one, and the boundary points numbered 10 and 21 are both the starting points of a continuous series of first target boundary points that meet condition two. Therefore, the boundary point numbered 13, the boundary point numbered 10, or the boundary point numbered 21 can be determined as the first starting point. When using the above boundary points as the first starting point, a continuous series of boundary points after the first starting point can be processed using the same smoothing processing logic as the first starting point as a group of first target boundary points, thereby reducing the number of times of switching the smoothing processing logic, reducing the complexity of the smoothing processing, and improving the smoothing processing efficiency. For example, when using the boundary point numbered 9 as the first starting point, only the boundary point numbered 9 and the boundary point numbered 8 can be used as a group of first target boundary points for smoothing processing, the boundary points numbered 13 to 16 can be used as a group of first target boundary points for smoothing processing, then the boundary points numbered 21 to 17 can be used as a group of first target boundary points for smoothing processing, and then the boundary point numbered 10 is processed. In this way, it takes four times of processing to finally complete the boundary smoothing of store A. However, when using the boundary point numbered 13 as the first starting point, first, the boundary points numbered 13 to 16 can be used as a group of first target boundary points for smoothing processing, then the boundary points numbered 21 to 17 can be used as a group of first target boundary points for smoothing processing, and then the boundary points numbered 10 to 8 can be used as a group of first target boundary points for smoothing processing. In this way, only three times of processing are required.

[0097] In the case where the current boundary point belongs to multiple stores, the condition for the current boundary point to be selected as the first starting point is: both the current boundary point and the previous boundary point are common boundary points, but not the common boundary points of the current store and the same store. And when the previous boundary point is a common boundary point, but the current boundary point only belongs to the current store, the previous boundary point is used as the first starting point. That is to say, the first starting point is a common boundary point and belongs to the same store as its next boundary point. See Figure 16 , assuming there are three stores, denoted as A, B, and C respectively. Among them, store A has 4 boundary points, numbered 1, 2, 3, and 4 respectively, and these 4 boundary points are in order, and the order is 1→2→3→4→1, forming a closed loop. The boundary point numbered 2, point G 2 is the common boundary point of store A and store B, that is, f(G 2 ) = {A, B}, and the boundary point numbered 3, point G 3 is the common boundary point of store A and store C. Then f(G 3) = {A, C}. Initialize the starting point identifier st = 0, indicating that the first starting point in the default order is the first starting point, that is, the boundary point G numbered 1 in this example 1 . For G 1 , its previous boundary point is the boundary point G numbered 4 4 , and f(G 1 ) = f(G 4 ) = {A}, that is, the boundary point numbered 1 and the boundary point numbered 4 both belong to the boundary points of store A.

[0098] Define p = f(G 4 ) - f(G 1 ), q = f(G 1 ) - f(G 4 ), then At this time, the starting point identifier st is not updated. For the boundary point G numbered 2 2 , its previous boundary point is G 1 , at this time f(G 2 ) = {A, B}, f(G 1 ) = {A}, then q = {B}, at this time the starting point identifier st is not updated. For the boundary point G numbered 3 3 , its previous boundary point is G 2 , at this time f(G 3 ) = {A, C}, f(G 2 ) = {A, B}, then p = {B}, q = {C}, at this time update the starting point identifier st = G 3 . For the boundary point G numbered 4 4 , its previous boundary point is G 3 , at this time f(G 4 ) = {A}, f(G 3 ) = {A, C}, then p = {C}, At this time, update the starting point identifier st = G3. Finally, the first starting point is G 3 , and its final order is 3 → 4 → 1 → 2 → 3.

[0099] Any two of the first identification information, the second identification information, and the third identification information are not the same. In some embodiments, the marking information may include numbers, letters, and / or symbols. Taking the marking information including numbers as an example, the first marking information may be -1, and the marking information of other boundary points (referred to as non-starting points) other than the first starting point may be 0 or 1, where the second marking information may be 0 and the third marking information may be 1. Assuming the marking information is denoted as Flag, the setting method of the marking information of each first boundary point is as shown in the following table:

[0100] Starting point Non - starting point Higher probability of belonging to one store Flag = - 1 Flag = {0, 1} Higher probability of belonging to multiple stores Flag = - 1 Flag = {0, 1}

[0101] It can be understood that the above is only an exemplary illustration, and the representation methods of various marker information are not limited to those described in the above embodiments. In actual applications, there are often multiple consecutive boundary points that only belong to one store, or multiple consecutive boundary points that belong to multiple stores. Therefore, when the previous boundary point of a certain boundary point only belongs to one store, it is highly probable that this boundary point also belongs to one store; similarly, when the previous boundary point of a certain boundary point belongs to multiple stores, it is highly probable that this boundary point also belongs to multiple stores. Therefore, the identification information of the boundary point can be determined based on the number of stores to which the previous boundary point of this boundary point belongs. When the identification information of the boundary points is different, different smoothing processing procedures can be adopted. By setting different marker information for the boundary points, some unnecessary processing procedures can be omitted, thereby improving the smoothing processing efficiency.

[0102] It is also possible to obtain the association relationship between the first boundary point and the store, and this association relationship is used to determine the store to which each first boundary point belongs. By obtaining the association relationship between the first boundary point and the store, it can be determined whether the first boundary point belonging to multiple stores is the common boundary point of the current store and the same store. Among them, the association relationship can be denoted as f(g). Assuming that f(g) of a first boundary point = {A, B}, it means that the stores to which this first boundary point belongs include store A and store B, that is, this first boundary point is the common boundary point on the common boundary of store A and store B.

[0103] Based on the marker information and the association relationship, multiple consecutive first target boundary points that meet the preset conditions can be determined. For example, assuming that the marker information of multiple consecutive boundary points is all 0, then these multiple consecutive boundary points are only on the boundary of the second business district of the current store, that is, these multiple consecutive boundary points are multiple first target boundary points that meet condition one. If the marker information of multiple consecutive boundary points is all 1, then the stores to which these multiple consecutive boundary points belong can be determined based on the association relationship. If the stores to which these multiple consecutive boundary points belong are all the current store and the same store, then these multiple consecutive boundary points are multiple first target boundary points that meet condition two.

[0104] In some embodiments, a temporary boundary list can be established. Each time a boundary point is obtained, the boundary point can be added to the temporary boundary list, and the next boundary point can be obtained. When it is determined that the preset condition satisfied by the current boundary point has changed relative to the previous boundary point, the boundary points stored in the temporary boundary list can be obtained, and the obtained boundary points can be used as a group of first target boundary points for smoothing to obtain smoothed boundary points. Among them, the previous boundary point and the next boundary point of the current boundary point can be determined according to a pre-established index. For example, assuming that the boundary points stored in the temporary boundary list are all boundary points that meet condition one, and the current boundary point does not meet condition one, the boundary points in the temporary boundary list can be smoothed. The acquired boundary points can also be cleared from the temporary boundary list to facilitate smoothing of the next group of first target boundary points, and after clearing, the current boundary point is added to the temporary boundary list. The smoothed boundary points can be added to the final boundary list. After all boundary points of the current store are processed, the boundary points stored in the final boundary list are obtained, and the target business district of the current store is determined based on these boundary points. The following is combined with Figure 10 , Figure 11 and Figure 12 , an example is given to illustrate a method of obtaining a plurality of continuous first target boundary points that meet the preset conditions.

[0105] In the case where the marking information of the current boundary point among the multiple first boundary points is the second marking information, if the current boundary point is the end point among the multiple first boundary points, or the current boundary point belongs to multiple stores, the boundary points stored in the temporary boundary list (tmp) can be determined as multiple continuous first target boundary points that meet the preset conditions and smoothed. After the smoothing process, the temporary boundary list can be cleared and the current boundary point can be added to the temporary boundary list.

[0106] Among them, if the previous boundary point of the current boundary point among multiple first boundary points belongs to a store, the marking information of the current boundary point can be set to the second marking information, indicating that the current boundary point has a greater probability of belonging to only one store. However, if the current boundary point actually belongs to multiple stores, it means that the current boundary point and the previous boundary point meet different preset conditions, and the current boundary point is likely to be the starting point of multiple continuous common boundary points, and the previous boundary point is likely to be the end point of multiple continuous boundary points belonging to a single store. Therefore, the boundary points stored in the temporary boundary list are determined as multiple first target boundary points that meet the preset conditions, that is, a group of boundary points that need to be smoothed. The boundary points stored in the temporary boundary list can be smoothed and cleared from the temporary boundary list. Then, the current boundary point is used as a new starting point that needs to be smoothed and added to the temporary boundary list.

[0107] likeFigure 10 As shown, assume that the current store is Store B, the previous boundary point is the boundary point numbered 7, the current boundary point is the boundary point numbered 8, and the boundary points stored in the temporary boundary list include the boundary points numbered from 1 to 7. It can be seen that the boundary point numbered 7 is the end point of a continuous series of boundary points that only belong to Store B, and the boundary point numbered 8 is the starting point of a continuous series of common boundary points between Store B and Store A. Therefore, the boundary points stored in the temporary boundary list (including the boundary points numbered from 1 to 7) are smoothed as a group of boundary points. After clearing the temporary boundary list, the boundary point numbered 8 is added to the temporary boundary list as the starting point of another group of boundary points to be smoothed. If the current boundary point is the end point among multiple first boundary points, it means that each boundary point among the multiple first boundary points has been smoothed, and thus the entire process can be ended.

[0108] In the case where the marking information of the current boundary point is the second marking information, if the current boundary point is not the end point among multiple first boundary points and the current boundary point only belongs to one store, the current boundary point can be added to the temporary boundary list. Among them, if the previous boundary point of the current boundary point among the multiple first boundary points belongs to one store, the marking information of the current boundary point can be set to the second marking information, indicating that the current boundary point has a high probability of only belonging to one store. If the current boundary point is actually also on the boundary of the first business circle of only one store, it means that the previous boundary point and the current boundary point are both boundary points of a continuous series of boundary points belonging to a single store, and they belong to the same group of continuous multiple first target boundary points that need to be smoothed. Still referring to Figure 10 , assume that the previous boundary point is the boundary point numbered 6 and the current boundary point is the boundary point numbered 7. Then these two boundary points need to be smoothed as a group of boundary points. Therefore, the current boundary point is continuously added to the temporary boundary list, then the current boundary point is updated to the previous boundary point, and the next boundary point of the current boundary point is updated to the current boundary point, so as to further determine whether the end point of this group of first target boundary points has been traversed.

[0109] To facilitate the identification of the first starting point, the marking information of the first starting point can be recorded as the first marking information different from the second marking information. If the current boundary point is the first starting point and the first starting point belongs to only one store, the current boundary point is added to the temporary boundary list. And, as described above, the first starting point is the starting point of a continuous plurality of first target boundary points that meet the preset conditions (condition one or condition two). Since the first starting point is only on the boundary of the first business circle of one store, it can be determined that the first starting point is the starting point of a continuous plurality of first target boundary points that meet condition one. Therefore, there is a high probability that several boundary points after the first starting point also meet condition one, that is, they belong to only one store. Thus, the marking information of the next boundary point can be set as the second marking information. As Figure 10 shown, assuming that the first starting point is the boundary point numbered 1, it means that there is a high probability that the next several boundary points are all continuous boundary points belonging to a single store. Therefore, the marking information of the next boundary point (i.e., the boundary point numbered 2) is the second marking information, indicating that this boundary point has a high probability of belonging to only one store.

[0110] In the case where the marking information of the current boundary point among the multiple first boundary points is the third marking information, if the current boundary point is the end point among the multiple first boundary points, or the current boundary point belongs to only one store, the second starting point of the temporary boundary list can be obtained, and the previous boundary point of the second starting point among the multiple first boundary points (referred to as the second target boundary point) can be obtained. The store list to which the second target boundary point belongs and the candidate store to which the second starting point belongs (neither the store list nor the candidate store includes the current store) are determined. If the candidate store is not in the store list, the boundary points already stored in the temporary boundary list are determined as a continuous plurality of first target boundary points that meet the preset conditions. After smoothing the continuous plurality of first target boundary points that meet the preset conditions, the temporary boundary list is cleared, and the current boundary point is added to the temporary boundary list.

[0111] Among them, if the previous boundary point of the current boundary point among multiple first boundary points belongs to multiple stores, the marking information of the current boundary point can be set to the third marking information, indicating that the current boundary point has a high probability of also belonging to multiple stores. However, if the current boundary point belongs to only one store, it means that the previous boundary point is the end point of multiple consecutive common boundary points on the common boundary, and the current boundary point is the starting point of multiple consecutive boundary points belonging to a single store. Therefore, it is necessary to smooth the previous boundary point of the current boundary point and the boundary points before it. However, in the case where the previous boundary point belongs to multiple stores, it is also necessary to determine whether the consecutive boundary points of the current store are also consecutive boundary points in other stores. Only when these consecutive common boundary points are consecutive boundary points in both the current store and other stores, can these consecutive common boundary points be smoothed as a group of boundary points. For example, assume that the boundary point numbered 1 and the boundary point numbered 2 are consecutive boundary points of store A, but the consecutive boundary point numbers of store B are the boundary point numbered 1, the boundary point numbered 3, and the boundary point numbered 2 in sequence. Then, the boundary point numbered 1 and the boundary point numbered 2 are not consecutive boundary points of store B, and these three boundary points cannot be smoothed as a group of first target boundary points. If the boundary point numbered 1 and the boundary point numbered 2 are also consecutive boundary points of store B, these two boundary points can be smoothed as a group of first target boundary points.

[0112] Denote the second starting point of the temporary boundary list as g s , assuming that the second starting point is the boundary point with the order of i among multiple first boundary points, then the second target boundary point is the boundary point with the order of i - 1 in the boundary point list, denoted as g p . It is possible to determine the list of stores f(g p ) to which the first business district where the second target boundary point is located belongs. For example, assume that the second target boundary point is the common boundary point of store A and store B, then f(g p ) = {A, B}. It is also possible to determine the candidate store o to which the second starting point belongs. If the candidate store o is not in the store list f(g p ), it indicates that the second target boundary point g p and the second starting point g s are not the common boundary points of the current store and the same store. If the candidate store o is in the store list f(g p ), it indicates that the second target boundary point g p and the second starting point g s are the common boundary points of the current store and the same store.

[0113] Therefore, if the candidate store o is not in the store list f(g p ), it indicates that the second starting point is the starting point of another group of first target boundary points that need to be smoothed. For exampleFigure 12 As shown, assume that the boundary points numbered 21 to 17 are the common boundary points of store A and store C, the boundary points numbered 10 to 8 are the common boundary points of store A and store B, the boundary points numbered 13 to 16 are the boundary points that only belong to store A, the boundary points numbered 1 to 7 are the boundary points that only belong to store B, and the boundary points numbered 22 and 23 are the boundary points that only belong to store C. Assume that the second starting point is the boundary point numbered 10, and the previous boundary point (i.e., the second target boundary point) of the second starting point among the multiple first boundary points is the boundary point numbered 17. It can be seen that the store list f(g p ) includes {C}, and the candidate store o where the second starting point belongs includes {B}. Since the candidate store o is not in the store list f(g p ), therefore, the second target boundary point g p and the second starting point g s are not the common boundary points of the current store and the same store. That is to say, the second target boundary point g p is the common boundary point of the current store and a certain store, while the second starting point is the common boundary point of the current store and another store. Therefore, the boundary points starting from the second starting point (i.e., the boundary points already stored in the temporary boundary list) are multiple consecutive first target boundary points that meet the preset conditions. After smoothing the boundary points already stored in the temporary boundary list, the temporary boundary list can be cleared, and the current boundary point can be added to the temporary boundary list.

[0114] If the candidate store is in the store list, it can be determined whether the second target boundary point and the second starting point are neighborhood points within the first business circle of the candidate store. If so, update the second starting point to the target boundary point, update the next boundary point of the second starting point in the temporary list to the second starting point, and return to the step of determining the store list to which the second target boundary point belongs.

[0115] As Figure 12 shown, assume that the second starting point is the boundary point numbered 9, and the second target boundary point is the boundary point numbered 10. It can be seen that the store list f(g p ) includes {B}, and the candidate store o to which the second target boundary point belongs also includes {B}. Since the candidate store o is in the store list f(g p ), therefore, the second target boundary point g p and the second starting point g s are the common boundary points of the current store and the same store. If the second target boundary point g p and the second starting point g s are also adjacent boundary points in store B, that is, |k(g s ,o)-k(g p, if |k(gs,o) - k(gp,o)| = 1, then it can be smoothed as a set of first target boundary points. However, the second starting point g s may not be the end point of multiple consecutive first target boundary points that meet condition two. Therefore, the second starting point g s (i.e., the boundary point numbered 9) can be updated to the second target boundary point g p , and the next boundary point of the second starting point g s in the temporary list (i.e., the boundary point numbered 8) can be updated to the second starting point g s , and return the step of determining the store list to which the second target boundary point g p belongs, so as to determine the end point of multiple consecutive first target boundary points that meet condition two.

[0116] If the second target boundary point and the second starting point are not neighborhood points within the first business circle of the candidate store, that is, |k(gs,o) - k(gp,o)| > 1, the boundary points between the second starting point in the temporary boundary list and the end point g e of the temporary boundary list can be determined as multiple consecutive first target boundary points that meet the preset conditions. After smoothing the multiple consecutive first target boundary points that meet the preset conditions, clear the temporary boundary list and add the current boundary point to the temporary boundary list.

[0117] As Figure 13 shown, assume that the boundary points numbered 10, 9, 25, and 8 are the common boundary points of store A and store B, the boundary point numbered 24 is the boundary point that belongs to store B alone, the temporary boundary list includes the boundary points numbered 10, 9, 25, and 8, the second starting point is the boundary point numbered 25, the second target boundary point is the boundary point numbered 9, and the boundary point numbered 8 is the end point of the temporary boundary list. It can be seen that the boundary point numbered 9 and the boundary point numbered 25 are not adjacent boundary points in store B. Therefore, the boundary point numbered 9 can be ignored, and the boundary points numbered 25 and 8 can be smoothed as multiple consecutive first target boundary points that meet the preset conditions.

[0118] In some embodiments, after smoothing the boundary points on the common boundary between the current store and the adjacent store, the smoothed boundary points can be stored in a common boundary list. When smoothing the boundary points of the adjacent store, the smoothed boundary points can be directly obtained from the common boundary list and added to the final boundary list of the adjacent store to generate the target business district of the adjacent store. In this way, on the one hand, it can be ensured that the boundary points on the common boundary are smoothed using the same smoothing method to avoid overlapping of the target order delivery ranges of the current store and the adjacent store; on the other hand, the common boundary points do not need to be smoothed multiple times, and only need to be directly read from the common boundary list, thereby improving the smoothing efficiency.

[0119] Similarly, when smoothing the common boundary points between the current store and the adjacent store, the smoothed boundary points corresponding to the common boundary points can also be read from the common boundary list. If read, the boundary points in the common boundary list are directly determined as the smoothed boundary points corresponding to the continuous plurality of first target boundary points (i.e. the common boundary points) that meet the preset conditions. If not read, the common boundary points are smoothed using the smoothing algorithm.

[0120] Specifically, if the second starting point g of the temporary boundary list s and the end point g of the temporary edge list e The number of boundary points between s ,g e ) is greater than 0, the starting point and the end point in the common boundary list can be obtained. Since each store sorts the boundary points in the same direction (for example, clockwise), the end point of the common boundary list corresponds to the second starting point of the temporary boundary list, and the starting point of the common boundary list corresponds to the end point of the temporary boundary list. Each boundary point between the end point of the common boundary list and the starting point of the common boundary list can be added to the final boundary list of the current store in sequence. Figure 12 As shown in the figure, assuming that store A is the current store, the boundary points in the common boundary list of store A and store B are numbered 10, 9, and 8, respectively. The boundary point numbered 10 is the starting point in the common boundary list, and the boundary point numbered 8 is the end point in the common boundary list. Then the three boundary points numbered 8, 9, and 10 can be added to the final boundary list of store A in sequence. If the second starting point g of the temporary boundary list is s and the end point g of the temporary edge list e The number of boundary points between s ,g e ) is equal to 0, the boundary points stored in the temporary boundary list are directly smoothed.

[0121] In some embodiments, when the marking information of the current boundary point is the third marking information, if the current boundary point is not the end point among multiple first boundary points and the current boundary point belongs to multiple stores, it can be determined whether the current boundary point and the previous boundary point of the current boundary point among the multiple first boundary points are neighborhood points within the first business circle of the candidate store. If so, add the current boundary point to the temporary boundary list. Otherwise, return to the step of obtaining the second starting point of the temporary boundary list.

[0122] Among them, when the previous boundary point of the current boundary point among the multiple first boundary points belongs to multiple stores, the marking information of the current boundary point can be set as the third marking information, indicating that there is a high probability that the current boundary point also belongs to multiple stores. If the current boundary point actually belongs to multiple stores, it is necessary to determine whether the current boundary point and its previous boundary point are adjacent boundary points of the same store. If so, the current boundary point can be added to the temporary boundary list, the next boundary point of the current boundary point can be updated to the current boundary point, and the current boundary point can be updated to the previous boundary point of the current boundary point, and the above operations can be repeated until it is determined that the current boundary point and the previous boundary point are not adjacent boundary points of the same store. When it is determined that the current boundary point and the previous boundary point are not adjacent boundary points of the same store, the boundary points already stored in the temporary boundary list can be smoothed. As described above, the corresponding boundary points can be obtained from the public boundary list and used as the boundary points after smoothing. The specific method can refer to the foregoing embodiments and will not be elaborated here.

[0123] If the current boundary point is the first starting point among multiple first boundary points and the first starting point belongs to multiple stores, add the current boundary point to the temporary boundary set. And, as described above, the first starting point is the starting point of a continuous multiple first target boundary points that meet the preset conditions (condition one or condition two). Since the first starting point is on the boundary of the first business circle of multiple stores, it can be determined that the first starting point is the starting point of a continuous multiple first target boundary points that meet condition two. Therefore, there is a high probability that several boundary points after the first starting point also meet condition two, that is, belong to multiple stores. Thus, the marking information of the next boundary point of the current boundary point can be set as the third marking information. As Figure 10 shown, assuming that the first starting point is the boundary point numbered 21, it means that the next multiple boundary points are likely to be consecutive boundary points belonging to multiple stores. Therefore, the marking information of the next boundary point (i.e., the boundary point numbered 20) is the third marking information, indicating that this boundary point has a high probability of belonging to multiple stores.

[0124] After smoothing a plurality of consecutive first target boundary points that meet the preset conditions, the smoothed boundary points can be added to the final boundary list, and the step of obtaining a plurality of consecutive first target boundary points that meet the preset conditions can be returned until all the boundary points among the plurality of first boundary points are obtained. The boundary points in the final boundary list can be used to obtain the target business district where the current store is located. For example Figure 10 As shown, it is assumed that first, a group of boundary points numbered from 21 to 17 are smoothed and added to the final boundary list. Since the boundary points of store A have not been processed completely, therefore, the next group of boundary points to be smoothed are obtained, that is, a group of boundary points numbered from 10 to 8, which are smoothed and added to the final boundary list. Then, the next group of boundary points to be smoothed are obtained, that is, a group of boundary points numbered from 13 to 16, which are smoothed and added to the final boundary list. At this time, all the boundary points of store A have been processed, so that the target business district where store A is located can be obtained according to the three sections of smoothed boundary points in the final boundary list.

[0125] After determining the target business district, delivery capacity can be allocated to the orders within the target business district. Specifically, the orders of the users within the target business district for the stores belonging to the target business district can be obtained, and delivery capacity can be allocated to the orders of the users within the target business district for the stores belonging to the target business district according to the current position and the current order-carrying quantity of the delivery capacity within the target business district (that is, the number of orders currently undertaken by the delivery capacity).

[0126] The marking information of each boundary point in some embodiments is as Figure 14 shown. The numbers in parentheses represent the marking information of the boundary points, and the numbers without parentheses represent the numbers of the boundary points. The current store is store A, and the adjacent store of the current store is store B. The boundary point numbered 1 is the first starting point, and its marking information is recorded as -1, which is added to the temporary boundary list. Since the first starting point belongs to only one store, therefore, the marking information of its next boundary point (that is, the boundary point numbered 2) is 0, indicating that it probably belongs to only one store. It can be seen that the boundary point numbered 2 actually belongs to one store, so the boundary point numbered 2 can be added to the temporary boundary list. Similarly, the boundary points numbered 3 to 5 can be processed. After processing the boundary point numbered 5, the temporary boundary list includes the boundary points numbered 1 to 5. Since the boundary point numbered 5 belongs to only one store, it is predicted that the probability that the boundary point numbered 6 belongs to one store is relatively large, and its marking information is set to 0. However, the boundary point numbered 6 belongs to multiple stores, so the boundary points numbered 1 to 5 are taken out from the temporary boundary list, smoothed and added to the final boundary list. Then, the boundary point numbered 6 is added to the temporary boundary list.

[0127] At this time, there is only the boundary point numbered 6 in the temporary boundary list. Since it belongs to multiple stores and it is predicted that its next boundary point also belongs to multiple stores, the marking information of the boundary point numbered 7 is set to 1. However, the boundary point numbered 7 belongs to only one store. Therefore, the second starting point of the temporary boundary list (i.e., the boundary point numbered 6) and its previous boundary point on the boundary of the first business district (i.e., the boundary point numbered 5, which is also the second target boundary point) are obtained. The candidate store to which the second starting point belongs is not in the store list to which the second target boundary point belongs. Therefore, each boundary point between the second starting point of the temporary boundary list and the end point of the temporary boundary list is obtained. Since the number of boundary points between the second starting point of the temporary boundary list and the end point of the temporary boundary list is equal to 0, the boundary point already stored in the temporary boundary list (i.e., the boundary point numbered 6) is directly smoothed and then added to the final boundary list, and the boundary point numbered 6 is cleared from the temporary boundary list. Then, the boundary point numbered 7 is added to the temporary boundary list. The processing methods of the remaining boundary points can be referred to the methods described in the foregoing embodiments, and will not be elaborated here.

[0128] See Figure 17 , the embodiments of the present disclosure also provide a business district determination device, and the device includes:

[0129] The first acquisition module 11 is configured to acquire the first business district where the current store is located; the first business district is a business district obtained by expanding the original business district where the current store is located;

[0130] The contraction processing module 12 is configured to perform boundary contraction processing on the first business district to obtain a second business district; the area of the second business district is smaller than the area of the first business district;

[0131] The smoothing processing module 13 is configured to perform smoothing processing on the boundary of the second business district; the number of first boundary points of the second business district after smoothing processing is smaller than the number of first boundary points of the second business district before smoothing processing;

[0132] The second acquisition module 14 is configured to acquire the target business district where the current store is located based on the first boundary points of the second business district after smoothing processing; the target business district is the range within which the delivery capacity can deliver the orders of the current store.

[0133] In some embodiments, the functions or modules included in the device provided by the embodiments of the present disclosure can be used to execute the methods described in the foregoing method embodiments, and their specific implementations can refer to the descriptions of the foregoing method embodiments. For the sake of brevity, they will not be elaborated here.

[0134] An embodiment of the present disclosure also provides a computer device, which at least includes a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the method described in any of the foregoing embodiments is implemented.

[0135] Figure 18 FIG. 4 shows a more specific schematic diagram of the hardware structure of a computing device provided by an embodiment of the present disclosure. The device may include: a processor 21, a memory 22, an input / output interface 23, a communication interface 24, and a bus 25. Among them, the processor 21, the memory 22, the input / output interface 23, and the communication interface 24 are communicatively connected to each other inside the device through the bus 25.

[0136] The processor 21 may be implemented in the form of a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, etc., and is used to execute relevant programs to implement the technical solutions provided by the embodiments of the present disclosure. The processor 21 may further include a graphics card, and the graphics card may be an Nvidia titan X graphics card or a 1080Ti graphics card, etc.

[0137] The memory 22 may be implemented in the form of a read-only memory (ROM), a random access memory (RAM), a static storage device, a dynamic storage device, etc. The memory 22 may store an operating system and other application programs. When implementing the technical solutions provided by the embodiments of the present disclosure through software or firmware, the relevant program codes are stored in the memory 22 and are called and executed by the processor 21.

[0138] The input / output interface 23 is used to connect to an input / output module to implement information input and output. The input / output module may be configured as a component in the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Among them, the input device may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device may include a display, a speaker, a vibrator, an indicator light, etc.

[0139] The communication interface 24 is used to connect to a communication module (not shown in the figure) to implement communication interaction between this device and other devices. Among them, the communication module may implement communication in a wired manner (such as USB, network cable, etc.) or in a wireless manner (such as mobile network, WIFI, Bluetooth, etc.).

[0140] The bus 25 includes a path for transmitting information between various components of the device, such as the processor 21, the memory 22, the input / output interface 23, and the communication interface 24.

[0141] It should be noted that although the above device only shows the processor 21, the memory 22, the input / output interface 23, the communication interface 24, and the bus 25, in the specific implementation process, the device may also include other components necessary for normal operation. In addition, those skilled in the art can understand that the above device may also only include the components necessary to implement the solution of the embodiments of the present disclosure, and do not necessarily include all the components shown in the figure.

[0142] The embodiments of the present disclosure also provide a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, it implements the method described in any one of the foregoing embodiments.

[0143] Computer-readable media includes both permanent and non-permanent, removable and non-removable media and can be implemented by any method or technology for storing information. The information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include transitory media such as modulated data signals and carrier waves.

[0144] From the description of the above embodiments, those skilled in the art can clearly understand that the embodiments of the present disclosure can be implemented by means of software plus a necessary general hardware platform. Based on such an understanding, the technical solution of the embodiments of the present disclosure, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. The computer software product can be stored in a storage medium, such as ROM / RAM, magnetic disk, optical disc, etc., and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments of the present disclosure.

[0145] The systems, devices, modules or units illustrated in the above embodiments can be specifically implemented by a computer device or entity, or by a product with certain functions. A typical implementation device is a computer, and the specific form of the computer can be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email transceiver device, a game console, a tablet computer, a wearable device, or a combination of any several of these devices.

[0146] Each embodiment in the present disclosure is described in a progressive manner. For the same or similar parts among the embodiments, reference can be made to each other. Each embodiment focuses on the differences from other embodiments. In particular, for the device embodiments, since they are basically similar to the method embodiments, the description is relatively simple. For the relevant parts, reference can be made to the partial description of the method embodiments. The device embodiments described above are only illustrative. The modules described as separate components may or may not be physically separated. When implementing the solutions of the embodiments of the present disclosure, the functions of the modules can be implemented in one or more software and / or hardware. It is also possible to select some or all of the modules according to actual needs to achieve the purpose of the solutions of this embodiment. A person of ordinary skill in the art can understand and implement it without creative efforts.

[0147] The above are only the specific implementation manners of the embodiments of the present disclosure. It should be noted that for those of ordinary skill in the art, without departing from the principles of the embodiments of the present disclosure, several improvements and refinements can be made, and these improvements and refinements should also be regarded as the protection scope of the embodiments of the present disclosure.

Claims

1. A business district determination method, the method comprises: obtaining a first business district where the current store is located; the first business district is a business district obtained by expanding the original business district where the current store is located; performing boundary contraction processing on the first business district to obtain a second business district; the area of the second business district is smaller than the area of the first business district; performing smoothing processing on the boundary of the second business district; after the smoothing processing, the number of first boundary points of the second business district is smaller than the number of first boundary points of the second business district before the smoothing processing; obtaining the target business district where the current store is located based on the first boundary points of the second business district after the smoothing processing; the target business district is the range within which the delivery capacity can deliver the orders of the current store.

2. The method according to claim 1, wherein the performing boundary contraction processing on the first business district to obtain a second business district comprises: obtaining a plurality of second boundary points of the first business district; deleting the boundary points that meet the deletion condition among the plurality of second boundary points; determining the area enclosed by the undeleted boundary points as the second business district; wherein, the deletion condition is determined based on at least one of the following: whether the second business district obtained after deleting the second boundary point is a connected business district; the order volume of the sub-region corresponding to the candidate boundary point among the second boundary points; whether the candidate boundary point among the second boundary points is a boundary point within the original business district.

3. The method according to claim 2, the method further comprises: obtaining the candidate boundary points among the plurality of second boundary points; if the second business district obtained after deleting the candidate boundary point is connected, determining the candidate boundary point as the boundary point that meets the deletion condition.

4. The method according to claim 3, the method further comprises: determining the passable sub-regions in the second business district; if there are no first sub-region and second sub-region in the second business district that meet the following conditions, determining that the second business district is connected: starting from the first sub-region and moving in the passable sub-regions, when the number of moving steps reaches a preset maximum number of steps, still not reaching the second sub-region; wherein, the first sub-region and the second sub-region are any sub-regions in the passable sub-regions.

5. The method according to claim 2, the method further comprises: obtaining the order volume of the sub-region corresponding to the candidate boundary point among the plurality of second boundary points; if the order volume of the sub-region corresponding to the candidate boundary point is less than or equal to a preset quantity, determining the candidate boundary point as the boundary point that meets the deletion condition.

6. The method according to claim 2, the method further comprises: if the sub-region corresponding to the candidate boundary point among the plurality of second boundary points is not a sub-region within the original business district, determining the candidate boundary point as the boundary point that meets the deletion condition.

7. The method according to claim 1, wherein the performing smoothing processing on the boundary of the second business district comprises: obtaining a plurality of consecutive first target boundary points in the second business district that meet the preset conditions; performing smoothing processing on the smoothable boundary segment formed by the plurality of first target boundary points; wherein, the preset conditions include: Only on the boundary of the second business circle where the current store is located; or On the common boundary of the second business circle where the current store is located and the second business circle where the same adjacent store is located.

8. The method according to claim 7, wherein the obtaining a plurality of consecutive first target boundary points in the second business circle that meet a preset condition comprises: obtaining the marking information of the first boundary point, where the marking information is used to indicate the probability that the first boundary point belongs to only one store; obtaining the association relationship between the first boundary point and the store, where the association relationship is used to determine the store to which each first boundary point belongs; based on the marking information and the association relationship, determining a plurality of consecutive first target boundary points that meet the preset condition.

9. A business circle determination device, the device comprises: a first obtaining module, configured to obtain the first business circle where the current store is located; the first business circle is a business circle obtained by expanding the original business circle where the current store is located; a contraction processing module, configured to perform boundary contraction processing on the first business circle to obtain a second business circle; the area of the second business circle is smaller than the area of the first business circle; a smoothing processing module, configured to perform smoothing processing on the boundary of the second business circle; the number of first boundary points of the second business circle after smoothing processing is smaller than the number of first boundary points of the second business circle before smoothing processing; a second obtaining module, configured to obtain the target business circle where the current store is located based on the first boundary points of the second business circle after smoothing processing; the target business circle is the range within which the delivery capacity can deliver the orders of the current store.

10. A computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

11. A computer device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the program, the method according to any one of claims 1 to 8 is implemented.

Images