An optimization method for navigation rescue scheduling based on rescue efficiency
An optimization method and efficient technology, applied in the field of aviation rescue, to achieve the effect of facilitating promotion and use, avoiding premature convergence phenomenon, and increasing the quality of population diversity and reconciliation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0059] refer to Figure 1 ~ Figure 3 As shown, a navigation rescue dispatch optimization method based on rescue efficiency, specifically includes the following steps:
[0060] Step 1: General aircraft is used as the scheduling research object, with aircraft load, flight time, and number of aircraft as constraints, and with the goal of maximizing rescue efficiency and minimizing total flight mileage, an aircraft scheduling optimization model with multiple rescue points and multiple disaster points is established;
[0061] Step 2: Use the hybrid genetic simulated annealing algorithm to solve the multi-rescue point, multi-disaster point aircraft scheduling optimization model, and obtain the best navigation rescue scheduling scheme.
[0062] The establishment of the navigation rescue dispatching model described in step 1 is as follows:
[0063] (1) The navigation rescue dispatching model has the following prerequisites
[0064] During the rescue process, the performance of each ...
example
[0105] Example: Taking the Wenchuan Earthquake as the background design example, assuming that there are 3 rescue points and 15 disaster-stricken points, each rescue point uses the Mi-171 series aircraft. The maximum load M of each aircraft f =4000kg, flight speed v=230km / h, maximum flight time L with full fuel f =4h, time t for material delivery or landing and unloading gf=0.33h, each rescue point has 5, 3, and 4 helicopters respectively, and the flight time target value T of each disaster point j = 4h. Algorithm related parameters are: population size N=100, highest crossover rate P c1 = 0.8, the lowest crossover rate P c2 =0.3, the highest mutation rate P m1 =0.06, the lowest variation rate P m2 =0.03, maximum iteration number C=1000, initial temperature T0=1000, annealing rate at=0.85.
[0106] Table 1 Data information table of various places
[0107]
[0108]
[0109] The generation of the optimal navigation rescue scheduling scheme described in step 2:
[...
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