Path planning method and device, electronic equipment, storage medium and product

Abstract

The invention provides a path planning method and device, electronic equipment, a storage medium and a product, and relates to the technical field of path planning, and the method comprises the steps: obtaining customer information in a target range; wherein the customer information is information of customers of all customer points included in the target range; determining customer prediction information according to the customer information; wherein the customer prediction information is customer information of all customer points in the target range at the next moment; determining customer drug demand according to the customer prediction information; and determining a drug delivery site selection planning path according to the customer drug demand quantity and the number of the alternative points of the delivery center in the target range, and determining a target drug delivery site selection planning path according to the drug delivery site selection planning path, the warehouse opening cost, the warehouse closing cost and the continuous operation cost of the delivery center alternative points. According to the technical scheme, the distribution cost is reduced based on comprehensive consideration of the cost.

Description

Technical Field

[0001] The present invention relates to the technical field of path planning, and particularly to a path planning method, device, electronic device, storage medium and product. Background Art

[0002] Currently, in the prior art, the path planning problem is usually considered separately. A truck is used for material distribution, and an improved path optimization algorithm is combined to solve the optimal path to achieve the timely distribution of emergency supplies and reduce the infection risk of staff. However, this distribution method does not consider the infection situation of users, resulting in the problem that emergency supplies cannot be fairly distributed. Summary of the Invention

[0003] The present invention provides a path planning method, device, electronic device, storage medium and product, which are used to solve the defect that the path planning problem is considered separately in the prior art, resulting in the unfair distribution of emergency supplies. It realizes determining the customer drug demand according to the customer prediction information of customer points, determining the drug distribution site selection planning path according to the customer drug demand and the number of alternative points of the distribution center alternative points within the target range, and determining the target drug distribution site selection planning path according to the drug distribution site selection planning path, the opening cost, closing cost and continuous operation cost of the distribution center alternative points. By comprehensively considering the customer drug demand, the drug distribution cost of the drug distribution vehicle and the opening and closing and operation costs of the distribution center alternative points, reasonable and fair distribution is realized, the distribution efficiency is improved, and the distribution cost is reduced.

[0004] The present invention provides a path planning method, including the following steps.

[0005] Obtain customer information within the target range; wherein, the customer information is the information of customers at all customer points included within the target range.

[0006] Determine customer prediction information according to the customer information; wherein, the customer prediction information is the customer information at the next moment of all customer points within the target range.

[0007] Determine the customer drug demand according to the customer prediction information.

[0008] Determine the drug distribution site selection planning path according to the customer drug demand and the number of alternative points of the distribution center alternative points within the target range, and determine the target drug distribution site selection planning path according to the drug distribution site selection planning path, the opening cost, closing cost and continuous operation cost of the distribution center alternative points.

[0009] A path planning method provided by the present invention, where customer information includes the number of susceptible people, the number of latent people, and the number of infected people; customer prediction information includes the predicted number of susceptible customers, the predicted number of latent customers, and the predicted number of infected customers; determining customer prediction information based on customer information includes: the predicted number of susceptible customers ; where represents the number of susceptible people obtained at time represents the number of infected people obtained at time represents the number of latent people obtained at time represents the proportion of contacts of infected people among all customer points in the target range to the total number of customers represents the infection rate of infected people represents the proportion of contacts of latent people among all customer points in the target range to the total number of customers represents the transmission rate of latent people; the predicted number of latent customers ; where represents the prevalence of latent people; the predicted number of infected customers ; where represents the recovery rate of infected people represents the mortality rate of infected people

[0010] A path planning method provided by the present invention, determining the drug demand of customers based on customer prediction information includes: the drug demand of customers ; where represents the predicted number of susceptible customers represents the predicted number of latent customers represents the predicted number of infected customers , and are preset constant coefficients

[0011] A path planning method provided by the present invention, determining the target drug delivery location planning path based on the drug delivery location planning path, the opening cost, closing cost, and continuous operation cost of the alternative delivery center points includes: obtaining the coordinate information of all customer points and all alternative delivery center points in the drug delivery location planning path; determining the distance information between any two points based on the coordinate information between any two points; obtaining the unit distance cost of the drug delivery vehicle; determining the vehicle delivery cost of the drug delivery vehicle based on the distance information and the unit distance cost; determining the target drug delivery location planning path based on the drug delivery location planning path, the vehicle delivery cost, the opening cost, closing cost, and continuous operation cost of the alternative delivery center points

[0012] A path planning method provided by the present invention, wherein the coordinate information includes abscissa information and ordinate information; determining the distance information between any two points according to the coordinate information between any two points, including: determining the distance information according to the abscissa information and ordinate information respectively corresponding between any two points, and the distance information ; wherein, represents the distance information from the th point to the th point, represents the abscissa information of the th point, represents the abscissa information of the th point, represents the ordinate information of the th point, represents the ordinate information of the

