A method and device for planning a delivery point

Abstract

The present specification discloses a method and device for planning a collection point, which can not only select a suitable target combination by comprehensively considering the cost of setting the collection point in the target area according to each collection point combination, but also further adjust the position of each to-be-set collection point in the target area according to the coverage area of each service object in the target area, that is, re-adjust the docking relationship between each service object in the target area and each to-be-set collection point in the target combination, so as to ensure that each collection point in the final collection point strategy combination can be reasonably distributed to each service object in the target area in terms of operation cost and collection distance, thereby ensuring the rationality of setting the collection point according to the collection point strategy combination and comprehensively improving the efficiency and convenience of each user in the service object going to the collection point to collect goods.

Description

Technical Field

[0001] This specification relates to the field of computer technology, and in particular to a method and apparatus for planning receiving points. Background Technology

[0002] Currently, various forms of online services are increasingly integrated into users' daily lives. For example, community e-commerce, as a new type of online business, is gradually becoming more widespread in various communities. Users can purchase the goods they need online, and after the merchant ships the goods, they are transported by logistics to a public collection point. The person in charge of the public collection point signs for the goods, completing the entire delivery process. Afterward, users can go to the public collection point to pick up the goods they purchased online.

[0003] In this business model, public pickup points often need to connect with multiple communities. Typically, users from multiple communities will go to a single, unified public pickup point to collect their goods. However, the selection of which communities to set up these public pickup points, and the size of each point, is often determined manually based on practical experience. This can lead to various unreasonable pickup point setups, such as public pickup points being too far from some of the connected communities, causing inconvenience for users, or public pickup points being too large for smaller communities with smaller order quantities, resulting in wasted resources.

[0004] Therefore, how to reasonably set up public pickup points between communities, while ensuring that resources are not wasted as much as possible, and also ensuring the convenience and efficiency of users picking up their goods, is an urgent problem to be solved. Summary of the Invention

[0005] This specification provides a method and apparatus for planning receiving points, which partially solves the aforementioned problems existing in the prior art.

[0006] The following technical solution is adopted in this specification:

[0007] This specification provides a method for planning pickup points, which is applied to the execution of online delivery operations, including:

[0008] In a target area containing multiple service objects, each receiving point to be set up is identified, and each receiving point to be set up connects to at least one service object in the target area.

[0009] From the various receiving points to be set, determine each receiving point combination, and the number of receiving points to be set in each receiving point combination is not exactly the same;

[0010] For each receiving point combination, the fit between the receiving point combination and the target area is determined based on the comprehensive cost of setting up receiving points in the target area according to the determined receiving point combination. The comprehensive cost and the fit are negatively correlated.

[0011] Based on the suitability of each receiving point combination, a target combination is determined.

[0012] Based on the area covered by each service object in the target area, adjust the position of each pickup point to be set in the target combination within the target area to obtain the pickup point strategy combination;

[0013] According to the combination of the receiving point strategies, each receiving point is planned in the target area.

[0014] Optionally, in a target area containing multiple service recipients, each receiving point to be set up is determined, specifically including:

[0015] Based on the distance between the areas covered by each service object in the target area, the service objects are clustered to obtain a set of service objects.

[0016] Each receiving point to be set up is determined based on the area covered by each service object set as a whole within the target area.

[0017] Optionally, each receiving point to be set up is determined based on the area covered by each service object set as a whole within the target area, specifically including:

[0018] For each service object set, estimate the sum of the number of goods purchased online by each user belonging to that service object set;

[0019] Based on the quantity, determine the location and scale of the receiving points to be set up within the target area to connect with the service object set.

[0020] Optionally, from the various receiving points to be set, combinations of receiving points are determined, specifically including:

[0021] Determine the range of the number of receiving points required for setting up receiving points within the target area;

[0022] After a preset number of selection rounds, each receiving point combination is determined from the various receiving points to be set. In each round of selection, receiving points with a quantity within the range of the number of receiving points are randomly selected from the various receiving points to be set and combined to obtain the receiving point combination obtained after that round of selection.

[0023] Optionally, the overall cost of setting up receiving points in the target area according to the combination of receiving points is determined, specifically including:

[0024] Based on the scale of each collection point to be set up in the collection point combination, the setting cost of each collection point to be set up in the collection point combination within the target area is determined as the setting cost corresponding to the collection point combination. Based on the location of each collection point to be set up in the collection point combination within the target area, the pickup cost incurred by the service recipients within the target area to collect goods from each collection point to be set up in the collection point combination is determined as the pickup cost corresponding to the collection point combination.

[0025] Based on the setup cost and pickup cost corresponding to the combination of receiving points, determine the overall cost of setting up receiving points in the target area according to the combination of receiving points.

[0026] Optionally, for each receiving point combination, the suitability between the receiving point combination and the target area is determined based on the overall cost of setting up receiving points in the target area according to the determined receiving point combination, specifically including:

[0027] Based on the determined comprehensive cost of setting up a collection point in the target area according to the collection point combination, and the first penalty value corresponding to the collection point combination, the suitability between the collection point combination and the target area is determined. Wherein, if the number of collection points to be set in the collection point combination exceeds a set number range, the larger the number of collection points to be set in the collection point combination, the higher the first penalty value. The higher the sum of the distances consumed by users belonging to each service object in the target area to travel to the collection points to be set in the collection point combination, the higher the first penalty value.

[0028] Optionally, for each receiving point combination, the suitability between the receiving point combination and the target area is determined based on the overall cost of setting up receiving points in the target area according to the determined receiving point combination, specifically including:

[0029] For each service object within the target area, determine the receiving point to be set up that is connected to the service object in the combination of the service object and the receiving point;

[0030] Determine the coverage area of ​​the receiving point to be set up with the service object within the target area, and determine the distance between the service object and the center of the coverage area as the distance corresponding to the service object;

[0031] The second penalty value corresponding to the collection point combination is determined based on the square of the sum of the distances corresponding to each service object, wherein the larger the square of the sum of the distances, the larger the second penalty value corresponding to the collection point combination.

[0032] Based on the determined overall cost of setting up receiving points in the target area according to the receiving point combination, and the second penalty value corresponding to the receiving point combination, the fit between the receiving point combination and the target area is determined.

[0033] Optionally, based on the suitability of each receiving point combination, a target combination is determined, specifically including:

[0034] Sort the receiving point combinations according to their suitability from largest to smallest, and obtain the sorting results;

[0035] Select the receiving point combination that ranks higher than the set position from the sorting results as the transition combination;

[0036] Perform a round of combination transformation on the transition combination to obtain each transformed combination after this round of combination transformation;

[0037] Determine the fit of each transformed combination for the target region after the current round of combination transformation, and select the transitional combination required for the next round of combination transformation in descending order of the fit of each transformed combination for the target region after the current round of combination transformation, until the selected transitional combination meets the first preset condition after several rounds of combination transformation.

