Order insertion scheduling method based on genetic algorithm and fireworks algorithm
A technology of fireworks algorithm and genetic algorithm, which is applied in the field of order insertion and scheduling based on genetic algorithm and fireworks algorithm, can solve the problems of large time loss, low scheduling efficiency, and increased frequency of order insertion, so as to improve accuracy and improve Efficiency and the effect of reducing time loss
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0074] Example 1: As shown, a plug-in scheduled method based on genetic algorithm and firework algorithm, including the following steps:
[0075] S1 sets the initial parameters, the initial parameters include population scale, elite scale h, number of variations, and total iterative;
[0076] S2 Select the interlocking mode for order sorting scheduled scheme or the smallest interlocking mode based on the loss;
[0077] S3 gets original orders and plug orders, generates initial seeds according to the set population, and starts iteration as the current population;
[0078] S4 performs population crossings for the current population to obtain a crossworm;
[0079] S5 performs a group variant of a crossed population according to the number of set variations, and is obtained by genetic groups;
[0080] S6 calculates the size of the fireworks based on the dynamic regulating mechanism based on the convergence, and remembers F, Among them, C represents the convergence index, and a repres...
Embodiment 2
[0087] Embodiment 2: Selecting the interpretation schedule in step S2 is based on order sorting mode;
[0088] The specific method of generating the initial population in step S3 is:
[0089] A-1 Get the order rights sequence, determine that the plug order is inserted into the plug order in the order rights sequence, and obtains the order sequence after the plug order is in the plug position in the order rights sequence.
[0090] A-2 acquires the original gene sequence fragment corresponding to each original order in the order sequence, and performs Gaussian variation from each original gene sequence sequence to the Gaussian variation, which is used for each plug order in the order sequence. The randomly generated manner generates its corresponding gene sequence fragment, and the gene sequence fragment corresponding to the Gaussian variation of the Gaussian desert sequence is serially connected in series in order of the order sequence, and the total gene sequence is used as one Th...
Embodiment 3
[0112] Embodiment 3: Selecting the interpretation scheme in step S2 is based on the minimum loss of loss;
[0113] The specific method of generating the initial population in step S3 is:
[0114] I-1 After encoding the procedure in the plug order, i-1 randomly generates a gene fragment, and records G1, obtains the original gene sequence corresponding to the original order, and performs Gaussian variation of Gaussi variation after each original gene sequence. And recorded as G2;
[0115] I-2 Compositions of gene sequences of initial individuals in accordance with G1 in front of G2;
[0116] I-3 Repeat steps I-1 to I-2 until the number of initial individuals reaches the set population size, and all of the resulting initial individuals constitute initial groups;
[0117] In step S4, the current population is cross-operated, and the specific method of obtaining the cross-over population is:
[0118] J-1 is generated in the [1, N) interval, generates a random number K "', where n repre...
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