[0013] A path planning method provided by the present invention, determining the target drug delivery site selection and planning path according to the drug delivery site selection and planning path, vehicle delivery cost, opening cost, closing cost and continuous operation cost of the alternative sites of the distribution center, including: constructing an objective function and constraint conditions according to the drug delivery site selection and planning path, vehicle delivery cost, opening cost, closing cost and continuous operation cost of the alternative sites of the distribution center; solving the objective function according to the constraint conditions to obtain the target drug delivery site selection and planning path.

[0014] The present invention also provides a path planning device, including the following modules.

[0015] An information acquisition module, configured to acquire customer information within a target range; wherein, the customer information is the information of customers at all customer points included within the target range.

[0016] An information determination module, configured to determine customer prediction information according to the customer information; wherein, the customer prediction information is the customer information at the next moment of all customer points within the target range.

[0017] A demand determination module, configured to determine the customer drug demand according to the customer prediction information.

[0018] A path determination module, configured to determine the drug delivery site selection and planning path according to the customer drug demand and the number of alternative sites of the alternative sites of the distribution center within the target range, and determine the target drug delivery site selection and planning path according to the drug delivery site selection and planning path, opening cost, closing cost and continuous operation cost of the alternative sites of the distribution center.

[0019] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, the above-mentioned path planning method is implemented.

[0020] The present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the above-mentioned path planning method is implemented.

[0021] The present invention also provides a computer program product, including a computer program. When the computer program is executed by a processor, the above-mentioned path planning method is implemented.

[0022] A path planning method, device, electronic device, storage medium, and product provided by the present invention obtain customer information within a target range; wherein, the customer information is the information of customers at all customer points included in the target range; determine customer prediction information according to the customer information; wherein, the customer prediction information is the customer information at the next moment of all customer points within the target range; determine the customer drug demand according to the customer prediction information; determine the drug distribution site selection planning path according to the customer drug demand and the number of alternative points of the alternative distribution centers within the target range, and determine the target drug distribution site selection planning path according to the drug distribution site selection planning path, the opening cost, closing cost, and continuous operation cost of the alternative distribution centers. The technical solution of the present invention is used to solve the defect that in the prior art, the path planning problem is considered alone, resulting in unfair distribution of emergency supplies, and realizes determining the customer drug demand by combining the customer prediction information of customer points, determining the drug distribution site selection planning path according to the customer drug demand, the drug distribution cost of drug distribution vehicles within the target range, and the opening and closing and operation costs of the alternative distribution centers within the target range, and the opening and closing conditions of the alternative distribution centers. By comprehensively considering the customer drug demand, the vehicle driving cost and drug distribution cost of drug distribution vehicles, reasonable and fair distribution is realized, the distribution efficiency is improved, and the distribution cost is reduced. Description of the Drawings

[0023] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0024] Figure 1 It is a flowchart of the path planning method provided by the present invention.

[0025] Figure 2 It is a structural diagram of the path planning device provided by the present invention.

[0026] Figure 3 It is a schematic structural diagram of the electronic device provided by the present invention. Specific embodiments

[0027] To make the objectives, technical solutions and advantages of the present invention clearer, the technical solutions in the present invention will be clearly and completely described below with reference to the accompanying drawings in the present invention. Obviously, the described embodiments are some but not all of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present invention without making creative efforts shall fall within the protection scope of the present invention.

[0028] The following Figure 1 Describe the path planning method provided by the present invention. The path planning method provided by the present invention is applicable to multi-stage emergency logistics location-path planning scenarios. The execution subject of this method can be an electronic device or a path planning device set in the electronic device. The path planning device can be implemented by software, hardware or a combination of both. Figure 1 It is a schematic flowchart of the path planning method provided by the present invention. As Figure 1 shown, the method includes the following steps 101, 102, 103 and 104.

[0029] Step 101: Obtain customer information within the target range.

[0030] In this step, the customer information is the information of all customers at the customer points included in the target range. The customer information of the customer points within the target range can, for example, include the number of susceptible people, the number of latent people, and the number of infected people, and can also include the total number of people within the target range, the number of recovered people, the number of deceased people, etc. This embodiment does not limit this.

[0031] The target range is a preset range for drug delivery, and the customer point is a preset point within the target range for receiving drugs. The number of customer points is not specifically limited.

[0032] Specifically, obtain customer information such as the number of susceptible people, the number of latent people, the number of infected people, and the number of recovered people at all customer points within the target range for drug delivery.

[0033] Step 102: Determine customer prediction information according to the customer information.

