A method and system for generating delivery routes for multi-product group buying in communities

Abstract

This invention provides a method and system for generating delivery routes for multi-item group buying in the field of logistics delivery planning technology. The method includes: obtaining delivery tasks for frozen goods, refrigerated goods, and general goods that need to be delivered; generating delivery routes based on the delivery tasks; randomly selecting a disruption operator; disrupting the current delivery route using the selected disruption operator; randomly selecting a repair operator; repairing the delivery route using the selected repair operator; determining whether the target value of the repaired delivery route is less than the target value of the delivery route before disruption; if the target value of the repaired delivery route is less than the target value of the delivery route before disruption, using the repaired delivery route as the new current delivery route; determining whether the current route meets the termination condition; and outputting the current delivery route as the optimal solution if the termination condition is met.

Description

Technical Field

[0001] This invention relates to the field of logistics distribution planning technology, specifically to a method and system for generating delivery routes for multi-product group buying in communities. Background Technology

[0002] With the booming development of e-commerce, group buying has become a popular shopping model among consumers. Group buying activities typically involve various types of goods, including frozen products, refrigerated goods, and general merchandise. Due to their different properties, these goods have different requirements for temperature control during delivery. For example, frozen products 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 spoilage; while general merchandise does not have special temperature control requirements. Therefore, the specific needs of each type of product must be considered when planning delivery routes to ensure that all goods arrive at the consumer's door in optimal condition.

[0003] However, in practice, efficiently integrating the delivery of different types of goods and developing an optimal delivery plan that satisfies both time efficiency and product quality has become a challenge. While some general logistics solutions based on geographic location or cost minimization exist in the market, they often overlook the additional constraints imposed by the characteristics of the goods. Especially for food products requiring strict temperature control, traditional delivery methods may result in the damage of sensitive items due to improper handling, impacting customer satisfaction and corporate reputation. Furthermore, inappropriate route planning can lead to resource waste (such as overuse of refrigerated trucks) and increased operating costs. Summary of the Invention

[0004] The purpose of this invention is to provide a method and system for generating delivery routes for multi-product group buying in communities. This method and system can adapt to the delivery time requirements of different types of goods.

[0005] To achieve the above objectives, embodiments of the present invention provide a method for generating delivery routes for multi-item group buying, including:

[0006] Obtain the delivery tasks for frozen, refrigerated, and general goods that currently need to be delivered;

[0007] Generate a delivery route based on the delivery task;

[0008] Randomly select a destruction operator;

[0009] The selected disruption operator disrupts the current delivery route;

[0010] Randomly select a repair operator;

[0011] The delivery route is repaired 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] If the target value of the repaired delivery route is less than the target value of the delivery route before the damage, the repaired delivery route will be used as the new current delivery route.

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

[0015] If the termination condition is met, the current delivery route will be output as the optimal solution.

[0016] If the termination condition is not met, return to the step of randomly selecting a destruction operator.

[0017] Optionally, generating a delivery route based on the delivery task includes:

[0018] The delivery points are divided into multiple virtual delivery points according to the delivery tasks for frozen goods, refrigerated goods, and general goods.

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

[0020] Use the distribution point as the initial location;

[0021] Starting from the aforementioned point, calculate the delivery losses for the remaining virtual delivery points.

[0022] Determine whether the remaining capacity of the current sub-path is sufficient to meet the delivery requirements of the virtual delivery point with the least delivery loss;

[0023] If it is determined that the remaining capacity of the current sub-path is insufficient to meet the delivery requirements of the virtual delivery point with the least delivery loss, the process returns to the step of generating a sub-path for the delivery task.

[0024] If it is determined that the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the least delivery loss, the virtual delivery point with the least delivery loss is selected and added to the sub-path.

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

[0026] If it is determined that there are still undelivered virtual delivery points, the virtual delivery point with the least delivery loss is taken as the new location point, and the process returns to the step of calculating the delivery loss of the remaining virtual delivery points starting from the current location point.

[0027] If it is determined that there are no undelivered virtual delivery points, the delivery route consisting of the sub-paths is output.

[0028] Optionally, the delivery losses at the remaining delivery points are calculated separately, including:

