Self-adaptive multi-object evolution method adopting constraint cloud workflow scheduling
A multi-objective evolution and self-adaptive technology, applied in office automation, genetic laws, data processing applications, etc., can solve problems such as easy to fall into local optimum, and achieve excellent global detection and local mining capabilities, excellent performance, good convergence and The effect of diversity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment approach 1
[0138] In this embodiment, the time limit values are respectively set to time limit 1, time limit 2, time limit 3, and time limit 4. The scientific workflow model Epigenomics is selected, and the ai-NSGA-II-PE and the NSGA-II algorithm based on Pareto entropy (ParetoEntropy based onNSGA-II, NSGA-II-PE) (NSGA-II-PE adopts the adaptive adjustment evolutionary parameters proposed by the present invention, but uses traditional static penalty function to deal with constraints), NSGA-II, multi-objective evolutionary algorithm based on decomposition (Multi-ObjectiveEvolutionary Algorithm based on Decomposition, MOEA / D), strength Pareto evolutionary algorithm (Strength Pareto Evolutionary Algorithm 2, SPEA2), multi-objective particle swarm optimization algorithm (Multi-Objective Particle Swarm Optimization, MOPSO) were compared respectively; simulation results like image 3 , Figure 4 , Figure 5 , Figure 6 ,Depend on image 3 , Figure 4 , Figure 5 , Figure 6 It can be s...
Embodiment approach 2
[0140] In this embodiment, the time limit values are respectively set to time limit 1, time limit 2, time limit 3, and time limit 4, and the scientific workflow model Inspiral is selected, and ai-NSGA-II-PE and NSGA-II-PE (using the method proposed by the present invention) The evolutionary parameters are adaptively adjusted, but the traditional static penalty function is used to deal with the constraints), NSGA-II, MOEA / D, SPEA2, and MOPSO evolutionary algorithms are compared respectively; the simulation results are as follows Figure 7 , Figure 8 , Figure 9 , Figure 10 ,Depend on Figure 7 , Figure 8 , Figure 9 , Figure 10 It can be seen that compared with other algorithms, ai-NSGA-II-PE can find a Pareto front with better global detection and local mining effects under strict constraints.
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