Disaster assistance ambulance path planning method based on multi-agent genetic algorithm
A genetic algorithm and multi-agent technology, applied in computing, instrumentation, data processing applications, etc., can solve problems such as easy to fall into local optimum and slow operation speed, improve global search ability, and improve the results of operation convergence. The effect of algorithm performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0035] With the development of the economy, various sudden disasters, including natural disasters, frequently occur and constantly invade our lives, threatening people's lives. A large number of patients appear at the same time in a disaster, and they all need medical assistance. A reasonable method of ambulance route planning can rescue more patients faster, which is very meaningful in disaster rescue.
[0036] Multi-agent genetic algorithm is an optimization algorithm based on the agent's ability to perceive and react to the environment. It replaces the evolution of the population with the grid of agents. Each individual can only perceive its local environment and can only communicate with its neighbors. domain interactions. The main advantages of multi-agent genetic algorithm are small population size and high algorithm stability, but there are also disadvantages that it is easy to fall into local optimum.
[0037]Aiming at the above-mentioned problem of easily falling int...
Embodiment 2
[0059] The disaster rescue ambulance path planning method based on the multi-agent genetic algorithm is the same as embodiment 1, and the path of the ambulance is initialized by encoding in step (2a), including the following steps:
[0060] (2a-1) The basic requirements of the agent: the population size of the agent grid L of the ambulance initial planning scheme is L size × L size , each grid point in the agent grid represents an agent, the agent cannot move, and can only perceive the information of its neighbors, that is to say, it can only interact with its adjacent agents. An agent contains a path plan sequence, and each path plan sequence in the agent grid is a chromosome, but a chromosome is not equal to an agent, it is only a path plan sequence for an ambulance, and a path plan for an ambulance The scenario sequence contains multiple ambulance routes.
[0061] (2a-2) Initialize the chromosome information in the agent: use 0 to m–1 to represent ambulances, m is the tot...
Embodiment 3
[0063] The disaster rescue ambulance path planning method based on the multi-agent genetic algorithm is the same as embodiment 1, in step (4), find the contemporary optimal path scheme and the globally optimal path scheme in the agent grid by iteration, specifically including have:
[0064] (4a) Using the fitness function formula, calculate the weighted sum of the latest service time of the red and green marked patients of each path scheme sequence; select the best path scheme found in this generation;
[0065] (4b) Execute the local search operator to optimize the contemporary optimal path; the local search operator of the present invention can also be called a self-learning operator, including 2-opt operator, 2-swap operator and 1-Insertion operator3 operator; the local search operator searches for as many excellent path schemes as possible through its own optimization learning; if the newly generated scheme is better than the contemporary optimal path scheme, the new indivi...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com