A store route clustering planning method, system, electronic device and storage medium

By calculating the comprehensive weight and clustering of stores and optimizing route planning, the problem of ignoring business attributes in the existing technology is solved, and more efficient route planning and operational efficiency is achieved.

CN118657273BActive Publication Date: 2024-11-08BEIJING FENYANG TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411127977.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-16
Publication Date
2024-11-08
Estimated Expiration
2044-08-16

AI Technical Summary

Technical Problem

The existing technology ignores the business attributes of supermarket stores in route planning, such as visit frequency, level and sales capabilities, resulting in inefficient planned routes and inability to meet complex business needs.

Method used

By calculating the comprehensive weight of the store, the store clustering is carried out based on the visit frequency, predefined level and sales capacity value, and the route planning is carried out based on the road distance within the cluster group to obtain the optimal access path.

Benefits of technology

Effectively combine business and geographical information, optimize route planning, improve operational efficiency and route accuracy, and meet complex business needs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118657273B_ABST
    Figure CN118657273B_ABST
Patent Text Reader

Abstract

The present invention proposes a store route clustering planning method, system, electronic device and storage medium, which belongs to the field of route planning. The method includes: calculating the comprehensive weight of the store according to the store's visit frequency, predefined level and sales capacity value; clustering the stores to be clustered according to the distance between the store to be clustered and the cluster center store and the comprehensive weight of the store to obtain multiple cluster groups; and planning the route according to the road distance between adjacent stores in the cluster group to obtain the optimal access path. The scheme proposed by the present invention can make full use of the combination of business and geographic information, more effectively coordinate the service routes between stores, and adopt advanced mathematical models and algorithms to ensure the accuracy and efficiency of route optimization results, which has a significant improvement effect on the actual operation of the industry.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of route planning, and in particular relates to a store route clustering planning method, system, electronic equipment and storage medium. Background Art

[0002] With the acceleration of urbanization and the expansion of supermarket business, how to effectively organize the logistics distribution and personnel visits of supermarket stores has become the key to improving efficiency and reducing costs. The challenge lies in how to minimize the total distribution route mileage while ensuring service quality, and how to effectively integrate the business attributes of stores (such as visit frequency, store level, sales ability) into route planning to improve the overall operational efficiency of the enterprise.

[0003] In the prior art, Chinese Patent No. CN116432886A provides an intelligent route planning method, including selecting stores that must be visited on the route scheduling date; calculating the visit frequency ratio values ​​of all stores; selecting benchmark stores based on the visit frequency ratio values ​​of all stores; selecting alternative stores, and selecting specific plans according to actual needs to calculate the store location ratio value of each alternative store; calculating the route scheduling weight of the alternative store based on the visit frequency ratio value and the store location ratio value; and completing the intelligent route planning based on the route scheduling weight.

[0004] Chinese patent No. CN112166423A provides a real estate search or comparison method based on commuting time. The method effectively processes public transportation and real estate data to calculate the travel time between the real estate and the vehicle stop. These times are stored. Since these parts of time are calculated and stored in advance, the method can determine the commuting time to each real estate in a scalable manner.

[0005] Chinese patent No. CN111161102A provides a GIS-based scenic area service facility layout analysis method, including the following steps: 1) importing the acquired data into the GIS platform; 2) selecting the real-time population big data sampling point and the nearest service facility through GIS and calculating the actual distance between the two; 3) calculating the coupling degree between the real-time population sampling point and the service facility; 4) expressing the coupling degree graphically, thereby outputting the final scenic area facility layout analysis results. This method can reflect the coupling relationship between service facilities and population distribution within the scenic area, thereby providing a basis for the layout of service facilities.

[0006] The defects of these existing technologies are mainly reflected in the following aspects: although the existing technologies provide route planning solutions based on geographic information system (GIS), these methods usually only focus on geographical location factors and ignore the business attributes of supermarket stores, such as the store's service demand frequency, importance level and sales performance, resulting in the planned routes being inefficient in actual operations and unable to meet complex business needs. Summary of the invention

[0007] In order to solve the above technical problems, the present invention proposes a technical solution of a store route clustering planning method, system, electronic device and storage medium to solve the above technical problems.

[0008] A first aspect of the present invention discloses a store route clustering planning method, the method comprising:

[0009] Step S1, calculating the comprehensive weight of the store according to the store's visit frequency, predefined level and sales ability value;

[0010] Step S2: clustering the stores to be clustered according to the distance between the stores to be clustered and the cluster center stores and the comprehensive weights of the stores to obtain multiple cluster groups;