[0029] The delivery loss is calculated according to formulas (1) and (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, and c1(r) is the delivery loss. k Let r ∈R) be the fixed loss of the k-th delivery vehicle. k For the sub-path of the k-th delivery vehicle, c2(r k Let c3(r) be the path loss of the k-th delivery vehicle, and let c3(r) be the path loss of the k-th delivery vehicle. k ∈R) represents the quality loss of goods in the k-th delivery vehicle;

[0032]

[0033] Where P is the set of product types at the delivery point, and L ip Let b be the quality loss function for the p-th item. ip Z represents the order quantity of the p-th item. p Let be the quality value loss parameter for the p-th item.

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

[0035] Multiple virtual delivery points are randomly selected from the current delivery routes to form a set of virtual delivery points;

[0036] Remove multiple virtual delivery points from the set of virtual delivery points from the delivery route.

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

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

[0039] Select multiple virtual delivery points with the smallest distance to form a set of virtual delivery points;

[0040] Remove multiple virtual delivery points from the set of virtual delivery points from the delivery route.

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

[0042] Calculate the growth value of delivery loss for each of the virtual delivery points in the delivery route;

[0043] Multiple virtual delivery points are selected from the delivery route in descending order to form a set of virtual delivery points;

[0044] Remove multiple virtual delivery points from the set of virtual delivery points from the delivery route.

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

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

[0047] Calculate the growth loss that occurs when the selected virtual delivery point is inserted into every two virtual delivery points on the disrupted delivery route;

[0048] Select the location corresponding to the minimum growth loss and insert the virtual delivery point into the delivery task;

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

[0050] If it is determined that there are no unselected virtual delivery points in the set of virtual delivery points, the repair is considered complete.

[0051] If 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.

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

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

[0054] Select one unselected virtual delivery point from the set of virtual delivery points, in descending order of regret value.

[0055] Calculate the growth loss that occurs when the selected virtual delivery point is inserted into every two virtual delivery points on the disrupted delivery route;

[0056] Select the location corresponding to the minimum growth loss and insert the virtual delivery point into the delivery task;

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

[0058] If it is determined that there are no unselected virtual delivery points in the set of virtual delivery points, the repair is considered complete.

[0059] If it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, return to the step of calculating the regret value of each virtual delivery point in the set of virtual delivery points.

[0060] Optionally, the regret value of each virtual delivery point in the set of virtual delivery points is calculated, including:

[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 Let Δf2(R) be the regret value of the i-th virtual delivery point. ′ 1,i) represents the increase in the second-minimum delivery loss after the i-th virtual delivery point is inserted into the delivery route, Δf1(R) ′ 1,i) is the minimum delivery loss increase value 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 multi-product joint delivery in community group buying, the system including a processor configured to perform any of the methods described above.

[0065] Through the above technical solutions, the embodiments of the present invention provide a method and system for generating delivery routes for multi-item group buying. This method and system generate delivery routes by constructing delivery tasks for different frozen, refrigerated, and general goods, and then optimizes the delivery routes through iteration of destruction and repair operators. Compared with existing technologies, the method and system provided by the present invention improve delivery efficiency while adapting to different delivery time requirements for frozen, refrigerated, and general goods.

[0066] Other features and advantages of the embodiments of the present invention will be described in detail in the following detailed description section. Attached Figure Description

[0067] The accompanying drawings are provided to further illustrate embodiments of the present invention and form part of the specification. They are used together with the following detailed description to explain the embodiments of the present invention, but do not constitute a limitation thereof. In the drawings:

[0068] Figure 1 This is a flowchart of a method for generating delivery routes for multi-item group buying according to an embodiment of the present invention;

[0069] Figure 2 This is a flowchart of a method for generating delivery routes according to one embodiment of the present invention;

[0070] Figure 3 This is a flowchart of a greedy repair method according to an embodiment of the present invention;

[0071] Figure 4 This is a flowchart of a regret value repair method according to an embodiment of the present invention. Detailed Implementation

