Fast non-dominated sorting genetic algorithm for dynamic equivalent parallel machine scheduling problem
A non-dominated sorting, efficient parallel computer technology, applied in the fields of genetic laws, computing, office automation, etc., to achieve the effect of achieving diversity and convergence, improving search efficiency and solution quality
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0099] Embodiment: a kind of improved fast non-dominated sorting genetic algorithm facing dynamic equivalent parallel machine scheduling problem, such as figure 1 shown, follow the steps below:
[0100] s1: Generate an initial population P of size N by mixing heuristic rules MODD (Modified due date), ATC (Apparent tardiness cost), X-RM (X-dispatch ATC) and random rules t .
[0101] S2: Using the decoding method based on dynamic programming, calculate the maximum completion time C of each individual max and the total overdue time and ∑T j (Total Tardiness).
[0102] s3: Determine whether the termination condition is met. If yes, end; otherwise, for population P t The individuals in are subjected to quick non-dominated sorting.
[0103] s4: Generate offspring population Q through genetic operators such as adaptive probability crossover and mutation, elite selection strategy t .
[0104] S5: the parent population P t and offspring population Q t A population R of size ...
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