An aggregated distribution planning method based on merchant integration

Abstract

The present invention discloses an aggregation distribution planning method based on merchant integration, comprising the following steps: S1, dividing a city into multiple first-level distribution areas according to regions; S2, locating the locations of merchants in the first-level distribution area according to their longitude and latitude to obtain the location coordinates of each merchant; S3, dividing each of the first-level distribution areas into several second-level distribution areas; S4, calibrating the merchants in each of the second-level distribution areas; S5, clustering the original merchants; S6, classifying the original orders; S7, classifying the secondary merchant clusters; S8, classifying the secondary order pools; S9, publishing the orders of the original order pool and / or the secondary order pool to the distribution platform or the delivery personnel. In the present invention, the distribution area is divided into multiple second-level distribution areas, and a merchant with a higher historical order volume is selected in the second-level distribution area as the cluster root merchant, and the merchant is classified according to the distance. The relevant delivery personnel use the cluster root merchant as the pickup base point to spread to other merchants close to the cluster root merchant, thereby effectively improving the distribution path planning effect.

Description

Technical Field

[0001] The present invention relates to an aggregated distribution planning method based on merchant integration. Background Art

[0002] At present, with the rapid development of the takeout industry, the delivery business volume is getting larger and larger, and accordingly, delivery route planning is becoming more and more important.

[0003] In the actual delivery process, in order to improve delivery efficiency, merchants that are close to each other are usually delivered together. Therefore, before delivery, the addresses of delivery outlets need to be aggregated to plan the delivery route.

[0004] In related technologies, when performing address aggregation, the distance information between delivery merchants is usually mainly considered, which is greatly affected by the distribution density of merchants and the number of orders, resulting in relatively poor effect of address aggregation. Correspondingly, the delivery route planning effect is also relatively poor. Summary of the Invention

[0005] The purpose of the present invention is to propose an aggregated distribution method capable of planning the distribution addresses of merchants.

[0006] To solve the above problems, the present invention provides a method for aggregated distribution planning based on merchant integration, which is characterized by comprising the following steps:

[0007] S1. Divide the city into multiple first-level distribution areas according to regions;

[0008] S2. Locate the locations of merchants within the primary distribution area according to their longitude and latitude to obtain the location coordinates of each merchant;

[0009] S3. Divide each of the first-level distribution areas into a number of second-level distribution areas;

[0010] S4. Marking each merchant in the secondary distribution area, and grading the priority of the merchants according to the number of historical orders in a unit period from large to small, and defining the graded merchants as the first merchant, the second merchant, the third merchant, etc. in order of priority;

[0011] S5. Clustering of original merchants: When a new order is generated, the first merchant in each secondary delivery area is used as the cluster root merchant. The navigation distances from each non-cluster root merchant in the primary delivery area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance is assigned to the original merchant cluster where the cluster root merchant is located.

[0012] S6: Adding original orders. Adding all subsequent orders from merchants in the original merchant cluster to an original order pool. The original order pool has a first upper limit and a first lower limit. When the number of orders added to the original order pool exceeds the first upper limit, the original order pool is deemed to be overflowing, and no more orders are added to the original order pool.

[0013] S7. Inclusion of secondary merchant clusters: When the original order pool in one of the secondary distribution areas or the secondary order pool to which orders from the previous cluster root merchant are allocated overflows, a secondary merchant cluster is created using the next-level merchants in the secondary distribution area. The navigation distances from each non-cluster root merchant in the primary distribution area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance to the cluster root merchant is included in the secondary merchant cluster of the cluster root merchant.

[0014] S8. Inclusion of the secondary order pool: Including orders subsequently generated by merchants in the secondary merchant cluster into the secondary order pool. The secondary order pool is set with a second upper limit and a second lower limit. When the number of orders in the secondary order pool exceeds the second upper limit, the secondary order pool is deemed to be overflowing, and no orders are added to the secondary order pool. When the number of orders in the original order pool is less than its own first lower limit, or there is a previous secondary order pool, and the number of orders in the previous secondary order pool is less than the second lower limit, the current secondary order pool stops adding orders and is allocated to the original merchant cluster or the previous secondary merchant cluster. Inclusion of the original merchant cluster takes precedence over inclusion of the previous secondary merchant cluster.

[0015] S9. When there are orders in the original order pool and / or the secondary order pool, publish the order of the original order pool and / or the secondary order pool to the delivery platform or the delivery person, and the order includes at least the delivery address information. After the delivery platform or the delivery person accepts the order, the order is deleted from the original order pool and / or the secondary order pool.