[0038] The target combination is determined based on the transition combination that satisfies the first preset condition.

[0039] Optionally, before determining the target combination based on the transitional combinations that satisfy the first preset condition, the method further includes:

[0040] For each round of combination transformation, the fit of each transformed combination for the target region after the round of combination transformation is taken as the fit of the round of combination transformation.

[0041] Based on the difference between the fitness degree corresponding to the current round of combination transformation and the fitness degree corresponding to the previous round of combination transformation, the improvement index corresponding to the current round of combination transformation is determined. If the fitness degree corresponding to the current round of combination transformation is higher than that corresponding to the previous round of combination transformation, the improvement index corresponding to the current round of combination transformation is smaller.

[0042] Based on the transitional combinations that satisfy the first preset condition, a target combination is determined, specifically including:

[0043] For each round of combination transformation, if the improvement index corresponding to the combination transformation of that round is less than the set improvement index, it is determined that the transition combination obtained after the combination transformation of that round satisfies the first preset condition, and the target combination is determined based on the transition combination obtained after the combination transformation of that round.

[0044] Optionally, based on the area covered by each service recipient within the target area, the positions of each pickup point to be set in the target combination are adjusted within the target area to obtain a pickup point strategy combination, specifically including:

[0045] Release the connection relationship between at least some of the receiving points to be set in the target combination and each service object in the target area;

[0046] For each round of group adjustment, the service objects in the target area that have a release docking relationship with at least some of the receiving points to be set are identified as target service objects. Based on the distance between the target service objects and the at least some receiving points to be set, the positions of the at least some receiving points to be set in the target area are adjusted to obtain the adjusted combination obtained after the round of group adjustment.

[0047] If it is determined that the adjusted combination obtained from the adjustment within the group in this round meets the second preset condition, the adjusted combination obtained from the adjustment within the group in this round is used as the receiving point strategy combination; otherwise, the adjustment within the group in the next round continues until the second preset condition is met.

[0048] Optionally, it is determined that the adjusted combination obtained within this round group satisfies the second preset condition, specifically including:

[0049] Determine each location-adjusted receiving point to be set in the adjusted combination obtained from the adjustments within this round group;

[0050] The positional deviation between the position of the receiving point to be set in the target area after the adjustment within the current round group and the position of the receiving point to be set in the target area after the adjustment within the previous round group is determined as the corresponding positional deviation of the receiving point to be set in the current round group.

[0051] If it is determined that after adjustment within the round group, the position deviation of no less than a set number of the receiving points to be set after position adjustment within the round group is less than the set position deviation threshold, then it is determined that the adjusted combination obtained within the round group satisfies the second preset condition.

[0052] This specification provides a receiving point planning device for performing online delivery operations, comprising:

[0053] The first determining module is used to determine each receiving point to be set up in a target area containing multiple service objects, and each receiving point to be set up connects to at least one service object in the target area.

[0054] The second determining module is used to determine each receiving point combination from the various receiving points to be set, wherein the number of receiving points to be set in each receiving point combination is not exactly the same;

[0055] An adaptation module is used to determine the degree of compatibility between each collection point combination and the target area based on the determined comprehensive cost of setting up collection points in the target area according to the collection point combination. The comprehensive cost and the degree of compatibility are negatively correlated.

[0056] The combination determination module is used to determine the target combination based on the adaptability of each receiving point combination.

[0057] The strategy module is used to adjust the position of each receiving point to be set in the target area according to the area covered by each service object in the target area, so as to obtain the receiving point strategy combination;

[0058] The planning module is used to plan each receiving point in the target area according to the combination of receiving point strategies.

[0059] This specification provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method for planning receiving points.

[0060] This specification provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the above-described method for planning receiving points.

[0061] The above-mentioned technical solutions adopted in this specification can achieve the following beneficial effects:

[0062] The receiving point planning method provided in this specification first identifies receiving points to be set up in a target area containing multiple service objects. Each receiving point to be set up connects to at least one service object in the target area. Then, from these receiving points to be set up, combinations of receiving points are determined. The number of receiving points to be set up in each combination is not exactly the same. For each combination of receiving points, the suitability between the combination of receiving points and the target area is determined based on the comprehensive cost of setting up receiving points in the target area according to the combination of receiving points. The comprehensive cost and suitability are negatively correlated. Based on the suitability of each combination of receiving points, a target combination is determined. Based on the area covered by each service object in the target area, the positions of each receiving point to be set up in the target combination are adjusted in the target area to obtain a receiving point strategy combination. Then, according to the receiving point strategy combination, each receiving point is planned in the target area.

[0063] As can be seen from the above method, not only can a suitable target combination be selected by considering the comprehensive cost of setting up collection points in the target area according to each collection point combination, but the location of each collection point to be set up in the target area can also be adjusted according to the coverage area of ​​each service object in the target area. That is, the connection relationship between each service object in the target area and each collection point to be set up in the target combination is readjusted. This ensures that in the final collection point strategy combination, each collection point can be reasonably allocated to each service object in the target area in terms of both operating costs and collection distance. This ensures the rationality of setting up collection points according to the collection point strategy combination and comprehensively improves the efficiency and convenience of each user in the service object going to the collection point to pick up the goods. Attached Figure Description

[0064] The accompanying drawings, which are included to provide a further understanding of this specification and form part of this specification, illustrate exemplary embodiments and are used to explain this specification, but do not constitute an undue limitation thereof. In the drawings:

[0065] Figure 1 This is a flowchart illustrating a method for planning receiving points provided in this specification;

[0066] Figure 2 This is a schematic diagram of the receiving point combination provided in this instruction manual;

[0067] Figure 3 This is a schematic diagram of a round of combination transformations provided in this specification;

[0068] Figure 4 This is a schematic diagram of a receiving point planning device provided in this specification;

[0069] Figure 5 This specification provides a corresponding Figure 1 A schematic diagram of an electronic device. Detailed Implementation

[0070] To make the objectives, technical solutions, and advantages of this specification clearer, the technical solutions of this specification will be clearly and completely described below in conjunction with specific embodiments and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of this specification, and not all of them. Based on the embodiments in this specification, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this specification.

[0071] The technical solutions provided in the various embodiments of this specification are described in detail below with reference to the accompanying drawings.

[0072] Figure 1This document provides a flowchart illustrating a method for planning receiving points, which includes the following steps:

[0073] S101: In a target area containing multiple service objects, determine each receiving point to be set up, and each receiving point to be set up connects to at least one service object in the target area.

[0074] In this manual, when the staff of the business platform need to determine how to set up the receiving points in a region, they can input relevant information into the designated device, which will then automatically determine the setting strategy for the receiving points in that region.

