Flexible workshop scheduling method for solving belt transportation time based on improved cultural gene algorithm

A kind of cultural gene algorithm and flexible operation technology, applied in the direction of genetic model, calculation, genetic law, etc., can solve the problems of small search range, slow convergence speed of local search algorithm, low search accuracy of group search algorithm, etc.

Inactive Publication Date: 2019-12-20
ZHENGZHOU UNIVERSITY OF AERONAUTICS
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] At present, there are group search algorithms and local search algorithms based on meta-heuristics to solve the FJSP problem. However, these algorithms have defects and deficiencies to a certain extent. The group search algorithm has low search accuracy and slow c

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
  • Flexible workshop scheduling method for solving belt transportation time based on improved cultural gene algorithm
  • Flexible workshop scheduling method for solving belt transportation time based on improved cultural gene algorithm
  • Flexible workshop scheduling method for solving belt transportation time based on improved cultural gene algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0038] Embodiment 1, the improved cultural genetic algorithm of the present invention solves the flexible job shop scheduling method with transportation time, which is characterized in that it includes the following steps:

[0039] Step 1: Parameter setting

[0040] Set the cultural gene algorithm to solve the relevant parameters of FJSP with transportation time, including: population size N pop , completely random initialization probability P A , priority minimum processing time initialization probability P B , the priority maximum remaining processing time initialization probability P C , number of iterations N iter , the optimal solution retaining algebra N re , crossover probability P xovr , the initial mutation probability P mutr0 , initial temperature T 0 , end temperature T f , the number of disturbances L k , temperature attenuation coefficient α, adjustment coefficient t, elite pool size N E .

[0041] The termination condition of cultural gene algorithm is...

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 cultural gene algorithm for solving a flexible job shop scheduling method with transportation time, which can effectively solve a flexible job shop scheduling scheme with transportation time. According to the technical scheme, the method comprises the following steps; 1, setting parameters; 2, generating an initial population through three initialization methods; 3, calculating a current optimal solution; 4, judging whether the algorithm is terminated or not; 5, executing a mutation operator; 6, forming a new population; 7, calculating the maximum completion time of the population individuals. The encoding mode is simple and easy to implement, the algorithm operation efficiency is improved, repeated search of neighborhood solutions of excellent individuals is avoided through the elite library and the mutation probability, and the search efficiency is improved.

Description

technical field [0001] The invention relates to the field of flexible job shop scheduling, in particular to a method for solving flexible job shop scheduling with transportation time by an improved cultural gene algorithm. Background technique [0002] In recent years, more and more efficient intelligent automated production methods have attracted widespread attention from the society. Products are developing in a more personalized and customized direction, and the assembly line production organization is more flexible, which makes the scheduling problem more complicated. Flexible Job Shop Scheduling Problem (FJSP) is an NP-hard combinatorial optimization problem, and it is an important extension of Job Shop Scheduling Problem (JSP). In the JSP problem, the process of the workpiece corresponds to the machine one by one, which is not in line with the actual production status. In the FJSP problem, the processing machine for each process is not unique, and the processing time ...

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/04G06Q10/06G06Q50/04G06N3/12
CPCG06N3/126G06Q10/04G06Q10/0631G06Q50/04Y02P90/30
Inventor 张国辉孙靖贺张海军闫琼刘星贾佳宋晓辉张理涛
Owner ZHENGZHOU UNIVERSITY OF AERONAUTICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap