Distribution route generation method and system for community group purchase multi-product co-distribution

Abstract

The embodiment of the invention provides a distribution route generation method and system for community group purchase multi-product co-distribution, and belongs to the technical field of logistics distribution planning. The method comprises the following steps: obtaining delivery tasks of frozen products, refrigerated products and common products which need to be delivered at present; generating a distribution route according to the distribution task; randomly selecting a destruction operator; the selected destruction operator is adopted to destroy the current distribution route; randomly selecting a repair operator; repairing the distribution route by adopting the selected repairing operator; judging whether the target value of the repaired distribution route is smaller than the target value of the distribution route before damage; when it is judged that the target value of the repaired distribution route is smaller than the target value of the distribution route before damage, the repaired distribution route serves as a new current distribution route; judging whether a termination condition is met currently; and when it is judged that the termination condition is met currently, the current delivery route is output as an optimal solution.

Description

Technical Field

[0001] The present invention relates to the technical field of logistics distribution planning, and specifically to a method and system for generating a distribution route for community group purchasing of multiple products. Background Art

[0002] With the booming development of e-commerce, group buying has become a new shopping model favored by consumers. Group buying activities usually involve a variety of types of goods, including frozen goods, refrigerated goods, and ordinary goods. Due to their different properties, these goods have different requirements for temperature control during the distribution process. For example, frozen goods need to be transported at extremely low temperatures to maintain their solid state; refrigerated goods need to be transported within a certain low temperature range to prevent deterioration; and ordinary goods do not have special temperature control requirements. Therefore, the specific needs of each type of goods must be taken into account when planning the distribution route to ensure that all goods can be delivered to consumers in the best condition.

[0003] However, in actual operation, how to efficiently integrate different types of commodity distribution and develop the optimal distribution plan that meets both time efficiency and product quality has become a challenge. Although there are some general logistics solutions based on geographical location or cost minimization in the current market, they often ignore the additional constraints brought by the characteristics of the goods. Especially for food products that require strict temperature control, if traditional methods are used for distribution, some sensitive items may be damaged due to improper handling, which in turn affects customer satisfaction and corporate reputation. In addition, unreasonable route arrangements may also cause waste of resources (such as excessive use of refrigerated trucks) and increase operating costs. Summary of the invention

[0004] The purpose of the embodiments of the present invention is to provide a method and system for generating delivery routes for community group purchasing of multiple products, which method and system can adapt to the delivery time requirements of different types of goods.

[0005] In order to achieve the above-mentioned purpose, an embodiment of the present invention provides a method for generating a delivery route for community group purchase of multiple products, including:

[0006] Get the delivery tasks of frozen products, refrigerated products and ordinary products that need to be delivered;

[0007] generating a delivery route according to the delivery task;

[0008] Randomly select a destruction operator;

[0009] Using the selected destruction operator to destroy the current delivery route;

[0010] Randomly select a repair operator;

[0011] Repairing the delivery route using the selected repair operator;

[0012] Determine whether the target value of the repaired delivery route is less than the target value of the delivery route before the damage;

[0013] In the case where it is determined that the target value of the delivery route after the repair is less than the target value of the delivery route before the damage, the delivery route after the repair is used as the new current delivery route;

[0014] Determine whether the termination condition is currently met;

[0015] When it is determined that the termination condition is currently met, the current delivery route is output as the optimal solution;

[0016] When it is determined that the termination condition is not satisfied currently, the process returns to the step of randomly selecting a destruction operator.

[0017] Optionally, generating a delivery route according to the delivery task includes:

[0018] The delivery points are split according to the delivery tasks of the frozen products, refrigerated products and common products to obtain a plurality of virtual delivery points;

[0019] Generate a sub-path of the delivery task;

[0020] The gathering point is taken as the initial location;

[0021] Taking the location as the starting point, respectively calculating the distribution losses of the remaining virtual distribution points;

[0022] Determine whether the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the minimum delivery loss;

[0023] When it is determined that the remaining capacity of the current sub-path cannot meet the delivery requirement of the virtual delivery point with the minimum delivery loss, returning to the step of generating a sub-path of the delivery task;

[0024] When it is determined that the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the smallest delivery loss, the virtual delivery point with the smallest delivery loss is selected to be added to the sub-path;

[0025] Determine whether there are any virtual delivery points that have not been delivered;