[0075] Specifically, staff can input relevant information about the target area into a designated device, which is configured with strategies to determine how to set up receiving points. The target area is the region where physical receiving points need to be established in the actual geographical area. For example, if staff determine that it is necessary to set up corresponding receiving points in an area with multiple service recipients to meet the needs of users belonging to each service recipient within that area for receiving goods, this area can be designated as the target area.

[0076] The relevant information of the target area may include the geographic information corresponding to the target area, the road network information within the target area, and the relevant information of the service objects covered in this target area. The relevant information of the service objects may include the regional location covered by the service objects in the target area, the number of users covered by a service object, and the total range of the number of goods purchased by users in a service object.

[0077] The aforementioned service targets can refer to areas in real life such as communities, commercial districts, and residential areas that encompass a certain number of users. When setting up collection points within the target area, it is necessary to ensure that each collection point is connected to at least one service target. The so-called collection point connecting to a service target means that users belonging to that service target need to go to that collection point to pick up their goods. That is, after users of that service target place orders online, all goods will be delivered to that collection point, and then the users of that service target will go to that collection point to pick up their goods.

[0078] At the same time, it is necessary to ensure that one service object is connected to one receiving point. That is, the optimal choice is that one receiving point can be connected to multiple service objects, but one service object can only be connected to one receiving point.

[0079] Determining the receiving points to be set within the target area can be understood as generating a number of locations within the target area for setting the receiving points, which represent the receiving points to be set. In this specification, there are several methods for determining the receiving points to be set within the target area. For example, several locations can be randomly selected within the target area as the locations of the receiving points to be set within the target area.

[0080] For example, service objects can first be clustered based on the distance between the areas covered by each service object within the target area, resulting in service object sets. Then, based on the area covered by each service object set as a whole within the target area, the receiving points to be set up are determined. In other words, within the target area, service objects that are relatively close to each other are grouped into a single category, resulting in service object sets. Each service object set can contain at least one service object from the clustered sets. Then, based on the location of these service object sets within the target area, some receiving points to be set up are determined. Each receiving point to be set up can connect to one service object set; that is, each service object within a service object set can be connected to by one receiving point to be set up.

[0081] In the process of clustering the aforementioned service objects, a geohashing algorithm (GeoHash) can be used to encode each service object (e.g., using a 6-bit encoding method) to obtain the geographical location code corresponding to each service object within the target area. Then, based on the geographical location code corresponding to each service object within the target area, the service objects are clustered to obtain several service object sets. Furthermore, each service object set can be encoded using a coarser-grained GeoHash encoding method (e.g., using a 5-bit encoding method), and after processing methods such as deduplication and merging, processed service object sets are obtained. Finally, based on the area covered by the processed service object sets within the target area, the receiving points to be set up are determined.

[0082] In this specification, for each service object set (or each processed service object set mentioned above), the total number of goods purchased online by each user belonging to that service object set can be estimated. Then, based on this total number, the location and scale of the pickup point to be set up to connect with that service object set are determined within the target area. The area covered by the service object set within the target area is used to determine the location of the pickup point to be set up within the target area, while the total number determines the size of the pickup point. A larger total number indicates stronger purchasing power among the users in that service object set, resulting in a higher number of goods purchased online per unit time. Therefore, a larger pickup point is needed to provide good temporary storage services for the users in that service object set. The total number of goods purchased online by each user in that service object set can be estimated based on the number of goods ordered online by each user in that service object set over a period of time.

[0083] Of course, there are many other ways to determine the receiving points to be set up within the target area, which will not be explained in detail here.

[0084] In this manual, the executing entity used to implement the receiving point planning method can refer to a designated device such as a server set up on the business platform, or a designated device such as a desktop computer or a laptop computer. For ease of description, the following will only use the server as the executing entity to explain the receiving point planning method provided in this manual.

[0085] S102: Determine each receiving point combination from the various receiving points to be set, wherein the number of receiving points to be set in each receiving point combination is not exactly the same.

[0086] After identifying the receiving points to be set up within the target area, the server further obtains combinations of receiving points. Specifically, in this specification, the server can determine the combinations of receiving points through random combinations. Each receiving point in a combination can connect to all service objects within the target area; that is, each receiving point in a combination corresponds to a subset of service objects within the target area.

[0087] As can be seen from the above, each combination of receiving points determined by the server can be regarded as a receiving point setting strategy that can be executed within the target area. However, if each receiving point is set up in the target area according to a certain combination of receiving points, it is unreasonable in terms of both cost and user pickup efficiency. Therefore, the server needs to select a better combination of receiving points from these combinations, or further select a better combination of receiving points based on these combinations, to set up receiving points in the target area to connect with each service object.

[0088] Furthermore, based on the above, it can be seen that among the receiving points initially identified by the server, some of them are connected to the same service object or the same set of service objects. However, it can be understood that these receiving points connected to the same service object or the same set of service objects are not exactly the same in terms of their specific location or scale within the target area.

[0089] Returning to the discussion in this step, the server can also determine the combinations of receiving points through other methods. Specifically, the server can determine the range of the number of receiving points specified for setting receiving points within the target area, and then, through a preset round of selection, determine the combinations of receiving points from the collection points to be set. Specifically, for each round of selection, the server randomly selects receiving points from the collection points to be set whose quantity falls within the specified range and combines them to obtain the combination of receiving points obtained after that round of selection.

[0090] In other words, the number of receiving points to be set up in each final combination of receiving points generally remains within a certain range, but the number of receiving points to be set up in each combination is not exactly the same. The so-called multi-round selection can be understood as randomly selecting a portion of the receiving points to be set up from each set of receiving points with replacement, within the range of the given number of receiving points, and then combining them into various receiving point combinations. The specific combination of receiving points can be as follows: Figure 2 As shown.

[0091] Figure 2 This is a schematic diagram of the receiving point combination provided in this instruction manual.

[0092] from Figure 2 As can be seen, this receiving point combination consists of 7 receiving points to be set up. L1 represents receiving point 1 to be set up in the target area, L5 represents receiving point 5 to be set up in the target area, and so on, with L10 representing receiving point 10 to be set up in the target area. The number of receiving points to be set up in other receiving point combinations can be compared with... Figure 2 The combinations of receiving points shown can be different, or they can be the same.

[0093] S103: For each receiving point combination, based on the determined comprehensive cost of setting up receiving points in the target area according to the receiving point combination, determine the fit between the receiving point combination and the target area, wherein the comprehensive cost and the fit are negatively correlated.

[0094] As can be seen from the above, the server needs to select a suitable combination of receiving points from these combinations, or determine a more optimal combination of receiving points based on these combinations, in order to plan the receiving points to be set up in the target area. Therefore, in this specification, the server needs to determine the overall cost required for setting up receiving points in the target area according to the strategy of each combination of receiving points.