[0034] In this step, the customer prediction information is the customer information at the next moment for all customer points within the target range. The customer prediction information includes the predicted number of susceptible customers, the predicted number of latent customers, and the predicted number of infected customers. The customer prediction information also includes the predicted number of recovered customers, the total predicted number of people, the predicted number of deceased customers, etc., which are not limited in this embodiment.

[0035] In a specific embodiment, after obtaining the customer information, the customer prediction information is determined according to the customer information and the infectious disease model.

[0036] In this step, the infectious disease model (Susceptible Exposed Infectious Recovered, SEIR) is a commonly used mathematical modeling algorithm for predicting the predicted number of susceptible customers, the predicted number of latent customers, the predicted number of infected customers, the predicted number of recovered customers, and the total predicted number of people, etc.

[0037] Specifically, in the process of predicting the predicted number of susceptible customers, the predicted number of latent customers, the predicted number of infected customers, the predicted number of recovered customers, and the total predicted number of people, etc. through the SEIR model, the SEIR model is further optimized, and the following assumptions are made for the SEIR model: (1) One day is used as the minimum time unit of the SEIR model. (2) The population is divided into four categories: susceptibles (S class), latent (E class), infected (I class), and recovered (R class); (3) During the epidemic, the birth and death, immigration and emigration of the population are not considered. (4) Recovered people have antibodies and will not be infected again. (5) The contact rate between individuals in the population is equal.

[0038] The advantage of such a setting is that by constraining the SEIR model, the calculation result of the SEIR model is improved, and the prediction accuracy of the predicted number of susceptible customers, the predicted number of latent customers, the predicted number of infected customers, the predicted number of recovered customers, and the total predicted number of people, etc. is improved.

[0039] In a specific embodiment, determining the customer prediction information according to the customer information includes: the predicted number of susceptible customers ; where represents the number of susceptible people obtained at time represents the number of infected people obtained at time represents the number of latent people obtained at time represents the proportion of contacts of infected people to the total number of customers at all customer points within the target range, Denotes the transmission rate of infected individuals, Denotes the proportion of contacts of latent individuals among the total number of customers at all customer points within the target range, Denotes the transmission rate of latent individuals; Predicted number of the customer latent population ; Among them, Denotes the prevalence rate of latent individuals; Predicted number of the customer infected population ; Among them, Denotes the recovery rate of infected individuals, Denotes the mortality rate of infected individuals.

[0040] Specifically, after obtaining customer information such as the number of susceptible individuals, the number of latent individuals, the number of infected individuals, and the number of recovered individuals, according to the optimized SEIR model, customer prediction information is obtained, and the predicted number of the customer susceptible population ; Among them, Denotes The number of susceptible individuals obtained at time Denotes The number of infected individuals obtained at time Denotes The number of latent individuals obtained at time Denotes the proportion of contacts of infected individuals among the total number of customers at all customer points within the target range, Denotes the transmission rate of infected individuals, Denotes the proportion of contacts of latent individuals among the total number of customers at all customer points within the target range, Denotes the transmission rate of latent individuals; Predicted number of the customer latent population ; Among them, Denotes the prevalence rate of latent individuals; Predicted number of the customer infected population ; Among them, Denotes the recovery rate of infected individuals, Denotes the mortality rate of infected individuals.

[0041] In a specific embodiment, the total predicted population , among which, Denotes the predicted number of the customer susceptible population, Denotes the predicted number of the customer latent population, Denotes the predicted number of the customer infected population, Denotes the predicted number of the customer recovered population, among which, the predicted number of the customer recovered population , Denotes the number of the recovered population, Denotes the recovery rate of infected individuals.

[0042] Step 103: Determine the customer drug demand according to the customer prediction information.

[0043] In this step, the customer's drug demand refers to the demand for drugs by the customer order.

[0044] Specifically, after obtaining the customer prediction information, the customer's drug demand is determined according to the customer prediction information.

[0045] In a specific embodiment, determining the customer's drug demand according to the customer prediction information includes: the customer's drug demand ; wherein, represents the predicted number of susceptible populations of the customer, represents the predicted number of latent populations of the customer, represents the predicted number of infected populations of the customer, 、 and are preset constant coefficients.

[0046] Specifically, the customer's drug demand ; wherein, represents the predicted number of susceptible populations of the customer, represents the predicted number of latent populations of the customer, represents the predicted number of infected populations of the customer, 、 and are preset constant coefficients.

[0047] Step 104: Determine the drug distribution site selection planning path according to the customer's drug demand and the number of alternative sites of the distribution center alternatives within the target range, and determine the target drug distribution site selection planning path according to the drug distribution site selection planning path, the opening cost, the closing cost and the continuous operation cost of the distribution center alternatives.