[0026] In the case that it is determined that there are still virtual delivery points that have not been delivered, the virtual delivery point with the smallest delivery loss is used as the new location point, and the step of returning to the location point as the starting point to calculate the delivery losses of the remaining virtual delivery points respectively;

[0027] When it is determined that there is no virtual delivery point that has not been delivered, the delivery route composed of the sub-paths is output.

[0028] Optionally, calculate the delivery losses of the remaining delivery points separately, including:

[0029] The distribution loss is calculated according to formula (1) and formula (2):

[0030] f(R)=∑ k∈K c1(r k ∈R)+∑ k∈K c2(r k ∈R)+∑ k∈K c3(r k ∈R), (1)

[0031] Where f(R) is the delivery loss, P is the delivery route, K is the number of sub-paths, c1(r k ∈R) is the fixed loss of the kth delivery vehicle, r k is the subpath of the kth delivery vehicle, c2(r k ∈R) is the path loss of the kth delivery vehicle, c3(r k ∈R) is the commodity quality loss of the kth delivery vehicle;

[0032]

[0033] Among them, P is the set of commodity types at the distribution point, L ip is the quality loss function of the pth product, b ip is the order quantity of the pth product, Z p is the quality value loss parameter of the pth commodity.

[0034] Optionally, the destruction operator comprises a random destruction method, comprising:

[0035] Randomly select multiple virtual delivery points from the current delivery route to form a virtual delivery point set;

[0036] A plurality of virtual delivery points in the set of virtual delivery points are removed from the delivery route.

[0037] Optionally, the destruction operator comprises a distance destruction method, comprising:

[0038] respectively calculating the distance between two adjacent virtual delivery points in the delivery route;

[0039] Selecting a plurality of the virtual delivery points with the shortest distances to form a virtual delivery point set;

[0040] A plurality of virtual delivery points in the set of virtual delivery points are removed from the delivery route.

[0041] Optionally, the destruction operator includes a worst-case destruction method, including:

[0042] Calculate the growth value of the delivery loss of each virtual delivery point in the delivery route respectively;

[0043] Selecting a plurality of virtual delivery points from the delivery route in descending order to form a set of virtual delivery points;

[0044] A plurality of virtual delivery points in the set of virtual delivery points are removed from the delivery route.

[0045] Optionally, the repair operator includes a greedy repair method, including:

[0046] Randomly select a virtual delivery point from the set of virtual delivery points;

[0047] Calculate the growth loss caused by inserting the selected virtual delivery point between every two virtual delivery points of the delivery route after the destruction respectively;

[0048] Selecting a position corresponding to the smallest growth loss, and inserting the virtual delivery point into the delivery task;

[0049] Determining whether there are any unselected virtual delivery points in the set of virtual delivery points;

[0050] In the case where it is determined that there is no unselected virtual delivery point in the set of virtual delivery points, determining that the repair is completed;

[0051] In the case where it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, the step of randomly selecting a virtual delivery point from the set of virtual delivery points is returned to be executed.

[0052] Optionally, the repair operator includes a regret value repair method, including:

[0053] Calculate the regret value of each virtual delivery point in the set of virtual delivery points respectively;

[0054] Selecting an unselected virtual delivery point from the set of virtual delivery points in descending order of the regret values;

[0055] Calculate the growth loss caused by inserting the selected virtual delivery point between every two virtual delivery points of the delivery route after the destruction respectively;

[0056] Selecting a position corresponding to the smallest growth loss, and inserting the virtual delivery point into the delivery task;

[0057] Determining whether there are any unselected virtual delivery points in the set of virtual delivery points;

[0058] In the case where it is determined that there is no unselected virtual delivery point in the set of virtual delivery points, determining that the repair is completed;

[0059] In the case where it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, the step of respectively calculating the regret value of each virtual delivery point in the set of virtual delivery points is returned to be executed.

[0060] Optionally, respectively calculating the regret value of each virtual delivery point in the set of virtual delivery points includes:

[0061] The regret value is calculated according to formula (3):

[0062] H i =Δf2(R ′ 1,i)-Δf1(R ′ 1,i), (3)

[0063] Among them, H i is the regret value of the ith virtual delivery point, Δf2(R ′ 1,i) is the growth value of the sub-minimum delivery loss after the i-th virtual delivery point is inserted into the delivery route, Δf1(R ′ 1,i) is the growth value of the minimum delivery loss after the i-th virtual delivery point is inserted into the delivery route.