[0095] Specifically, the server can determine the setup cost of each pickup point in the pickup point combination within the target area based on the setup scale of each pickup point to be set up in the pickup point combination, and use this cost as the setup cost corresponding to the pickup point combination. Simultaneously, the server can determine the pickup cost incurred by service recipients within the target area for collecting goods from each pickup point in the pickup point combination, based on the location of each pickup point in the pickup point combination within the target area, and use this cost as the pickup cost corresponding to the pickup point combination.

[0096] The server can then determine the overall cost of setting up pickup points within the target area based on the setup cost and pickup cost associated with that pickup point combination. This overall cost reflects the costs incurred in setting up pickup points within the target area according to the strategy of that pickup point combination, as well as the travel costs incurred by users of the service recipients when traveling to those pickup points to pick up their orders.

[0097] Therefore, for a given combination of pickup points, the higher the overall cost of setting up pickup points within the target area according to that combination, the less suitable the strategy is for that pickup point combination in the target area, both from a cost perspective and from the perspective of the distance users travel to pick up their goods. Thus, the lower the fit between the pickup point combination and the target area. Conversely, the lower the overall cost of setting up pickup points within the target area according to that combination, the more suitable the strategy is for setting up pickup points within the target area. Therefore, the higher the fit between the pickup point combination and the target area.

[0098] Furthermore, in order to further control the cost of setting up receiving points, in this specification, the server may also determine the compatibility between the receiving point combination and the target area based on the determined comprehensive cost of setting up receiving points in the target area according to the receiving point combination, and the first penalty value corresponding to the receiving point combination.

[0099] The first penalty value is used to further adjust the fit between the collection point combination and the target area based on the cost of setting up collection points. If the number of collection points to be set up in the collection point combination exceeds a set range, a larger number of collection points indicates a higher cost of setting up collection points in the target area according to the combination's strategy, thus resulting in a higher first penalty value. Furthermore, a higher total distance traveled by users within the target area to the corresponding collection points within the combination indicates a higher cost incurred by users in terms of travel distance when setting up collection points according to the combination's strategy, also resulting in a higher first penalty value.

[0100] Furthermore, for each service object, the server can determine the receiving point to be set up that is connected to the service object in the combination of the service object and the receiving point, then determine the coverage area of ​​the receiving point to be set up that is connected to the service object in the target area, and determine the distance between the service object and the center of the coverage area as the distance corresponding to the service object.

[0101] The server can determine the second penalty value corresponding to the receiving point combination based on the square of the sum of the distances to each service object. The larger the square of the sum of the distances, the larger the second penalty value for the receiving point combination. Finally, the server can determine the suitability between the receiving point combination and the target area based on the determined overall cost of setting up receiving points in the target area according to the receiving point combination, and the second penalty value corresponding to the receiving point combination.

[0102] This second penalty value is used to measure whether the coverage of the receiving points in the receiving point combination within the target area is reasonable. Ideally, the receiving points in the combination should cover the entire target area without any blind spots or overlaps. Therefore, if the penalty value is the square of the sum of distances, it indicates that the area covered by the receiving points in the target area is not reasonably shaped, meaning that some areas may be missed or not covered. Thus, the second penalty value is correspondingly larger.

[0103] Of course, in this specification, the server can also combine the above points to determine the suitability between the receiving point combination and the target area. That is, the server can determine the suitability between the receiving point combination and the target area based on the comprehensive cost corresponding to the receiving point combination, the first penalty value corresponding to the receiving point combination, and the second penalty value corresponding to the receiving point combination.

[0104] S104: Determine the target combination based on the suitability of each receiving point combination.

[0105] After determining the compatibility between each receiving point combination and the target area, the server selects the receiving point combination with the highest compatibility as the target combination, and then plans the receiving points that need to be set up in the target area based on the target combination in the subsequent process.

[0106] Of course, since the currently obtained collection point combinations may not include the optimal combination, or rather, a better combination of collection points can be obtained from the current combinations, in this specification, the server can sort the collection point combinations according to their suitability from highest to lowest, obtaining a sorting result. Then, the collection point combinations ranked higher in the set position are selected from this sorting result as transitional combinations.

[0107] The server can perform a round of combination transformation on the transitional combinations to obtain the transformed combinations after this round of combination transformation, and determine the adaptability of each transformed combination to the target region. The server can then filter the transitional combinations required for the next round of combination transformation according to the descending order of the adaptability of each transformed combination to the target region, until, after several rounds of combination transformation, the filtered transitional combinations meet a first preset condition. Finally, the target combination is determined based on the transitional combinations that meet the first preset condition.

[0108] The above method can be understood as follows: each round of combination transformation needs to retain the better transitional combination obtained after this round of combination transformation, and use this as the basis for the next round of transitional combination transformation. This is because by using the better transitional combination, there is a greater probability of obtaining a better delivery point combination when transforming each other. In other words, this method can be used to obtain a higher quality delivery point combination.

[0109] There are various specific transformation forms that can be used in a round of combination transformation. For example, common receiving points to be set in the transitional combinations can be retained, and then non-common receiving points to be set can be randomly allocated. Figure 3 As shown.

[0110] Figure 3 This is a schematic diagram of a round of combination transformations provided in this specification.

[0111] Figure 3 The diagram shows two transitional combinations, A and B, where the common receiving points to be set in these two transitional combinations are: L1, L6, L7, L8, and L9 (e.g., ...). Figure 3 (The dark area in the image) When these two transition combinations are combined, they can retain the common receiving points to be set, and select the non-common receiving points to be set in the two transition combinations to form an allocation set. Then, the receiving points to be set contained in the allocation set are randomly allocated to the two transition combinations A and B, and finally the transition combination A′ and transition combination B′ obtained after this round of combination transformation are obtained.

[0112] Of course, the server can also perform combination transformations in other ways. For example, it can delete a receiving point to be set in a transition combination and randomly add a receiving point to be set that does not exist in the transition combination to complete this round of combination transformation.

[0113] Furthermore, the two methods mentioned above can also be used in combination, for example, first following... Figure 3 As shown, the result is as follows Figure 3 The transition combinations A′ and B′ are shown. Then, a second method can be used: randomly delete one receiving point to be set in transition combination A′, and randomly add one receiving point that does not exist in transition combination A′. The same applies to transition combination B′. Other combination transformation methods will not be illustrated in detail here.

[0114] Through the above method, the server can perform multiple rounds of combination transformations, and after determining that a set round of combination transformations has been reached, it can be determined that a relatively high-quality receiving point combination has been obtained. Thus, the transitional combination obtained after the set rounds of combination transformations can be used as a transitional combination that meets the first preset condition, and then the transitional combination that meets the first preset condition can be used as the target combination.

