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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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:
...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com