[0064] On the other hand, the present invention also provides a delivery route generation system for community group purchasing of multiple products, the system comprising a processor, and the processor is configured to execute any of the methods described above.

[0065] Through the above technical solution, the embodiment of the present invention provides a method and system for generating a delivery route for community group purchase of multiple products. The method and system generate delivery routes by constructing delivery tasks for different frozen products, refrigerated products, and ordinary products, and then optimize the delivery routes through the iteration of destruction operators and repair operators. Compared with the prior art, the method and system provided by the present invention improves the efficiency of delivery while adapting to the different delivery time requirements of frozen products, refrigerated products, and ordinary products.

[0066] Other features and advantages of the embodiments of the present invention will be described in detail in the subsequent detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] The accompanying drawings are used to provide a further understanding of the embodiments of the present invention and constitute a part of the specification. Together with the following specific implementations, they are used to explain the embodiments of the present invention, but do not constitute a limitation on the embodiments of the present invention. In the accompanying drawings:

[0068] Figure 1 It is a flow chart of a method for generating a delivery route for community group purchase of multiple products according to an embodiment of the present invention;

[0069] Figure 2 is a flow chart of a method for generating a delivery route according to one embodiment of the present invention;

[0070] Figure 3 is a flow chart of a greedy repair method according to one embodiment of the present invention;

[0071] Figure 4 is a flowchart of a regret value repairing method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0072] The specific implementation of the embodiment of the present invention is described in detail below in conjunction with the accompanying drawings. It should be understood that the specific implementation described here is only used to illustrate and explain the embodiment of the present invention, and is not used to limit the embodiment of the present invention.

[0073] It should be noted that the acquisition, transmission, storage, use, and processing of data in the technical solution of this application are in compliance with the relevant provisions of national laws and regulations. In the embodiments of this application, some existing solutions in the industry such as certain software, components, and models may be mentioned, which should be considered as exemplary. Their purpose is only to illustrate the feasibility of implementing the technical solution of this application, but it does not mean that the applicant has or will necessarily use the solution.

[0074] like Figure 1 The figure is a flow chart of a method for generating a delivery route for community group purchase of multiple products according to one embodiment of the present invention. Figure 1 In the method, the method may include the following steps:

[0075] In step S10, the delivery tasks of frozen products, refrigerated products and common products that need to be delivered are obtained;

[0076] In step S11, a delivery route is generated according to the delivery task;

[0077] In step S12, a destruction operator is randomly selected;

[0078] In step S13, the current delivery route is destroyed using the selected destruction operator;

[0079] In step S14, a repair operator is randomly selected;

[0080] In step S15, the delivery route is repaired using the selected repair operator;

[0081] In step S16, it is determined whether the target value of the delivery route after the repair is less than the target value of the delivery route before the damage;

[0082] In step S17, if it is determined that the target value of the delivery route after the repair is less than the target value of the delivery route before the damage, the repaired delivery route is used as the new current delivery route;

[0083] In step S18, it is determined whether the termination condition is currently met;

[0084] In step S19, when it is determined that the termination condition is currently met, the current delivery route is output as the optimal solution;

[0085] When it is determined that the termination condition is not satisfied currently, the process returns to the step of randomly selecting a destruction operator, that is, returns to step S12.

[0086] In such Figure 1 In the method shown, step S10 can be used to obtain the delivery tasks of frozen products, refrigerated products and ordinary products that currently need to be delivered. Among them, the delivery tasks can correspond to multiple delivery points at different distances from the distribution point. Each delivery point has a different combination of requirements for frozen products, refrigerated products and ordinary products. For frozen and refrigerated products, the quality of the goods will be affected by the transportation and loading and unloading time, causing their quality to deteriorate (thaw, rot), and when the quality drops to a predefined threshold, the goods will lose their value. Therefore, different types of goods (frozen products, refrigerated products and ordinary products) have different requirements for delivery time limits.

[0087] Step S11 can be used to generate a delivery route according to the delivery task. The delivery route can be further adopted as follows Figure 2 The method shown in is used to generate. Figure 2 In the method for generating the delivery route, the method may include the following steps:

[0088] In step S20, the distribution points are split according to the distribution tasks of frozen products, refrigerated products and ordinary products to obtain multiple virtual distribution points;

[0089] In step S21, a sub-path of a delivery task is generated;

[0090] In step S22, the gathering and distribution point is used as the initial location;