[0048] In this step, the opening cost represents the opening cost of the warehouse of the distribution center alternative, the closing cost represents the closing cost of the warehouse of the distribution center alternative, and the continuous operation cost represents the water and electricity fees and labor costs during the continuous operation of the warehouse of the distribution center alternative. This embodiment does not limit this.

[0049] Specifically, after obtaining the customer's drug demand, all drug distribution site selection planning paths in the drug distribution process can be calculated first according to the customer's drug demand and the number of alternative sites of the distribution center alternatives within the target range. Then, according to the opening and closing status of the distribution center alternatives within the target range of drug distribution, determine whether the distribution center alternative is in an open warehouse state or a closed state, as well as the vehicle distribution cost of the drug distribution vehicles within the target range. At the same time, determine the opening cost, closing cost and continuous operation cost of the distribution center alternative. Finally, combine the vehicle distribution cost, opening cost, closing cost and continuous operation cost to determine the target drug distribution site selection planning path from all drug distribution site selection planning paths.

[0050] In a specific embodiment, the selection method of determining the target drug distribution site selection planning path from all drug distribution site selection planning paths by combining the vehicle distribution cost, opening cost, closing cost and continuous operation cost can be, for example, randomly select two paths from all drug distribution site selection planning paths first, combine the vehicle distribution cost, opening cost, closing cost and continuous operation cost of the two paths to determine the total distribution cost of the two paths, and then select a drug distribution site selection planning path with the lowest cost according to the total distribution cost of the two paths. And so on, continue to select a path from the remaining drug distribution site selection planning paths to calculate the total distribution cost, compare them pairwise, and finally determine the target drug distribution site selection planning path. It can also be that, according to all drug distribution site selection planning paths, combine the vehicle distribution cost, opening cost, closing cost and continuous operation cost to determine the total distribution cost of all paths, and then compare the total distribution cost with the preset cost, and determine the path with the total distribution cost less than the preset cost as the target drug distribution site selection planning path. This embodiment does not limit this.

[0051] In a specific embodiment, determining the target drug distribution site selection planning path according to the drug distribution site selection planning path, the opening cost, closing cost and continuous operation cost of the distribution center alternative includes: obtaining the coordinate information of all customer points and all distribution center alternatives in the drug distribution site selection planning path; determining the distance information between any two points according to the coordinate information between any two points; obtaining the unit distance cost of the drug distribution vehicle; determining the vehicle distribution cost of the drug distribution vehicle according to the distance information and the unit distance cost; determining the target drug distribution site selection planning path according to the drug distribution site selection planning path, vehicle distribution cost, opening cost, closing cost and continuous operation cost of the distribution center alternative.

[0052] In a specific embodiment, the coordinate information includes abscissa information and ordinate information; determining the distance information between any two points according to the coordinate information between any two points includes: Determine distance information based on the corresponding abscissa information and ordinate information between any two points. The distance information ; where represents the distance information from the th point to the th point. represents the abscissa information of the th point. represents the abscissa information of the th point. represents the ordinate information of the th point. represents the ordinate information of the th point.

[0053] In this step, and belong to any customer points or any alternative distribution center points within the target range, and this embodiment does not limit this.

[0054] In a specific embodiment, determine the target drug distribution site selection planning path according to the drug distribution site selection planning path, vehicle distribution cost, opening cost, closing cost, and continuous operation cost of the alternative distribution center points, including: constructing an objective function and constraint conditions according to the drug distribution site selection planning path, vehicle distribution cost, opening cost, closing cost, and continuous operation cost of the alternative distribution center points; solving the objective function according to the constraint conditions to obtain the target drug distribution site selection planning path.

[0055] Specifically, after obtaining the customer drug demand, determine the drug distribution site selection planning path according to the customer drug demand and the number of alternative points of the alternative distribution center points within the target range, determine the target drug distribution site selection planning path according to the drug distribution site selection planning path, opening cost, closing cost, and continuous operation cost of the alternative distribution center points, and combine with the Location-Routing Problem (LRP) model to determine the target drug distribution site selection planning path.

[0056] Among them, the LRP model is composed of an objective function and constraint conditions, that is, construct an objective function and constraint conditions according to the drug distribution site selection planning path, vehicle distribution cost, opening cost, closing cost, and continuous operation cost of the alternative distribution center points; solve the objective function according to the constraint conditions to obtain the target drug distribution site selection planning path.

[0057] In the construction of the location-routing problem model to determine the path composition of the target drug distribution location planning, the following assumptions are also required for the constructed location-routing problem model: (1) The alternative points of the distribution center are known, with capacity limitations, opening and closing costs, and continuous operation costs. (2) The drug demand of each customer point is known, and its relevant parameters are all independent of each other. (3) Each customer at each customer point can be served by and only by one vehicle, and the demand cannot be split. (4) The standard load capacities of all drug distribution vehicles are the same. (5) After serving the customers, the drug distribution vehicles return to their own starting points.

