Route generation method and system of home-based care bath-assisting service center

Abstract

The embodiment of the invention provides a route generation method and system for a home-based care bath-assisting service center, and belongs to the technical field of dispatching of bath-assisting vehicles. The method comprises the following steps: acquiring basic attribute information of a node to be served and a service center; generating a plurality of service routes according to the basic attribute information and the pheromone matrix to form a population; performing a neighborhood descent search method on each service route in the population to obtain a plurality of better solutions; judging whether the minimum value of the fitness of the plurality of better solutions is smaller than or equal to a preset threshold value or not; when it is judged that the minimum value of the fitness of the multiple optimal solutions is smaller than or equal to a threshold value, the service route corresponding to the minimum value is selected to serve as the optimal solution to be output; when it is judged that the minimum value of the fitness of the multiple optimal solutions is larger than a threshold value, a preset number of service routes are selected from the multiple optimal solutions according to the preset fitness from small to large; and updating the pheromone matrix according to the selected service route.

Description

Technical Field

[0001] The present invention relates to the technical field of scheduling bathing-assisting vehicles, and in particular to a method, device, storage medium and processor for processing field information. Background Art

[0002] As the global population aging trend intensifies, the number of elderly people continues to rise. This social phenomenon has had a profound impact on many industries, especially the field of elderly care and medical services. Due to the natural decline of physical functions, the elderly often face problems such as mobility difficulties and reduced self-care ability, which makes it difficult for traditional home care models to meet their growing needs. Especially in bathing and daily medical treatment, the elderly need more professional help and support.

[0003] In order to meet this challenge, the elderly bathing and medical service industry has emerged, aiming to provide more convenient and professional door-to-door services for the elderly. Such services usually consist of mobile bathing vehicles or medical vehicles equipped with professional caregivers and necessary medical equipment, which can go directly to the customer's home or designated location to provide the elderly with a safe and comfortable bathing experience as well as basic medical examinations and treatments. This service model not only reduces the care pressure of family members, but also improves the quality of life of the elderly, allowing them to be properly cared for in a familiar environment.

[0004] However, despite the increasing demand, elderly bathing and medical services still face many challenges in actual operation, one of which is the route planning problem. Since the service recipients live in scattered areas and each elderly person has different specific needs, health conditions and appointment times, how to efficiently arrange service routes and ensure that each service can be delivered on time and accurately has become the key to improving service efficiency and satisfaction. In addition, considering factors such as emergency handling, changes in traffic conditions and the dispatch of service personnel, the complexity of route planning is further increased.

[0005] At present, although some service providers have begun to try to use information technology to assist management, such as using GPS positioning, electronic maps and other tools for preliminary route planning, these methods often lack systematicity and intelligence, and it is difficult to fully consider all influencing factors and achieve the selection of the optimal route. Therefore, the development of a route optimization system specifically for the characteristics of elderly bathing and medical services has become an urgent problem to be solved in the industry. Such a system should be able to comprehensively analyze customer needs, geographical location, traffic conditions, service resource distribution and other information, and through advanced algorithm models, plan the most economical and efficient driving routes for bathing-assisted vehicles, thereby improving the service level and operational efficiency of the entire industry. Summary of the invention

[0006] The purpose of the embodiments of the present invention is to provide a route generation method and system for a home-based elderly care and bathing assistance service center, which can improve the efficiency of elderly care and bathing assistance services.

[0007] In order to achieve the above object, an embodiment of the present invention provides a route generation method for a home-based elderly care bathing service center, comprising:

[0008] Obtain basic attribute information of the node to be served and the service center;

[0009] Generate a plurality of service routes according to the basic attribute information and the pheromone matrix to form a population;

[0010] Performing a neighborhood descent search method on each service route in the population to obtain multiple optimal solutions;

[0011] Determine whether the minimum value of the fitness of the plurality of the better solutions is less than or equal to a preset threshold;