[0091] In step S23, the distribution loss of the remaining virtual distribution points is calculated respectively, starting from the current point. The distribution loss calculation method can be various forms known to those skilled in the art. In one example of the present invention, the distribution loss calculation method can be calculated using the following formula (1) and formula (2):

[0092] f(R)=∑ k∈K c1(r k ∈R)+∑ k∈K c2(r k ∈R)+∑ k∈K c3(r k ∈R), (1)

[0093] Among them, f(R) is the distribution loss, R is the distribution route, K is the number of sub-paths, c1(r k ∈R) is the fixed loss of the kth delivery vehicle, r k is the subpath of the kth delivery vehicle, c2(r k ∈R) is the path loss of the kth delivery vehicle, c3(r k ∈R) is the commodity quality loss of the kth delivery vehicle;

[0094]

[0095] Among them, P is the set of commodity types at the distribution point, L ip is the quality loss function of the pth product, b ip is the order quantity of the pth product, Z p is the quality value loss parameter of the pth commodity. Furthermore, for the quality loss function, the specific forms of frozen products, refrigerated products and ordinary products are different. Specifically, for ordinary products, since they are not affected by the distribution process, the corresponding quality loss function L ip = 0. For refrigerated products, the quality loss is linearly related to the delivery time, so the corresponding quality loss function L ip =a ip / T1, where a ip is the time when the i-th distribution point receives the product p, and T1 is the benchmark value of the quality loss of refrigerated products. For frozen products, their quality loss is nonlinearly related to the delivery time, so the corresponding quality loss function L ip =(a ip / T2) α , T2 is the benchmark value of product quality loss of frozen products, and α is the sensitivity index of frozen products to delivery time.

[0096] In step S24, it is determined whether the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the minimum delivery loss;

[0097] If it is determined that the remaining capacity of the current sub-path cannot meet the delivery requirements of the virtual delivery point with the minimum delivery loss, return to the step of generating a sub-path for a delivery task, that is, return to step S21;

[0098] In step S25, when it is determined that the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the smallest delivery loss, the virtual delivery point with the smallest delivery loss is selected to be added to the sub-path;

[0099] In step S26, it is determined whether there are any virtual delivery points that have not been delivered yet;

[0100] In step S27, when it is determined that there are still virtual delivery points that have not been delivered, the virtual delivery point with the smallest delivery loss is used as the new location point, and the process returns to the step of calculating the delivery losses of the remaining virtual delivery points with the location point as the starting point, that is, returns to step S23;

[0101] In step S28, when it is determined that there is no virtual delivery point that has not been delivered, a delivery route consisting of sub-paths is output.

[0102] Step S12 can be used to randomly select a destruction operator. Step S13 can use the selected destruction operator to destroy the current distribution route. The destruction operator can be used to delete some distribution points from the generated distribution route, and combined with the subsequent repair process of the repair operator, so as to update the distribution route. The specific form of the destruction operator can be a variety known to those skilled in the art. In an example of the present invention, the destruction operator can include a random destruction method, a worst destruction method and / or a distance destruction method. Among them, the random destruction method can be first randomly selecting multiple virtual distribution points from the current distribution route to form a virtual distribution point set, and then removing multiple virtual distribution points in the virtual distribution point set from the distribution route. The distance destruction method can be first respectively calculating the distance between two adjacent virtual distribution points in the distribution route, and then selecting multiple virtual distribution points with the smallest distance to form a virtual distribution point set, and finally removing multiple virtual distribution points in the virtual distribution point set from the distribution route. For the worst damage method, the growth value of the distribution loss of each virtual distribution point in the distribution route can be calculated first, and then multiple virtual distribution points are selected from the distribution route in order from large to small to form a virtual distribution point set, and finally multiple virtual distribution points in the virtual distribution point set are removed from the distribution route.

[0103] Step S14 may be used to randomly select a repair operator, and step S15 may be used to repair the delivery route using the selected repair operator. The specific form of the repair operator may be various known to those skilled in the art. In one example of the present invention, the repair operator may include a greedy repair method and / or a regret value repair method. Specifically, the greedy repair method may include: Figure 3 In the steps shown in Figure 3 In the greedy repair method, the following steps may be included:

[0104] In step S30, a virtual delivery point is randomly selected from the set of virtual delivery points;

[0105] In step S31, the growth loss caused by inserting the selected virtual delivery point between every two virtual delivery points of the delivery route after the destruction is calculated respectively;