[0115] It should be noted that before determining the target combination, the server can take the adaptability of each transformed combination for the target region in each round of combination transformation as the adaptability of that round of combination transformation. This adaptability can be understood as the total adaptability of each transformed combination for the target region, or the average adaptability, or the highest adaptability of these transformed combinations for the target region.

[0116] The server can determine the improvement index corresponding to the current round of combination transformation based on the difference between the fitness degree corresponding to the current round of combination transformation and the fitness degree corresponding to the previous round of combination transformation. If the fitness degree corresponding to the current round of combination transformation is higher than that corresponding to the previous round of combination transformation, the improvement index corresponding to the current round of combination transformation is smaller.

[0117] In this scenario, the server can perform combination transformations for each round. If it is determined that the improvement index corresponding to the combination transformation in that round is less than a set improvement index, it can determine that the transitional combination obtained after the combination transformation in that round satisfies the first preset condition. Based on the transitional combination obtained after the combination transformation in that round, the target combination can be determined. Specifically, refer to the following formula:

[0118] I0 = c

[0119] I i =|f i -f i-1 |+I i-1 *α

[0120] In the above formula, I i f is used to represent the improvement index corresponding to the i-th round of combination transformation. i This is used to represent the fitness degree corresponding to the i-th round of combination transformation. Since it can be seen from these two formulas that the improvement index corresponding to each round of transformation combination is obtained through continuous iteration, an initial value needs to be assigned; that is, the improvement index corresponding to the 0th round of combination transformation can be c.

[0121] In the above formula, α is the reduction coefficient. That is, the improvement index of the previous iteration is reduced in each iteration. This is to ensure that the improvement index decreases continuously in the whole after each combination transformation. When the improvement index is less than the set improvement index, the iteration stops to obtain the target combination.

[0122] S105: Based on the area covered by each service object in the target area, adjust the position of each receiving point to be set in the target combination within the target area to obtain the receiving point strategy combination.

[0123] After obtaining the target combination using the methods described above, the server can further adjust the target combination to obtain a higher-quality collection point combination. Specifically, the server can release the connection relationships between at least some of the collection points to be set up in the target combination and the service objects in the target region. The release of connection relationships will be explained through the following example.

[0124] Suppose the target combination includes two adjacent receiving points L1 and L2 located within the target area. In this combination, receiving point L1 was originally connected to service objects a, b, and c within the target area, while receiving point L2 was originally connected to service objects d and e. When the connection between these two receiving points and their respective service objects is released, receiving points L1 and L2 will temporarily cease connecting to any service objects.

[0125] After the release is completed, the server can perform multiple rounds of intra-group adjustments on the target combination of the released docking relationships to obtain a final, higher-quality combination of receiving points, i.e., the receiving point strategy combination. Specifically, for each round of intra-group adjustment, the server can identify service objects in the target area that have released docking relationships with at least some of the receiving points to be set, as target service objects, and adjust the positions of at least some of the receiving points to be set in the target area according to the distance between the target service objects and the at least some receiving points to be set, thus obtaining the adjusted combination obtained after that round of intra-group adjustment.

[0126] The adjustments mentioned here involve at least some of the pickup points to be set up within the target area. These adjustments include small-scale relocations of the pickup points within the target area, and swapping their locations. The basis for these adjustments is largely similar to the idea of ​​determining the target combination mentioned above. Specifically, it considers the combined effect of factors such as the cost of setting up the pickup points within the target area, the cost to users traveling to pick up their orders, and the coverage within the target area. The question is whether this adjustment has a positive (increased) or negative (decreased) impact on the fit between the adjusted combination and the target area. For example, the following formula can be used as a reference:

[0127]

[0128]

[0129]

[0130]

[0131] In the above formula, x i and y i The coordinates of service object i are used to represent the latitude and longitude, and x0 and y0 are used to represent the latitude and longitude of the receiving point to be set. It can be seen from this that the position of the receiving point to be set in the target area can be adjusted by controlling the sum of the distances between the receiving point to be set and the service object it is connected to.

[0132] Furthermore, when the server determines that the adjusted combination obtained from the adjustment within the group in this round meets the second preset condition, the adjusted combination obtained from the adjustment within the group in this round can be used as the final receiving point strategy combination; otherwise, the adjustment within the group in the next round continues until the second preset condition is met.

[0133] If the server determines that a relatively high-quality delivery point combination has been obtained after a set number of combination adjustments, then the adjusted combination within the set number of rounds can be used as the adjusted combination that meets the second preset condition, thereby obtaining the delivery point strategy combination.

[0134] Of course, the second preset condition can also take other forms. For example, the server can determine each receiving point to be set whose position has been adjusted in the adjusted combination obtained in the round group, and further determine the position of the receiving point to be set in the target area after the adjustment in the round group, and the position deviation between the position of the receiving point to be set in the target area after the adjustment in the previous round group, as the corresponding position deviation of the receiving point to be set in the round group.

[0135] If the server determines that after the adjustment within the round group, no less than a set number of the receiving points to be set after the position adjustment have a corresponding position deviation of less than a set position deviation threshold, then it can be determined that the adjusted combination obtained within the round group meets the second preset condition.

[0136] In other words, if after a round of group adjustments the server finds that the location of most of the receiving points to be set in the target area after this adjustment is not significantly different from the location after the previous round of group adjustments, then it can be determined that the adjusted combination obtained in this round of group adjustments can meet the second preset condition.

[0137] S106: Plan each receiving point in the target area according to the receiving point strategy combination.

[0138] The receiving point strategy combination determined through the above method not only shows the interface relationship between each receiving point to be set up in the strategy combination and each service object in the target area, but also shows the location of each receiving point to be set up in the target area and its specific setting scale. Therefore, the server can determine the planning strategy for each receiving point in the target area based on this receiving point strategy combination and display it to the staff for review. The staff can then use this planning strategy to construct the physical entities of each receiving point in the target area.

[0139] The server can not only select a suitable target combination by considering the overall cost of setting up collection points in the target area according to each collection point combination, but also further adjust the location of each collection point to be set up in the target area based on the coverage area of ​​each service object in the target area. In other words, it readjusts the connection relationship between each service object in the target area and each collection point to be set up in the target combination. This ensures that in the final collection point strategy combination, each collection point can be reasonably allocated to each service object in the target area in terms of both operating costs and collection distance. This guarantees the rationality of setting up collection points according to the collection point strategy combination, comprehensively improves the efficiency and convenience of users in the service objects to pick up their goods at the collection points, and also reduces the labor cost of staff planning collection points in the target area.

[0140] The above describes a receiving point planning method provided by one or more embodiments of this specification. Based on the same idea, this specification also provides a corresponding receiving point planning device, such as... Figure 4 As shown.