[0016] As a further improvement of the present invention, the order in step S5 is sent by external order software that communicates with the software, and the order information includes at least order address information.

[0017] As a further improvement of the present invention, step 4 includes:

[0018] S4.1. Define the merchant with the largest number of historical orders within a unit period as the first merchant and assign it the highest priority;

[0019] S4.2. Calculate the minimum navigation distance Lmin between two adjacent businesses; calculate the average distance Lavg between two adjacent businesses; calculate the ratio n of the minimum navigation distance Lmin to the average distance Lavg, i.e., n = Lmin / Lavg, and compare this ratio n with a set distance threshold L. When the ratio n is less than the set distance threshold L, and:

[0020] - When one of the merchants is the first merchant, the non-first merchant is merged into the first merchant, and the two merchants are considered as one first merchant in the original merchant cluster inclusion unit and the secondary merchant cluster inclusion unit;

[0021] - When both merchants are not the first merchant, define the merchant with the shorter distance from the first merchant as the standardized merchant, and define the merchant with the longer distance from the first merchant as the non-standardized merchant. Merge the orders of the non-standardized merchant into the standardized merchant, and consider the two merchants as one standardized merchant in the remaining merchant calibration sub-units, the original merchant cluster inclusion unit, and the secondary merchant cluster inclusion unit.

[0022] S4.3. After excluding the first merchant and non-standardized merchants in each of the secondary distribution areas, the merchants are calibrated, and the priorities of the above merchants are graded from most to least according to the number of historical orders in a unit period. The graded merchants are defined as the second merchant, the third merchant, the fourth merchant, etc. in order of priority.

[0023] As a further improvement of the present invention, when there are multiple groups of standardized merchants or non-standardized merchants, and at least two groups of standardized merchants or non-standardized merchants overlap, the step

[0024] S4.4. A plurality of merchants having at least one overlapping identical merchant are grouped as a standardized merchant group. The standardized merchant group is considered as an independent merchant in the original merchant cluster and the secondary merchant cluster. The geometric center of the standardized merchant group is the coordinate of the standardized merchant group. All merchants in the standardized merchant group are defined as non-standardized merchants.

[0025] As a further improvement of the present invention, the geometric center of the standardized merchant group is the intersection of the lines connecting the coordinates of the four outermost merchants of the standardized merchant group.

[0026] As a further improvement of the present invention, in step S3, each merchant in the primary delivery area is scanned in one direction, and is divided into several secondary delivery areas in sequence according to the set distance or area based on the merchant coordinates.

[0027] The beneficial effect of the present invention is that, in the present invention, the first-level distribution area is divided into multiple second-level distribution areas, and the merchant with the largest historical sales in each second-level distribution area is marked as the cluster root merchant. The other merchants in the first-level distribution area are classified into the original merchant cluster where the cluster root merchant closest to them is located according to their distance, and are allocated to the delivery platform or delivery personnel in the same original order pool. When the accumulated orders in the original order pool exceed the upper limit, the next-level merchant in each second-level distribution is used as the cluster root merchant, and other merchants in its first-level distribution area are classified into the secondary merchant cluster where the cluster root merchant closest to them is located according to their distance, and are allocated to the delivery platform or delivery personnel in the same secondary order pool, thus circulating. However, when the orders in the previous-level secondary order pool or the original order pool are less than the second lower limit order quantity or the first lower limit order quantity, the previous-level merchant is re-classified as the cluster root merchant. This can effectively improve the efficiency of takeout order allocation. DETAILED DESCRIPTION

[0028] The technical solution of the present invention will be further described below with reference to the accompanying drawings and through specific implementation methods. Example

[0029] The first embodiment of the present invention includes the following steps:

[0030] S1. Divide the city into multiple first-level distribution areas according to regions;

[0031] S2. Locate the locations of merchants within the primary distribution area according to their longitude and latitude to obtain the location coordinates of each merchant;

[0032] S3. Divide each of the first-level distribution areas into a number of second-level distribution areas;

[0033] S4. Marking each merchant in the secondary distribution area, and grading the priority of the merchants according to the number of historical orders in a unit period from large to small, and defining the graded merchants as the first merchant, the second merchant, the third merchant, etc. in order of priority;

[0034] S5. Clustering of original merchants: When a new order is generated, the first merchant in each secondary delivery area is used as the cluster root merchant. The navigation distances from each non-cluster root merchant in the primary delivery area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance is assigned to the original merchant cluster where the cluster root merchant is located.

[0035] S6: Adding original orders. Adding all subsequent orders from merchants in the original merchant cluster to an original order pool. The original order pool has a first upper limit and a first lower limit. When the number of orders added to the original order pool exceeds the first upper limit, the original order pool is deemed to be overflowing, and no more orders are added to the original order pool.