[0106] In step S32, the position corresponding to the minimum growth loss is selected, and the virtual delivery point is inserted into the delivery task;

[0107] In step S33, it is determined whether there are any unselected virtual delivery points in the set of virtual delivery points;

[0108] In step S34, when it is determined that there is no unselected virtual delivery point in the virtual delivery point set, it is determined that the repair is completed;

[0109] When it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, the process returns to the step of randomly selecting a virtual delivery point from the set of virtual delivery points, that is, returns to step S30.

[0110] The regret value repair method may include: Figure 4 In the steps shown in Figure 4 In the above method, the regret value repairing method may include the following steps:

[0111] In step S40, the regret value of each virtual delivery point in the set of virtual delivery points is calculated. Specifically, the regret value can be calculated using the following formula (3):

[0112] H i =Δf2(R ′ 1,i)-Δf1(R ′ 1,i), (3)

[0113] Among them, H i is the regret value of the ith virtual delivery point, Δf2(R ′ 1,i) is the growth value of the sub-minimum delivery loss after the i-th virtual delivery point is inserted into the delivery route, Δf1(R ′1,i) is the growth value of the minimum delivery loss after the i-th virtual delivery point is inserted into the delivery route.

[0114] In step S41, an unselected virtual delivery point is selected from the set of virtual delivery points in descending order of regret value;

[0115] In step S42, the growth loss caused by inserting the selected virtual delivery point between every two virtual delivery points of the delivery route after the destruction is calculated respectively;

[0116] In step S43, the position corresponding to the minimum growth loss is selected, and the virtual delivery point is inserted into the delivery task;

[0117] In step S44, it is determined whether there are any unselected virtual delivery points in the set of virtual delivery points;

[0118] In step S45, when it is determined that there is no unselected virtual delivery point in the virtual delivery point set, it is determined that the repair is completed;

[0119] When it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, the process returns to the step of respectively calculating the regret value of each virtual delivery point in the set of virtual delivery points, that is, returns to step S40.

[0120] On the other hand, the present invention also provides a delivery route generation system for community group purchasing of multiple products, the system comprising a processor, and the processor is configured to execute any of the methods described above.

[0121] Through the above technical solution, the embodiment of the present invention provides a method and system for generating a delivery route for community group purchase of multiple products. The method and system generate delivery routes by constructing delivery tasks for different frozen products, refrigerated products, and ordinary products, and then optimize the delivery routes through the iteration of destruction operators and repair operators. Compared with the prior art, the method and system provided by the present invention improves the efficiency of delivery while adapting to the different delivery time requirements of frozen products, refrigerated products, and ordinary products.

[0122] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0123] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0124] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0125] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

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

[0127] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

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

[0129] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0130] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.

Claims

1. A method for generating a delivery route for community group purchase of multiple products, characterized in that: include: Get the delivery tasks of frozen products, refrigerated products and ordinary products that need to be delivered; generating a delivery route according to the delivery task; Randomly select a destruction operator; Using the selected destruction operator to destroy the current delivery route; Randomly select a repair operator; Repairing the delivery route using the selected repair operator; Determine whether the target value of the delivery route after the repair is less than the target value of the delivery route before the damage; In the case where it is determined that the target value of the delivery route after the repair is less than the target value of the delivery route before the damage, the delivery route after the repair is used as the new current delivery route; Determine whether the termination condition is currently met; When it is determined that the termination condition is currently met, the current delivery route is output as the optimal solution; When it is determined that the termination condition is not satisfied currently, the process returns to the step of randomly selecting a destruction operator.

2. The method according to claim 1, characterized in that Generating a delivery route according to the delivery task includes: According to the delivery tasks of the frozen products, refrigerated products and common products, the delivery points are split to obtain a plurality of virtual delivery points; Generate a sub-path of the delivery task; The gathering point is taken as the initial location; Taking the location as the starting point, respectively calculating the distribution losses of the remaining virtual distribution points; Determine whether the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the minimum delivery loss; When it is determined that the remaining capacity of the current sub-path cannot meet the delivery requirement of the virtual delivery point with the minimum delivery loss, returning to the step of generating a sub-path of the delivery task; When it is determined that the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the smallest delivery loss, the virtual delivery point with the smallest delivery loss is selected to be added to the sub-path; Determine whether there are any virtual delivery points that have not been delivered; In the case that it is determined that there are still virtual delivery points that have not been delivered, the virtual delivery point with the smallest delivery loss is used as the new location point, and the step of returning to the location point as the starting point to calculate the delivery losses of the remaining virtual delivery points respectively; When it is determined that there is no virtual delivery point that has not been delivered, the delivery route composed of the sub-paths is output.

