Improved imperialist competitive algorithm for solving job-shop scheduling problem

Abstract

The invention provides an improved imperialist competitive algorithm for solving a job-shop scheduling problem. According to the algorithm, the empire relative power is described by machine handling operation capability; a machine is directly defined as an empire while an operation is directly defined as a colony, so that uncertainty caused by random generation of an initial solution is avoided, and algorithm operating time is reduced; machine utilization rate is described by empire survival rate, so that the algorithm is simple and easy to understand; by converting movement from the colony to the imperialist into a viewing angle of movement from the imperialist country to the colony country in the imperialist competitive algorithm, so that the algorithm is closer to the actual condition; meanwhile, a cost function is described by a distance between the colony and the empire, so that the algorithm is simple and practical, and detailed and efficient; in addition, an approaching way from the empire to the colony is simulated by Levy flight executed by a bird flight Mantegna algorithm, so that the convergence speed of the algorithm is properly reduced; by setting probability of one empire in colony embezzlement, and by performing random selection by 0-1 planning, the algorithm is more flexible, and the calculation result is more accurate.

Description

[0001] Field [0002] The invention relates to the technical field of job shop scheduling. Background technique [0003] 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 occupy it. The basic idea of ​​the imperialist competitive algorithm is: similar to other evolutionary algorithms, the imperialist competitive algorithm starts from a group of individuals defined as countries, and all countries are divided into two categories: imperialist countries and colonial countries. The countries with relatively strong power at the beginning are ...

AI Technical Summary

Problems solved by technology

[0005] In view of the above-mentioned shortcomings existing in the existing imperialist competition algorithm, the technical problem to be solved by the present invention is to provide an improved imperialist competition algorithm to solve the scheduling problem of the job shop

Images