[0036] S7. Inclusion of secondary merchant clusters: When the original order pool in one of the secondary distribution areas or the secondary order pool to which orders from the previous cluster root merchant are allocated overflows, a secondary merchant cluster is created using the next-level merchants in the secondary distribution area. The navigation distances from each non-cluster root merchant in the primary distribution area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance to the cluster root merchant is included in the secondary merchant cluster of the cluster root merchant.

[0037] S8. Inclusion of the secondary order pool: Including orders subsequently generated by merchants in the secondary merchant cluster into the secondary order pool. The secondary order pool is set with a second upper limit and a second lower limit. When the number of orders in the secondary order pool exceeds the second upper limit, the secondary order pool is deemed to be overflowing, and no orders are added to the secondary order pool. When the number of orders in the original order pool is less than its own first lower limit, or there is a previous secondary order pool, and the number of orders in the previous secondary order pool is less than the second lower limit, the current secondary order pool stops adding orders and is allocated to the original merchant cluster or the previous secondary merchant cluster. Inclusion of the original merchant cluster takes precedence over inclusion of the previous secondary merchant cluster.

[0038] S9. When there are orders in the original order pool and / or the secondary order pool, publish the order of the original order pool and / or the secondary order pool to the delivery platform or the delivery person, and the order includes at least the delivery address information. After the delivery platform or the delivery person accepts the order, the order is deleted from the original order pool and / or the secondary order pool.

[0039] In this embodiment, the first-level distribution area is divided into multiple second-level distribution areas. In each second-level distribution area, the merchant with the largest historical sales volume is marked as the cluster root merchant. Other merchants in the first-level distribution area are classified into the original merchant cluster where the cluster root merchant closest to them is located according to their distance, and are allocated to the delivery platform or delivery personnel in the same original order pool. When the accumulated orders in the original order pool exceed the upper limit, the next-level merchant in each second-level distribution is used as the cluster root merchant, and is classified into the secondary merchant cluster where the cluster root merchant closest to them is located according to their distance according to other merchants in its first-level distribution area, and is allocated to the delivery platform or delivery personnel in the same secondary order pool, and thus the cycle continues. However, when the orders in the previous-level secondary order pool or the original order pool are less than the second lower limit order quantity or the first lower limit order quantity, the previous-level merchant is re-classified as the cluster root merchant. When picking up takeout, the delivery personnel first go to the cluster root merchant to pick up the goods, and then go to other merchants to pick up the goods according to the distance or order order. This embodiment can effectively improve the efficiency of takeout order allocation. Example

[0040] The second embodiment of the present invention includes the following steps:

[0041] S1. Divide the city into multiple first-level distribution areas according to regions;

[0042] S2. Locate the locations of merchants within the primary distribution area according to their longitude and latitude to obtain the location coordinates of each merchant;

[0043] S3. Divide each of the first-level distribution areas into a number of second-level distribution areas;

[0044] S4.1. Define the merchant with the largest number of historical orders within a unit period as the first merchant and assign it the highest priority;

[0045] S4.2. Calculate the minimum navigation distance Lmin between two adjacent businesses; calculate the average distance Lavg between two adjacent businesses; calculate the ratio n of the minimum navigation distance Lmin to the average distance Lavg, i.e., n = Lmin / Lavg, and compare this ratio n with the set distance threshold L. If the ratio n is less than the set distance threshold L, take the value of

[0046] - When one of the merchants is the first merchant, the non-first merchant is merged into the first merchant, and the two merchants are considered as one first merchant in the original merchant cluster inclusion unit and the secondary merchant cluster inclusion unit;

[0047] - When both merchants are not the first merchant, define the merchant with the shorter distance from the first merchant as the standardized merchant, and define the merchant with the longer distance from the first merchant as the non-standardized merchant. Merge the orders of the non-standardized merchant into the standardized merchant, and consider the two merchants as one standardized merchant in the remaining merchant calibration sub-units, the original merchant cluster inclusion unit, and the secondary merchant cluster inclusion unit.

[0048] S4.3. Determine the merchants in each secondary distribution area after excluding the first merchant and non-standardized merchants, and prioritize these merchants according to the number of historical orders within a unit period, from the highest to the lowest. Determine the prioritized merchants as the second merchant, the third merchant, the fourth merchant, and so on.

[0049] S4.4. A plurality of merchants having at least one overlapping identical merchant are grouped as a standardized merchant group. The standardized merchant group is considered as an independent merchant in the original merchant cluster and the secondary merchant cluster. The geometric center of the standardized merchant group is the coordinate of the standardized merchant group. All merchants in the standardized merchant group are defined as non-standardized merchants.