[0141] Figure 4 A schematic diagram of a receiving point planning device provided in this specification includes:

[0142] The first determining module 401 is used to determine each receiving point to be set in a target area containing multiple service objects, and each receiving point to be set is connected to at least one service object in the target area.

[0143] The second determining module 402 is used to determine each receiving point combination from the various receiving points to be set, wherein the number of receiving points to be set included in each receiving point combination is not exactly the same;

[0144] The adaptation module 403 is used to determine the degree of adaptation between the receiving point combination and the target area for each receiving point combination based on the determined comprehensive cost of setting up receiving points in the target area according to the receiving point combination. The comprehensive cost and the degree of adaptation are negatively correlated.

[0145] The combination determination module 404 is used to determine the target combination based on the adaptability of each receiving point combination.

[0146] Strategy module 405 is used to adjust the position of each receiving point to be set in the target area according to the area covered by each service object in the target area, so as to obtain the receiving point strategy combination;

[0147] Planning module 406 is used to plan each receiving point in the target area according to the receiving point strategy combination.

[0148] Optionally, the first determining module 401 is specifically used to: cluster the service objects according to the distance between the areas covered by each service object in the target area to obtain each service object set; and determine each receiving point to be set according to the area covered by each service object set as a whole in the target area.

[0149] Optionally, the first determining module 401 is specifically used to: estimate the total number of goods purchased online by each user belonging to each service object set for each service object set; and determine the location and scale of the receiving point to be set up in the target area based on the total number of goods purchased online for each service object set.

[0150] Optionally, the second determining module 402 is specifically used to determine the range of the number of receiving points specified for setting up receiving points in the target area; and after a preset number of selection rounds, determine each combination of receiving points from the receiving points to be set up, wherein, for each round of selection, randomly select the receiving points to be set up whose number is within the range of the number of receiving points to be set up and combine them to obtain the combination of receiving points obtained after that round of selection.

[0151] Optionally, the adaptation module 403 is specifically used to: determine the setup cost of each pickup point in the target area based on the setup scale of each pickup point in the pickup point combination, as the setup cost corresponding to the pickup point combination; and determine the pickup cost incurred by service recipients in the target area to collect goods from each pickup point in the pickup point combination based on the location of each pickup point in the pickup point combination within the target area, as the pickup cost corresponding to the pickup point combination; and determine the comprehensive cost of setting up pickup points in the target area according to the pickup point combination based on the setup cost and the pickup cost corresponding to the pickup point combination.

[0152] Optionally, the adaptation module 403 is specifically used to determine the compatibility between the collection point combination and the target area based on the determined comprehensive cost of setting up collection points in the target area according to the collection point combination, and the first penalty value corresponding to the collection point combination. Specifically, if the number of collection points to be set in the collection point combination exceeds a set range, the larger the number of collection points to be set in the collection point combination, the higher the first penalty value. Furthermore, the higher the sum of distances consumed by users belonging to each service object within the target area to travel to the collection points to be set in the collection point combination, the higher the first penalty value.

[0153] Optionally, the adaptation module 403 is specifically configured to: for each service object in the target area, determine the receiving point to be set up in the combination of the service object and the receiving point; determine the coverage area of ​​the receiving point to be set up in the target area, and determine the distance between the service object and the center position of the coverage area as the distance corresponding to the service object; determine the second penalty value corresponding to the receiving point combination based on the square of the sum of the distances corresponding to each service object, wherein the larger the square of the sum of the distances, the larger the second penalty value corresponding to the receiving point combination; and determine the adaptability between the receiving point combination and the target area based on the determined comprehensive cost of setting up receiving points in the target area according to the receiving point combination and the second penalty value corresponding to the receiving point combination.

[0154] Optionally, the combination determination module 404 is specifically used to: sort the receiving point combinations according to the order of adaptability from largest to smallest, and obtain a sorting result; select the receiving point combinations that are ranked higher than a set position from the sorting result as transitional combinations; perform a round of combination transformation on the transitional combinations to obtain each transformed combination after the round of combination transformation; determine the adaptability of each transformed combination after the round of combination transformation to the target area, and filter out the transitional combinations required for the next round of combination transformation according to the order of adaptability of each transformed combination after the round of combination transformation to the target area from largest to smallest, until the filtered transitional combinations meet the first preset condition after several rounds of combination transformation; and determine the target combination based on the transitional combinations that meet the first preset condition.

[0155] Optionally, before determining the target combination based on the transitional combination that satisfies the first preset condition, the combination determination module 404 is further configured to, for each round of combination transformation, use the fit degree of each transformed combination after the round of combination transformation for the target region as the fit degree corresponding to the round of combination transformation; and determine the improvement index corresponding to the round of combination transformation based on the difference between the fit degree corresponding to the round of combination transformation and the fit degree corresponding to the previous round of combination transformation. If the fit degree corresponding to the round of combination transformation is higher than the fit degree corresponding to the previous round of combination transformation, the improvement index corresponding to the round of combination transformation is smaller.

[0156] The combination determination module 404 is specifically used to determine, for each round of combination transformation, if the improvement index corresponding to the round of combination transformation is less than the set improvement index, to determine that the transition combination obtained after the round of combination transformation satisfies the first preset condition, and to determine the target combination based on the transition combination obtained after the round of combination transformation.

[0157] Optionally, the strategy module 405 is specifically used to: release the connection relationship between at least some of the receiving points to be set in the target combination and each service object in the target area; for each round of intra-group adjustment, determine the service objects in the target area that have released the connection relationship with the at least some of the receiving points to be set, as target service objects, and adjust the position of the at least some of the receiving points to be set in the target area according to the distance between the target service objects and the at least some of the receiving points to be set, and obtain the adjusted combination obtained after the intra-group adjustment in this round; if it is determined that the adjusted combination obtained after the intra-group adjustment in this round satisfies the second preset condition, the adjusted combination obtained after the intra-group adjustment in this round is used as the receiving point strategy combination; otherwise, continue to the next round of intra-group adjustment until the second preset condition is satisfied.

[0158] Optionally, the strategy module 405 is specifically used to: determine each receiving point to be set whose position has been adjusted and included in the adjusted combination obtained in the current round group; determine the position deviation between the position of the receiving point to be set in the target area after the adjustment in the current round group and the position of the receiving point to be set in the target area after the adjustment in the previous round group, as the position deviation corresponding to the adjustment of the receiving point to be set in the current round group; if it is determined that after the adjustment in the current round group, the position deviation corresponding to the adjustment of no less than a set number of receiving points to be set whose position has been adjusted and is less than a set position deviation threshold, determine that the adjusted combination obtained in the current round group satisfies the second preset condition.

[0159] This specification also provides a computer-readable storage medium storing a computer program that can be used to execute the above-described... Figure 1 This provides a method for planning receiving points.

