Imperialism competition algorithm based on real variable function side distance

An imperialist, real variable function technology, applied in the field of using algorithms to solve job shop scheduling problems, to achieve the effect of accurate algorithm results, high solution accuracy, and reduced algorithm running time

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

AI Technical Summary

Problems solved by technology

[0007] 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 a kind of imperialist competition algorithm based on real variable function lateral distance to solve the scheduling problem of the job shop

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
  • Imperialism competition algorithm based on real variable function side distance
  • Imperialism competition algorithm based on real variable function side distance
  • Imperialism competition algorithm based on real variable function side distance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] 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. Excellent solution. However, for the optimization of the job shop scheduling problem, it is easy to converge. The imperialist algorithm cannot obtain a sufficiently accurate solution, and the imperialist algorithm finally obtains a solution instead of a set of solutions, which is not suitable for solving the job shop management scheduling problem. .

[0036] In order to make the purpose, technical solution and advantages of the present invention clearer, the following will be specifically described in conjunction with the flow chart.

[0037] 1. Imperialist Competition Algorithm

[0038] In the imperialist competition algorithm, each country is represented by an array or vector of real numbers.

[0039] for a N var dimension optimization problem, the array is defined as follows:

[0040]

[...

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 imperialism competition algorithm based on a real variable function side distance for solving a job shop scheduling problem. The invention provides the imperialism competition algorithm based on the real variable function side distance for solving the problems of easy premature convergence of the traditional imperialism competition algorithm, low solution precision and inflexible application in the job shop scheduling problem. The improvement of the algorithm is as follows: 1, a machine is directly defined as an empire and a work is defined as a colony; 2, the colony belonging property is determined by the imperial group forces and the side distance, so that the final result of the algorithm is more applicable to the actual problems; 3, the geographic position advantage problem of the empire to invade the colony is evaluated by the real variable function side distance, so that the complex problems become simple; 4, in combination with the social evolution process and specific conditions of actual application examples, the generation conditions of a new colony and a new empire in the algorithm are designed, thereby being practical, simple, visual and high in calculation precision; and 5, the algorithm describes the machine utilization rate by the survival rate of the empire, thereby being simple and understandable.

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] Job-Shop Scheduling Problem (JSP) is one of the core and focus of manufacturing execution system research, its research not only has great practical significance, but also has far-reaching theoretical significance. JSP is to rationally allocate resources according to product manufacturing needs, and then achieve the purpose of rationally utilizing product manufacturing resources and improving enterprise economic benefits. JSP is a co-existing problem in the product manufacturing industry. It is closely related to the factory management and product manufacturing levels of Computer Integrated Manufacturing Systems (CIMS), and is an important research topic in the field of CIMS. JSP is a typical NP-hard problem, and its research will definitely have a meaningful impact on the research of NP probl...

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