Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Improved method for solving FJSP (flexible job shop scheduling problem) with ICA (imperialist competitive algorithm)

A workshop scheduling and flexible operation technology, applied in control/adjustment systems, instruments, comprehensive factory control, etc., can solve problems such as difficult to express flexible operation workshop problems, premature convergence, insufficient application, etc., to reduce computational complexity, increase Variety, quality-enhancing effects

Inactive Publication Date: 2018-11-13
ZHENGZHOU UNIVERSITY OF AERONAUTICS
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In view of the above situation, in order to overcome the defects of the prior art, the present invention provides a method for solving the flexible job shop scheduling problem by an improved imperial competition algorithm, which can solve the existing imperial competition algorithm in the discrete flexible job shop scheduling problem Insufficient application of the traditional imperial competition algorithm, the country individual expression in the traditional imperial competition algorithm is difficult to express the flexible job shop problem; solve the problem that the existing imperial competition algorithm is easy to fall into 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
  • Improved method for solving FJSP (flexible job shop scheduling problem) with ICA (imperialist competitive algorithm)
  • Improved method for solving FJSP (flexible job shop scheduling problem) with ICA (imperialist competitive algorithm)
  • Improved method for solving FJSP (flexible job shop scheduling problem) with ICA (imperialist competitive algorithm)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] In order to make the purpose, technical solution and advantages of the present invention more clear, the specific implementation manners of the present invention will be further described in detail below in conjunction with the accompanying drawings.

[0026] Step 1: Set the parameters of the empire competition algorithm, including: the number of countries N pop , the number of imperialist countries N imp , the number of colonial countries N col , number of iterations N iter , the internal assimilation probability P of the empire cimp , the probability of revolution within the empire P mimp , Colonial country impact factor α.

[0027] Among them, N pop =N imp +N col , 0cimp mimp <1.

[0028] The termination condition of the empire competition algorithm is: if the number of iterations N has not been reached iter When there is only one empire left, the algorithm terminates; otherwise, it runs until the number of iterations.

[0029] Explanation on the value of t...

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 an improved method for solving an FJSP (flexible job shop scheduling problem) with an ICA (imperialist competitive algorithm) and overcomes the defects of the ICA in applicationto the discrete type FJSP. Two-segment integer encoding is adopted for each individual country to express one scheme, the encoding mode can solve multiple FJSPs, and calculation complexity of the algorithm is reduced. With the adoption of the method for producing an initial country group by mixing of three initialization methods, quality of the entire solution of the group is improved, operatingefficiency of the algorithm is improved, and the optimal solution is obtained more quickly. Assimilation operation in an empire is improved, good information is shared between colonial countries and imperialist countries by exchanging the good information, so that the colonial countries are enabled to approach the imperialist countries; by means of revolutionary operation in the empire, probability change is performed according to iterations of the ICA, diversity of the individual country is improved, and the algorithm is prevented from premature convergence.

Description

technical field [0001] The invention relates to shop scheduling, in particular to a method for solving the problem of flexible job shop scheduling by an improved imperial competition algorithm. Background technique [0002] With the rapid development of advanced information technology, manufacturing technology and network technology, the needs of customers are becoming more and more diversified and personalized, new products are constantly emerging, the speed of product upgrading is accelerating, and the production mode is gradually turning to "variety of varieties, batch change". Small, pay attention to delivery time, reduce inventory" mass customer customization model. A new round of scientific and technological revolution and industrial revolution is ready to go, such as the "Industry 4.0" strategy proposed by the German industry and the "Made in China 2025" strategy proposed by China. Among them, intelligent manufacturing is one of the main development directions, and i...

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): G05B19/418
CPCG05B19/41865G05B2219/32252
Inventor 张国辉陈洪根王国东刘航薛丽佀庆民王永成刘星高广章
Owner ZHENGZHOU UNIVERSITY OF AERONAUTICS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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