[0050] S5. Clustering of original merchants: When a new order is generated, the first merchant in each secondary delivery area is used as the cluster root merchant. The navigation distances from each non-cluster root merchant in the primary delivery area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance is assigned to the original merchant cluster where the cluster root merchant is located.

[0051] S6: Adding original orders. Adding all subsequent orders from merchants in the original merchant cluster to an original order pool. The original order pool has a first upper limit and a first lower limit. When the number of orders added to the original order pool exceeds the first upper limit, the original order pool is deemed to be overflowing, and no more orders are added to the original order pool.

[0052] S7. Inclusion of secondary merchant clusters: When the original order pool in one of the secondary distribution areas or the secondary order pool to which orders from the previous cluster root merchant are allocated overflows, a secondary merchant cluster is created using the next-level merchants in the secondary distribution area. The navigation distances from each non-cluster root merchant in the primary distribution area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance to the cluster root merchant is included in the secondary merchant cluster of the cluster root merchant.

[0053] S8. Inclusion of the secondary order pool: Including orders subsequently generated by merchants in the secondary merchant cluster into the secondary order pool. The secondary order pool is set with a second upper limit and a second lower limit. When the number of orders in the secondary order pool exceeds the second upper limit, the secondary order pool is deemed to be overflowing, and no orders are added to the secondary order pool. When the number of orders in the original order pool is less than its own first lower limit, or there is a previous secondary order pool, and the number of orders in the previous secondary order pool is less than the second lower limit, the current secondary order pool stops adding orders and is allocated to the original merchant cluster or the previous secondary merchant cluster. Inclusion of the original merchant cluster takes precedence over inclusion of the previous secondary merchant cluster.

[0054] S9. When there are orders in the original order pool and / or the secondary order pool, publish the order of the original order pool and / or the secondary order pool to the delivery platform or the delivery person, and the order includes at least the delivery address information. After the delivery platform or the delivery person accepts the order, the order is deleted from the original order pool and / or the secondary order pool.

[0055] In this embodiment, the first-level distribution area is divided into multiple second-level distribution areas. In each second-level distribution area, the merchant with the largest historical sales volume is marked as the cluster root merchant. Other merchants in the first-level distribution area are classified into the original merchant cluster where the cluster root merchant closest to them is located according to their distance, and are allocated to the delivery platform or delivery personnel in the same original order pool. When the accumulated orders in the original order pool exceed the upper limit, the next-level merchant in each second-level distribution is used as the cluster root merchant, and is classified into the secondary merchant cluster where the cluster root merchant closest to them is located according to their distance according to other merchants in its first-level distribution area, and is allocated to the delivery platform or delivery personnel in the same secondary order pool, and thus the cycle continues. However, when the orders in the previous-level secondary order pool or the original order pool are less than the second lower limit order quantity or the first lower limit order quantity, the previous-level merchant is re-classified as the cluster root merchant. When picking up takeout, the delivery personnel first go to the cluster root merchant to pick up the goods, and then go to other merchants to pick up the goods according to the distance or order order. This embodiment can effectively improve the efficiency of takeout order allocation.

[0056] In step S4, the distances between adjacent businesses are compared. If the distance between two adjacent businesses is less than a set value, they are considered as a single business. If the distance between multiple adjacent businesses is small, the businesses are considered as a whole (a standardized business group), and the geometric center of the standardized business group is used as the coordinate point during positioning. This eliminates the problem of adjacent businesses being too close, which may lead to unreasonable route planning.

[0057] The technical principles of the present invention have been described above with reference to specific embodiments. These descriptions are intended solely to illustrate the principles of the present invention and are not to be construed in any way as limiting the scope of protection of the present invention. Based on the explanations herein, those skilled in the art will readily conceive of other specific embodiments of the present invention without inventive effort, and such embodiments will fall within the scope of protection of the present invention.

Claims