[0011] Step S3: perform route planning based on the road distances between adjacent stores in the cluster group to obtain the optimal access path.

[0012] According to the method of the first aspect of the present invention, in step S1, calculating the comprehensive weight of a store according to the store's visit frequency, predefined level and sales capability value includes:

[0013]

[0014]

[0015]

[0016]

[0017] in, Indicates The comprehensive weight of each store; Indicates Frequency of store visits; Indicates Predefined levels of stores; Indicates The sales capacity value of each store; Indicates The weight coefficient of the visit frequency of each store; Indicates The weight coefficients of the predefined levels of the stores; Indicates The weight coefficient of the sales capacity value of each store.

[0018] According to the method of the first aspect of the present invention, in step S2, the stores to be clustered are clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores, and the multiple cluster groups obtained include:

[0019]

[0020] in, Represents the target of clustering; Indicates Cluster groups; Indicates the number of cluster groups; It is the first Home stores, It is Home Store Stores with cluster centers The road distance between Indicates The comprehensive weight of each store; Represents the comprehensive weight of the store in the cluster center; Represents a comprehensive evaluation function. The evaluation function calculates a reference value based on the input parameters. The reference value represents the The probability that the store and the cluster center store are grouped into one group, The specific implementation of the function is relatively flexible, and common normalization functions or other similar functions can be used.

[0021] According to the method of the first aspect of the present invention, in step S3, performing route planning according to the road distances between adjacent stores in the cluster group includes:

[0022]

[0023] in, Represents a specific access path within a cluster group, including the order from one store to another; and They are and The stores traversed by cluster groups, Indicates the access path Neighboring stores and The road distance between Represents the target function, that is, the access path The sum of the road distances between all adjacent stores in the upper cluster group.

[0024] A second aspect of the present invention discloses a store route clustering planning system, the system comprising:

[0025] A first processing module is configured to calculate a comprehensive weight of a store according to the store's visit frequency, a predefined grade, and a sales capability value;

[0026] The second processing module is configured to cluster the stores to be clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores to obtain multiple cluster groups;

[0027] The third processing module is configured to perform route planning according to the road distances between adjacent stores in the cluster group to obtain an optimal access path.

[0028] According to the system of the second aspect of the present invention, the calculating of the comprehensive weight of the store according to the store's visit frequency, predefined level and sales capability value comprises:

[0029]

[0030]

[0031]

[0032]

[0033] in, Indicates The comprehensive weight of each store; Indicates Frequency of store visits; Indicates Predefined levels of stores; Indicates The sales capacity value of each store; Indicates The weight coefficient of the visit frequency of each store; Indicates The weight coefficients of the predefined levels of the stores; Indicates The weight coefficient of the sales capacity value of each store.

[0034] According to the system of the second aspect of the present invention, the stores to be clustered are clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores, and the multiple cluster groups obtained include:

[0035]

[0036] in, Represents the target of clustering; Indicates Cluster groups; Indicates the number of cluster groups; It is the first Home stores, It is Home Store Stores with cluster centers The road distance between Indicates The comprehensive weight of each store; Represents the comprehensive weight of the store in the cluster center; Represents a comprehensive evaluation function, the input parameters are:

[0037] Stores To the cluster center store The road distance between

[0038] Indicates The comprehensive weight of each store;

[0039] It is the cluster center store;

[0040] The comprehensive evaluation function can give the final reference result based on the input parameters.

[0041] According to the system of the second aspect of the present invention, the route planning according to the road distance between adjacent stores in the cluster group includes:

[0042]

[0043] in, Represents a specific access path within a cluster group, including the order from one store to another; and They are and The stores traversed by cluster groups, Indicates the access path Neighboring stores and The road distance between Represents the target function, that is, the access path The sum of the road distances between all adjacent stores in the upper cluster group.

[0044] The third aspect of the present invention discloses an electronic device, which includes a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps in any one of the store route clustering planning methods in the first aspect of the present disclosure are implemented.

[0045] The fourth aspect of the present invention discloses a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in any one of the store route clustering planning methods in the first aspect of the present disclosure are implemented.

[0046] In summary, the solution proposed in the present invention can make full use of the combination of business and geographic information, more effectively coordinate the service routes between stores, and adopt advanced mathematical models and algorithms to ensure the accuracy and efficiency of route optimization results, which has a significant improvement effect on the actual operation of the industry. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0048] Figure 1 is a flow chart of a store route clustering planning method according to an embodiment of the present invention;

[0049] Figure 2 is a schematic diagram of 100 stores according to an embodiment of the present invention;