[0058] The advantage of such settings is that by adding assumptions to the LRP model, the accuracy of the LRP model in determining the path of the target drug distribution location planning is improved.

[0059] In the process of constructing the objective function and constraint conditions in the LRP model, according to the vehicle distribution cost of the drug transportation vehicles in the drug distribution location planning path, the opening cost, closing cost, and continuous operation cost of the alternative points of the distribution center, the constructed objective function ; among them, represents the vehicle driving cost per unit distance of the drug transportation vehicle within the target range, represents the distance information from point to point within the target range, represents the path from the th point to the th point delivered by the drug transportation vehicle in the cycle , represents the opening cost of the th alternative point of the distribution center within the target range, represents the opening situation of the th alternative point of the distribution center in the cycle , represents the opening situation of the th alternative point of the distribution center in the cycle , represents the closing cost of the th alternative point of the distribution center in the cycle , represents the continuous operation cost of the th alternative point of the distribution center in the cycle , represents the acquisition cycle, represents the acquisition cycle data set. represents any th point within the target range, represents any point indicating the drug transport vehicle indicating all drug transport vehicles indicating the set of alternative sites for the distribution center.

[0060] In the objective function, represents the vehicle distribution cost, represents the opening cost of the alternative site for the distribution center, represents the closing cost of the alternative site for the distribution center, represents the continuous operation cost of the alternative site for the distribution center.

[0061] In the process of constructing the objective function and constraint conditions in the LRP model, the constraint conditions include Formula (1), Formula (2), Formula (3), Formula (4), Formula (5), Formula (6), Formula (7), Formula (8), Formula (9), Formula (10), Formula (11), Formula (12), Formula (13) and Formula (14).

[0062] (1) In Formula (1), the constraint condition defines the initial state of all alternative sites for the distribution center as closed, and the customer point belongs to the set of alternative sites for the distribution center.

[0063] (2) In Formula (2), the constraint condition defines that at least one alternative site for the distribution center is opened in each distribution cycle, and the cycle belongs to the cycle set.

[0064] (3) In Formula (3), the constraint condition defines that the drug transport vehicle can only pass through the open road path, indicating the path from the drug transport vehicle from the point to the point within the cycle

[0065] (4) In Formula (4), the constraint condition defines that in any cycle, any customer point will be visited once.

[0066] (5) In Formula (5), the constraint condition defines that in any cycle, the drug transport vehicle visits at most the The customer makes an order once, indicating the set of customer orders within the target range.

[0067] (6) In formula (6), the constraint condition defines the drug transportation vehicle can only start distribution from the open alternative distribution center as the starting point.

[0068] (7) In formula (7), the constraint condition defines that for any drug transportation vehicle, the starting point in the corresponding distribution route must be an open alternative distribution center.

[0069] (8) In formula (8), the constraint condition defines that the customer drug demand carried by the vehicle within any period cannot exceed the limit of the maximum vehicle load. Among them, represents the period and the customer drug demand at the customer order point, and represents the

[0070] maximum vehicle load of the drug transportation vehicle. In formula (9), the constraint condition defines the flow conservation, that is, the inflow and outflow at any node are conserved. represents the route from the point to the point delivered by the drug transportation vehicle

[0071] (10) In formula (10), the constraint condition defines that at least one vehicle departs within any period.

[0072] (11) In formula (11), the constraint condition defines that for each drug transportation vehicle in any period, the distribution route must start and end at the alternative distribution center.

[0073] (12) In formula (12), the constraint condition defines the elimination of duplicate sub - loops. Among them, represents that in the period, there is a drug transportation vehicle starting from starting from a point It means that within a cycle, there is a drug transportation vehicle starting from a point It represents the number of customer points.

[0074] (13) In formula (13), the constraint condition defines that each customer point in any cycle uniquely corresponds to a distribution center, where represents the cycle the th customer point within the cycle is served by the th distribution center. represents the th distribution center.

[0075] (14) In formula (14), the constraint condition defines the drug storage capacity constraint. The drug demand of customers at customer points served by the distribution center within a cycle cannot exceed the drug storage capacity, where represents the cycle the drug demand of customers at the th customer point within the cycle.

[0076] The advantage of such a setting is that by setting constraint conditions and solving the objective function, the target drug distribution site selection planning path is obtained, improving the accuracy of the target drug distribution site selection planning path and reducing the distribution cost.

