Critical process-combined genetic local search algorithm for solving flexible job-shop scheduling

A flexible job and job shop scheduling technology, applied in the field of flexible job shop scheduling and job shop scheduling, can solve problems such as long calculation time, unstable solution results, and large randomness of genetic search, so as to reduce computing time, facilitate genetic operations and Understand and avoid the effects of the scope of the search

Inactive Publication Date: 2017-05-03
SICHUAN YONGLIAN INFORMATION TECH CO LTD
View PDF2 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The object of the present invention is: first. Solving the problem of infeasible solution in the genetic operator operation in the evolution proces

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
  • Critical process-combined genetic local search algorithm for solving flexible job-shop scheduling
  • Critical process-combined genetic local search algorithm for solving flexible job-shop scheduling
  • Critical process-combined genetic local search algorithm for solving flexible job-shop scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention and not to limit the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative efforts fall within the protection scope of the present invention.

[0027] The invention aims at the infeasible solution of the genetic operator operation in the evolution process of the existing genetic algorithm, and for the flexible job shop scheduling problem of different scales, the different selection pairs of parameters such as population size, mutation rate and crossover rate can solve the problem Even if the same parameters are used for the solution, due to the r...

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 provides a critical process-combined genetic local search algorithm for solving flexible job-shop scheduling and aims at solving the problems that an infeasible solution can be generated by a genetic algorithm in an operation and the solving result is unstable to cause insufficient local search capability due to the randomness of local search in the prior art. The disadvantages are overcome by combining the methods of a cross repairing procedure, a critical process-based local search method and the like. According to the genetic local search algorithm, a novel vector-based encoding mode is adopted when populations are initialized, a gene repairing procedure is carried out during crossover operation of the genetic algorithm and the search range is controlled by adopting critical process-based search. The flexible job-shop scheduling problem can be solved, and the genetic local search algorithm has the characteristic of high practicability.

Description

[0001] Technical field [0002] The invention relates to the technical field of job shop scheduling, in particular to the field of flexible job shop scheduling with strong practicability. Background technique [0003] Job Shop Scheduling Problem (JSP), as one of the typical combinatorial optimization problems, its research began in the 1950s, and it can be traced back to 1954, when scientists put forward the flow shop scheduling problem of two machine tools and solve. In recent decades, more and more scholars have devoted themselves to the research of JSP due to the needs of actual production and the continuous introduction of related technologies, especially intelligent optimization algorithms. From single-resource constraints to multi-resource constraints, deterministic to uncertain, single-objective to multi-objective, small-scale to large-scale, all kinds of JSPs have been extensively studied. And the research results of some intelligent scheduling methods have been succ...

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/06G06N3/12
CPCG06Q10/04G06N3/126G06Q10/063
Inventor 龚晓慧胡成华
Owner SICHUAN YONGLIAN INFORMATION TECH CO LTD
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