Flexible job shop scheduling method based on improved artificial bee colony algorithm

A technology of artificial bee colony algorithm and workshop scheduling, applied in computing, computing model, artificial life and other directions, can solve the problems of weak local search ability, premature convergence, local optimization and so on

Pending Publication Date: 2020-10-20
NANJING UNIV OF INFORMATION SCI & TECH
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In view of the above problems, the present invention proposes a flexible job shop scheduling method based on the improved artificial bee colony algorithm to solve the deficiencies of the artificial bee colony algorithm in solving the problem of flexible job shop scheduling, which solves the weak local search ability of the traditional artificial bee colony algorithm , easy to fall into the defects of local optimum and premature convergence

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 job shop scheduling method based on improved artificial bee colony algorithm
  • Flexible job shop scheduling method based on improved artificial bee colony algorithm
  • Flexible job shop scheduling method based on improved artificial bee colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0119] The partial flexible job shop scheduling problem of 8×8 scale is used, that is, 8 workpieces are processed on 8 machines, and the corresponding test examples are shown in Table 1. Figure 7 Optimal Scheduling Gantt Chart for 8×8 Problems. Figure 8 An iterative graph for the 8×8 problem.

[0120] Table 1 Test example of 8×8 flexible job shop scheduling problem

[0121]

[0122]

example 2

[0124] A fully flexible job shop scheduling problem with a scale of 10×10 is used, that is, 10 workpieces are processed on 10 machines. The corresponding test examples are shown in Table 2. Figure 9 Optimal scheduling Gantt chart for the 10×10 problem. Figure 10 Iteration graph for the 10×10 problem.

[0125] Table 2 Test examples of 10×10 flexible job shop scheduling problem

[0126]

[0127]

[0128] In an example, the specific operation process of the flexible job shop scheduling method based on the improved artificial bee colony algorithm may include:

[0129] After establishing the mathematical model, select appropriate initial parameters, set the population size NP to 200, the number of employed bees EB and observer bees OB to 100, the maximum number of searches limit to 20, the search threshold threshold to 5, and the maximum number of iterations maxCycle of the algorithm to 100 .

[0130] This example uses a combination of random selection and rule-based sel...

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 discloses a flexible job shop scheduling method based on an improved artificial bee colony algorithm, the artificial bee colony algorithm is improved and applied to a flexible job shop scheduling problem, a scheduling scheme is expressed by adopting double-layer integer coding of each nectar source individual, and the coding and decoding operations are simple. According to the method, population initialization is improved, a method of combining random selection and rule selection is adopted to generate a high-quality initial solution, an improved IPOX cross method is provided foran employed bee search process, and the development and exploration capability of an algorithm can be balanced while excellent parent individuals are inherited; in the bee observation stage, a variable step size strategy is adopted to enhance the global search capability of the algorithm, and local optimum is avoided; the diversity of the population is maintained by increasing the number of investigation bees; in the algorithm iteration process, a greedy strategy is adopted to reserve an elite solution so as to ensure that the result is not degraded, and an optimal workshop scheduling resultis obtained.

Description

technical field [0001] The invention relates to the technical field of flexible job shop scheduling optimization, in particular to a flexible job shop scheduling method based on an improved artificial bee colony algorithm. Background technique [0002] With the development of science and technology, the complexity of the production workshop is getting higher and higher. In 1954, Johnson studied the scheduling problem of two machines in the assembly line. Since then, more and more researchers have started to expand the problem deeply. Research. In the scheduling-related research, the classic Job Shop Scheduling Problem (JSP) has achieved a lot of research results, and its research results have been widely used in the workshop production of steel, textile, electronics, machinery and other industries. Based on this research, in the 1990s, Bruker and Schlie first proposed the concept of Flexible Job Shop Problem (FJSP). The flexible job shop scheduling problem is an extension ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/06G06N3/00
CPCG06Q10/0631G06N3/006G06Q10/06312
Inventor 王玉芳马铭阳缪昇葛嘉荣
Owner NANJING UNIV OF INFORMATION SCI & TECH
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