[0050] Figure 3 This is a schematic diagram of 100 stores after clustering according to an embodiment of the present invention;

[0051] Figure 4 A structural diagram of a store route clustering planning system according to an embodiment of the present invention;

[0052] Figure 5 The figure is a structural diagram of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0053] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0054] A first aspect of the present invention discloses a store route clustering planning method. Figure 1 FIG. 1 is a flow chart of a store route clustering planning method according to an embodiment of the present invention. Figure 1 As shown, the method includes:

[0055] Step S1, calculating the comprehensive weight of the store according to the store's visit frequency, predefined level and sales ability value;

[0056] Step S2: clustering the stores to be clustered according to the distance between the stores to be clustered and the cluster center stores and the comprehensive weights of the stores to obtain multiple cluster groups;

[0057] Step S3: perform route planning based on the road distances between adjacent stores in the cluster group to obtain the optimal access path.

[0058] In step S1, the comprehensive weight of the store is calculated according to the store's visit frequency, predefined level and sales ability value.

[0059] In some embodiments, in step S1, calculating the comprehensive weight of a store according to the store's visit frequency, predefined level, and sales capability value includes:

[0060]

[0061] It is a normalization function with an output value range of [0,1], which is used to convert attribute values ​​of different scales into comparable and cumulative scores to ensure the balance and fairness between attribute values;

[0062] Normalization function: Add ginseng The value range of is [0, +∞], and the value range of the out parameter is [0, 1];

[0063]

[0064]

[0065]

[0066] in, Indicates The comprehensive weight of each store; Indicates The frequency of store visits is the number of normal visits required within a certain period of time. The frequency of visits reflects the activity of the store and the intensity of demand for services. The higher the store visit frequency, the greater the value of the frequency of visits. Indicates The predefined grade of each store, which is a rating assigned based on the store's sales, customer traffic and other key business indicators, reflecting the store's importance in the supermarket network; the higher the store's predefined grade, the greater the store grade value; Indicates The sales capacity value of a store is measured by sales volume or average transaction volume, reflecting the sales performance of the store; the higher the store sales, the greater the sales capacity value; Indicates The weight coefficient of the visit frequency of each store; Indicates The weight coefficients of the predefined levels of the stores; Indicates The weight coefficient of the sales capacity value of each store.

[0067] In step S2, the stores to be clustered are clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores to obtain a plurality of cluster groups.

[0068] Due to the diversity of store geographical distribution and business attributes, directly optimizing the overall route cost is a highly complex problem. In order to simplify this problem and improve computational efficiency, this embodiment adopts a clustering strategy. This strategy groups geographically adjacent stores with similar business needs into the same cluster as the basic unit for route planning.

[0069] In some embodiments, in step S2, the stores to be clustered are clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores, and the multiple cluster groups obtained include:

[0070]

[0071] in, Represents the target of clustering; Indicates Cluster groups; Indicates the number of cluster groups; It is the first Home stores, It is Home Store Stores with cluster centers The road distance between Indicates The comprehensive weight of each store; represents the comprehensive weight of the store in the cluster center; represents the comprehensive evaluation function, which calculates a reference value based on the input parameters. The reference value represents the The probability that the store and the cluster center store are grouped into one group, The specific implementation of the function is relatively flexible, and common normalization functions or other similar functions can be used; Represents a comprehensive evaluation function, the input parameters are:

[0072] Stores To the cluster center store The road distance between

[0073] Indicates The comprehensive weight of each store;

[0074] It is the cluster center store;

[0075] The comprehensive evaluation function can give the final reference result based on the input parameters.

[0076] In step S3, route planning is performed based on the road distances between adjacent stores in the cluster group to obtain the optimal access path.

[0077] After the clustering grouping of the routes is determined, the specific access sequence within each group needs to be planned. This embodiment achieves this optimization by minimizing the length of the internal path of the cluster.

[0078] In some embodiments, in step S3, performing route planning according to the road distances between adjacent stores in the cluster group includes:

[0079]

[0080] in, Represents a specific access path within a cluster group, including the order from one store to another; and are respectively and The stores traversed by cluster groups, Indicates the access path Neighboring stores and The road distance between Represents the target function, that is, the access path The sum of the road distances between all adjacent stores in the upper cluster group.

[0081] Example 1

[0082] Step 1: Figure 2 As shown, 100 stores are randomly generated, and the comprehensive weight of the stores is calculated based on the store's visit frequency, predefined level and sales ability value;

[0083] Step 2: Figure 3 As shown, the clustering algorithm is applied to divide the 100 stores into 6 designated clusters;