[0012] When it is determined that the minimum value of the fitness of the plurality of the better solutions is less than or equal to the threshold, selecting the service route corresponding to the minimum value to output as the best solution;

[0013] When it is determined that the minimum value of the fitness of the plurality of the better solutions is greater than the threshold, selecting a preset number of service routes from the plurality of the better solutions in a preset ascending order of fitness;

[0014] The pheromone matrix is ​​updated according to the selected service route, and the step of returning to execute generating a plurality of service routes according to the basic attribute information and the pheromone matrix to form a population is performed.

[0015] Optionally, obtain basic attribute information of the node to be served and the service center, including:

[0016] Obtaining the locations of the nodes and service centers;

[0017] Obtain the demand type and demand time window of each of the nodes.

[0018] Optionally, generating a plurality of service routes according to the basic attribute information and the pheromone matrix includes:

[0019] Update the personnel composition of the bathing vehicle;

[0020] Determine the current location of the bathing assistance vehicle, wherein the initial current location is the service center;

[0021] Calculate the nodes at the preset distance from the current position of the bathing assistance vehicle respectively;

[0022] Determine respectively whether the bathing assistance vehicle can currently complete the service task of the node;

[0023] When it is determined that the bathing assistance vehicle is currently capable of completing the service task of the node, the corresponding node is added to the set of nodes to be selected at the current location;

[0024] Generate a transition probability of each of the nodes in the set of nodes to be selected;

[0025] Selecting one of the nodes as a new node that the bathing vehicle needs to serve according to the transfer probability;

[0026] If it is determined that the bathing assistance vehicle is currently unable to complete the service task of the node, the generated route is stored, the counted time window of the bathing assistance vehicle is cleared, and the step of determining the current location of the bathing assistance vehicle is returned to be executed;

[0027] Determine whether there is a node to be served at present;

[0028] In the case where it is determined that there is a node to be served, the current location of the bathing assistance vehicle is updated, and the step of returning to execute the calculation of nodes at a preset distance from the current location of the bathing assistance vehicle is performed;

[0029] When it is determined that there is no node to be served currently, the stored routes are aggregated to obtain the service route.

[0030] Optionally, the route generation method includes:

[0031] The fitness is calculated according to formula (1):

[0032]

[0033] Among them, V 0,n+1 is the set of all nodes, V n+1 is the set that does not include the node as the starting point, R is the set of bathing vehicles, d ij is the distance from the i-th node to the j-th node, is the decision variable indicating whether the bathing vehicle r moves from the i-th node to the j-th node.

[0034] Optionally, respectively judging whether the bathing assistance vehicle is currently capable of completing the service task of the node includes:

[0035] Determine whether the bathing assistance vehicle can meet the demand type of the node;

[0036] In the case where it is determined that the bathing assistance vehicle can meet the demand type of the node, it is determined whether the remaining time window of the bathing assistance vehicle can meet the demand time window of the node;

[0037] In the case where it is determined that the remaining time window of the bathing assistance vehicle can meet the required time window of the node, determining that the bathing assistance vehicle can complete the service task of the node;

[0038] When it is determined that the bathing assistance vehicle cannot meet the demand type of the node and / or the remaining time window of the bathing assistance vehicle cannot meet the demand time window of the node, it is determined that the bathing assistance vehicle cannot complete the service task of the node.

[0039] Optionally, generating the transition probability of each node in the set of nodes to be selected includes:

[0040] The transition probability is generated according to formula (2):

[0041]

[0042] in, is the transfer probability of the bathing vehicle r from the i-th node to the j-th node, α is the pheromone importance factor, β is the heuristic function pheromone importance factor, τ ij is the pheromone concentration between the i-th node and the j-th node, η ij is the heuristic function between the i-th node and the j-th node, τ ik is the pheromone concentration between the i-th node and the k-th node, η ik is the heuristic function between the i-th node and the k-th node, allowed r is the node set of the bathing vehicle r.

[0043] Optionally, updating the pheromone matrix according to the selected service route includes:

[0044] Update the pheromone matrix according to formula (3):

[0045] τ ij (t+1)=τ ij (t)*(1-ρ)+Δτ ij (0<ρ<1), (3)

[0046] Among them, τ ij (t+1) is the sum of the pheromone concentrations between the i-th node and the j-th node after update, τ ij (t) is the pheromone concentration between the i-th node and the j-th node before the update, ρ is the pheromone volatility, represents the pheromone concentration of the rth bathing vehicle between the i-th node and the j-th node, and m is the number of bathing vehicles releasing pheromones between the i-th node and the j-th node.

[0047] Optionally, the route generation method further includes:

[0048] In the case where it is determined that the minimum value of the fitness of the multiple better solutions is greater than the threshold, determining whether the current number of iterations is greater than or equal to a preset number threshold;

[0049] When it is determined that the number of iterations is greater than or equal to the number threshold, the process returns to the step of updating the personnel composition of the bathing assistance vehicle.

[0050] On the other hand, the present invention also provides a route generation system for a home-based elderly care and bathing assistance service center, the route generation system comprising a processor, and the processor is configured to execute any of the route generation methods described above.

[0051] Through the above technical scheme, the embodiment of the present invention provides a route generation method and system for a home-based elderly care and bathing assistance service center. The method and system, by combining factors such as the needs and locations of the service center and the nodes to be served, specifically adopt an improved ant colony algorithm to generate paths, thereby improving the access efficiency of bathing assistance vehicles and thus improving the overall advancement of elderly care and bathing assistance services.

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

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

[0054] Figure 1 is a flow chart of a route generation method for a home-based elderly care bathing service center according to an embodiment of the present invention;

[0055] Figure 2 is a flow chart of a route generation method of a method for obtaining a service route according to an embodiment of the present invention;

[0056] Figure 3 It is a comparison diagram of the path lengths (fitness function values) of service routes generated by different methods according to an embodiment of the present invention. DETAILED DESCRIPTION

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

[0058] like Figure 1The figure is a flow chart of a route generation method of a home-based elderly care bathing service center according to one embodiment of the present invention. Figure 1 In the method, the method may include the following steps:

[0059] In step S10, basic attribute information of the node to be served and the service center is obtained;

[0060] In step S11, a plurality of service routes are generated according to the basic attribute information and the pheromone matrix to form a population;

[0061] In step S12, a neighborhood descent search method is performed on each service route in the population to obtain multiple optimal solutions;

[0062] In step S13, it is determined whether the minimum value of the fitness of multiple optimal solutions is less than or equal to a preset threshold;

[0063] In step S14, when it is determined that the minimum value of the fitness of multiple better solutions is less than or equal to the threshold, the service route corresponding to the minimum value is selected to be output as the best solution;

[0064] In step S15, when it is determined that the minimum value of the fitness of the multiple optimal solutions is greater than the threshold, a preset number of service routes are selected from the multiple optimal solutions in the order of preset fitness from small to large;

[0065] In step S16, the pheromone matrix is ​​updated according to the selected service route, and the process returns to the step of generating a plurality of service routes according to the basic attribute information and the pheromone matrix to form a population, that is, returns to step S11.

[0066] In this Figure 1 In the method shown, step S10 is used to obtain basic attribute information of the node to be served and the service center. The basic attribute information may be in various forms known to those skilled in the art. In one example of the present invention, the basic attribute information may include the location of the node to be served and the service center, the demand type of each node, and the demand time window. Therefore, in this example, step S10 may also be to obtain the location of the node and the service center, and to obtain the demand type and demand time window of each node.

[0067] Step S11 may be used to generate a plurality of service routes according to the basic attribute information and the pheromone matrix to form a population. Specifically, in this embodiment, the method for obtaining the service route may include: Figure 2 In the steps shown in Figure 2 In the method for obtaining the service route, the method may include the following steps:

[0068] In step S20, the personnel composition of the bathing assistance vehicle is updated;

