Joint analysis method for vaccination station site selection and vaccine distribution path planning
Through a joint analysis method of site selection for vaccination stations and vaccine delivery path planning, combined with step-by-step decision-making model and sequential heuristic algorithm, the problems of regional planning, resource allocation and cost control in vaccination activities are solved, and vaccination efficiency and Cost optimization.
Patent Information
- Application Number
- CN202411093894.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-09
- Publication Date
- 2024-11-22
AI Technical Summary
The prior art is difficult to balance regional planning, resource allocation and cost control in vaccination activities, resulting in inefficient vaccination and waste of resources.
The joint analysis method of vaccination station site selection and vaccine delivery path planning is adopted, and the site selection and delivery path of vaccination stations is optimized through the step-by-step decision model combining site selection and delivery stages, using sequential heuristic algorithms and local search disturbances. Ensure cost minimization and reasonable allocation of resources.
Comprehensive optimization of regional planning, resource allocation and cost control in vaccination activities has been achieved, vaccination efficiency has been improved, resource waste and residents’ vaccination costs have been reduced, and real-time decision-making support tools have been provided.
Smart Images

Figure CN119005467A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of vaccination technology, and in particular to a joint analysis method for vaccination station site selection and vaccine distribution route planning. Background Art
[0002] During the vaccination campaign, most people will randomly choose a convenient vaccination site. If too many people go to the same vaccination site, some vaccination sites will have long queues while others will be idle, which will lead to inefficient vaccination, as well as waste of resources and increased costs at vaccination sites.
[0003] In related technologies, the site selection problem of vaccination stations usually unilaterally considers the operating costs or vehicle delivery routes related to site selection, and establishes corresponding models to solve it. However, large-scale vaccination activities are relatively complex and involve many issues. At present, due to incomplete consideration of the issues and the inability to comprehensively balance the costs of all aspects, it is difficult to quickly provide real-time decision support for complex decision-making scenarios such as regional planning and resource allocation in vaccination activities. Summary of the invention
[0004] In view of the shortcomings of the existing technology, the present invention provides a joint analysis method for vaccination station site selection and vaccine distribution route planning, which solves the problem of difficult balance among regional planning, resource allocation and cost control in vaccination activities.
[0005] To achieve the above objectives, the present invention is implemented through the following technical solutions:
[0006] In the first aspect, an embodiment of the present application provides a joint analysis method for vaccination station site selection and vaccine distribution route planning, the joint analysis method comprising: inputting target data into a preset hierarchical decision model, the hierarchical decision model being a joint model established with the goal of minimizing total cost and corresponding to a site selection stage and a distribution stage, so as to perform vaccination station site selection and vaccine distribution route planning, the target data being used to characterize the community vaccination information, vaccination station information and vaccine transportation information of the target area; randomly selecting vaccination stations, initializing algorithm parameters and the first feasible solution of the site selection stage; passing the initialized first feasible solution to the module corresponding to the distribution stage in the hierarchical decision model, performing community allocation and vaccine distribution route planning based on a sequential heuristic algorithm, and obtaining a global feasible solution; performing local search and perturbation on the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determining the global intermediate solution that meets the preset termination conditions as the global target solution; decoding the global target solution to obtain the target site selection of the vaccination station, and the distribution relationship between the vaccination station and the community, so as to perform route planning.
[0007] According to the first aspect of the embodiment of the present application, the target data include the number of communities, the number of vaccination stations, the locations of communities, the locations of vaccination stations, the number of people who need to be vaccinated in each community, the upper limit of the service capacity of the vaccination stations, the cost of opening the vaccination stations, the unit travel cost of residents to the vaccination stations, and the unit transportation cost of vehicles.
[0008] According to the first aspect of the embodiment of the present application, the communities, vaccination stations and CDCs in the target area have preset numbers and locations, each community has a certain number of people to be vaccinated, one community corresponds to one vaccination station, and one vaccination station corresponds to at least one community.
[0009] According to the first aspect of the embodiment of the present application, the CDC can distribute vaccines to each vaccination station by vehicle based on the vaccine demand of each vaccination station. One vehicle can perform multiple transportations and deliver the vaccine to each vaccination station.
[0010] According to the first aspect of the embodiment of the present application, the aforementioned method transfers the initialized first feasible solution to the module corresponding to the distribution stage in the hierarchical decision model, performs community allocation and vaccine distribution path planning based on a sequential heuristic algorithm, and obtains a global feasible solution, including:
[0011] Determine the first penalty cost of each community in the target area when it is assigned to the second closest vaccination station instead of the closest vaccination station; arrange all communities in descending order according to their corresponding first penalty costs to obtain a first community sequence; assign each community to the nearest vaccination station based on the order in the first community sequence, and determine whether each vaccination station exceeds its own service capacity threshold; when all communities are assigned and do not exceed the service capacity threshold of the vaccination station, without considering the vehicle capacity, generate an initial delivery path that can meet the needs of all vaccination stations through a greedy strategy; place the vaccination stations one by one in the initial delivery path according to the order in the delivery path, and open a new delivery path when the vehicle capacity is insufficient to obtain at least one intermediate delivery path; relocate the split point of the path, and place the split point at the initial position or the last position of the intermediate delivery path to adjust the position of the split point to the target position in the path to shorten the distance, and generate a target delivery path for the vaccine based on the adjusted target position to obtain a global feasible solution.
[0012] According to the first aspect of the embodiment of the present application, when some vaccination stations exceed their own service capacity threshold, before the aforementioned initial delivery route that can meet the needs of all vaccination stations is generated by a greedy strategy without considering vehicle capacity, the joint analysis method for vaccination station site selection and vaccine distribution route planning also includes: based on all communities in the target area, excluding the assigned communities to update the community list to obtain a target list; based on all vaccination stations, excluding vaccination stations that exceed their own service capacity threshold to obtain a target vaccination station sequence; determining the second penalty cost for each community in the target list when it is assigned to the second closest vaccination station in the target vaccination station sequence instead of the closest vaccination station; based on the second penalty cost, sequentially assigning the communities in the target list to the vaccination stations in the target vaccination station sequence.
[0013] According to the first aspect of the embodiment of the present application, the aforementioned local search and perturbation of the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determine the global intermediate solution that meets the preset termination condition as the global target solution, including: defining a neighborhood structure, initializing the neighborhood index to 1, and calculating the objective function value of the current global feasible solution; initializing the number of iterations to 0, and starting iteration based on the neighborhood index to perform local search for the global feasible solution; when the current number of iterations is less than or equal to the preset maximum number of iterations, and the neighborhood index is less than or equal to the preset maximum number of neighborhoods, searching for a new solution in the neighborhood to obtain an initial intermediate solution; processing the initial intermediate solution based on a preset correction strategy to obtain a target intermediate solution, and determining the objective function value corresponding to the target intermediate solution; when the objective function value corresponding to the target intermediate solution is not better than the objective function value of the solution of the previous stage in the iterative processing, increasing the value of the neighborhood index, and when the neighborhood index after the increase is less than or equal to the maximum number of neighborhoods, continuing to search for a new solution in the neighborhood; when the objective function value corresponding to the target intermediate solution is better than the objective function value of the solution of the previous stage in the iterative processing, perturbation processing is performed on the target intermediate solution to obtain a global intermediate solution.
[0014] According to the first aspect of the embodiment of the present application, the global target solution is decoded to obtain the target site selection of vaccination stations and the allocation relationship between vaccination stations and communities for path planning, including: generating a decoding matrix based on the encoding of the global target solution and the preset allocation scheme, the decoding matrix being a K*I 0-1 matrix; wherein I represents the total number of vaccination stations and K represents the number of communities; based on the decoding matrix, determining the target site selection of vaccination stations and the allocation relationship between vaccination stations and communities.
[0015] According to the first aspect of the embodiment of the present application, the constraints of the correction strategy include: each element in the initial intermediate solution is an integer between the interval [1, I); the number of people assigned to the same vaccination station cannot exceed the upper limit of the service capacity of the vaccination station. If the number of people assigned to the vaccination station exceeds the upper limit of the service capacity of the vaccination station, the vaccination station with service capacity and the closest distance is selected for correction.
[0016] According to the first aspect of the embodiment of the present application, the objective function of the aforementioned hierarchical decision model satisfies the expression:
[0017]
[0018] Among them, S represents the node set of candidate vaccination stations, K represents the number of communities, N = S∪{0}, where 0 represents the CDC, r represents the rth route of the vehicle, and R = {1, 2..., r};
[0019] c 1 represents the unit distance travel cost of residents to the vaccination station, f ik represents the distance between community k and vaccination station i, q k represents the number of residents in community k who need to be vaccinated, x ik indicates which vaccination station i is responsible for community k, c i represents the fixed cost of opening vaccination station i; u i Indicates whether vaccination station i is open, u i ∈{0, 1}, when vaccination station i is open, u i Take 1, otherwise u i Take 0; c 2 represents the unit cost of vehicle transportation, d ij represents the distance between vaccination station i and vaccination station j; represents the order in which the vehicle visits vaccination stations i and j in the rth route, If the vehicle visits vaccination station i first and then vaccination station j in route r, then Take 1.
[0020] According to a first aspect of an embodiment of the present application, the constraint condition satisfies the expression:
[0021]
[0022] The above formula ensures that all communities are assigned only once;
[0023]
[0024] The above formula ensures that vaccination sites that are assigned communities are open, while vaccination sites that are not assigned communities are closed;
[0025]
[0026] The above formula ensures that each vaccination station is visited at least once in all routes;
[0027]
[0028] The above formula ensures that the starting point and end point of the vehicle are both the CDC, and the route of the vehicle is continuous;
[0029]
[0030] The above formula ensures the elimination of subroutes in the route, where P is the vertex set of the number of people in the route;
[0031]
[0032] The above formula ensures that the vehicle only visits open vaccination stations, where q k represents the number of people in community k who need to be vaccinated;
[0033]
[0034] The above formula ensures that the total number of vaccines transported on each route does not exceed the vehicle capacity limit, where V represents the upper limit of the vehicle capacity;
[0035]
[0036] The above formula ensures that the number of people assigned to a vaccination station does not exceed the service capacity of the vaccination station, where G i Indicates the upper limit of the number of people that vaccination station i can serve.
[0037] In the second aspect, an embodiment of the present application provides a joint analysis device for vaccination station site selection and vaccine distribution route planning, the joint analysis device comprising an input module, an initialization module, a transfer solution module, a search disturbance module and a decoding module; the input module is used to input target data into a preset hierarchical decision model, the hierarchical decision model is a joint model established with the goal of minimizing the total cost and corresponds to a site selection stage and a distribution stage, so as to perform vaccination station site selection and vaccine distribution route planning, and the target data is used to characterize the community vaccination information, vaccination station information and vaccine transportation information of the target area; the initialization module is used to randomly select vaccination stations , initialize the algorithm parameters and the first feasible solution of the site selection stage; the transfer solution module is used to transfer the initialized first feasible solution to the module corresponding to the distribution stage in the hierarchical decision model, and perform community allocation and vaccine distribution path planning based on the sequential heuristic algorithm to obtain a global feasible solution; the search perturbation module is used to perform local search and perturbation on the global feasible solution to update the global feasible solution to obtain the global intermediate solution, and determine the global intermediate solution that meets the preset termination conditions as the global target solution; the decoding module is used to decode the global target solution to obtain the target site selection of the vaccination station and the allocation relationship between the vaccination station and the community for path planning.
[0038] In a third aspect, an embodiment of the present application provides an electronic device comprising: a processor, a memory, and a program stored in the memory and executable on the processor, wherein when the program is executed by the processor, the joint analysis method for vaccination station site selection and vaccine distribution route planning in the aforementioned first aspect is implemented.
[0039] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium storing programs or instructions, which, when executed by a processor, implements the joint analysis method for vaccination station site selection and vaccine distribution route planning in the aforementioned first aspect.
[0040] The present invention provides a joint analysis method for vaccination station site selection and vaccine distribution route planning. Compared with the prior art, it has the following beneficial effects:
[0041] The hierarchical decision model established in this application covers both the site selection and distribution stages of vaccination stations, combining the vaccination site selection and vaccine distribution problems to achieve a balance in costs at different stages; after determining the first feasible solution in the site selection stage, the first feasible solution is passed to the distribution stage, and community allocation and path planning are performed through a preset sequential heuristic algorithm, which can solve the allocation of community needs and adjust the distribution order; and further perform local search and perturbations on the global feasible solution to improve the efficiency of finding the global target solution. By decoding the global target solution, the target site selection of the vaccination station and the distribution relationship between the vaccination station and the community can be obtained; this application comprehensively considers the regional planning, resource allocation and cost control of vaccination, not only taking into account the operating costs and distribution costs of opening vaccination stations, but also from the perspective of residents, allowing residents to go to vaccination stations for vaccination as conveniently as possible. BRIEF DESCRIPTION OF THE DRAWINGS
[0042] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0043] Figure 1 It is a flowchart of a joint analysis method for vaccination station site selection and vaccine distribution route planning provided in an embodiment of the present application;
[0044] Figure 2 yes Figure 1 An exemplary partial flow chart of S130;
[0045] Figure 3 yes Figure 1 Another exemplary partial flow chart of S130;
[0046] Figure 4 yes Figure 1 An exemplary flow chart of S140;
[0047] Figure 5 It is a structural schematic diagram of a joint analysis device for vaccination station site selection and vaccine distribution route planning provided in an embodiment of the present application;
[0048] Figure 6 It is a structural schematic diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0049] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention are clearly and completely described. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0050] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.
[0051] The embodiment of the present application solves the problem of difficult balance among regional planning, resource allocation and cost control in vaccination activities by providing a joint analysis method for vaccination station site selection and vaccine distribution route planning.
[0052] The technical solution in the embodiment of the present application is to solve the above technical problems, and the overall idea is as follows:
[0053] Currently, in vaccination activities, most people will randomly choose a convenient vaccination site. If too many people go to the same vaccination site, some vaccination sites will have long queues while others will be idle, which will lead to low vaccination efficiency, waste of resources and increased vaccination site costs. Therefore, it is necessary to reasonably arrange for residents to receive vaccinations at designated vaccination sites. By reasonably determining the location and number of open vaccination sites and the allocation of people who need to be vaccinated, it can effectively improve resource utilization and reduce costs.
[0054] In the vaccination activities, an appropriate number of vaccination sites should be opened according to the travel distance of residents to achieve the goals of minimizing vaccination-related costs and maximizing the convenience of vaccination for residents. At present, the site selection of most vaccination sites only considers the operating costs related to site selection, without considering the vaccination distance of residents and the cost of vaccine distribution, which seriously affects the willingness of residents to be vaccinated and the vaccination coverage rate.
[0055] In previous studies, some models have been established for different goals in the allocation of vaccination demand and vaccine distribution. However, existing technologies lack support for complex decision-making scenarios such as regional planning and resource allocation in vaccination activities. In the past, there have been many studies on the site selection of vaccination stations and vehicle distribution routes, but there are few studies that comprehensively consider how to plan the vaccination needs of the population, make decisions on the opening of vaccination stations, and deliver vaccines. It is impossible to provide real-time decision-making for vaccination during epidemics of infectious diseases. In some model studies, only the various costs incurred by the organizers in the vaccination activities are considered, and the experience of residents in vaccination is ignored, which affects the residents' acceptance and participation in vaccination. In terms of model solution methods, traditional heuristic algorithms and solvers have the disadvantages of slow solution speed and low solution accuracy, and cannot be applied to the analysis of large-scale vaccination activities.
[0056] In order to better understand the above technical solution, the above technical solution will be described in detail below in conjunction with the accompanying drawings and specific implementation methods.
[0057] The following first introduces a joint analysis method for vaccination station site selection and vaccine distribution route planning provided in an embodiment of the present application.
[0058] The present application embodiment provides a flowchart of a joint analysis method for vaccination station site selection and vaccine distribution route planning, such as Figure 1 As shown, the joint analysis method may include the following steps S110-S150.
[0059] S110. Input the target data into the preset hierarchical decision model. The hierarchical decision model is a joint model established with the goal of minimizing the total cost and corresponds to a site selection stage and a distribution stage to carry out vaccination station site selection and vaccine distribution route planning. The target data is used to characterize the community vaccination information, vaccination station information and vaccine transportation information of the target area.
[0060] S120. Randomly select a vaccination station, initialize the algorithm parameters and the first feasible solution in the site selection phase.
[0061] S130, passing the initialized first feasible solution to the module corresponding to the distribution stage in the hierarchical decision model, performing community allocation and vaccine distribution path planning based on a sequential heuristic algorithm, and obtaining a global feasible solution.
[0062] S140, locally searching and perturbing the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determining the global intermediate solution that meets a preset termination condition as the global target solution.
[0063] S150. Decode the global target solution to obtain the target location of the vaccination station and the allocation relationship between the vaccination station and the community for path planning.
[0064] In the embodiments of the present application, it can be understood that the present application combines the vaccination site selection and vaccine distribution problems to achieve a balance in costs at different stages; after determining the first feasible solution in the site selection stage, the first feasible solution is passed to the distribution stage, and the allocation of community needs and the adjustment of the distribution order can be solved through a preset sequential heuristic algorithm; the present application can improve the efficiency of finding the global target solution by performing local search and perturbation on the global feasible solution, and by decoding the global target solution, the target site selection of the vaccination station and the distribution relationship between the vaccination station and the community can be obtained.
[0065] It should be noted that this application has taken full and comprehensive consideration of the regional planning, resource allocation and cost control of vaccination. It not only takes into account the operating costs and distribution costs of opening vaccination stations, but also makes it as convenient as possible for residents to go to vaccination stations to get vaccinated from the perspective of residents.
[0066] In some embodiments, the objective function of the aforementioned hierarchical decision model satisfies the expression:
[0067]
[0068] Where S represents the node set of candidate vaccination stations, K represents the number of communities, N = S ∪ {0}, where 0 represents the CDC, r represents the rth route of the vehicle, and R = {1, 2..., r}; c 1 represents the unit distance travel cost of residents to the vaccination station, f ik represents the distance between community k and vaccination station i, q k represents the number of residents in community k who need to be vaccinated, x ik indicates which vaccination station i is responsible for community k, c i represents the fixed cost of opening vaccination station i; u i Indicates whether vaccination station i is open, u i ∈{0, 1}, when vaccination station i is open, u i Take 1, otherwise u i Take 0; c 2 represents the unit cost of vehicle transportation, d ij represents the distance between vaccination station i and vaccination station j; represents the order in which the vehicle visits vaccination stations i and j in the rth route, If the vehicle visits vaccination station i first and then vaccination station j in route r, then Take 1.
[0069] In some embodiments, the aforementioned hierarchical decision model is set with the following assumptions:
[0070] (1) The number of people who need to be vaccinated in each community is known;
[0071] (2) One vehicle can deliver vaccines to multiple vaccination sites;
[0072] (3) Using one vehicle for multiple transports.
[0073] It should be noted that, assuming that a given target area has K communities, I vaccination stations and a CDC, the CDC is represented by site 0, and the location of each site and community is known; each community is served by one vaccination station, but one vaccination station can serve several different communities; these communities are assigned to different vaccination stations based on their locations and the number of people who need to be vaccinated, and residents of the same community will go to the same vaccination station, and residents will incur travel costs; opening a vaccination station will incur related operating costs, among which the vaccine demand of a vaccination station is the sum of the number of people who need to be vaccinated in all communities assigned to the vaccination station.
[0074] In one example, the aforementioned target data include the number of communities, the number of vaccination stations, the locations of communities, the locations of vaccination stations, the number of people who need to be vaccinated in each community, the upper limit of the service capacity of the vaccination stations, the cost of opening the vaccination stations, the unit travel cost of residents to the vaccination stations, and the unit transportation cost of vehicles.
[0075] In one example, the communities, vaccination stations, and CDCs in the target area have preset numbers and locations, each community has a certain number of people to be vaccinated, one community corresponds to one vaccination station, and one vaccination station corresponds to at least one community.
[0076] In one example, before vaccination begins, the CDC is able to distribute vaccines to various vaccination stations by vehicle based on the vaccine demand of each vaccination station. One vehicle can make multiple trips and deliver the vaccine to each vaccination station, and vehicle transportation will incur transportation costs.
[0077] In some embodiments, the constraints of the aforementioned hierarchical decision model satisfy the following expression:
[0078]
[0079] The above formula ensures that all communities are assigned only once;
[0080]
[0081] The above formula ensures that vaccination sites that are assigned communities are open, while vaccination sites that are not assigned communities are closed;
[0082]
[0083] The above formula ensures that each vaccination station is visited at least once in all routes;
[0084]
[0085] The above formula ensures that the starting point and end point of the vehicle are both the CDC, and the route of the vehicle is continuous;
[0086]
[0087] The above formula ensures the elimination of subroutes in the route, where P is the vertex set of the number of people in the route;
[0088]
[0089] The above formula ensures that the vehicle only visits open vaccination stations, where q k represents the number of people in community k who need to be vaccinated;
[0090]
[0091] The above formula ensures that the total number of vaccines transported on each route does not exceed the vehicle capacity limit, where V represents the upper limit of the vehicle capacity;
[0092]
[0093] The above formula ensures that the number of people assigned to a vaccination station does not exceed the service capacity of the vaccination station, where G i Indicates the upper limit of the number of people that vaccination station i can serve.
[0094] In some embodiments, please refer to Figure 2 , the above-mentioned first feasible solution is transferred to the module corresponding to the distribution stage in the hierarchical decision model, and community allocation and vaccine distribution path planning are performed based on the sequential heuristic algorithm to obtain a global feasible solution, that is, S130 may specifically include the following steps:
[0095] S210. Determine the first penalty cost for each community in the target area when being assigned to the second closest vaccination station instead of the closest vaccination station.
[0096] S220 , arranging all communities in descending order according to their corresponding first penalty costs to obtain a first community sequence.
[0097] S230. Based on the order in the first community sequence, each community is assigned to the nearest vaccination station, and it is determined whether each vaccination station exceeds its own service capacity threshold.
[0098] S240. When all communities are assigned and the service capacity threshold of the vaccination stations is not exceeded, the initial delivery path that can meet the needs of all vaccination stations is generated through a greedy strategy without considering the vehicle capacity.
[0099] S250. Place the vaccination stations one by one into the initial delivery path according to the order in the delivery path, and open a new delivery path when the vehicle capacity is insufficient, to obtain at least one intermediate delivery path.
[0100] S260, relocate the segmentation point of the path, place the segmentation point at the initial position or the final position of the intermediate distribution path, adjust the position of the segmentation point to the target position in the path to shorten the distance, and generate the target distribution path of the vaccine based on the adjusted target position to obtain a global feasible solution.
[0101] In the embodiments of the present application, it can be understood that, compared with the single delivery of the traditional vehicle routing problem, in the decomposable routing problem, vehicles are allowed to make multiple deliveries to demand points. The difficulty lies in how to determine the decomposable demand points and the delivery order after decomposition. The sequential heuristic rules independently designed in the present application can solve the allocation of community needs, effectively split the vaccination points, adjust the delivery order, and generate the target delivery path of the vaccine based on the adjusted target location to obtain a globally feasible solution, which is conducive to generating a better delivery path plan.
[0102] In one example, in the aforementioned step S260, when there is a split point at the initial position or the final position of the intermediate delivery path:
[0103] For intermediate delivery paths: 0-x 1 -x 2 -x 3 -…-x n -0, when the split point is at the initial position, that is, x 1 is the split point, delete point x 1 , the path becomes 0-x 2 -x 3 -…-x n -0; then reinsert x at the target position 1 , the left and right sides of the insertion position can be expressed as and Then calculate the change in the total path distance after inserting the new target position, Δc. If the Δc of the initial position is the smallest, then x 1 Keep the original position; otherwise, x1 Place in the new target location.
[0104] In another example, in the aforementioned step S260, when there are split points at both the initial position and the final position of the intermediate delivery path:
[0105] For intermediate delivery paths: 0-x 1 -x 2 -x 3 -…-x n -0, when there are split points at both the initial position and the final position, that is, x 1 and x n is the split point, delete x 1 and x n , the path becomes 0-x 2 -x 3 -…-x n-2 -x n-1 -0; reinsert x 1 and x n , then calculate x 1 In x n In front, and x n In x 1 The distance change value when in front; x 1 The left and right sides of the insertion position can be expressed as and Accordingly, x n The left and right sides of the insertion position can be expressed as and Then calculate the change Δc of the total path distance after inserting the new target position. The calculation formula satisfies:
[0106]
[0107] This application can determine x by comparing the change values Δc of different target positions. 1 and x n The optimal location of the vaccine is then generated to generate the target delivery path and obtain a globally feasible solution.
[0108] In some embodiments, after the aforementioned S230, when some vaccination stations exceed their own service capacity thresholds, before generating an initial delivery path that can meet the needs of all vaccination stations through a greedy strategy without considering vehicle capacity, the joint analysis method for vaccination station site selection and vaccine distribution path planning provided by the present application may further include the following steps:
[0109] S310: Update the community list based on all communities in the target area, excluding the assigned communities, to obtain a target list.
[0110] S320. Based on all vaccination stations, exclude the vaccination stations that exceed their own service capacity thresholds to obtain the target vaccination station sequence.
[0111] S330. Determine a second penalty cost for each community in the target list when it is assigned to the second closest vaccination station in the target vaccination station sequence instead of the closest vaccination station.
[0112] S340. Based on the second penalty cost, the communities in the target list are sequentially assigned to the vaccination stations in the target vaccination station sequence.
[0113] In the embodiment of the present application, it can be understood that when some vaccination stations exceed their own service capacity threshold, it is necessary to update the community list, exclude the communities that have been assigned, and recalculate the second penalty cost generated when each community in the updated target list is assigned to the second closest vaccination station instead of the nearest vaccination station, and sort and allocate them.
[0114] In some embodiments, the aforementioned local search and perturbation of the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determine the global intermediate solution that meets the preset termination condition as the global target solution, that is, the aforementioned S140 may specifically include the following steps:
[0115] S410, define a neighborhood structure, initialize the neighborhood index to 1, and calculate the objective function value of the current global feasible solution.
[0116] It should be noted that the neighborhood structure in the present application is proposed based on problem characteristics and coding. Compared with the traditional neighborhood structure, the neighborhood structure in the present application is more suitable for the aforementioned hierarchical decision model.
[0117] S420, initializing the number of iterations to 0, and starting iteration based on the neighborhood index to perform a local search for a global feasible solution.
[0118] S430: When the current number of iterations is less than or equal to the preset maximum number of iterations and the neighborhood index is less than or equal to the preset maximum number of neighborhoods, search for a new solution in the neighborhood to obtain an initial intermediate solution.
[0119] It should be noted that, when the neighborhood index is greater than the preset maximum number of neighborhoods, if the objective function value of the current solution fails to improve, the iteration continues and a new solution is searched again in the neighborhood.
[0120] S440, processing the initial intermediate solution based on a preset correction strategy to obtain a target intermediate solution, and determining an objective function value corresponding to the target intermediate solution.
[0121] S450. When the objective function value corresponding to the target intermediate solution is not better than the objective function value of the solution in the previous stage of the iterative process, increase the value of the neighborhood index. When the neighborhood index after the increase is less than or equal to the maximum number of neighbors, continue to search for a new solution in the neighborhood.
[0122] S460. When the objective function value corresponding to the target intermediate solution is better than the objective function value of the solution in the previous stage in the iterative process, the target intermediate solution is perturbed to obtain a global intermediate solution.
[0123] In the embodiments of the present application, it can be understood that when the current number of iterations is greater than the maximum number of iterations, the iteration is stopped, and when the current number of iterations is less than or equal to the preset maximum number of iterations, the initial intermediate solution is determined through local search, and after the initial intermediate solution is obtained, the initial intermediate solution is checked and verified through a correction strategy; the present application determines the optimal target intermediate solution through local search, and after obtaining the target intermediate solution, further perturbs the target intermediate solution.
[0124] In one example, the constraints of the aforementioned correction strategy include: each element in the initial intermediate solution is an integer between the interval [1, I), where I represents the number of vaccination stations; the number of people assigned to the same vaccination station cannot exceed the upper limit of the service capacity of the vaccination station. If the number of people assigned to the vaccination station exceeds the upper limit of the service capacity of the vaccination station, the vaccination station with service capacity and the closest distance is selected for correction.
[0125] In some embodiments, when the objective function value corresponding to the target intermediate solution is better than the objective function value of the global feasible solution, the target intermediate solution is perturbed to obtain the global intermediate solution, that is, the aforementioned S460 may specifically include the following steps:
[0126] S461, initialization parameter θ 1 and θ 2 .
[0127] S462, generate a random number μ between 0 and 1 1 , if μ 1 <θ1 , Then perform a migration operation on the solution to generate a new solution; otherwise, perform a region exchange operation on the solution to generate a new solution.
[0128] S463, generate a random number μ between 0 and 1 2 , if μ 2 <θ 2 , then perform the route interchange operation on the solution to generate a new solution; otherwise, perform the region migration operation on the solution to generate a new solution.
[0129] S464. Apply the correction strategy to obtain a feasible solution and its objective function value.
[0130] S465. If the objective function value of the feasible solution is better than the objective function value of the current optimal solution, the current optimal solution is updated to a feasible solution, and the objective function value is updated accordingly.
[0131] It can be understood that the present application performs perturbation processing on the target intermediate solution based on the proposed neighborhood structure. Specifically, the perturbation processing may include the following contents:
[0132] (1) Close the vaccination stations that are open in the current solution, and reallocate the communities assigned to the closed vaccination stations to the nearest vaccination stations with service capacity.
[0133] (2) Open the closed vaccination stations in the current solution and redistribute communities to the open vaccination stations.
[0134] (3) Close a vaccination station in the current solution and open a closed vaccination station at the same time.
[0135] (4) The vaccination station was moved to another location.
[0136] (5) Exchange the vaccination stations at two locations.
[0137] (6) Select two locations and reverse the order of the middle vaccination stations.
[0138] (7) Relocate some vaccination stations to another location.
[0139] In some embodiments, the global target solution is decoded to obtain the target location of the vaccination station and the allocation relationship between the vaccination station and the community for path planning, that is, S150 may specifically include the following steps:
[0140] The decoding matrix is generated based on the encoding of the global objective solution and the preset allocation scheme. The decoding matrix is a K*I 0-1 matrix; where I represents the total number of vaccination stations and K represents the number of communities.
[0141] Based on the decoding matrix, the target locations of vaccination stations and the allocation relationship between vaccination stations and communities are determined.
[0142] It should be noted that a one-dimensional vector with K elements is used in the encoding process, where I represents the total number of vaccination stations and K represents the total number of communities; each element is an integer between the interval [1, I), and if the value is equal to i, it means that the community is assigned to vaccination station i within a specific time period; the scheme can be written as: 1 ,x 2 ,x 3 ,…,xK ). Accordingly, in the decoding process, a K*I 0-1 matrix can be generated, and the elements in the matrix are assigned 1 according to the encoding of the allocation scheme, indicating that the community is under the responsibility of the vaccination station, and a decoding matrix is obtained.
[0143] In one example, the target area includes 15 communities and 4 candidate vaccination stations, and a 4*15 0-1 matrix is generated as follows:
[0144]
[0145] Among them, each row of the 0-1 matrix corresponds to a vaccination station, each column of the 0-1 matrix corresponds to a community, and each row of the matrix represents which communities the vaccination stations are responsible for. The first community corresponds to vaccination station No. 1, the second community corresponds to vaccination station No. 1, the third community corresponds to vaccination station No. 1, the fourth community corresponds to vaccination station No. 2, the fifth community corresponds to vaccination station No. 2, the sixth community corresponds to vaccination station No. 3, the seventh community corresponds to vaccination station No. 1, the eighth community corresponds to vaccination station No. 2, the ninth community corresponds to vaccination station No. 3, the tenth community corresponds to vaccination station No. 3, the eleventh community corresponds to vaccination station No. 4, the twelfth community corresponds to vaccination station No. 4, the thirteenth community corresponds to vaccination station No. 3, the fourteenth community corresponds to vaccination station No. 2, and the fifteenth community corresponds to vaccination station No. 4.
[0146] In some embodiments, please refer to Figure 5 The present application also provides a joint analysis device 500 for vaccination station site selection and vaccine distribution route planning. The joint analysis device 500 may specifically include:
[0147] An input module 510 is used to input target data into a preset hierarchical decision model. The hierarchical decision model is a joint model established with the goal of minimizing total cost and corresponds to a site selection stage and a distribution stage, so as to select vaccination sites and plan vaccine distribution routes. The target data is used to represent community vaccination information, vaccination site information, and vaccine transportation information in the target area.
[0148] Initialization module 520, for randomly selecting vaccination stations, initializing algorithm parameters and the first feasible solution of the site selection stage;
[0149] The transfer solution module 530 is used to transfer the initialized first feasible solution to the module corresponding to the distribution stage in the hierarchical decision model, perform community allocation and vaccine distribution path planning based on the sequential heuristic algorithm, and obtain a global feasible solution;
[0150] A search and perturbation module 540 is used to perform local search and perturbation on the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determine the global intermediate solution that meets the preset termination condition as the global target solution;
[0151] The decoding module 550 is used to decode the global target solution to obtain the target location of the vaccination station and the allocation relationship between the vaccination station and the community for path planning.
[0152] According to an embodiment of the present application, any multiple modules among the input module 510, the initialization module 520, the transfer solution module 530, the search disturbance module 540 and the decoding module 550 can be combined into one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module.
[0153] In some embodiments, the transfer solution module 530 may be specifically used to:
[0154] Determine the first penalty cost for each community in the target area when assigned to the second closest vaccination station instead of the closest one;
[0155] Arrange all communities in descending order according to their corresponding first penalty costs to obtain the first community sequence;
[0156] Based on the order in the first community sequence, each community is assigned to the nearest vaccination station, and it is determined whether each vaccination station exceeds its own service capacity threshold;
[0157] When all communities are assigned and the service capacity threshold of the vaccination stations is not exceeded, the initial delivery routes that can meet the needs of all vaccination stations are generated through a greedy strategy without considering the vehicle capacity;
[0158] The vaccination stations are placed one by one into the initial delivery path according to the order in the delivery path, and a new delivery path is opened when the vehicle capacity is insufficient, so as to obtain at least one intermediate delivery path;
[0159] Reposition the split point of the path and place it at the initial or final position of the intermediate delivery path to adjust the position of the split point to the target position in the path to shorten the distance, and generate the target delivery path of the vaccine based on the adjusted target position to obtain a globally feasible solution.
[0160] In some embodiments, the transfer solution module 530 may also be used to:
[0161] Based on all communities in the target area, excluding the assigned communities, the community list is updated to obtain a target list;
[0162] Based on all vaccination stations, excluding those that exceed their own service capacity threshold, the target vaccination station sequence is obtained;
[0163] Determine the second penalty cost for each community in the target list when it is assigned to the second closest vaccination station in the sequence of target vaccination stations instead of the closest one;
[0164] Based on the second penalty cost, the communities in the target list are sequentially assigned to vaccination stations in the target vaccination station sequence.
[0165] In some embodiments, the search disturbance module 540 may be specifically used to:
[0166] Define the neighborhood structure, initialize the neighborhood index to 1, and calculate the objective function value of the current global feasible solution;
[0167] Initialize the number of iterations to 0, and start iteration based on the neighborhood index to perform local search for a global feasible solution;
[0168] When the current number of iterations is less than or equal to the preset maximum number of iterations, and the neighborhood index is less than or equal to the preset maximum number of neighborhoods, a new solution is searched in the neighborhood to obtain an initial intermediate solution;
[0169] Processing the initial intermediate solution based on a preset correction strategy to obtain a target intermediate solution, and determining an objective function value corresponding to the target intermediate solution;
[0170] When the objective function value corresponding to the target intermediate solution is not better than the objective function value of the solution in the previous stage of the iterative process, the value of the neighborhood index is increased. When the neighborhood index after the increase is less than or equal to the maximum number of neighbors, the search for a new solution in the neighborhood continues;
[0171] When the objective function value corresponding to the target intermediate solution is better than the objective function value of the solution in the previous stage in the iterative process, the target intermediate solution is perturbed to obtain a global intermediate solution.
[0172] In some embodiments, the decoding module 550 may be specifically used to:
[0173] The decoding matrix is generated based on the encoding of the global objective solution and the preset allocation scheme. The decoding matrix is a K*I 0-1 matrix; where I represents the total number of vaccination stations and K represents the number of communities;
[0174] Based on the decoding matrix, the target locations of vaccination stations and the allocation relationship between vaccination stations and communities are determined.
[0175] Figure 5Each module in the device shown has the function of implementing each step in the aforementioned joint analysis method for vaccination station site selection and vaccine distribution route planning, and can achieve its corresponding technical effect. For the sake of concise description, it will not be repeated here.
[0176] In some embodiments, the present application provides an electronic device, the structure diagram of the electronic device is as follows Figure 6 shown.
[0177] The electronic device may include a processor 610 and a memory 620 storing computer program instructions.
[0178] Specifically, the processor 610 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of the embodiments of the present application.
[0179] The memory 620 may include a large capacity memory for data or instructions. By way of example and not limitation, the memory 620 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive or a combination of two or more of these. In appropriate cases, the memory 620 may include a removable or non-removable (or fixed) medium. In appropriate cases, the memory 620 may be inside or outside the integrated gateway disaster recovery device. In a specific embodiment, the memory 620 is a non-volatile solid-state memory.
[0180] The memory 620 may include a read-only memory (ROM), a random access memory (RAM), a disk storage medium device, an optical storage medium device, a flash memory device, an electrical, optical or other physical / tangible memory storage device. Therefore, typically, the memory 620 includes one or more tangible (non-transitory) computer-readable storage media (e.g., a memory device) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it can perform the operations described in any of the above-mentioned embodiments of the joint analysis method for vaccination station site selection and vaccine distribution route planning.
[0181] The processor 610 reads and executes computer program instructions stored in the memory 620 to implement any one of the joint analysis methods for vaccination station site selection and vaccine distribution route planning in the above embodiments.
[0182] In one example, the electronic device may further include a communication interface 630 and a bus 600. Figure 6 As shown, the processor 610, the memory 620, and the communication interface 630 are connected via a bus 600 and communicate with each other.
[0183] The communication interface 630 is mainly used to implement communication between various modules, devices, units and / or equipment in the embodiments of the present application.
[0184] Bus 600 includes hardware, software or both, and the parts of online data flow billing equipment are coupled to each other. For example, but not limitation, bus may include accelerated graphics port (AGP) or other graphics bus, enhanced industrial standard architecture (EISA) bus, front-end bus (FSB), hypertransport (HT) interconnection, industrial standard architecture (ISA) bus, infinite bandwidth interconnection, low pin count (LPC) bus, memory bus, micro channel architecture (MCA) bus, peripheral component interconnection (PCI) bus, PCI-Express (PCI-X) bus, serial advanced technology attachment (SATA) bus, video electronics standard association local (VLB) bus or other suitable bus or two or more of these combinations. In appropriate cases, bus 600 may include one or more buses. Although the present application embodiment describes and shows a specific bus, the present application considers any suitable bus or interconnection.
[0185] In addition, in combination with the joint analysis method for vaccination station site selection and vaccine distribution route planning in the above embodiments, the present application embodiment can provide a computer storage medium for implementation. The computer storage medium stores computer program instructions; when the computer program instructions are executed by the processor, any one of the joint analysis methods for vaccination station site selection and vaccine distribution route planning in the above embodiments is implemented.
[0186] It should be clear that the present application is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present application is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present application.
[0187] The functional blocks shown in the above block diagram can be implemented as hardware, software, firmware or a combination thereof. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of the present application are programs or code segments that are used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or a communication link by a data signal carried in a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, optical fiber media, radio frequency (RF) links, etc. The code segment can be downloaded via a computer network such as the Internet, an intranet, etc.
[0188] It should also be noted that the exemplary embodiments mentioned in this application describe some methods or systems based on a series of steps or devices. However, this application is not limited to the order of the above steps, that is, the steps can be performed in the order mentioned in the embodiment, or in a different order from the embodiment, or several steps can be performed simultaneously.
[0189] Aspects of the present disclosure are described above with reference to the flowchart and / or block diagram of the method, device (system) and computer program product according to the embodiment of the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine so that these instructions executed by the processor of the computer or other programmable data processing device enable the implementation of the function / action specified in one or more boxes of the flowchart and / or block diagram. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field programmable logic circuit. It can also be understood that each box in the block diagram and / or flowchart and the combination of boxes in the block diagram and / or flowchart can also be implemented by dedicated hardware that performs a specified function or action, or can be implemented by a combination of dedicated hardware and computer instructions.
[0190] In summary, compared with the prior art, this application has the following beneficial effects:
[0191] 1. Based on the characteristics of the problem, this application proposes an effective heuristic algorithm to solve the optimization scheduling problem, which can provide decision-making basis for large, medium and small-scale vaccination activities in a relatively short time; this application conducts local search and perturbation on the global feasible solution to improve the efficiency of finding the global target solution. By decoding the global target solution, the target location of the vaccination station and the distribution relationship between the vaccination station and the community can be obtained.
[0192] 2. This application comprehensively considers the regional planning, resource allocation and cost control of vaccination, with the goal of minimizing total cost, minimizing operating cost, distribution cost and residents' travel cost for vaccination, and solves the site selection problem, demand allocation problem and vaccine distribution problem of vaccination stations. The solution to this problem can provide a practical decision-making support tool for large-scale vaccination during influenza epidemics.
[0193] 3. In order to achieve a balance between cost and service quality, this application constructs a two-stage decision-making mixed integer linear programming model to combine the vaccination site selection and vaccine distribution problems to jointly solve the problems involved at both levels; it not only takes into account the operating costs and distribution costs of opening vaccination stations, but also allows residents to go to vaccination stations for vaccination as conveniently as possible from the perspective of residents.
[0194] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A joint analysis method for vaccination station site selection and vaccine distribution route planning, characterized in that: include: Inputting target data into a preset hierarchical decision model, wherein the hierarchical decision model is a joint model established with the goal of minimizing total cost and corresponds to a site selection stage and a distribution stage, so as to select vaccination sites and plan vaccine distribution routes, and the target data is used to characterize community vaccination information, vaccination site information, and vaccine transportation information in the target area; Randomly select a vaccination station, initialize the algorithm parameters and the first feasible solution of the site selection stage; The initialized first feasible solution is transferred to the module corresponding to the distribution stage in the hierarchical decision model, and community allocation and vaccine distribution path planning are performed based on a sequential heuristic algorithm to obtain a global feasible solution; Performing local search and perturbation on the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determining the global intermediate solution that meets a preset termination condition as the global target solution; The global target solution is decoded to obtain the target location of the vaccination station and the allocation relationship between the vaccination station and the community for path planning.
2. The joint analysis method for vaccination station site selection and vaccine distribution route planning as claimed in claim 1, characterized in that: The target data include the number of communities, the number of vaccination stations, the location of communities, the location of vaccination stations, the number of people who need to be vaccinated in each community, the upper limit of the service capacity of vaccination stations, the cost of opening vaccination stations, the unit travel cost of residents to vaccination stations, and the unit transportation cost of vehicles; The target area has a preset number and location of communities, vaccination stations and disease control centers, each community has a certain number of vaccinated people, one community corresponds to one vaccination station, and one vaccination station corresponds to at least one community; The CDC can distribute vaccines to each vaccination station by vehicle based on the vaccine demand of each vaccination station. One vehicle can perform multiple transportations and deliver vaccines to each vaccination station.
3. The joint analysis method for vaccination station site selection and vaccine distribution route planning as claimed in claim 1, characterized in that: The first feasible solution is transferred to the module corresponding to the distribution stage in the hierarchical decision model, and community allocation and vaccine distribution path planning are performed based on a sequential heuristic algorithm to obtain a global feasible solution, including: determining a first penalty cost for each community in the target area when being assigned to the second closest vaccination station instead of the closest vaccination station; Arrange all communities in descending order according to their corresponding first penalty costs to obtain a first community sequence; Based on the order in the first community sequence, assign each community to the nearest vaccination station, and determine whether each vaccination station exceeds its own service capacity threshold; When all communities are assigned and the service capacity threshold of the vaccination stations is not exceeded, the initial delivery routes that can meet the needs of all vaccination stations are generated through a greedy strategy without considering the vehicle capacity; placing the vaccination stations one by one into the initial delivery path according to the order in the delivery path, and opening a new delivery path when the vehicle capacity is insufficient, to obtain at least one intermediate delivery path; Reposition the split point of the path and place the split point at the initial position or the final position of the intermediate distribution path, so as to adjust the position of the split point to the target position in the path to shorten the distance, and generate the target distribution path of the vaccine based on the adjusted target position to obtain a globally feasible solution.
4. The joint analysis method for vaccination station site selection and vaccine distribution route planning as claimed in claim 3, characterized in that: In the case where some of the vaccination stations exceed their own service capacity thresholds, before the initial distribution path that can meet the needs of all vaccination stations is generated by the greedy strategy without considering the vehicle capacity, the joint analysis method for vaccination station site selection and vaccine distribution path planning also includes: Based on all communities in the target area, excluding the assigned communities, the community list is updated to obtain a target list; Based on all vaccination stations, excluding the vaccination stations that exceed their own service capacity thresholds, to obtain a target vaccination station sequence; determining a second penalty cost for each community in the target list when being assigned to the second closest vaccination station in the sequence of target vaccination stations instead of the closest vaccination station; Based on the second penalty cost, the communities in the target list are sequentially assigned to the vaccination stations in the target vaccination station sequence.
5. The joint analysis method for vaccination station site selection and vaccine distribution route planning according to claim 1, characterized in that: The locally searching and perturbing the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determining the global intermediate solution that satisfies a preset termination condition as the global target solution, comprises: Define a neighborhood structure, initialize the neighborhood index to 1, and calculate the objective function value of the current global feasible solution; Initialize the number of iterations to 0, and start iteration based on the neighborhood index to perform a local search for the global feasible solution; When the current number of iterations is less than or equal to the preset maximum number of iterations, and the neighborhood index is less than or equal to the preset maximum number of neighborhoods, searching for a new solution in the neighborhood to obtain an initial intermediate solution; Processing the initial intermediate solution based on a preset correction strategy to obtain a target intermediate solution, and determining an objective function value corresponding to the target intermediate solution; When the objective function value corresponding to the target intermediate solution is not better than the objective function value of the solution in the previous stage in the iterative process, the value of the neighborhood index is increased, and when the neighborhood index after the increase is less than or equal to the maximum number of neighbors, the new solution is continued to be searched in the neighborhood; When the objective function value corresponding to the target intermediate solution is better than the objective function value of the solution in the previous stage in the iterative process, the target intermediate solution is perturbed to obtain a global intermediate solution.
6. The joint analysis method for vaccination station site selection and vaccine distribution route planning as claimed in claim 5, characterized in that: The decoding process of the global target solution to obtain the target location of the vaccination station and the allocation relationship between the vaccination station and the community for path planning includes: A decoding matrix is generated based on the encoding of the global objective solution and the preset allocation scheme, wherein the decoding matrix is a K*I 0-1 matrix; wherein I represents the total number of vaccination stations and K represents the number of communities; Based on the decoding matrix, determining target locations for vaccination stations and allocation relationships between vaccination stations and communities; The constraints of the correction strategy include: Each element in the initial intermediate solution is an integer between the interval [1, I); The number of people assigned to the same vaccination station cannot exceed the upper limit of the service capacity of the vaccination station. If the number of people assigned to the vaccination station exceeds the upper limit of the service capacity of the vaccination station, the vaccination station with service capacity and closest distance will be selected for correction.
7. The joint analysis method for vaccination station site selection and vaccine distribution route planning as claimed in claim 1, characterized in that: The objective function of the hierarchical decision model satisfies the expression: Among them, S represents the node set of candidate vaccination stations, K represents the number of communities, N = S∪{0}, where 0 represents the CDC, r represents the rth route of the vehicle, and R = {1, 2…, r}; c1 represents the unit distance travel cost of residents to the vaccination station, f ik represents the distance between community k and vaccination station i, q k represents the number of residents in community k who need to be vaccinated, x ik indicates which vaccination station i is responsible for community k, c i represents the fixed cost of opening vaccination station i; u i Indicates whether vaccination station i is open, u i ∈{0, 1}, when vaccination station i is open, u i Take 1, otherwise u i Take 0; c2 represents the unit cost of vehicle transportation, d ij represents the distance between vaccination station i and vaccination station j; represents the order in which the vehicle visits vaccination stations i and j in the rth route, If the vehicle visits vaccination station i first and then vaccination station j in route r, then Take 1; The constraint satisfies the expression: The above formula ensures that all communities are assigned only once; The above formula ensures that vaccination sites that are assigned communities are open, while vaccination sites that are not assigned communities are closed; The above formula ensures that each vaccination station is visited at least once in all routes; The above formula ensures that the starting point and end point of the vehicle are both the CDC, and the route of the vehicle is continuous; The above formula ensures the elimination of subroutes in the route, where P is the vertex set of the number of people in the route; The above formula ensures that the vehicle only visits open vaccination stations, where q k represents the number of people in community k who need to be vaccinated; The above formula ensures that the total number of vaccines transported on each route does not exceed the vehicle capacity limit, where V represents the upper limit of the vehicle capacity; The above formula ensures that the number of people assigned to a vaccination station does not exceed the service capacity of the vaccination station, where G i Indicates the upper limit of the number of people that vaccination station i can serve.
8. A joint analysis device for vaccination station site selection and vaccine distribution route planning, characterized in that: include: An input module is used to input target data into a preset hierarchical decision model, wherein the hierarchical decision model is a joint model established with the goal of minimizing total cost and corresponds to a site selection stage and a distribution stage, so as to select vaccination station sites and plan vaccine distribution routes, and the target data is used to characterize community vaccination information, vaccination station information, and vaccine transportation information in the target area; An initialization module, used to randomly select a vaccination station, initialize algorithm parameters and the first feasible solution of the site selection stage; A transfer solution module, used to transfer the initialized first feasible solution to the module corresponding to the distribution stage in the hierarchical decision model, perform community allocation and vaccine distribution path planning based on a sequential heuristic algorithm, and obtain a global feasible solution; A search and perturbation module is used to perform local search and perturbation on the global feasible solution to update the global feasible solution to obtain a global intermediate solution, and determine that the global intermediate solution that meets a preset termination condition is a global target solution; The decoding module is used to decode the global target solution to obtain the target location of the vaccination station and the allocation relationship between the vaccination station and the community for path planning.
9. An electronic device, characterized in that: include: A processor, a memory, and a program stored in the memory and executable on the processor, wherein the program, when executed by the processor, implements a joint analysis method for vaccination station site selection and vaccine distribution route planning as described in any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores programs or instructions, which, when executed by a processor, implement the joint analysis method for vaccination station site selection and vaccine distribution route planning as described in any one of claims 1 to 7.
Citation Information
Cited By
Power grid metering material verification and distribution collaborative optimization method and device and storage medium
CN121052760A
Power grid metering material verification and distribution collaborative optimization method and device and storage medium
CN121052760B