[0084] Step 3: Connect the stores in series based on the path optimization algorithm.

[0085] In summary, the solution proposed in the present invention can make full use of the combination of business and geographic information, more effectively coordinate the service routes between stores, and adopt advanced mathematical models and algorithms to ensure the accuracy and efficiency of route optimization results, which has a significant improvement effect on the actual operation of the industry.

[0086] A second aspect of the present invention discloses a store route clustering planning system. Figure 4 FIG. 4 is a structural diagram of a store route clustering planning system according to an embodiment of the present invention; Figure 4 As shown, the system 100 includes:

[0087] The first processing module 101 is configured to calculate the comprehensive weight of the store according to the store's visit frequency, predefined level and sales ability value;

[0088] The second processing module 102 is configured to cluster the stores to be clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores to obtain multiple cluster groups;

[0089] The third processing module 103 is configured to perform route planning according to the road distances between adjacent stores in the cluster group to obtain an optimal access path.

[0090] According to the system of the second aspect of the present invention, the first processing module 101 is specifically configured to calculate the comprehensive weight of the store according to the store's visit frequency, predefined level and sales ability value, including:

[0091]

[0092] It is a normalization function with an output value range of [0,1], which is used to convert attribute values ​​of different scales into comparable and cumulative scores to ensure the balance and fairness between attribute values;

[0093] Normalization function: Add ginseng The value range of is [0, +∞], and the value range of the out parameter is [0, 1];

[0094]

[0095]

[0096]

[0097] in, Indicates The comprehensive weight of each store; Indicates The frequency of store visits is the number of normal visits required within a certain period of time. The frequency of visits reflects the activity of the store and the intensity of demand for services. The higher the store visit frequency, the greater the value of the frequency of visits. Indicates The predefined grade of each store, which is a rating assigned based on the store's sales, customer traffic and other key business indicators, reflecting the store's importance in the supermarket network; the higher the store's predefined grade, the greater the store grade value; Indicates The sales capacity value of a store is measured by sales volume or average transaction volume, reflecting the sales performance of the store; the higher the store sales, the greater the sales capacity value; Indicates The weight coefficient of the visit frequency of each store; Indicates The weight coefficients of the predefined levels of the stores; Indicates The weight coefficient of the sales capacity value of each store.

[0098] According to the system of the second aspect of the present invention, the second processing module 102 is specifically configured to cluster the stores to be clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores, and obtain multiple cluster groups including:

[0099]

[0100] in, Represents the target of clustering; Indicates Cluster groups; Indicates the number of cluster groups; It is the first Home stores, It is Home Store Stores with cluster centers The road distance between Indicates The comprehensive weight of each store; Represents the comprehensive weight of the store in the cluster center; Represents the comprehensive evaluation function.

[0101] According to the system of the second aspect of the present invention, the third processing module 103 is specifically configured to perform route planning according to the road distance between adjacent stores in the cluster group, including:

[0102]

[0103] in, Represents a specific access path within a cluster group, including the order from one store to another; and They are and The stores traversed by cluster groups represent the access path Neighboring stores and The road distance between Represents the target function, that is, the access path The sum of the road distances between all adjacent stores in the upper cluster group.

[0104] The third aspect of the present invention discloses an electronic device, which includes a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of any one of the store route clustering planning methods disclosed in the first aspect of the present invention are implemented.

[0105] Figure 5 is a structural diagram of an electronic device according to an embodiment of the present invention, such as Figure 5 As shown, the electronic device includes a processor, a memory, a communication interface, a display screen and an input device connected through a system bus. Among them, the processor of the electronic device is used to provide computing and control capabilities. The memory of the electronic device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The communication interface of the electronic device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be achieved through WIFI, an operator network, near field communication (NFC) or other technologies. The display screen of the electronic device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the electronic device can be a touch layer covered on the display screen, or a key, trackball or touchpad set on the housing of the electronic device, or an external keyboard, touchpad or mouse, etc.

[0106] Those skilled in the art will understand that Figure 5 The structure shown in the figure is only a structural diagram of the part related to the technical solution of the present disclosure, and does not constitute a limitation on the electronic device to which the technical solution of the present application is applied. The specific electronic device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0107] The fourth aspect of the present invention discloses a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the steps of the store route clustering planning method disclosed in any one of the first aspects of the present invention are implemented.