[0072] The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are for illustration and explanation only and are not intended to limit the scope 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 all comply with the relevant provisions of national laws and regulations. In the embodiments of this application, certain existing industry solutions such as software, components, and models may be mentioned. These should be considered exemplary, intended only to illustrate the feasibility of implementing the technical solution of this application, and do not imply that the applicant has already used or necessarily used such solutions.

[0074] like Figure 1 The diagram shows a flowchart of a method for generating delivery routes for multi-product group buying according to an embodiment of the present invention. Figure 1 In this method, the steps may include:

[0075] In step S10, the delivery tasks for frozen goods, refrigerated goods, and general goods that need to be delivered are obtained;

[0076] In step S11, a delivery route is generated based on the delivery task;

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

[0078] In step S13, the selected disruption operator disrupts the current delivery route;

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

[0080] In step S15, the selected repair operator is used to repair the delivery route;

[0081] In step S16, it is determined whether the target value of the repaired delivery route 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 repaired delivery route is less than the target value of the delivery route before the damage, the repaired delivery route is taken as the new current delivery route.

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

[0084] In step S19, if the termination condition is met, the current delivery route is output as the optimal solution.

[0085] If the termination condition is not met, return to the step of randomly selecting a destruction operator, that is: return to step S12.

[0086] In such Figure 1 In the method shown, step S10 can be used to obtain the delivery tasks for frozen goods, refrigerated goods, and general goods that currently need to be delivered. These delivery tasks can correspond to multiple delivery points at different distances from the distribution center. Each delivery point has a different combination of demands for frozen goods, refrigerated goods, and general goods. For frozen and refrigerated goods, product quality is affected by transportation and handling time, causing quality degradation (thawing, spoilage), and once the quality degradation reaches a predefined threshold, the goods lose their value. Therefore, different types of goods (frozen goods, refrigerated goods, and general goods) have different delivery time requirements.

[0087] Step S11 can be used to generate a delivery route based on the delivery task. This delivery route can be further optimized using methods such as... Figure 2 The method shown is used to generate it. Figure 2 In this context, the method for generating the delivery route may include the following steps:

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

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

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

[0091] In step S23, starting from the current point, the delivery losses for the remaining virtual delivery points are calculated. The calculation method for this delivery loss can be of various forms known to those skilled in the art. In one example of the present invention, the delivery loss can be calculated using the following formulas (1) and (2).

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

[0093] Where f(R) is the delivery loss, R is the delivery route, K is the number of sub-paths, and c1(r) is the delivery loss. k Let r ∈R) be the fixed loss of the k-th delivery vehicle. k For the sub-path of the k-th delivery vehicle, c2(r k Let c3(r) be the path loss of the k-th delivery vehicle, and let c3(r) be the path loss of the k-th delivery vehicle. k ∈R) represents the quality loss of goods in the k-th delivery vehicle;

[0094]

[0095] Where P is the set of product types at the delivery point, and L ip Let b be the quality loss function for the p-th item. ip Z represents the order quantity of the p-th item. p Let L be the quality value loss parameter for the p-th item. Furthermore, the specific form of this quality loss function can differ depending on the characteristics of frozen goods, refrigerated goods, and ordinary goods. Specifically, for ordinary goods, since they are not affected by the delivery process, the corresponding quality loss function L... ip =0. For refrigerated goods, the quality loss is linearly related to the delivery time, therefore the corresponding quality loss function L... ip =a ip / T1, where a ip Let T1 be the time when the i-th delivery point receives the goods p, and T1 be the baseline value for the quality loss of refrigerated goods. For frozen goods, the quality loss is non-linearly related to the delivery time, therefore the corresponding quality loss function L... ip =(a ip / T2) α T2 is the baseline value for the 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 least delivery loss;

[0097] If it is determined that the remaining capacity of the current sub-path is insufficient to meet the delivery requirements of the virtual delivery point with the least 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, if it is determined that the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the least delivery loss, the virtual delivery point with the least delivery loss is selected and added to the sub-path.

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

[0100] In step S27, if it is determined that there are still virtual delivery points that have not been delivered, the virtual delivery point with the least delivery loss is taken as the new location point, and the process returns to the step of calculating the delivery loss of the remaining virtual delivery points starting from the current location point, that is, returning to the execution of step S23.