1. A distribution planning method based on merchant integration, characterized in that: The following steps are involved: S1. Divide the city into multiple first-level distribution areas according to regions; S2. Locate the locations of merchants within the primary distribution area according to their longitude and latitude to obtain the location coordinates of each merchant; S3. Divide each of the first-level distribution areas into a number of second-level distribution areas; S4. Marking each merchant in the secondary distribution area, and grading the priority of the merchants according to the number of historical orders in a unit period from large to small, and defining the graded merchants as the first merchant, the second merchant, the third merchant, etc. in order of priority; S5. Clustering of original merchants: When a new order is generated, the first merchant in each secondary delivery area is used as the cluster root merchant. The navigation distances from each non-cluster root merchant in the primary delivery area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance is assigned to the original merchant cluster where the cluster root merchant is located. S6: Adding original orders. Adding all subsequent orders from merchants in the original merchant cluster to an original order pool. The original order pool has a first upper limit and a first lower limit. When the number of orders added to the original order pool exceeds the first upper limit, the original order pool is deemed to be overflowing, and no more orders are added to the original order pool. S7. Inclusion of secondary merchant clusters: When the original order pool in one of the secondary distribution areas or the secondary order pool to which orders from the previous cluster root merchant are allocated overflows, a secondary merchant cluster is created using the next-level merchants in the secondary distribution area. The navigation distances from each non-cluster root merchant in the primary distribution area to the cluster root merchant are compared, and the non-cluster root merchant with the shortest navigation distance to the cluster root merchant is included in the secondary merchant cluster of the cluster root merchant. S8. Inclusion of the secondary order pool: Including orders subsequently generated by merchants in the secondary merchant cluster into the secondary order pool. The secondary order pool is set with a second upper limit and a second lower limit. When the number of orders in the secondary order pool exceeds the second upper limit, the secondary order pool is deemed to be overflowing, and no orders are added to the secondary order pool. When the number of orders in the original order pool is less than its own first lower limit, or there is a previous secondary order pool, and the number of orders in the previous secondary order pool is less than the second lower limit, the current secondary order pool stops adding orders and is allocated to the original merchant cluster or the previous secondary merchant cluster. Inclusion of the original merchant cluster takes precedence over inclusion of the previous secondary merchant cluster. S9. When there are orders in the original order pool and / or the secondary order pool, publish the order of the original order pool and / or the secondary order pool to the delivery platform or the delivery person, and the order includes at least the delivery address information. After the delivery platform or the delivery person accepts the order, the order is deleted from the original order pool and / or the secondary order pool.

2. The method for aggregated distribution planning based on merchant integration according to claim 1, characterized in that: The order in step S5 is sent by the external order software that is in data communication with the software, and the order information includes at least the order address information.

3. The method for aggregated distribution planning based on merchant integration according to claim 2, characterized in that: The step 4 comprises: S4.

1. Define the merchant with the largest number of historical orders within a unit period as the first merchant and assign it the highest priority; S4.

2. Calculate the minimum navigation distance Lmin between two adjacent businesses; calculate the average distance Lavg between two adjacent businesses; calculate the ratio n of the minimum navigation distance Lmin to the average distance Lavg, i.e., n = Lmin / Lavg, and compare this ratio n with a set distance threshold L. When the ratio n is less than the set distance threshold L, and: - When one of the merchants is the first merchant, the non-first merchant is merged into the first merchant, and the two merchants are considered as one first merchant in the original merchant cluster and the secondary merchant cluster. - When both merchants are not the first merchant, define the merchant with the shorter distance from the first merchant as the standardized merchant, and define the merchant with the longer distance from the first merchant as the non-standardized merchant. Merge the orders of the non-standardized merchant into the standardized merchant, and consider the two merchants as one standardized merchant in the remaining merchant calibration sub-units, the original merchant cluster inclusion unit, and the secondary merchant cluster inclusion unit. S4.

3. After excluding the first merchant and non-standardized merchants in each of the secondary distribution areas, the merchants are calibrated, and the priorities of the above merchants are graded from most to least according to the number of historical orders in a unit period. The graded merchants are defined as the second merchant, the third merchant, the fourth merchant, etc. in order of priority.

4. The method for aggregated distribution planning based on merchant integration according to claim 3, characterized in that: When there are multiple groups of standardized merchants or non-standardized merchants, and at least two groups of standardized merchants or non-standardized merchants overlap, The following steps are included S4.

4. Multiple merchants with at least one overlapping identical merchant are grouped as a standardized merchant group. The standardized merchant group is considered as an independent merchant in the primary merchant clustering and the secondary merchant clustering. The geometric center of the standardized merchant group is the coordinate of the standardized merchant group. All merchants in the standardized merchant group are defined as non-standardized merchants.

5. The method for aggregated distribution planning based on merchant integration according to claim 4, characterized in that: The geometric center of the standardized merchant group is the intersection of the lines connecting the coordinates of the four outermost merchants of the standardized merchant group.

6. The method for aggregated distribution planning based on merchant integration according to claim 5, characterized in that: In step S3, each merchant in the primary delivery area is scanned in one direction, and is divided into a number of secondary delivery areas in sequence according to the merchant coordinates and the set distance or area.