Improved imperialist competitive algorithm for solving job shop scheduling problem

An imperialism and job shop technology, applied in the field of solving job shop scheduling problems with algorithms, can solve problems such as inflexible application of job shop scheduling problems, insufficient solution accuracy, and easy premature convergence, etc., to reduce algorithm running time, algorithm The effect of flexibility and reduced computational complexity

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

AI Technical Summary

Problems solved by technology

[0007] The purpose of the present invention is to overcome the problems existing in the prior art: the traditional imperialist competition algorithm i

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 imperialist competitive algorithm for solving job shop scheduling problem
  • Improved imperialist competitive algorithm for solving job shop scheduling problem
  • Improved imperialist competitive algorithm for solving job shop scheduling problem

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0028] The traditional imperialist competition algorithm has the advantages of simplicity, accuracy, and time saving. It is a very efficient and easy-to-use optimization algorithm. This algorithm saves memory, has a short optimization time, and can quickly converge to the best in the search space. Excellent solution. However, for the optimization of job shop scheduling problems, it is easy to converge. The imperialist algorithm cannot get enough accurate solutions, and the imperialist algorithm finally obtains a solution instead of a set of solutions, which is not suitable for the solution of job shop management arrangements. .

[0029] In order to make the objectives, technical solutions, and advantages of the present invention clearer, the following describes the present invention in detail.

[0030] 1. The imperialist competition algorithm

[0031] In the imperialist competition algorithm, each country is represented by an array or vector of real numbers. For an N var Dimension...

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 imperialist competitive algorithm for solving a job shop scheduling problem. The improved imperialist competitive algorithm is provided for the problems that a conventional imperialist competitive algorithm is easy in premature convergence, low in solving precision and insufficiently flexible in application to the job scheduling problem. The algorithm is improved in that 1, relative power of an empire is described directly by using a machine processing job capability , so that the calculation complexity of the algorithm is lowered; 2, a machine and jobs are directly defined as the empire and colonies, so that the indeterminacy caused by random generation of an initial solution is avoided and the running time of the algorithm is shortened; 3, the power of an imperialist country is calculated by utilizing job running time, so that the calculation is simple, practical and reliable; 4, the machine job capability is used as a colony distribution criterion of the imperialist country, so that the criterion is simple and intuitive, and the solution precision is high; and 5, a calculation mode of the total power of the empire is changed, so that the algorithm is more flexible.

Description

[0001] Field [0002] The invention relates to the field of job shop scheduling, in particular to using an algorithm to solve job shop scheduling problems. Background technique [0003] In the prior art, many algorithms have been used to solve the Job-Shop Scheduling Problem (JSP). Such as genetic algorithm, particle swarm algorithm and so on. Although these algorithms have their own advantages, they also have their disadvantages: slow convergence speed, low accuracy and so on. [0004] The Imperialist Algorithm (ICA), also known as the Colonial Competition Algorithm, is an evolutionary algorithm based on the imperialist colonial competition mechanism proposed by Atashaz_Gargari and Lucas in 2007, which belongs to the socially inspired stochastic optimization search method. ICA algorithm to control more countries according to imperialist social policy, use their resources when colonial countries are governed by some laws, if one empire loses great power, other countries will...

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): G06Q10/04
CPCG06Q10/04
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

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