[0101] In step S28, if it is determined that there are no undelivered virtual delivery points, 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 delivery route. This destruction operator can be used to delete some delivery points from the generated delivery route, and combined with the subsequent repair operator's repair process, thereby updating the delivery route. The specific form of this destruction operator can be various that are known to those skilled in the art. In one example of the present invention, the destruction operator can include a random destruction method, a worst-case destruction method, and / or a distance destruction method. The random destruction method can be to first randomly select multiple virtual delivery points from the current delivery route to form a set of virtual delivery points, and then remove multiple virtual delivery points from the delivery route. The distance destruction method can be to first calculate the distance between two adjacent virtual delivery points in the delivery route, then select multiple virtual delivery points with the smallest distance to form a set of virtual delivery points, and finally remove multiple virtual delivery points from the delivery route. For the worst-case scenario, one could first calculate the growth value of delivery loss for each virtual delivery point in the delivery route, then select multiple virtual delivery points from the delivery route in descending order to form a set of virtual delivery points, and finally remove multiple virtual delivery points from the delivery route.

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

[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 into every two virtual delivery points of the disrupted delivery route is calculated.

[0106] In step S32, the location 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, if it is determined that there are no unselected virtual delivery points in the set of virtual delivery points, the repair is deemed complete.

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

[0110] The regret value repair method can include, for example: Figure 4 The steps shown are described in this. Figure 4 In this context, the regret value repair method may include the following steps:

[0111] In step S40, the regret value is calculated for each virtual delivery point in the set of virtual delivery points. 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 Let Δf2(R) be the regret value of the i-th virtual delivery point. ′ 1,i) represents the second-minimum delivery loss increase after inserting the i-th virtual delivery point into the delivery route, Δf1(R) ′1,i) represents the minimum increase in delivery loss after inserting the i-th virtual delivery point into the delivery route.

[0114] In step S41, a virtual delivery point that has not been selected 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 into every two virtual delivery points of the disrupted delivery route is calculated.

[0116] In step S43, the location 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, if it is determined that there are no unselected virtual delivery points in the set of virtual delivery points, the repair is deemed complete.

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

[0120] On the other hand, the present invention also provides a delivery route generation system for multi-product joint delivery in community group buying, the system including a processor configured to perform any of the methods described above.

[0121] Through the above technical solutions, the embodiments of the present invention provide a method and system for generating delivery routes for multi-item group buying. This method and system generate delivery routes by constructing delivery tasks for different frozen, refrigerated, and general goods, and then optimizes the delivery routes through iteration of destruction and repair operators. Compared with existing technologies, the method and system provided by the present invention improve delivery efficiency while adapting to different delivery time requirements for frozen, refrigerated, and general goods.

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

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

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

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

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

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

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

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

[0130] The above are merely embodiments of this application and are not intended to limit the scope of this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of the claims of this application.

Claims

1. A method for generating delivery routes for multi-product joint delivery in community group buying, characterized in that, include: Obtain the delivery tasks for frozen, refrigerated, and general goods that currently need to be delivered; Generate a delivery route based on the delivery task; Randomly select a destruction operator; The selected disruption operator disrupts the current delivery route; Randomly select a repair operator; The delivery route is repaired using the selected repair operator; Determine whether the target value of the repaired delivery route is less than the target value of the delivery route before the damage. If the target value of the repaired delivery route is less than the target value of the delivery route before the damage, the repaired delivery route will be used as the new current delivery route. Determine whether the termination condition is currently met; If the termination condition is met, the current delivery route will be output as the optimal solution. If it is determined that the termination condition is not met, return to the step of randomly selecting a destruction operator; Generate a delivery route based on the delivery task, including: The delivery points are divided according to the delivery tasks for frozen products, refrigerated products, and general products to obtain multiple virtual delivery points; Generate a sub-path for the delivery task; Use the distribution point as the initial location; Starting from the aforementioned point, calculate the delivery losses for the remaining virtual delivery points. Determine whether the remaining capacity of the current sub-path is sufficient to meet the delivery requirements of the virtual delivery point with the least delivery loss; If it is determined that the remaining capacity of the current sub-path is insufficient to meet the delivery requirements of the virtual delivery point with the least delivery loss, the process returns to the step of generating a sub-path for the delivery task. If it is determined that the remaining capacity of the current sub-path can meet the delivery requirements of the virtual delivery point with the least delivery loss, the virtual delivery point with the least delivery loss is selected and added to the sub-path. Determine if there are still any virtual delivery points that have not yet been delivered; If it is determined that there are still undelivered virtual delivery points, the virtual delivery point with the least delivery loss is taken as the new location point, and the process returns to the step of calculating the delivery loss of the remaining virtual delivery points starting from the current location point. If it is determined that there are no undelivered virtual delivery points, the delivery route consisting of the sub-paths is output.