[0077] Exemplarily, in the actual application process, calculations are carried out by collecting data from thirteen communities and three fixed alternative distribution center sites in XX area. To ensure the accuracy and scientific nature of the calculation examples, this paper selects the SEIR standard test data set calculated based on the XX disease transmission situation as the training data set for the SEIR model, and obtains customer information of customer points to establish the SEIR model for prediction. Then, in combination with alternative distribution center sites and drug transportation vehicles, calculations are carried out to obtain the target drug distribution site selection and planning path. For example, it can be through experimental calculations that distribution centers W1 and W3 are opened, 5 drug transportation vehicles are dispatched, and the target drug distribution site selection and planning path includes vehicle 1: W1->C9->C1->C2->W1; vehicle 2: W1->C6->C7->C5->C3->W1; vehicle 3: W1->C4->W1; vehicle 4: W3->C10->C8->C13->C12->W3; vehicle 5: W3->C11->W3. Through experimental calculations, a total of 5 optimal paths are obtained, that is, starting from distribution centers W1 and W3, only 5 vehicles are needed to complete the distribution tasks of 13 customer points. The distance cost is 7676, the distribution center opening cost is 2000, the operation cost is 20, and the total cost is 9696. Among them, W1 and W3 are distribution centers, and C1, C2, C3, C4, C5, C6, C7, C8, C9, C10, C11, C12, and C13 are thirteen communities, that is, 13 customer points. This embodiment does not limit this.

[0078] In a specific embodiment, when the vehicle load of the drug distribution vehicle is less than the total customer drug demand of all customer points and greater than or equal to the customer drug demand of any customer point, as the vehicle load of the drug distribution vehicle increases, the distribution cost is gradually decreasing, the total path traveled by the drug distribution vehicle is decreasing, and the number of opened distribution centers and the number of used drug distribution vehicles are also decreasing. Therefore, in the distribution process, the vehicle load of the drug distribution vehicle can be appropriately increased to reduce the total distribution cost to a certain extent.

[0079] In a specific embodiment, further, the influence of the number of vehicles of the drug distribution vehicle within the target range on the total distribution cost can also be considered. This embodiment does not limit this.

[0080] A path planning method provided by the present invention includes obtaining customer information within a target range; where the customer information is the information of customers at all customer points included within the target range; determining customer prediction information based on the customer information; where the customer prediction information is the customer information at the next moment for all customer points within the target range; determining the customer drug demand based on the customer prediction information; determining a drug delivery site selection planning path based on the customer drug demand and the number of alternative points of the distribution center alternative points within the target range, and determining the target drug delivery site selection planning path based on the drug delivery site selection planning path, the opening cost, closing cost, and continuous operation cost of the distribution center alternative points. On the basis of the above embodiments, the technical solution of the present invention is used to solve the defect in the prior art that only considering the path planning problem leads to unfair distribution of emergency supplies, and realizes determining the customer drug demand by combining the customer prediction information of customer points, determining the drug delivery site selection planning path based on the customer drug demand and the number of alternative points of the distribution center alternative points within the target range, and determining the target drug delivery site selection planning path based on the drug delivery site selection planning path, the opening cost, closing cost, and continuous operation cost of the distribution center alternative points. By comprehensively considering the customer drug demand, the vehicle driving cost of the drug delivery vehicle, and the drug delivery cost, reasonable and fair distribution is achieved, the distribution efficiency is improved, and the distribution cost is reduced.

[0081] The path planning device provided by the present invention will be described below. The path planning device described below can be correspondingly referred to the path planning method described above.

[0082] Figure 2 is a schematic structural diagram of the path planning device provided by the present invention. Refer to Figure 2 As shown, the path planning device 200 includes: an information acquisition module 201, an information determination module 202, a demand determination module 203, and a path determination module 204.

[0083] The information acquisition module 201 is used to obtain customer information within a target range; where the customer information is the information of customers at all customer points included within the target range.

[0084] The information determination module 202 is used to determine customer prediction information based on the customer information; where the customer prediction information is the customer information at the next moment for all customer points within the target range.

[0085] The demand determination module 203 is used to determine the customer drug demand based on the customer prediction information.

[0086] A path determination module 204 is configured to determine a drug delivery site selection planning path according to the customer drug demand quantity and the number of alternative points of the alternative distribution center within the target range, and determine a target drug delivery site selection planning path according to the drug delivery site selection planning path, the opening cost, the closing cost and the continuous operation cost of the alternative distribution center.

[0087] In an exemplary embodiment, the customer information includes the number of susceptible people, the number of latent people and the number of infected people; the customer prediction information includes the predicted number of susceptible customers, the predicted number of latent customers and the predicted number of infected customers.