[0069] In step S21, the current location of the bathing vehicle is determined, wherein the initial current location is the service center;

[0070] In step S22, nodes at a preset distance from the current location of the bathing assistance vehicle are respectively calculated;

[0071] In step S23, it is respectively determined whether the bathing assistance vehicle can currently complete the service task of the node. Among them, the specific method for determining whether the bathing assistance vehicle can complete the service task of the node can be various forms known to those skilled in the art. However, considering that the aforementioned basic information includes the demand time window and demand type of the node, in this example, the method for determining whether the bathing assistance vehicle can complete the service task of the node can be to first determine whether the bathing assistance vehicle can meet the demand type of the node. In the case of determining that the bathing assistance vehicle can meet the demand type of the node, it is further determined whether the remaining time window of the bathing assistance vehicle can meet the demand time window of the node. In the case of determining that the remaining time window of the bathing assistance vehicle can meet the demand time window of the node, it is determined that the bathing assistance vehicle can complete the service task of the node. On the contrary, in the case of determining that the bathing assistance vehicle cannot meet the demand type of the node and / or the remaining time window of the bathing assistance vehicle cannot meet the demand time window of the node, it is determined that the bathing assistance vehicle cannot complete the service task of the node.

[0072] In step S24, when it is determined that the bathing assistance vehicle can currently complete the service task of the node, the corresponding node is added to the set of nodes to be selected at the current location;

[0073] In step S25, the transition probability of each node in the set of nodes to be selected is generated. The specific calculation method of the transition probability can be various forms known to those skilled in the art. In one example of the present invention, the transition probability can be calculated using the following formula (2):

[0074]

[0075] in, is the transfer probability of the bathing vehicle r from the i-th node to the j-th node, α is the pheromone importance factor, β is the heuristic function pheromone importance factor, τ ij is the pheromone concentration between the i-th node and the j-th node, η ij is the heuristic function between the i-th node and the j-th node, τ ik is the pheromone concentration between the i-th node and the k-th node, η ik is the heuristic function between the i-th node and the k-th node, allowed r is the node set of the bathing vehicle r.

[0076] In step S26, a node is selected as a new node that the bathing vehicle needs to serve according to the transfer probability;

[0077] In step S27, if it is determined that the bathing assistance vehicle is currently unable to complete the service task of the node, the generated route is stored, the counted time window of the bathing assistance vehicle is cleared, and the step of determining the current location of the bathing assistance vehicle is returned to execute, that is, returning to execute step S21;

[0078] In step S28, it is determined whether there is a node to be served;

[0079] In step S29, when it is determined that there is a node to be served, the current location of the bathing assistance vehicle is updated, and the process of calculating nodes at a preset distance from the current location of the bathing assistance vehicle is returned, that is, the process of returning to step S22 is executed;

[0080] In step S30, when it is determined that there is no node to be served, the stored routes are aggregated to obtain a service route.

[0081] Step S12 can be used to perform a neighborhood descent search method on each service route in the population to obtain multiple optimal solutions. The specific steps of the neighborhood descent search method can be in various forms known to those skilled in the art. The fitness function of the neighborhood descent search method for searching for optimal solutions can be calculated according to the following formula (1) in one example of the present invention:

[0082]

[0083] Among them, V 0,n+1 is the set of all nodes, V n+1 is the set that does not include the node as the starting point, R is the set of bathing vehicles, d ij is the distance from the i-th node to the j-th node, is the decision variable indicating whether the bathing vehicle r moves from the i-th node to the j-th node.

[0084] Step S13 is used to determine whether the minimum value of the fitness of multiple optimal solutions is less than or equal to a preset threshold. When it is determined that the minimum value is less than or equal to the threshold, it means that the optimization of the service route has reached the expected requirements, so the service route corresponding to the minimum value can be directly selected from multiple optimal solutions as the optimal solution output. On the contrary, if the minimum value is greater than the threshold, it is necessary to return to iterate again. Considering that the re-iteration needs to generate different service routes, the pheromone matrix needs to be updated, that is, step S16. The specific method for updating the pheromone matrix can be a variety of forms known to those skilled in the art. In this example, the pheromone matrix can be preferably updated using the following formula (3):