[0160] This instruction manual also provides Figure 5 One of the corresponding Figure 1 A schematic diagram of the structure of an electronic device. (e.g.) Figure 5 At the hardware level, the electronic device includes a processor, internal bus, network interface, memory, and non-volatile memory, and may also include other hardware required for the business operations. The processor reads the corresponding computer program from the non-volatile memory into memory and then runs it to achieve the above-mentioned functions. Figure 1 The method for planning the receiving points is described above. Of course, in addition to software implementation, this specification does not exclude other implementation methods, such as logic devices or a combination of hardware and software, etc. That is to say, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0161] In the 1990s, improvements to a technology could be clearly distinguished as either hardware improvements (e.g., improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the methodology). However, with technological advancements, many methodological improvements today can be considered direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved methodology into the hardware circuit. Therefore, it cannot be said that a methodological improvement cannot be implemented using hardware physical modules. For example, a Programmable Logic Device (PLD) (such as a Field Programmable Gate Array (FPGA)) is such an integrated circuit whose logic function is determined by the user programming the device. Designers can program and "integrate" a digital system onto a PLD themselves, without needing chip manufacturers to design and manufacture dedicated integrated circuit chips. Furthermore, nowadays, instead of manually manufacturing integrated circuit chips, this programming is mostly implemented using "logic compiler" software. Similar to the software compiler used in program development, the original code before compilation must be written in a specific programming language, called a Hardware Description Language (HDL). There are many HDLs, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, and RHDL (Ruby Hardware Description Language). Currently, the most commonly used are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should understand that by simply performing some logic programming on the method flow using one of these hardware description languages ​​and programming it into an integrated circuit, the hardware circuit implementing the logical method flow can be easily obtained.

[0162] The controller can be implemented in any suitable manner. For example, it can take the form of a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro)processor, logic gates, switches, application-specific integrated circuits (ASICs), programmable logic controllers, and embedded microcontrollers. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicon Labs C8051F320. A memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art will also recognize that, in addition to implementing the controller in purely computer-readable program code form, the same functionality can be achieved by logically programming the method steps to make the controller take the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers. Therefore, such a controller can be considered a hardware component, and the means included therein for implementing various functions can also be considered as structures within the hardware component. Alternatively, the means for implementing various functions can be considered as both software modules implementing the method and structures within the hardware component.

[0163] The systems, devices, modules, or units described in the above embodiments can be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, a computer can be, for example, a personal computer, laptop computer, cellular phone, camera phone, smartphone, personal digital assistant, media player, navigation device, email device, game console, tablet computer, wearable device, or any combination of these devices.

[0164] For ease of description, the above devices are described in terms of function, divided into various units. Of course, in implementing this specification, the functions of each unit can be implemented in one or more software and / or hardware components.

[0165] Those skilled in the art will understand that embodiments of this specification can be provided as methods, systems, or computer program products. Therefore, this specification may take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this specification may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0166] This specification is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this specification. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create a machine for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0167] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0168] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0169] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0170] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0171] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, 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, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0172] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0173] Those skilled in the art will understand that the embodiments of this specification can be provided as methods, systems, or computer program products. Therefore, this specification may take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this specification may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0174] This specification can be described in the general context of computer-executable instructions that are executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform a specific task or implement a specific abstract data type. This specification can also be practiced in distributed computing environments, where tasks are performed by remote processing devices connected via a communication network. In distributed computing environments, program modules can reside in local and remote computer storage media, including storage devices.

[0175] The various embodiments in this specification are described in a progressive manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the system embodiments are basically similar to the method embodiments, so the description is relatively simple; relevant parts can be referred to the descriptions in the method embodiments.

[0176] The above description is merely an embodiment of this specification and is not intended to limit this specification. Various modifications and variations can be made to this specification by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this specification should be included within the scope of the claims of this specification.

Claims

1. A method for planning receiving points, characterized in that, The method is applied to the execution of online delivery services, including: In a target area containing multiple service objects, each receiving point to be set up is identified, and each receiving point to be set up connects to at least one service object in the target area. From the various receiving points to be set, determine each receiving point combination, and the number of receiving points to be set in each receiving point combination is not exactly the same; For each receiving point combination, the fit between the receiving point combination and the target area is determined based on the comprehensive cost of setting up receiving points in the target area according to the determined receiving point combination. The comprehensive cost and the fit are negatively correlated. Based on the suitability of each receiving point combination, a target combination is determined. Based on the area covered by each service object in the target area, adjust the position of each pickup point to be set in the target combination within the target area to obtain the pickup point strategy combination; According to the aforementioned collection point strategy combination, each collection point is planned in the target area; The step of determining the target combination based on the suitability of each receiving point combination specifically includes: Sort the receiving point combinations according to their suitability from largest to smallest, and obtain the sorting results; Select the receiving point combination that ranks higher than the set position from the sorting results as the transition combination; Perform a round of combination transformation on the transition combination to obtain each transformed combination after this round of combination transformation; Determine the fit of each transformed combination for the target region after the current round of combination transformation, and select the transitional combination required for the next round of combination transformation in descending order of the fit of each transformed combination for the target region after the current round of combination transformation, until the selected transitional combination meets the first preset condition after several rounds of combination transformation. Based on the transitional combinations that satisfy the first preset condition, determine the target combination; Based on the area covered by each service recipient within the target area, the positions of each pickup point to be set in the target combination are adjusted within the target area to obtain a pickup point strategy combination, specifically including: Release the connection relationship between at least some of the receiving points to be set in the target combination and each service object in the target area; For each round of group adjustment, the service objects in the target area that have a release docking relationship with at least some of the receiving points to be set up are identified as target service objects. Based on the distance between the target service objects and the at least some receiving points to be set up, the positions of the at least some receiving points to be set up in the target area are adjusted to obtain the adjusted combination obtained after the round of group adjustment. If it is determined that the adjusted combination obtained from the adjustment within the group in this round meets the second preset condition, the adjusted combination obtained from the adjustment within the group in this round is used as the receiving point strategy combination; otherwise, the adjustment within the group in the next round continues until the second preset condition is met.

2. The method as described in claim 1, characterized in that, In a target area containing multiple service recipients, identify the receiving points to be set up, specifically including: Based on the distance between the areas covered by each service object in the target area, the service objects are clustered to obtain a set of service objects. Each receiving point to be set up is determined based on the area covered by each service object set as a whole within the target area.

3. The method as described in claim 2, characterized in that, Based on the area covered by each service object set as a whole within the target area, determine each receiving point to be set up, specifically including: For each service object set, estimate the sum of the number of goods purchased online by each user belonging to that service object set; Based on the quantity, determine the location and scale of the receiving points to be set up within the target area to connect with the service object set.

