Priority encoding-based hybrid genetic algorithm for solving job-shop scheduling problem

A hybrid genetic algorithm and job shop technology, applied in the field of computer-executed manufacturing systems, can solve problems such as increased convergence speed and low pheromone convergence speed, so as to enhance performance and avoid excessive execution time

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

AI Technical Summary

Problems solved by technology

Due to the shortage and randomness of pheromone in the early stage of ACO algorithm, the convergence speed is low, but the convergence speed increases significantly in the later stage.

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
  • Priority encoding-based hybrid genetic algorithm for solving job-shop scheduling problem
  • Priority encoding-based hybrid genetic algorithm for solving job-shop scheduling problem
  • Priority encoding-based hybrid genetic algorithm for solving job-shop scheduling problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] The invention mixes the self-adaptive genetic algorithm and the improved ant colony algorithm. The invention first utilizes the self-adaptive genetic algorithm to initialize the pheromone distribution, and then executes the improved ant colony algorithm. This algorithm combines the advantages of the two algorithms, avoids the problems of searching for local optimal solutions and long execution time, and overcomes their respective shortcomings. And the performance of the hybrid algorithm is better than that of the previous one, and the performance of the algorithm is better as the size of JSP increases.

[0023] Attached below figure 1 - image 3 and Examples describe the present invention in detail.

[0024] The job shop scheduling problem refers to the timing distribution problem of assigning n workpieces to m machines for processing. There are many different forms that can be used to describe JSP, such as linear programming model and disjunction graph model. In th...

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 priority encoding-based hybrid genetic algorithm for solving a job-shop scheduling problem. According to the hybrid algorithm, an ant colony optimization algorithm (ACO) is combined with an adaptive genetic algorithm (AGA), the adaptive genetic algorithm is firstly executed by adopting a dynamic linking strategy, a group of optimization schemes generated according to the genetic algorithm are transformed into initial pheromone distribution of an ant colony algorithm and the ant colony algorithm is executed. A priority matrix-based encoding mode is adopted by the genetic algorithm, encoding is facilitated and decoding is not needed. Crossover and mutation probabilities adaptively change according to the change of the fitness of the best chromosome. The problems that the early convergence speed of the AGA is high and the late convergence speed is reduced due to shortage of feedback, and the early convergence speed of the ACO is relatively low due to shortage of pheromones and the randomness and the late convergence speed is significantly improved are solved. The shortcomings are overcome by learning from the strong points, the problems that search runs into a local optimal solution and the execution time is overlong are solved and the performance and the practicability of the algorithm are strengthened.

Description

[0001] Technical field [0002] The invention relates to the field of computer-executed manufacturing systems, in particular to using algorithms to solve the combined optimization problem of job shop scheduling. Background technique [0003] Job-Shop Scheduling Problem (Job-Shop Scheduling Problem) is one of the core and focus of manufacturing execution system research, its research not only has great practical significance, but also has far-reaching theoretical significance. The Job Shop Scheduling Problem (JSP) is to rationally allocate product manufacturing resources according to product manufacturing needs, and then achieve the purpose of rationally utilizing product manufacturing resources and improving enterprise economic benefits. JSP is a problem that coexists in the product manufacturing industry. It is closely related to the factory management and product manufacturing levels of Computer Integrated Manufacturing Systems (CIMS), and is an important research topic in t...

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): G06Q50/04G06N3/00G06N3/12
CPCY02P90/30G06Q50/04G06N3/00G06N3/12
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