[0085] τ ij (t+1)=τ ij (t)*(1-ρ)+Δτ ij (0<ρ<1), (3)

[0086] Among them, τ ij (t+1) is the sum of the pheromone concentrations between the i-th node and the j-th node after update, τ ij (t) is the pheromone concentration between the i-th node and the j-th node before the update, ρ is the pheromone volatility, represents the pheromone concentration of the rth bathing vehicle between the i-th node and the j-th node, and m is the number of bathing vehicles releasing pheromones between the i-th node and the j-th node.

[0087] In addition, considering that a single bathing vehicle carries different numbers or types of nursing staff, the output of the optimal solution may also be affected. Therefore, in one example of the present invention, when it is determined in step S13 that the minimum value of the fitness of multiple optimal solutions is greater than a threshold, it is possible to further determine whether the current number of iterations is greater than or equal to a preset number threshold, so as to determine whether further adjustment of parameters is required to obtain the optimal solution, that is, when it is determined that the number of iterations is greater than or equal to the number threshold, return to the step of updating the personnel composition of the bathing vehicle (step S20).

[0088] In order to verify the technical effect of the method provided by the present invention, in an example of the present invention, the same set of data can be used to process the data using the method (ACOVND), ACO (Ant Colony Optimization), GA (Genetic Algorithm), and SA (Structured Analysis) provided by the present invention, and the comparison diagram of the obtained path length (fitness function value) is as follows: Figure 3 As shown. Figure 3It can be clearly seen that the method provided by the present invention can significantly reduce the cumulative travel distance of the bathing-assisting vehicle, thereby improving the transportation efficiency of the bathing-assisting vehicle.

[0089] On the other hand, the present invention also provides a route generation system for a home-based elderly care and bathing assistance service center, the route generation system comprising a processor, and the processor is configured to execute any of the route generation methods described above.

[0090] Through the above technical scheme, the embodiment of the present invention provides a route generation method and system for a home-based elderly care and bathing assistance service center. The method and system, by combining factors such as the needs and locations of the service center and the nodes to be served, specifically adopt an improved ant colony algorithm to generate paths, thereby improving the access efficiency of bathing assistance vehicles and thus improving the overall advancement of elderly care and bathing assistance services.

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

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

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

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

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

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

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

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

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

Claims

1. A route generation method for a home-based elderly care bathing service center, characterized in that: The route generation method comprises: Obtain basic attribute information of the node to be served and the service center; Generate a plurality of service routes according to the basic attribute information and the pheromone matrix to form a population; Performing a neighborhood descent search method on each service route in the population to obtain multiple optimal solutions; Determine whether the minimum value of the fitness of the plurality of the better solutions is less than or equal to a preset threshold; When it is determined that the minimum value of the fitness of the plurality of the better solutions is less than or equal to the threshold, selecting the service route corresponding to the minimum value to output as the best solution; When it is determined that the minimum value of the fitness of the plurality of the better solutions is greater than the threshold, selecting a preset number of service routes from the plurality of the better solutions in a preset ascending order of fitness; The pheromone matrix is ​​updated according to the selected service route, and the step of returning to execute generating a plurality of service routes according to the basic attribute information and the pheromone matrix to form a population is performed.

2. The route generation method according to claim 1, characterized in that: Get the basic attribute information of the node to be served and the service center, including: Obtaining the locations of the nodes and service centers; Obtain the demand type and demand time window of each of the nodes.