[0088] In an exemplary embodiment, the information determination module 202 is specifically configured to: the predicted number of susceptible customers ; where represents the number of susceptible people obtained at time represents the number of infected people obtained at time represents the number of latent people obtained at time represents the proportion of the contacts of the infected people in the total number of all customer points within the target range, represents the infection rate of the infected people, represents the proportion of the contacts of the latent people in the total number of all customer points within the target range, represents the latent transmission rate; the predicted number of latent customers ; where represents the latent prevalence rate; the predicted number of infected customers ; where represents the recovery rate of the infected people, represents the mortality rate of the infected people.

[0089] In an exemplary embodiment, the demand quantity determination module 203 is specifically configured to: the customer drug demand quantity ; where represents the predicted number of susceptible customers, represents the predicted number of latent customers, represents the predicted number of infected customers, , and are preset constant coefficients.

[0090] In an exemplary embodiment, the path determination module 204 is specifically configured to: obtain the coordinate information of all customer points and all alternative distribution center points in the drug delivery site selection planning path; determine the distance information between any two points according to the coordinate information between any two points; obtain the unit distance cost of the drug delivery vehicle; determine the vehicle delivery cost of the drug delivery vehicle according to the distance information and the unit distance cost; determine the target drug delivery site selection planning path according to the drug delivery site selection planning path, the vehicle delivery cost, the opening cost, the closing cost and the continuous operation cost of the alternative distribution center points.

[0091] In an exemplary embodiment, the coordinate information includes abscissa information and ordinate information.

[0092] In an exemplary embodiment, the path determination module 204 determines the distance information between any two points according to the coordinate information between any two points, and is specifically configured to: determine the distance information according to the abscissa information and the ordinate information respectively corresponding to any two points, and the distance information ; wherein, represents the distance information from the th point to the th point, represents the abscissa information of the th point, represents the abscissa information of the th point, represents the ordinate information of the th point, represents the ordinate information of the th point.

[0093] In an exemplary embodiment, the path determination module 204 determines the target drug delivery site selection planning path according to the drug delivery site selection planning path, the vehicle delivery cost, the opening cost, the closing cost and the continuous operation cost of the alternative distribution center points, and is specifically configured to: construct an objective function and constraint conditions according to the drug delivery site selection planning path, the vehicle delivery cost, the opening cost, the closing cost and the continuous operation cost of the alternative distribution center points; solve the objective function according to the constraint conditions to obtain the target drug delivery site selection planning path.

[0094] The device in this embodiment can be used to execute the method in any one of the method embodiments of the path planning. The specific implementation process and technical effects are similar to those in the method embodiments of the path planning. For details, reference can be made to the detailed introduction in the method embodiments of the path planning, which will not be elaborated here.

[0095] Figure 3 is a schematic structural diagram of the electronic device provided by the present invention, as Figure 3As shown in the figure, the electronic device may include: a processor 310, a communications interface 320, a memory 330, and a communication bus 340. Among them, the processor 310, the communications interface 320, and the memory 330 complete communication with each other through the communication bus 340. The processor 310 can call the logical instructions in the memory 330 to execute a path planning method, which includes: obtaining customer information within a target range; where the customer information is the information of all customers at all customer points included within the target range; determining customer prediction information based on the customer information; where the customer prediction information is the customer information at the next moment of all customer points within the target range; determining the customer drug demand based on the customer prediction information; determining a drug delivery site selection planning path based on the customer drug demand and the number of alternative points of the distribution center alternative points within the target range, and determining a target drug delivery site selection planning path based on the drug delivery site selection planning path, the opening cost, closing cost, and continuous operation cost of the distribution center alternative points.

[0096] In addition, when the logical instructions in the above-mentioned memory 330 can be implemented in the form of software functional units and sold or used as an independent product, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in various embodiments of the present invention. The foregoing storage medium includes: USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical disks and other various media that can store program codes.

[0097] On the other hand, the present invention also provides a computer program product. The computer program product includes a computer program, which can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the path planning method provided by each of the above methods. The method includes: obtaining customer information within a target range; where the customer information is the information of all customers at all customer points included within the target range; determining customer prediction information based on the customer information; where the customer prediction information is the customer information at the next moment of all customer points within the target range; determining the customer drug demand based on the customer prediction information; determining a drug distribution site selection planning path based on the customer drug demand and the number of alternative points of the distribution center alternative points within the target range, and determining a target drug distribution site selection planning path based on the drug distribution site selection planning path, the opening cost, closing cost, and continuous operation cost of the distribution center alternative points.

