Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Improved genetic algorithm for flexible job shop scheduling with moving time

A technology of improved genetic algorithm and moving time, which is applied in the field of flexible job shop scheduling with moving time by improved genetic algorithm, and can solve problems such as the influence of moving time

Active Publication Date: 2018-12-18
ZHENGZHOU UNIVERSITY OF AERONAUTICS
View PDF3 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In view of the above situation, in order to overcome the defects of the prior art, the present invention provides an improved genetic algorithm to solve the flexible job shop scheduling method with moving time, which effectively solves the problem of the impact of objectively existing moving time in the actual production process

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Improved genetic algorithm for flexible job shop scheduling with moving time
  • Improved genetic algorithm for flexible job shop scheduling with moving time
  • Improved genetic algorithm for flexible job shop scheduling with moving time

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0059] The present invention solves the flexible job shop scheduling method with moving time for improving genetic algorithm, is characterized in that, comprises the following steps:

[0060] Step 1, set parameters; determine the population size P, the number of iterations G, and the crossover probability P c , variation probability P m Wait;

[0061] Step 2, population initialization, using random selection method to randomly generate population individuals;

[0062] Step 3: Calculate and evaluate the fitness value of each chromosome in the population, i.e. the target value, and compare its size. If the output condition is met or the approximate optimal solution is completed, the operation is completed; otherwise, step 4 is performed;

[0063] Step 4, use the tournament method to select and select the next generation population;

[0064] Step 5, perform crossover according to the crossover strategy for the chromosomal individuals satisfying the crossover probability in the...

Embodiment 2

[0084] Embodiment two, on the basis of embodiment one, in order to provide a better embodiment, the main parameter of genetic algorithm is set as follows: population size P=40, crossover probability P c =0.8, mutation probability P m = 0.6, the maximum genetic algebra G is 200 generations.

Embodiment 3

[0085] Embodiment three, on the basis of embodiment one,

[0086] The initialization method of FJSP:

[0087] When the genetic algorithm is used to solve the target problem, the quality of the initial solution directly affects the solution quality of the algorithm and the convergence speed of the solution. Because FJSP not only needs to solve the problem of machine selection, but also needs to solve the problem of sequence of processing procedures. Aiming at the characteristics of FJSP, the machine selection part in the chromosome of the present invention adopts an integer random initialization method, that is, the number on each gene position on the chromosome indicates that the processing procedure is randomly generated in the sequence number of the optional machine set. The specific execution steps are as follows:

[0088] 1) In the optional workpiece set, select the first workpiece, and select the first process of the current workpiece;

[0089] 2) Randomly select a mac...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to an improved genetic algorithm for solving a flexible job shop scheduling method with moving time, which effectively solves the problem that the existing algorithm ignores moving time and may affect the processing quality of a product in some specific production fields. The technical scheme for solving the problem comprises the following steps: 1. setting parameters; 2, initializing a population, and randomly generating a population individual by using a random selection method; 3, calculating, evaluating the fitness value of each chromosome in the population and carrying out size comparison, if the condition is satisfied or the approximate optimal solution is finished, otherwise, executing the step 4; 4, selecting the next generation population by using a tournament selection method; 5, that chromosome individual satisfying the crossover probability in the population; 6, compiling that chromosome individuals satisfying the mutation probability to obtain a new population; 7, returning to step 3. The invention realizes fast optimization of the scheduling scheme.

Description

technical field [0001] The invention relates to the technical field of flexible job shop scheduling, in particular to an improved genetic algorithm to solve the flexible job shop scheduling method with moving time. Background technique [0002] The flexible job shop scheduling problem (Flexible Job Shop Scheduling Problem, FJSP) is a new problem extended on the basis of the traditional job shop scheduling problem. At present, there are many studies on swarm intelligence optimization algorithms for flexible job shop scheduling problems, such as genetic algorithm (Genetic Algorithm, GA), particle swarm optimization (Particle Swarm Optimization, PSO), ant colony algorithm (Ant Colony Optimization, ACO), gray wolf optimization algorithm (Grey Wolf Optimization, GWO), teaching and learning optimization algorithm (Teaching Learning Based Optimization, TLBO). [0003] However, only a few scholars have explored the research on the moving time between processes. In the actual produ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06Q10/06G06N3/12G06N3/00G06Q50/04
CPCG06N3/008G06N3/126G06Q10/06316G06Q50/04Y02P90/30
Inventor 张国辉张海军闫琼杨洋洋朱宝英
Owner ZHENGZHOU UNIVERSITY OF AERONAUTICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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