4. The method as described in claim 1, characterized in that, From the various receiving points to be set, determine the combinations of receiving points, specifically including: Determine the range of the number of receiving points required for setting up receiving points within the target area; After a preset number of selection rounds, each receiving point combination is determined from the various receiving points to be set. In each round of selection, receiving points with a quantity within the range of the number of receiving points are randomly selected from the various receiving points to be set and combined to obtain the receiving point combination obtained after that round of selection.

5. The method as described in claim 1, characterized in that, Determine the overall cost of setting up receiving points in the target area according to this combination of receiving points, specifically including: Based on the scale of each collection point to be set up in the collection point combination, the setting cost of each collection point to be set up in the collection point combination within the target area is determined as the setting cost corresponding to the collection point combination. Based on the location of each collection point to be set up in the collection point combination within the target area, the pickup cost incurred by the service recipients within the target area to collect goods from each collection point to be set up in the collection point combination is determined as the pickup cost corresponding to the collection point combination. Based on the setup cost and pickup cost corresponding to the combination of receiving points, determine the overall cost of setting up receiving points in the target area according to the combination of receiving points.

6. The method as described in claim 5, characterized in that, For each receiving point combination, based on the determined overall cost of setting up receiving points in the target area according to that receiving point combination, the suitability between that receiving point combination and the target area is determined, specifically including: Based on the determined comprehensive cost of setting up a collection point in the target area according to the collection point combination, and the first penalty value corresponding to the collection point combination, the suitability between the collection point combination and the target area is determined. Wherein, if the number of collection points to be set in the collection point combination exceeds a set number range, the larger the number of collection points to be set in the collection point combination, the higher the first penalty value. The higher the sum of the distances consumed by users belonging to each service object in the target area to travel to the collection points to be set in the collection point combination, the higher the first penalty value.

7. The method as described in claim 5 or 6, characterized in that, For each receiving point combination, based on the determined overall cost of setting up receiving points in the target area according to that receiving point combination, the suitability between that receiving point combination and the target area is determined, specifically including: For each service object within the target area, determine the receiving point to be set up that is connected to the service object in the combination of the service object and the receiving point; Determine the coverage area of ​​the receiving point to be set up with the service object within the target area, and determine the distance between the service object and the center of the coverage area as the distance corresponding to the service object; The second penalty value corresponding to the collection point combination is determined based on the square of the sum of the distances corresponding to each service object, wherein the larger the square of the sum of the distances, the larger the second penalty value corresponding to the collection point combination. Based on the determined overall cost of setting up receiving points in the target area according to the receiving point combination, and the second penalty value corresponding to the receiving point combination, the fit between the receiving point combination and the target area is determined.

8. The method as described in claim 1, characterized in that, Before determining the target combination based on the transitional combinations that satisfy the first preset condition, the method further includes: For each round of combination transformation, the fit of each transformed combination for the target region after the round of combination transformation is taken as the fit of the round of combination transformation. Based on the difference between the fitness degree corresponding to the current round of combination transformation and the fitness degree corresponding to the previous round of combination transformation, the improvement index corresponding to the current round of combination transformation is determined. If the fitness degree corresponding to the current round of combination transformation is higher than that corresponding to the previous round of combination transformation, the improvement index corresponding to the current round of combination transformation is smaller. Based on the transitional combinations that satisfy the first preset condition, a target combination is determined, specifically including: For each round of combination transformation, if the improvement index corresponding to the combination transformation of that round is less than the set improvement index, it is determined that the transition combination obtained after the combination transformation of that round satisfies the first preset condition, and the target combination is determined based on the transition combination obtained after the combination transformation of that round.

9. The method as described in claim 1, characterized in that, The adjusted combination obtained from the adjustments within this round group is determined to meet the second preset condition, specifically including: Determine each location-adjusted receiving point to be set in the adjusted combination obtained from the adjustments within this round group; The positional deviation between the position of the receiving point to be set in the target area after the adjustment within the current round group and the position of the receiving point to be set in the target area after the adjustment within the previous round group is determined as the corresponding positional deviation of the receiving point to be set in the current round group. If it is determined that after adjustment within the round group, the position deviation of no less than a set number of the receiving points to be set after position adjustment within the round group is less than the set position deviation threshold, then it is determined that the adjusted combination obtained within the round group satisfies the second preset condition.

10. A receiving point planning device, characterized in that, The device is used to perform online delivery services, including: The first determining module is used to determine each receiving point to be set up in a target area containing multiple service objects, and each receiving point to be set up connects to at least one service object in the target area. The second determining module is used to determine each receiving point combination from the various receiving points to be set, wherein the number of receiving points to be set in each receiving point combination is not exactly the same; An adaptation module is used to determine the degree of compatibility between each collection point combination and the target area based on the determined comprehensive cost of setting up collection points in the target area according to the collection point combination. The comprehensive cost and the degree of compatibility are negatively correlated. The combination determination module is used to determine the target combination based on the adaptability of each receiving point combination. The strategy module is used to adjust the position of each receiving point to be set in the target area according to the area covered by each service object in the target area, so as to obtain the receiving point strategy combination; The planning module is used to plan each receiving point in the target area according to the combination of receiving point strategies; The combination determination module further includes determining a target combination based on the suitability of each receiving point combination, specifically including: Sort the receiving point combinations according to their suitability from largest to smallest, and obtain the sorting results; Select the receiving point combination that ranks higher than the set position from the sorting results as the transition combination; Perform a round of combination transformation on the transition combination to obtain each transformed combination after this round of combination transformation; Determine the fit of each transformed combination for the target region after the current round of combination transformation, and select the transitional combination required for the next round of combination transformation in descending order of the fit of each transformed combination for the target region after the current round of combination transformation, until the selected transitional combination meets the first preset condition after several rounds of combination transformation. Based on the transitional combinations that satisfy the first preset condition, determine the target combination; Based on the area covered by each service recipient within the target area, the positions of each pickup point to be set in the target combination are adjusted within the target area to obtain a pickup point strategy combination, specifically including: Release the connection relationship between at least some of the receiving points to be set in the target combination and each service object in the target area; For each round of group adjustment, the service objects in the target area that have a release docking relationship with at least some of the receiving points to be set up are identified as target service objects. Based on the distance between the target service objects and the at least some receiving points to be set up, the positions of the at least some receiving points to be set up in the target area are adjusted to obtain the adjusted combination obtained after the round of group adjustment. If it is determined that the adjusted combination obtained from the adjustment within the group in this round meets the second preset condition, the adjusted combination obtained from the adjustment within the group in this round is used as the receiving point strategy combination; otherwise, the adjustment within the group in the next round continues until the second preset condition is met.

11. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, which, when executed by a processor, implements the method described in any one of claims 1 to 9.

12. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method described in any one of claims 1 to 9.

Images