Feature selection method in dynamic job shop scheduling rule based on GEP-VNS evolution
A GEP-VNS, job shop technology, applied in data processing applications, instruments, calculations, etc., can solve problems such as low algorithm efficiency and large search space, achieve good scheduling performance, solve large search space, and improve accuracy and efficiency Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0089] The present invention will be described in detail below with reference to the accompanying drawings and embodiments.
[0090] The feature selection method in dynamic job shop scheduling rules based on GEP-VNS evolution includes the following steps:
[0091] S1, set the basic parameters of the GEP-VNS algorithm: total number of iterations ITER, population size popsize, number of genes n, head length head, tail length tail, mutation probability p m , the recombination probability p r and the shift probability p s The number of neighborhoods z, the function set FS{+, -, ×, ÷, min, max, if}, the terminal set TS is the original feature set of the dynamic job shop, including shop-related, workpiece-related and machine-related features;
[0092] The set ITER parameter is the end condition of the algorithm. When iter>ITER, the algorithm ends and an excellent scheduling rule set for the dynamic job shop scene is given. One scheduling rule corresponds to a polygenic chromosome ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