[0108] It can be seen that the present invention has obvious technical differences compared with the prior art. For example, compared with Chinese Patent No. CN116432886A, the latter emphasizes the selection of the most suitable stores to the route according to the various weights of the stores, and the stores can exist on different routes at the same time. The present invention mainly emphasizes the classification of designated stores to different routes according to the various weights of the stores and reasonable arrangement of the routes. Stores can only exist on one route, which is more targeted and accurate; Chinese Patent No. CN116432886A uses the goal of planning routes based on the reference stores in combination with weight calculations, so more data is needed as support for analyzing the planned routes, and the calculation method is mainly based on the distance reference value or actual distance from the store to the reference store. The present invention uses an optimized version of the K-means clustering algorithm combined with weights to achieve the route planning goal. The advantage is that there is no need for a reference store as a reference, and the center point of the class is continuously adjusted through multiple rounds of calculations of the clustering algorithm until the center point of the class no longer changes.

[0109] Please note that the technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification. The above embodiments only express several implementation methods of the present application, and their descriptions are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention application. It should be pointed out that for ordinary technicians in this field, without departing from the concept of the present application, several variations and improvements can be made, which all belong to the scope of protection of the present application. Therefore, the scope of protection of the present application shall be based on the attached claims.

Claims

1. A store route clustering planning method, characterized in that: The method comprises: Step S1, calculating the comprehensive weight of the store according to the store's visit frequency, predefined level and sales ability value; Step S2: clustering the stores to be clustered according to the distance between the stores to be clustered and the cluster center stores and the comprehensive weights of the stores to obtain multiple cluster groups; Step S3: perform route planning based on the road distances between adjacent stores in the cluster group to obtain the optimal access path; In step S1, the calculation of the comprehensive weight of the store according to the store's visit frequency, predefined level and sales ability value includes: ; ; ; ; in, Indicates The comprehensive weight of each store; Indicates Frequency of store visits; Indicates Predefined levels of stores; Indicates The sales capacity value of each store; Indicates The weight coefficient of the visit frequency of each store; Indicates The weight coefficients of the predefined levels of the stores; Indicates The weight coefficient of the sales capacity value of each store; In step S2, the stores to be clustered are clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores, and a plurality of cluster groups are obtained, including: ; in, Represents the target of clustering; Indicates Cluster groups; Indicates the number of cluster groups; It is the first Home stores, It is Home Store Stores with cluster centers The road distance between Indicates The comprehensive weight of each store; Represents the comprehensive weight of the store in the cluster center; represents the comprehensive evaluation function; In step S3, performing route planning according to the road distances between adjacent stores in the cluster group includes: ; in, Represents a specific access path within a cluster group, including the order from one store to another; and They are and The stores traversed by cluster groups, Indicates the access path Neighboring stores and The road distance between Represents the target function, that is, the access path The sum of the road distances between all adjacent stores in the upper cluster group.

2. A store route clustering planning system, the system adopts the method of claim 1, characterized in that: The system comprises: A first processing module is configured to calculate a comprehensive weight of a store according to the store's visit frequency, a predefined grade, and a sales capability value; The second processing module is configured to cluster the stores to be clustered according to the distance between the stores to be clustered and the cluster center store and the comprehensive weight of the stores to obtain multiple cluster groups; The third processing module is configured to perform route planning according to the road distances between adjacent stores in the cluster group to obtain an optimal access path; The calculation of the comprehensive weight of a store according to the store's visit frequency, predefined level and sales capability value includes: ; ; ; ; in, Indicates The comprehensive weight of each store; Indicates Frequency of store visits; Indicates Predefined levels of stores; Indicates The sales capacity value of each store; Indicates The weight coefficient of the visit frequency of each store; Indicates The weight coefficients of the predefined levels of the stores; Indicates The weight coefficient of the sales capacity value of each store; According to the distance between the to-be-clustered stores and the cluster center stores and the comprehensive weight of the stores, the to-be-clustered stores are clustered to obtain multiple cluster groups including: ; in, Represents the target of clustering; Indicates Cluster groups; Indicates the number of cluster groups; It is the first Home stores, It is Home Store Stores with cluster centers The road distance between Indicates The comprehensive weight of each store; Represents the comprehensive weight of the store in the cluster center; represents the comprehensive evaluation function; The route planning according to the road distance between adjacent stores in the cluster group includes: ; in, Represents a specific access path within a cluster group, including the order from one store to another; and They are and The stores traversed by cluster groups, Indicates the access path Neighboring stores and The road distance between Represents the target function, that is, the access path The sum of the road distances between all adjacent stores in the upper cluster group.

3. An electronic device, characterized in that: The electronic device includes a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, the steps in the store route clustering planning method described in claim 1 are implemented.

4. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in the store route clustering planning method described in claim 1 are implemented.