2. The method according to claim 1, characterized in that, Calculate the delivery losses for the remaining delivery points separately, including: The delivery loss is calculated according to formulas (1) and (2). ，（1） in, For the aforementioned delivery loss, For delivery routes, The number of sub-paths. For the first Fixed wear and tear on each delivery vehicle For the first Sub-route of a delivery vehicle For the first Route loss of each delivery vehicle For the first Goods quality loss in one delivery vehicle; ，（2） in, A collection of product types for distribution points. For the first The quality loss function of a product For the first The order quantity of each product. For the first Parameters for the loss of quality value of a product.

3. The method according to claim 1, characterized in that, The destruction operator includes a random destruction method, comprising: Multiple virtual delivery points are randomly selected from the current delivery routes to form a set of virtual delivery points; Remove multiple virtual delivery points from the set of virtual delivery points from the delivery route.

4. The method according to claim 1, characterized in that, The destruction operator includes a distance destruction method, comprising: Calculate the distance between two adjacent virtual delivery points in the delivery route; Select multiple virtual delivery points with the smallest distance to form a set of virtual delivery points; Remove multiple virtual delivery points from the set of virtual delivery points from the delivery route.

5. The method according to claim 1, characterized in that, The destruction operator includes the worst-case destruction method, including: Calculate the growth value of delivery loss for each of the virtual delivery points in the delivery route; Multiple virtual delivery points are selected from the delivery route in descending order to form a set of virtual delivery points; Remove multiple virtual delivery points from the set of virtual delivery points from the delivery route.

6. The method according to any one of claims 3 to 5, characterized in that, The repair operator includes a greedy repair method, comprising: Randomly select a virtual delivery point from the set of virtual delivery points; Calculate the growth loss that occurs when the selected virtual delivery point is inserted into every two virtual delivery points on the disrupted delivery route; Select the location corresponding to the minimum growth loss and insert the virtual delivery point into the delivery task; Determine whether there are any unselected virtual delivery points in the set of virtual delivery points; If it is determined that there are no unselected virtual delivery points in the set of virtual delivery points, the repair is considered complete. If 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.

7. The method according to any one of claims 3 to 5, characterized in that, The repair operator includes a regret value repair method, comprising: Calculate the regret value for each virtual delivery point in the set of virtual delivery points; Select one unselected virtual delivery point from the set of virtual delivery points, in descending order of regret value. Calculate the growth loss that occurs when the selected virtual delivery point is inserted into every two virtual delivery points on the disrupted delivery route; Select the location corresponding to the minimum growth loss and insert the virtual delivery point into the delivery task; Determine whether there are any unselected virtual delivery points in the set of virtual delivery points; If it is determined that there are no unselected virtual delivery points in the set of virtual delivery points, the repair is considered complete. If it is determined that there are still unselected virtual delivery points in the set of virtual delivery points, return to the step of calculating the regret value of each virtual delivery point in the set of virtual delivery points.

8. The method according to claim 7, characterized in that, Calculate the regret value for each virtual delivery point in the set of virtual delivery points, including: The regret value is calculated according to formula (3). ，（3） in, For the first Regret value of a virtual delivery point For the first The increase in the second-minimum delivery loss after inserting a virtual delivery point into the delivery route. For the first The minimum increase in delivery loss after inserting a virtual delivery point into the delivery route.

9. A delivery route generation system for multi-product joint delivery in community group buying, characterized in that, The system includes a processor configured to perform the method as described in any one of claims 1 to 8.

Images