3. The method according to claim 2, characterized in that Calculate the distribution losses of the remaining distribution points separately, including: The distribution loss is calculated according to formula (1) and formula (2): f(R)=∑ k∈K c1(r k ∈R)+∑ k∈K c2(r k ∈R)+∑ k∈K c3(r k ∈R), (1) Where f(R) is the delivery loss, R is the delivery route, K is the number of sub-paths, c1(r k ∈R) is the fixed loss of the kth delivery vehicle, r k is the subpath of the kth delivery vehicle, c2(r k ∈R) is the path loss of the kth delivery vehicle, c3(r k ∈R) is the commodity quality loss of the kth delivery vehicle; Among them, P is the set of commodity types at the distribution point, L ip is the quality loss function of the pth product, b ip is the order quantity of the pth product, Z p is the quality value loss parameter of the pth commodity.

4. The method according to claim 2, characterized in that: The destruction operator includes a random destruction method, including: Randomly select multiple virtual delivery points from the current delivery route to form a virtual delivery point set; A plurality of virtual delivery points in the set of virtual delivery points are removed from the delivery route.

5. The method according to claim 2, characterized in that: The destruction operator includes a distance destruction method, including: respectively calculating the distance between two adjacent virtual delivery points in the delivery route; Selecting a plurality of the virtual delivery points with the shortest distances to form a virtual delivery point set; A plurality of virtual delivery points in the set of virtual delivery points are removed from the delivery route.

6. The method according to claim 2, characterized in that The damage operator includes a worst-case damage method, including: Calculate the growth value of the delivery loss of each virtual delivery point in the delivery route respectively; Selecting a plurality of virtual delivery points from the delivery route in descending order to form a set of virtual delivery points; A plurality of virtual delivery points in the set of virtual delivery points are removed from the delivery route.

7. The method according to any one of claims 4 to 6, characterized in that: The repair operator includes a greedy repair method, including: Randomly select a virtual delivery point from the set of virtual delivery points; Calculate the growth loss caused by inserting the selected virtual delivery point between every two virtual delivery points of the delivery route after the destruction respectively; Selecting a position corresponding to the smallest growth loss, and inserting the virtual delivery point into the delivery task; Determining whether there are any unselected virtual delivery points in the set of virtual delivery points; In the case where it is determined that there is no unselected virtual delivery point in the set of virtual delivery points, determining that the repair is completed; In the case where it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, the step of randomly selecting a virtual delivery point from the set of virtual delivery points is returned to be executed.

8. The method according to any one of claims 4 to 6, characterized in that: The repair operator includes a regret value repair method, including: Calculate the regret value of each virtual delivery point in the set of virtual delivery points respectively; Selecting an unselected virtual delivery point from the set of virtual delivery points in descending order of the regret values; Calculate the growth loss caused by inserting the selected virtual delivery point between every two virtual delivery points of the delivery route after the destruction respectively; Selecting a position corresponding to the smallest growth loss, and inserting the virtual delivery point into the delivery task; Determining whether there are any unselected virtual delivery points in the set of virtual delivery points; In the case where it is determined that there is no unselected virtual delivery point in the set of virtual delivery points, determining that the repair is completed; In the case where it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, the step of respectively calculating the regret value of each virtual delivery point in the set of virtual delivery points is returned to be executed.

9. The method according to claim 8, characterized in that Calculating the regret value of each virtual delivery point in the set of virtual delivery points respectively, including: The regret value is calculated according to formula (3): H i =Δf2(R ′ 1,i)-Δf1(R ′ 1,i), (3) Among them, H i is the regret value of the ith virtual delivery point, Δf2(R ′ 1,i) is the growth value of the sub-minimum delivery loss after the i-th virtual delivery point is inserted into the delivery route, Δf1(R ′ 1,i) is the growth value of the minimum delivery loss after the i-th virtual delivery point is inserted into the delivery route.

10. A delivery route generation system for community group purchase of multiple products, characterized in that: The system comprises a processor configured to execute the method according to any one of claims 1 to 9.

Images