3. The route generation method according to claim 1, characterized in that: A plurality of service routes are generated according to the basic attribute information and the pheromone matrix, including: Update the personnel composition of the bathing vehicle; Determine the current location of the bathing assistance vehicle, wherein the initial current location is the service center; Calculate the nodes at the preset distance from the current position of the bathing assistance vehicle respectively; Determine respectively whether the bathing assistance vehicle can currently complete the service task of the node; When it is determined that the bathing assistance vehicle is currently capable of completing the service task of the node, the corresponding node is added to the set of nodes to be selected at the current location; Generate a transition probability of each of the nodes in the set of nodes to be selected; Selecting one of the nodes as a new node that the bathing vehicle needs to serve according to the transfer probability; If it is determined that the bathing assistance vehicle is currently unable to complete the service task of the node, the generated route is stored, the counted time window of the bathing assistance vehicle is cleared, and the step of determining the current location of the bathing assistance vehicle is returned to be executed; Determine whether there is a node to be served at present; In the case where it is determined that there is a node to be served, the current location of the bathing assistance vehicle is updated, and the step of returning to respectively calculate the nodes at a preset distance from the current location of the bathing assistance vehicle is executed; When it is determined that there is no node to be served currently, the stored routes are aggregated to obtain the service route.

4. The route generation method according to claim 3, characterized in that: The route generation method comprises: The fitness is calculated according to formula (1): Among them, V 0,n+1 is the set of all nodes, V n+1 is the set that does not include the node as the starting point, R is the set of bathing vehicles, d ij is the distance from the i-th node to the j-th node, is the decision variable indicating whether the bathing vehicle r moves from the i-th node to the j-th node.

5. The route generation method according to claim 3, characterized in that: Determining whether the bathing assistance vehicle can currently complete the service task of the node includes: Determine whether the bathing assistance vehicle can meet the demand type of the node; In the case where it is determined that the bathing assistance vehicle can meet the demand type of the node, it is determined whether the remaining time window of the bathing assistance vehicle can meet the demand time window of the node; In the case where it is determined that the remaining time window of the bathing assistance vehicle can meet the required time window of the node, determining that the bathing assistance vehicle can complete the service task of the node; When it is determined that the bathing assistance vehicle cannot meet the demand type of the node and / or the remaining time window of the bathing assistance vehicle cannot meet the demand time window of the node, it is determined that the bathing assistance vehicle cannot complete the service task of the node.

6. The route generation method according to claim 3, characterized in that: Generating the transition probability of each node in the set of nodes to be selected, comprising: The transition probability is generated according to formula (2): in, is the transfer probability of the bathing vehicle r from the i-th node to the j-th node, α is the pheromone importance factor, β is the heuristic function pheromone importance factor, τ ij is the pheromone concentration between the i-th node and the j-th node, η ij is the heuristic function between the i-th node and the j-th node, τ ik is the pheromone concentration between the i-th node and the k-th node, η ik is the heuristic function between the i-th node and the k-th node, allowed r is the node set of the bathing vehicle r.

7. The route generation method according to claim 1, characterized in that: Updating the pheromone matrix according to the selected service route includes: Update the pheromone matrix according to formula (3): t ij (t+1)=τ ij (t)*(1-ρ)+Δτ ij (0<ρ<1), (3) Among them, τ ij (t+1) is the sum of the pheromone concentrations between the i-th node and the j-th node after update, τ ij (t) is the pheromone concentration between the i-th node and the j-th node before the update, ρ is the pheromone volatility, represents the pheromone concentration of the rth bathing vehicle between the i-th node and the j-th node, and m is the number of bathing vehicles releasing pheromones between the i-th node and the j-th node.

8. The route generation method according to claim 3, characterized in that: The route generation method further includes: In the case where it is determined that the minimum value of the fitness of the multiple better solutions is greater than the threshold, determining whether the current number of iterations is greater than or equal to a preset number threshold; When it is determined that the number of iterations is greater than or equal to the number threshold, the process returns to the step of updating the personnel composition of the bathing assistance vehicle.

9. A route generation system for a home-based elderly care bathing service center, characterized in that: The route generation system comprises a processor, and the processor is configured to execute the route generation method according to any one of claims 1 to 8.

Images