[0098] On another aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, it is implemented to execute the path planning method provided by each of the above methods. The method includes: obtaining customer information within a target range; where the customer information is the information of all customers at all customer points included within the target range; determining customer prediction information based on the customer information; where the customer prediction information is the customer information at the next moment of all customer points within the target range; determining the customer drug demand based on the customer prediction information; determining a drug distribution site selection planning path based on the customer drug demand and the number of alternative points of the distribution center alternative points within the target range, and determining a target drug distribution site selection planning path based on the drug distribution site selection planning path, the opening cost, closing cost, and continuous operation cost of the distribution center alternative points.

[0099] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. A person of ordinary skill in the art can understand and implement it without creative labor.

[0100] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on such an understanding, the essence of the above technical solution, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0101] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A path planning method, characterized in that: include: Acquire customer information within a target range; wherein the customer information is information of customers of all customer points included in the target range; Determine customer prediction information according to the customer information; wherein the customer prediction information is the customer information of all the customer points within the target range at a later moment; Determining the customer's drug demand based on the customer forecast information; The drug distribution site selection planning path is determined based on the customer's drug demand and the number of alternative distribution center alternative points within the target range, and the target drug distribution site selection planning path is determined based on the drug distribution site selection planning path, the opening cost, closing cost and continuous operating cost of the distribution center alternative points.

2. The path planning method according to claim 1, characterized in that: The customer information includes the number of susceptible people, the number of latent people and the number of infected people; the customer prediction information includes the predicted number of susceptible people, the predicted number of latent people and the predicted number of infected people; the determining of customer prediction information based on the customer information includes: The estimated number of customers susceptible to infection ;in, express The number of susceptible people obtained at any time, express The number of infected people obtained at any time, express The number of lurkers obtained at any time, It represents the ratio of the number of contacts of the infected person to the total number of customers of all the customer points within the target range, represents the transmission rate of infected persons, It represents the ratio of the contacts of the lurker to the total number of customers of all the customer points within the target range, represents the latent transmission rate; The predicted number of potential customer groups ;in, represents the latent prevalence; The estimated number of infected customers ;in, The recovery rate of infected people, Indicates the mortality rate of infected persons.

3. The path planning method according to claim 2, characterized in that: The step of determining the customer's drug demand according to the customer forecast information includes: The customer's drug demand ;in, represents the predicted number of susceptible people of the customer, represents the predicted number of potential customer populations, represents the predicted number of infected customers, , and is a preset constant coefficient.

4. The path planning method according to claim 1, characterized in that: The step of determining the target drug distribution site selection planning path according to the drug distribution site selection planning path, the warehouse opening cost, warehouse closing cost and continuous operation cost of the distribution center candidate point includes: Obtaining coordinate information of all the customer points and all the distribution center candidate points in the drug distribution site selection planning path; Determine the distance information between any two points according to the coordinate information between any two points; Obtain the unit distance cost of drug delivery vehicles; determining a vehicle delivery cost of the drug delivery vehicle based on the distance information and the unit distance cost; The target drug distribution site selection planning path is determined according to the drug distribution site selection planning path, the vehicle distribution cost, the opening cost, closing cost and continuous operation cost of the distribution center alternative point.

5. The path planning method according to claim 4, characterized in that: The coordinate information includes abscissa information and ordinate information; The determining the distance information between any two points according to the coordinate information between any two points comprises: The distance information is determined according to the horizontal coordinate information and the vertical coordinate information corresponding to any two points. ;in, Indicates Click to The distance information of the point, Indicates The horizontal coordinate information of the point, Indicates The horizontal coordinate information of the point, Indicates The vertical coordinate information of the point, Indicates The vertical coordinate information of the point.

6. The path planning method according to claim 4, characterized in that: The step of determining the target drug distribution site selection planning path according to the drug distribution site selection planning path, the vehicle distribution cost, the warehouse opening cost, warehouse closing cost and continuous operation cost of the distribution center candidate point includes: Constructing an objective function and constraints based on the drug distribution site planning path, the vehicle distribution cost, the opening cost, closing cost and continuous operation cost of the distribution center alternative point; The objective function is solved according to the constraint conditions to obtain the target drug distribution site planning path.

7. A path planning device, characterized in that: include: An information acquisition module, used to acquire customer information within a target range; wherein the customer information is information of customers of all customer points included in the target range; An information determination module, used to determine customer prediction information according to the customer information; wherein the customer prediction information is the customer information of all the customer points within the target range at a later moment; A demand determination module, used to determine the customer's drug demand based on the customer forecast information; The path determination module is used to determine the drug distribution site planning path according to the customer's drug demand and the number of alternative distribution center alternative points within the target range, and to determine the target drug distribution site planning path according to the drug distribution site planning path, the opening cost, closing cost and continuous operation cost of the distribution center alternative points.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the path planning method according to any one of claims 1 to 6 is implemented.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the path planning method according to any one of claims 1 to 6 is implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the path planning method according to any one of claims 1 to 6 is implemented.

Images