Multi-objective flexible job shop scheduling method based on discrete firefly algorithm

A technology of firefly algorithm and flexible operation, applied in the field of multi-objective flexible job shop scheduling based on discrete firefly algorithm, can solve problems such as unsuitable flexible job shop scheduling

Inactive Publication Date: 2017-05-24
XIANGTAN UNIV
View PDF7 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The solution space of the flexible job shop scheduling problem is discrete, but the standard firefly algorithm is used to solve continuous problems, so the standard firefly algorithm's coding rules, distance definition, position update and other rules are not suitable for solving the flexible job shop scheduling problem

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
  • Multi-objective flexible job shop scheduling method based on discrete firefly algorithm
  • Multi-objective flexible job shop scheduling method based on discrete firefly algorithm
  • Multi-objective flexible job shop scheduling method based on discrete firefly algorithm

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach

[0047] The invention improves the global optimization ability of the firefly by improving the firefly algorithm decoding mode and iteration rule, and proposes a firefly movement strategy to ensure the diversity of the population for the multi-objective flexible job shop scheduling problem. Thus the Pareto dominant solution of the multi-objective flexible job shop scheduling problem is obtained.

[0048] Its specific implementation process is:

[0049] Establish a mathematical model for the multi-objective flexible job shop scheduling problem;

[0050] Firefly is coded by segment coding method, including machine selection part and process sorting part;

[0051] Using the discrete firefly algorithm, optimize the above model to obtain the Pareto optimal solution set;

[0052] Select the solution that meets the actual needs from the Pareto optimal solution set, and decode and output the machine selection position information and process sequence position information.

[0053] T...

Embodiment

[0078] Taking the mk01 problem as an example, the multi-objective optimization of flexible job shop scheduling is carried out. This problem contains 10 workpieces, 6 optional processing machines, and a total of 55 processes. There is no priority constraint relationship between the processing processes of the workpiece elements, and there is a clear priority relationship between the processing processes of the workpiece elements themselves. The detailed data are as follows in Table 1:

[0079]

[0080]

[0081]

[0082] Related parameter settings: α=1.2, β 0=1, γ=0.06, the maximum number of iterations is 150, and the total number of fireflies is 100. For the mk01 problem, the maximum completion time f 1 , Bottleneck machine load f 2 and the machine corresponds to the total amount f 3 The minimum is the optimization objective, and the discrete firefly algorithm is used for multi-objective optimization.

[0083] Table 2 below is the Pareto frontier solution set:

...

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 multi-objective flexible job shop scheduling method based on a discrete firefly algorithm. The method comprises the steps that a mathematical model is established for a multi-objective flexible job shop scheduling problem; a segment coding method is used to code a firefly, and a machine selection part and a process sorting part are divided; the discrete firefly algorithm is used to optimize the model to acquire a Pareto optimal solution set; and a solution corresponding to the actual need is selected from the Pareto optimal solution set, and decoding is carried out to output machine selection position information and process sorting position information. Compared with the existing method, the multi-objective flexible job shop scheduling problem optimizing method has the advantages that the global optimization ability of the algorithm is improved; the overall processing time is shortened; the job shop production cost is reduced; and the method meets actual production needs.

Description

technical field [0001] The invention relates to the field of design scheduling problems, and more specifically relates to a multi-objective flexible job shop scheduling method based on the discrete firefly algorithm. Background technique [0002] Production scheduling refers to arranging the resources, processing time and processing time used by its components by issuing production instructions for a decomposable job under the premise of satisfying the constraints of the process route, resource situation, and delivery date as much as possible. A job that has been optimized in terms of time or cost to manufacture a product. The flexible job shop scheduling problem is a kind of job shop scheduling problem. It refers to a group of machine tools with different functions in the processing system. The workpiece to be processed contains multiple processes. Each process is processed on a machine tool. Not the same, there is a sequence constraint between each workpiece process. The...

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): G05B19/418
CPCG05B19/41865G05B2219/32252
Inventor 李明富龙睿杰彭郎军
Owner XIANGTAN UNIV
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